Motion Memory: Leveraging Past Experiences to Accelerate Future Motion Planning (2310.06198v2)
Abstract: When facing a new motion-planning problem, most motion planners solve it from scratch, e.g., via sampling and exploration or starting optimization from a straight-line path. However, most motion planners have to experience a variety of planning problems throughout their lifetimes, which are yet to be leveraged for future planning. In this paper, we present a simple but efficient method called Motion Memory, which allows different motion planners to accelerate future planning using past experiences. Treating existing motion planners as either a closed or open box, we present a variety of ways that Motion Memory can contribute to reduce the planning time when facing a new planning problem. We provide extensive experiment results with three different motion planners on three classes of planning problems with over 30,000 problem instances and show that planning speed can be significantly reduced by up to 89% with the proposed Motion Memory technique and with increasing past planning experiences.
- Y. Kuwata, J. Teo, G. Fiore, S. Karaman, E. Frazzoli, and J. P. How, “Real-time motion planning with applications to autonomous urban driving,” IEEE Transactions on control systems technology, vol. 17, no. 5, pp. 1105–1118, 2009.
- D. Fox, W. Burgard, and S. Thrun, “The dynamic window approach to collision avoidance,” IEEE Robotics & Automation Magazine, vol. 4, no. 1, pp. 23–33, 1997.
- S. Murray, W. Floyd-Jones, Y. Qi, D. J. Sorin, and G. D. Konidaris, “Robot motion planning on a chip.” in Robotics: Science and Systems, vol. 6, 2016.
- R. Volpe, “Rover functional autonomy development for the mars mobile science laboratory,” in Proceedings of the 2003 IEEE Aerospace Conference, vol. 2, 2003, pp. 643–652.
- L. E. Kavraki, P. Svestka, J.-C. Latombe, and M. H. Overmars, “Probabilistic roadmaps for path planning in high-dimensional configuration spaces,” IEEE transactions on Robotics and Automation, vol. 12, no. 4, pp. 566–580, 1996.
- D. Hsu, J.-C. Latombe, and R. Motwani, “Path planning in expansive configuration spaces,” in Proceedings of international conference on robotics and automation, vol. 3. IEEE, 1997, pp. 2719–2726.
- S. LaValle, “Rapidly-exploring random trees: A new tool for path planning,” Research Report 9811, 1998.
- S. Karaman and E. Frazzoli, “Sampling-based algorithms for optimal motion planning,” The international journal of robotics research, vol. 30, no. 7, pp. 846–894, 2011.
- X. Xiao, B. Liu, G. Warnell, and P. Stone, “Motion planning and control for mobile robot navigation using machine learning: a survey,” Autonomous Robots, vol. 46, no. 5, pp. 569–597, 2022.
- X. Xiao, J. Biswas, and P. Stone, “Learning inverse kinodynamics for accurate high-speed off-road navigation on unstructured terrain,” IEEE Robotics and Automation Letters, vol. 6, no. 3, pp. 6054–6060, 2021.
- H. Karnan, K. S. Sikand, P. Atreya, S. Rabiee, X. Xiao, G. Warnell, P. Stone, and J. Biswas, “Vi-ikd: High-speed accurate off-road navigation using learned visual-inertial inverse kinodynamics,” in 2022 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS). IEEE, 2022, pp. 3294–3301.
- P. Atreya, H. Karnan, K. S. Sikand, X. Xiao, S. Rabiee, and J. Biswas, “High-speed accurate robot control using learned forward kinodynamics and non-linear least squares optimization,” in 2022 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS). IEEE, 2022, pp. 11 789–11 795.
- A. Datar, C. Pan, and X. Xiao, “Learning to model and plan for wheeled mobility on vertically challenging terrain,” arXiv preprint arXiv:2306.11611, 2023.
- S. M. LaValle and J. J. Kuffner, “Randomized kinodynamic planning,” International Journal of Robotics Research, vol. 20, no. 5, pp. 378–400, 2001.
- S. M. LaValle, “Motion planning: The essentials,” IEEE Robotics & Automation Magazine, vol. 18, no. 1, pp. 79–89, 2011.
- W. Xinyu, L. Xiaojuan, G. Yong, S. Jiadong, and W. Rui, “Bidirectional potential guided RRT* for motion planning,” IEEE Access, vol. 7, pp. 95 046–95 057, 2019.
- A. Shkolnik, M. Walter, and R. Tedrake, “Reachability-guided sampling for planning under differential constraints,” in IEEE International Conference on Robotics and Automation, 2009, pp. 2859–2865.
- D. Devaurs, T. Simeon, and J. Cortés, “Enhancing the transition-based RRT to deal with complex cost spaces,” in IEEE International Conference on Robotics and Automation, 2013, pp. 4120–4125.
- D. Hsu, J.-C. Latombe, and R. Motwani, “Path planning in expansive configuration spaces,” in IEEE International Conference on Robotics and Automation, vol. 3, 1997, pp. 2719–2726.
- I. A. Şucan and L. E. Kavraki, “A sampling-based tree planner for systems with complex dynamics,” IEEE Transactions on Robotics, vol. 28, no. 1, pp. 116–131, 2012.
- E. Plaku, “Region-guided and sampling-based tree search for motion planning with dynamics,” IEEE Transactions on Robotics, vol. 31, pp. 723–735, 2015.
- E. Plaku, E. Plaku, and P. Simari, “Clearance-driven motion planning for mobile robots with differential constraints,” Robotica, vol. 36, pp. 971–993, 2018.
- T. McMahon, A. Sivaramakrishnan, E. Granados, K. E. Bekris et al., “A survey on the integration of machine learning with sampling-based motion planning,” Foundations and Trends® in Robotics, vol. 9, no. 4, pp. 266–327, 2022.
- G. S. Aoude, B. D. Luders, J. M. Joseph, N. Roy, and J. P. How, “Probabilistically safe motion planning to avoid dynamic obstacles with uncertain motion patterns,” Autonomous Robots, vol. 35, pp. 51–76, 2013.
- B. Burns and O. Brock, “Sampling-based motion planning using predictive models,” in Proceedings of the 2005 IEEE international conference on robotics and automation. IEEE, 2005, pp. 3120–3125.
- Z. Kingston, M. Moll, and L. E. Kavraki, “Exploring implicit spaces for constrained sampling-based planning,” The International Journal of Robotics Research, vol. 38, no. 10-11, pp. 1151–1178, 2019.
- G. Sutanto, I. R. Fernández, P. Englert, R. K. Ramachandran, and G. Sukhatme, “Learning equality constraints for motion planning on manifolds,” in Conference on Robot Learning. PMLR, 2021, pp. 2292–2305.
- I. Baldwin and P. Newman, “Non-parametric learning for natural plan generation,” in 2010 IEEE/RSJ International Conference on Intelligent Robots and Systems. IEEE, 2010, pp. 4311–4317.
- M. Zucker, J. Kuffner, and J. A. Bagnell, “Adaptive workspace biasing for sampling-based planners,” in 2008 IEEE International Conference on Robotics and Automation. IEEE, 2008, pp. 3757–3762.
- B. Ichter, J. Harrison, and M. Pavone, “Learning sampling distributions for robot motion planning,” in 2018 IEEE International Conference on Robotics and Automation (ICRA). IEEE, 2018, pp. 7087–7094.
- K. Hauser, “Lazy collision checking in asymptotically-optimal motion planning,” in 2015 IEEE international conference on robotics and automation (ICRA). IEEE, 2015, pp. 2951–2957.
- A. Mandalika, S. Choudhury, O. Salzman, and S. Srinivasa, “Generalized lazy search for robot motion planning: Interleaving search and edge evaluation via event-based toggles,” in Proceedings of the International Conference on Automated Planning and Scheduling, vol. 29, 2019, pp. 745–753.
- J. Bialkowski, M. Otte, S. Karaman, and E. Frazzoli, “Efficient collision checking in sampling-based motion planning via safety certificates,” The International Journal of Robotics Research, vol. 35, no. 7, pp. 767–796, 2016.
- J. Huh and D. D. Lee, “Learning high-dimensional mixture models for fast collision detection in rapidly-exploring random trees,” in 2016 IEEE International Conference on Robotics and Automation (ICRA). IEEE, 2016, pp. 63–69.
- N. Das and M. Yip, “Learning-based proxy collision detection for robot motion planning applications,” IEEE Transactions on Robotics, vol. 36, no. 4, pp. 1096–1114, 2020.
- C. Yu and S. Gao, “Reducing collision checking for sampling-based motion planning using graph neural networks,” Advances in Neural Information Processing Systems, vol. 34, pp. 4274–4289, 2021.
- J. Pan, S. Chitta, and D. Manocha, “Faster sample-based motion planning using instance-based learning,” in Algorithmic Foundations of Robotics X: Proceedings of the Tenth Workshop on the Algorithmic Foundations of Robotics. Springer, 2013, pp. 381–396.
- M. Bhardwaj, S. Choudhury, B. Boots, and S. Srinivasa, “Leveraging experience in lazy search,” Autonomous Robots, vol. 45, pp. 979–996, 2021.
- B. Hou, S. Choudhury, G. Lee, A. Mandalika, and S. S. Srinivasa, “Posterior sampling for anytime motion planning on graphs with expensive-to-evaluate edges,” in 2020 IEEE International Conference on Robotics and Automation (ICRA). IEEE, 2020, pp. 4266–4272.
- D. Berenson, P. Abbeel, and K. Goldberg, “A robot path planning framework that learns from experience,” in 2012 IEEE International Conference on Robotics and Automation. IEEE, 2012, pp. 3671–3678.
- È. Pairet, C. Chamzas, Y. Petillot, and L. E. Kavraki, “Path planning for manipulation using experience-driven random trees,” IEEE Robotics and Automation Letters, vol. 6, no. 2, pp. 3295–3302, 2021.
- D. Coleman, I. A. Şucan, M. Moll, K. Okada, and N. Correll, “Experience-based planning with sparse roadmap spanners,” in 2015 IEEE International Conference on Robotics and Automation (ICRA). IEEE, 2015, pp. 900–905.
- C. Chamzas, A. Shrivastava, and L. E. Kavraki, “Using local experiences for global motion planning,” in 2019 International Conference on Robotics and Automation (ICRA). IEEE, 2019, pp. 8606–8612.
- S. Finney, L. P. Kaelbling, and T. Lozano-Pérez, “Predicting partial paths from planning problem parameters.” in Robotics: Science and Systems. Citeseer, 2007.
- A. H. Qureshi, A. Simeonov, M. J. Bency, and M. C. Yip, “Motion planning networks,” in 2019 International Conference on Robotics and Automation (ICRA). IEEE, 2019, pp. 2118–2124.
- J. J. Johnson, L. Li, F. Liu, A. H. Qureshi, and M. C. Yip, “Dynamically constrained motion planning networks for non-holonomic robots,” in 2020 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS). IEEE, 2020, pp. 6937–6943.
- R. Strudel, R. G. Pinel, J. Carpentier, J.-P. Laumond, I. Laptev, and C. Schmid, “Learning obstacle representations for neural motion planning,” in Conference on Robot Learning. PMLR, 2021, pp. 355–364.
- A. H. Qureshi, J. Dong, A. Choe, and M. C. Yip, “Neural manipulation planning on constraint manifolds,” IEEE Robotics and Automation Letters, vol. 5, no. 4, pp. 6089–6096, 2020.
- C. Chamzas, Z. Kingston, C. Quintero-Peña, A. Shrivastava, and L. E. Kavraki, “Learning sampling distributions using local 3d workspace decompositions for motion planning in high dimensions,” in 2021 IEEE International Conference on Robotics and Automation (ICRA). IEEE, 2021, pp. 1283–1289.
- J.-M. Lien and Y. Lu, “Planning motion in environments with similar obstacles.” in Robotics: Science and systems, 2009.
- C. Chamzas, A. Cullen, A. Shrivastava, and L. E. Kavraki, “Learning to retrieve relevant experiences for motion planning,” in 2022 International Conference on Robotics and Automation (ICRA). IEEE, 2022, pp. 7233–7240.
- X. Xiao, B. Liu, G. Warnell, and P. Stone, “Toward agile maneuvers in highly constrained spaces: Learning from hallucination,” IEEE Robotics and Automation Letters, vol. 6, no. 2, pp. 1503–1510, 2021.
- X. Xiao, B. Liu, and P. Stone, “Agile robot navigation through hallucinated learning and sober deployment,” in 2021 IEEE international conference on robotics and automation (ICRA). IEEE, 2021, pp. 7316–7322.
- Z. Wang, X. Xiao, A. J. Nettekoven, K. Umasankar, A. Singh, S. Bommakanti, U. Topcu, and P. Stone, “From agile ground to aerial navigation: Learning from learned hallucination,” in 2021 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS). IEEE, 2021, pp. 148–153.
- T. S. Lembono, A. Paolillo, E. Pignat, and S. Calinon, “Memory of motion for warm-starting trajectory optimization,” IEEE Robotics and Automation Letters, vol. 5, no. 2, pp. 2594–2601, 2020.