Search-Based Path Planning in Interactive Environments among Movable Obstacles
Abstract: This paper investigates Path planning Among Movable Obstacles (PAMO), which seeks a minimum cost collision-free path among static obstacles from start to goal while allowing the robot to push away movable obstacles (i.e., objects) along its path when needed. To develop planners that are complete and optimal for PAMO, the planner has to search a giant state space involving both the location of the robot as well as the locations of the objects, which grows exponentially with respect to the number of objects. This paper leverages a simple yet under-explored idea that, only a small fraction of this giant state space needs to be searched during planning as guided by a heuristic, and most of the objects far away from the robot are intact, which thus leads to runtime efficient algorithms. Based on this idea, this paper introduces two PAMO formulations, i.e., bi-objective and resource constrained problems in an occupancy grid, and develops PAMO*, a planning method with completeness and solution optimality guarantees, to solve the two problems. We then further extend PAMO* to hybrid-state PAMO* to plan in continuous spaces with high-fidelity interaction between the robot and the objects. Our results show that, PAMO* can often find optimal solutions within a second in cluttered maps with up to 400 objects.
- https://box2d.org/.
- https://www.movingai.com/benchmarks/mapf/index.html.
- Enhanced methods for the weight constrained shortest path problem. Networks, 2024.
- An analysis of single-player monte carlo tree search performance in sokoban. Expert Systems with Applications, 192:116224, 2022.
- Pushpush and push-1 are np-hard in 2d. In Proceedings of the 12th Canadian Conference on Computational Geometry, 2000.
- Path planning for autonomous vehicles in unknown semi-structured environments. The international journal of robotics research, 29(5):485–501, 2010.
- Sokoban and other motion planning problems. Computational Geometry, 13(4):215–228, 1999.
- Interactive-far: Interactive, fast and adaptable routing for navigation among movable obstacles in complex unknown environments. arXiv preprint arXiv:2404.07447, 2024.
- Simple and efficient bi-objective search algorithms via fast dominance checks. Artificial intelligence, 314:103807, 2023.
- Sokoban: Enhancing general single-agent search methods using domain knowledge. Artificial Intelligence, 129(1-2):219–251, 2001.
- Dealing with difficult instances of object rearrangement. In Robotics: Science and Systems, volume 1123, 2015.
- Locally optimal navigation among movable obstacles in unknown environments. In 2014 IEEE-RAS International Conference on Humanoid Robots, pages 86–91. IEEE, 2014.
- Algorithms and systems for manipulating multiple objects. IEEE Transactions on Robotics, 39(1):2–20, 2023.
- Erca*: A new approach for the resource constrained shortest path problem. IEEE Transactions on Intelligent Transportation Systems, 24(12):14994–15005, 2023.
- Enhanced multi-objective A* using balanced binary search trees. In Proceedings of the International Symposium on Combinatorial Search, volume 15, pages 162–170, 2022.
- Manipulation planning among movable obstacles using physics-based adaptive motion primitives. In 2021 IEEE International Conference on Robotics and Automation (ICRA), pages 6570–6576, 2021.
- Planning among movable obstacles with artificial constraints. The International Journal of Robotics Research, 27(11-12):1295–1307, 2008.
- Path planning among movable obstacles: a probabilistically complete approach. In Algorithmic Foundation of Robotics VIII: Selected Contributions of the Eight International Workshop on the Algorithmic Foundations of Robotics, pages 599–614. Springer, 2010.
- Multi-robot box-pushing: Single-agent q-learning vs. team q-learning. In 2006 IEEE/RSJ international conference on intelligent robots and systems, pages 3694–3699. IEEE, 2006.
- Gordon Wilfong. Motion planning in the presence of movable obstacles. In Proceedings of the fourth annual symposium on Computational geometry, pages 279–288, 1988.
- Interactive gibson benchmark: A benchmark for interactive navigation in cluttered environments. IEEE Robotics and Automation Letters, 5(2):713–720, 2020.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.