The DOI matches its Crossref record; 48 of the 48 references it cites were found in a registry or an index.
Optimal Multirobot Path Planning on Graphs: Complete Algorithms and Effective Heuristics
Open accessAbstract
We study optimal multirobot path planning on graphs (MPP) over four minimization objectives: the makespan (last arrival time), the maximum (single-robot traveled) distance, the total arrival time, and the total distance. Having established previously that these objectives are distinct and NP-hard to optimize, in this paper, we focus on efficient algorithmic solutions for solving these optimal MPP problems. Toward this goal, we first establish a one-to-one solution mapping between MPP and a special type of multiflow network. Based on this equivalence and integer linear programming (ILP), we design novel and complete algorithms for optimizing over each of the four objectives. In particular, our exact algorithm for computing optimal makespan solutions is a first that is capable of solving extremely challenging problems with robot-vertex ratios as high as 100%. Then, we further improve the computational performance of these exact algorithms through the introduction of principled heuristics, at the expense of slight optimality loss. The combination of ILP model based algorithms and the heuristics proves to be highly effective, allowing the computation of 1.x-optimal solutions for problems containing hundreds of robots, densely populated in the environment, often in just seconds.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Network Flows: Theory, Algorithms, and Applications.
Smith, D. K., Ahuja, R. K., Magnanti, T. L., & Orlin, J. B. (1994) · The Journal of the Operational Research Society · doi:10.2307/2583863 · Cited by 8,034
Latombe, J.-C. (1991) · Springer eBooks · doi:10.1007/978-1-4615-4022-9 · Cited by 6,396
LaValle, S. M. (2006) · Cambridge University Press eBooks · doi:10.1017/cbo9780511546877 · Cited by 5,211
Self-citationLaValle, S. M. (2006) · Cited by 4,177
Self-citationBehavior-based formation control for multirobot teams
Balch, T., & Arkin, R. C. (1998) · IEEE Transactions on Robotics and Automation · doi:10.1109/70.736776 · Cited by 3,112
Network flows: Theory, algorithms and applications
(1994) · Discrete Applied Mathematics · doi:10.1016/0166-218x(94)90171-6 · Cited by 2,585
Principles of Robot Motion: Theory, Algorithms, and Implementations
Choset, H., & Latombe, J. (2005) · Medical Entomology and Zoology · Cited by 2,149
An Automatic Method for Solving Discrete Programming Problems
Land, A. H., & Doig, A. G. (2010) · 50 Years of Integer Programming 1958-2008 · doi:10.1007/978-3-540-68279-0_5 · Cited by 1,988
An Automatic Method of Solving Discrete Programming Problems
Land, A. H., & Doig, A. G. (1960) · Econometrica · doi:10.2307/1910129 · Cited by 1,942
Reciprocal Velocity Obstacles for real-time multi-agent navigation
van den Berg, J., Lin, M., & Manocha, D. (2008) · 2008 IEEE International Conference on Robotics and Automation · doi:10.1109/robot.2008.4543489 · Cited by 1,722
Graph Minors .XIII. The Disjoint Paths Problem
Robertson, N., & Seymour, P. D. (1995) · Journal of Combinatorial Theory, Series B · doi:10.1006/jctb.1995.1006 · Cited by 1,262
Coordinating hundreds of cooperative, autonomous vehicles in warehouses
Wurman, P. R., & Mountz, M. (2008) · Cited by 835
Tanner, H. G., Pappas, G. J., & Kumar, V. (2004) · IEEE Transactions on Robotics and Automation · doi:10.1109/tra.2004.825275 · Cited by 775
Toward Efficient Trajectory Planning: The Path-Velocity Decomposition
Kant, K., & Zucker, S. W. (1986) · The International Journal of Robotics Research · doi:10.1177/027836498600500304 · Cited by 753
Erdmann, M., & Lozano-Pérez, T. (1987) · Algorithmica · doi:10.1007/bf01840371 · Cited by 736
A Probabilistic Approach to Collaborative Multi-Robot Localization
Fox, D., Burgard, W., Kruppa, H., & Thrun, S. (2000) · Autonomous Robots · doi:10.1023/a:1008937911390 · Cited by 692
Silver, D. (2005) · Proceedings of the AAAI Conference on Artificial Intelligence and Interactive Digital Entertainment · doi:10.1609/aiide.v1i1.18726 · Cited by 688
Constrained coverage for mobile sensor networks
Poduri, S., & Sukhatme, G. S. (2004) · Proceedings - IEEE International Conference on Robotics and Automation/Proceedings · doi:10.1109/robot.2004.1307146 · Cited by 541
Optimal motion planning for multiple robots having independent goals
LaValle, S. M., & Hutchinson, S. A. (1998) · IEEE Transactions on Robotics and Automation · doi:10.1109/70.736775 · Cited by 411
Self-citationCooperative multi-robot box-pushing
Mataric, M. J., Nilsson, M., & Simsarin, K. T. (2002) · Proceedings 1995 IEEE/RSJ International Conference on Intelligent Robots and Systems. Human Robot Interaction and Cooperative Robots · doi:10.1109/iros.1995.525940 · Cited by 367
Finding Optimal Solutions to Cooperative Pathfinding Problems
Standley, T. (2010) · Proceedings of the AAAI Conference on Artificial Intelligence · doi:10.1609/aaai.v24i1.7564 · Cited by 358
The increasing cost tree search for optimal multi-agent pathfinding
Sharon, G., Stern, R., Goldenberg, M., & Felner, A. (2013) · Artificial Intelligence · doi:10.1016/j.artint.2012.11.006 · Cited by 323
Prioritized motion planning for multiple robots
van den Berg, J. P., & Overmars, M. H. (2005) · 2005 IEEE/RSJ International Conference on Intelligent Robots and Systems · doi:10.1109/iros.2005.1545306 · Cited by 308
Reciprocal collision avoidance with acceleration-velocity obstacles
van den Berg, J., Snape, J., Guy, S. J., & Manocha, D. (2011) · 2011 IEEE International Conference on Robotics and Automation · doi:10.1109/icra.2011.5980408 · Cited by 288
Moving furniture with teams of autonomous robots
Rus, D. L., Donald, B., & Jennings, J. (2002) · IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS) · doi:10.1109/iros.1995.525802 · Cited by 276
A mobile robot exploration algorithm
Zelinsky, A. (1992) · IEEE Transactions on Robotics and Automation · doi:10.1109/70.182671 · Cited by 273
M*: A complete multirobot path planning algorithm with performance bounds
Wagner, G., & Choset, H. (2011) · 2011 IEEE/RSJ International Conference on Intelligent Robots and Systems · doi:10.1109/iros.2011.6095022 · Cited by 228
Erdmann, M., & Lozano-Perez, T. (1986) · Proceedings. 1986 IEEE International Conference on Robotics and Automation · doi:10.1109/robot.1986.1087401 · Cited by 208
Planning optimal paths for multiple robots on graphs
Yu, J., & LaValle, S. M. (2013) · 2013 IEEE International Conference on Robotics and Automation · doi:10.1109/icra.2013.6631084 · Cited by 197
Self-citationC apt: Concurrent assignment and planning of trajectories for multiple robots
Turpin, M., Michael, N., & Kumar, V. (2014) · The International Journal of Robotics Research · doi:10.1177/0278364913515307 · Cited by 193
Push and swap: fast cooperative path-finding with completeness guarantees
Luna, R., & Bekris, K. E. (2011) · International Joint Conference on Artificial Intelligence · doi:10.5591/978-1-57735-516-8/ijcai11-059 · Cited by 192
Graph puzzles, homotopy, and the alternating group
Wilson, R. M. (1974) · Journal of Combinatorial Theory, Series B · doi:10.1016/0095-8956(74)90098-7 · Cited by 181
Centralized path planning for multiple robots: Optimal decoupling into sequential plans
van den Berg, J., Snoeyink, J., Lin, M., & Manocha, D. (2009) · Robotics: Science and Systems V · doi:10.15607/rss.2009.v.018 · Cited by 167
Complete Algorithms for Cooperative Pathfinding Problems
Standley, T., & Korf, R. E. (2012) · Cited by 164
Multi-agent Path Planning and Network Flow
Yu, J., & LaValle, S. M. (2013) · Springer Tracts in Advanced Robotics · doi:10.1007/978-3-642-36279-8_10 · Cited by 164
Self-citationA General Framework for Assembly Planning: The Motion Space Approach
Halperin, D., Latombe, J.-C., & Wilson, R. H. (2000) · Algorithmica · doi:10.1007/s004539910025 · Cited by 147
A Complete and Scalable Strategy for Coordinating Multiple Robots Within Roadmaps
Peasgood, M., Clark, C., & McPhee, J. (2008) · IEEE Transactions on Robotics · doi:10.1109/tro.2008.918056 · Cited by 125
A novel approach to path planning for multiple robots in bi-connected graphs
Surynek, P. (2009) · Proceedings - IEEE International Conference on Robotics and Automation/Proceedings · doi:10.1109/robot.2009.5152326 · Cited by 124
Push and Rotate: a Complete Multi-agent Pathfinding Algorithm
de Wilde, B., ter Mors, A., & Witteveen, C. (2014) · Journal of Artificial Intelligence Research · doi:10.1613/jair.4447 · Cited by 119
Towards Optimal Cooperative Path Planning in Hard Setups through Satisfiability Solving
Surynek, P. (2012) · Lecture notes in computer science · doi:10.1007/978-3-642-32695-0_50 · Cited by 110
Solovey, K., Salzman, O., & Halperin, D. (2016) · The International Journal of Robotics Research · doi:10.1177/0278364915615688 · Cited by 109
Solovey, K., Salzman, O., & Halperin, D. (2015) · Springer tracts in advanced robotics · doi:10.1007/978-3-319-16595-0_34 · Cited by 108
Path planning for permutation-invariant multirobot formations
Kloder, S., & Hutchinson, S. (2006) · IEEE Transactions on Robotics · doi:10.1109/tro.2006.878952 · Cited by 104
Felner, A., Korf, R. E., Meshulam, R., & Holte, R. C. (2007) · Journal of Artificial Intelligence Research · doi:10.1613/jair.2241 · Cited by 76
Multi-Agent Pathfinding with Simultaneous Execution of Single-Agent Primitives
Sajid, Q., Luna, R., & Bekris, K. E. (2021) · Proceedings of the International Symposium on Combinatorial Search · doi:10.1609/socs.v3i1.18243 · Cited by 69
k -color multi-robot motion planning
Solovey, K., & Halperin, D. (2013) · The International Journal of Robotics Research · doi:10.1177/0278364913506268 · Cited by 61
Behavior-based evacuation planning
Rodriguez, S., & Amato, N. M. (2010) · Proceedings - IEEE International Conference on Robotics and Automation/Proceedings · doi:10.1109/robot.2010.5509502 · Cited by 55
Switching Rules for Decentralized Control with Simple Control Laws
Shucker, B., Murphey, T. D., & Bennett, J. K. (2007) · Proceedings of the ... American Control Conference/Proceedings of the American Control Conference · doi:10.1109/acc.2007.4282736 · Cited by 25
Cited by
A Survey on Aerial Swarm Robotics
Chung, S.-J., Paranjape, A. A., Dames, P., Shen, S., & Kumar, V. (2018) · IEEE Transactions on Robotics · doi:10.1109/tro.2018.2857475 · Cited by 672
Fan, T., Long, P., Liu, W., & Pan, J. (2020) · The International Journal of Robotics Research · doi:10.1177/0278364920916531 · Cited by 332
Persistent and Robust Execution of MAPF Schedules in Warehouses
Honig, W., Kiesel, S., Tinka, A., Durham, J. W., & Ayanian, N. (2019) · IEEE Robotics and Automation Letters · doi:10.1109/lra.2019.2894217 · Cited by 139
Metadata
- Authors
- Yu, J., & LaValle, S. M.
- Venue
- IEEE Transactions on Robotics
- Published
- 2016-10
- Volume
- 32
- Issue
- 5
- Pages
- 1163-1177
- ISSN
- 1552-3098 (ISSN-L)
- 1941-0468
- OpenAlex
- W2241553860
- Cited by
- 331
- References
- 48
- FWCI
- 15.52
- Type
- journal article
- Language
- en
- Open access
- green
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.