Adaptive Lattice-based Motion Planning
Abhishek Dhar, Sarthak Mishra, Spandan Roy, Daniel Axehill

TL;DR
This paper introduces an adaptive lattice-based motion planning method that updates system models online to generate feasible, collision-free trajectories with improved accuracy in cluttered environments, especially under model uncertainty.
Contribution
It presents a novel adaptive approach that dynamically refines the system model and motion primitives, reducing uncertainty and improving planning performance over time.
Findings
Reduced model set diameter over time
Decreased motion primitive tube sizes
Enhanced collision avoidance in cluttered environments
Abstract
This paper proposes an adaptive lattice-based motion planning solution to address the problem of generating feasible trajectories for systems, represented by a linearly parameterizable non-linear model operating within a cluttered environment. The system model is considered to have uncertain model parameters. The key idea here is to utilize input/output data online to update the model set containing the uncertain system parameter, as well as a dynamic estimated parameter of the model, so that the associated model estimation error reduces over time. This in turn improves the quality of the motion primitives generated by the lattice-based motion planner using a nominal estimated model selected on the basis of suitable criteria. The motion primitives are also equipped with tubes to account for the model mismatch between the nominal estimated model and the true system model, to guarantee…
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.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsRobotic Path Planning Algorithms · Distributed Control Multi-Agent Systems · Reinforcement Learning in Robotics
