CMAX++ : Leveraging Experience in Planning and Execution using Inaccurate Models
Anirudh Vemula, J. Andrew Bagnell, Maxim Likhachev
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++ achieves this by integrating model-free learning using acquired experience with model-based planning using the potentially inaccurate model. We provide provable guarantees on the completeness and asymptotic convergence of CMAX++ to the optimal path cost as the number of repetitions increases. CMAX++ is also shown to outperform baselines in simulated robotic tasks including 3D mobile robot navigation where the track friction is incorrectly modeled, and a 7D pick-and-place task where the mass of the object is unknown leading to discrepancy between true and modeled dynamics. 1
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Your agent calls
Luneget_paper_fulltext
Free to start. No credit card required.
Terminal
Install the CLIlune papers fulltext c5708404-be7a-4229-817d-a9c868eea75fCited by top-tier papers3
- Leveraging Approximate Symbolic Models for Reinforcement Learning via Skill DiversityLin Guan, Sarath Sreedharan, Subbarao KambhampatiICML 2022 · 31 citations
- Monte Carlo Tree Search in the Presence of Transition UncertaintyFarnaz Kohankhaki, Kiarash Aghakasiri, Hongming Zhang, Ting-Han Wei et al.AAAI 2024 · 4 citations
- Multi-Robot Motion Planning with Diffusion ModelsYorai Shaoul, Itamar Mishani, Shivam Vats, Jiaoyang Li et al.ICLR 2025
Related papers
- COPlanner: Plan to Roll Out Conservatively but to Explore Optimistically for Model-Based RLXiyao Wang, Ruijie Zheng, Yanchao Sun, Ruonan Jia et al.ICLR 2024 · 19 citations
- DyWA: Dynamics-Adaptive World Action Model for Generalizable Non-Prehensile ManipulationJiangran Lyu, Ziming Li, Xuesong Shi, Chaoyi Xu et al.ICCV 2025 · 2 citations
- Evaluating Model-Based Planning and Planner Amortization for Continuous ControlArunkumar Byravan, Leonard Hasenclever, Piotr Trochim, Mehdi Mirza et al.ICLR 2022 · 18 citations
- Self-Consistent Models and ValuesGregory Farquhar, Kate Baumli, Zita Marinho, Angelos Filos et al.NeurIPS 2021 · 10 citations
- Learning to Execute: Efficient Learning of Universal Plan-Conditioned Policies in RoboticsIngmar Schubert, Danny Driess, Ozgur S. Oguz, Marc ToussaintNeurIPS 2021 · 2 citations
