Repository logo
Log in(current)
Repository logoMIT Open ScholarshipDSpace@MIT
  1. Home
  2. MIT Open Access Articles
  3. MIT Open Access Articles
  4. Incremental sampling-based algorithm for minimum-violation motion planning

Incremental sampling-based algorithm for minimum-violation motion planning

Thumbnail Image
Download
Name

Rus_Incremental sampling.pdf

Size

2.42 MB

Format

Adobe PDF

Checksum (MD5)

50f060ccfca049c152c0b6a53b04a262

Author(s)
Reyes Castro, Luis I.
•
Chaudhari, Pratik Anil
•
Tumova, Jana
•
Karaman, Sertac
•
Frazzoli, Emilio
•
Rus, Daniela L.
Date Issued
December 2013
Journal
Proceedings of the 52nd IEEE Conference on Decision and Control
Publisher
Institute of Electrical and Electronics Engineers (IEEE)
Citation
Reyes Castro, Luis I., Pratik Chaudhari, Jana Tumova, Sertac Karaman, Emilio Frazzoli, and Daniela Rus. “Incremental Sampling-Based Algorithm for Minimum-Violation Motion Planning.” 52nd IEEE Conference on Decision and Control (December 2013).
Version
Author's final manuscript
Abstract
This paper studies the problem of control strategy synthesis for dynamical systems with differential constraints to fulfill a given reachability goal while satisfying a set of safety rules. Particular attention is devoted to goals that become feasible only if a subset of the safety rules are violated. The proposed algorithm computes a control law, that minimizes the level of unsafety while the desired goal is guaranteed to be reached. This problem is motivated by an autonomous car navigating an urban environment while following rules of the road such as “always travel in right lane” and “do not change lanes frequently”. Ideas behind sampling based motion-planning algorithms, such as Probabilistic Road Maps (PRMs) and Rapidly-exploring Random Trees (RRTs), are employed to incrementally construct a finite concretization of the dynamics as a durational Kripke structure. In conjunction with this, a weighted finite automaton that captures the safety rules is used in order to find an optimal trajectory that minimizes the violation of safety rules. We prove that the proposed algorithm guarantees asymptotic optimality, i.e., almost-sure convergence to optimal solutions. We present results of simulation experiments and an implementation on an autonomous urban mobility-on-demand system.
MIT Department
Massachusetts Institute of Technology. Department of Aeronautics and Astronautics
Massachusetts Institute of Technology. School of Engineering
Terms of Use
Creative Commons Attribution-Noncommercial-Share Alike
http://creativecommons.org/licenses/by-nc-sa/4.0/
Persistent DSpace Link
http://hdl.handle.net/1721.1/90595
DOI of Published Version
https://doi.org/10.1109/CDC.2013.6760374
Repository logo
PrivacyPermissionsAccessibilityContact us
Repository logo
Notify us about copyright concerns.