TL;DR
This paper introduces RTD, a trajectory planning method for mobile robots that guarantees safety and dynamic feasibility in real-time by using reachability analysis and obstacle mapping, demonstrated through extensive simulations and hardware tests.
Contribution
The work presents a novel RTD approach combining offline reachability analysis with real-time obstacle mapping to ensure safe, feasible trajectories for mobile robots.
Findings
RTD guarantees safety and persistent feasibility in real-time planning.
RTD outperforms RRT and NMPC in simulations.
RTD successfully deployed on hardware platforms in diverse environments.
Abstract
To operate with limited sensor horizons in unpredictable environments, autonomous robots use a receding-horizon strategy to plan trajectories, wherein they execute a short plan while creating the next plan. However, creating safe, dynamically-feasible trajectories in real time is challenging; and, planners must ensure persistent feasibility, meaning a new trajectory is always available before the previous one has finished executing. Existing approaches make a tradeoff between model complexity and planning speed, which can require sacrificing guarantees of safety and dynamic feasibility. This work presents the Reachability-based Trajectory Design (RTD) method for trajectory planning. RTD begins with an offline Forward Reachable Set (FRS) computation of a robot's motion when tracking parameterized trajectories; the FRS provably bounds tracking error. At runtime, the FRS is used to map…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
