CMAX++ : Leveraging Experience in Planning and Execution using Inaccurate Models
Anirudh Vemula, J. Andrew Bagnell, Maxim Likhachev

TL;DR
CMAX++ enhances robotic planning by integrating experience-based learning with model-based planning, improving solution quality over repetitions despite inaccuracies in the dynamical models.
Contribution
It introduces CMAX++, a novel method that combines model-free learning with model-based planning to iteratively improve robotic task planning in uncertain environments.
Findings
Outperforms baselines in simulated navigation tasks with model inaccuracies.
Guarantees asymptotic convergence to optimal path cost.
Effective in 3D navigation and 7D pick-and-place tasks with unknown parameters.
Abstract
Given access to accurate dynamical models, modern planning approaches are effective in computing feasible and optimal plans for repetitive robotic tasks. However, it is difficult to model the true dynamics of the real world before execution, especially for tasks requiring interactions with objects whose parameters are unknown. A recent planning approach, CMAX, tackles this problem by adapting the planner online during execution to bias the resulting plans away from inaccurately modeled regions. CMAX, while being provably guaranteed to reach the goal, requires strong assumptions on the accuracy of the model used for planning and fails to improve the quality of the solution over repetitions of the same task. In this paper we propose CMAX++, an approach that leverages real-world experience to improve the quality of resulting plans over successive repetitions of a robotic task. CMAX++…
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.
Taxonomy
TopicsMachine Learning and Algorithms · Robot Manipulation and Learning · Robotic Path Planning Algorithms
