The DOI matches its Crossref record; 47 of the 47 references it cites were found in a registry or an index.
Subdimensional expansion for multirobot path planning
Open accessOverview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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
A Formal Basis for the Heuristic Determination of Minimum Cost Paths
Hart, P., Nilsson, N., & Raphael, B. (1968) · IEEE Transactions on Systems Science and Cybernetics · doi:10.1109/tssc.1968.300136 · Cited by 12,738
Proceedings. 1985 IEEE International Conference on Robotics and Automation
(1985) · doi:10.1109/robot.1985 · Cited by 3,673
2013 IEEE International Conference on Robotics and Automation
(2013) · doi:10.1109/icra19839.2013 · Cited by 2,025
Depth-first iterative-deepening
Korf, R. E. (1985) · Artificial Intelligence · doi:10.1016/0004-3702(85)90084-0 · Cited by 1,562
Heuristics: Intelligent search strategies for computer problem solving.
(1985) · Information Processing & Management · doi:10.1016/0306-4573(85)90100-1 · Cited by 1,430
Proceedings of the International Joint Conference on Artificial Intelligence (IJCAI 2017)
Amendola, G., Ricca, F., & Truszczyński, M. (2017) · International Joint Conference on Artificial Intelligence · Cited by 1,179
Proceedings. 1988 IEEE International Conference on Robotics and Automation
(1988) · doi:10.1109/robot.1988 · Cited by 984
Bonet, B., & Geffner, H. (2001) · Artificial Intelligence · doi:10.1016/s0004-3702(01)00108-4 · Cited by 959
Proceedings of the 26th AAAI Conference on Artificial Intelligence (AAAI'12)
Hoffmann, J., & Selman, B. (2012) · HAL · Cited by 754
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
Silver, D. (2005) · Proceedings of the AAAI Conference on Artificial Intelligence and Interactive Digital Entertainment · doi:10.1609/aiide.v1i1.18726 · Cited by 688
Unifying SAT-based and graph-based planning
Kautz, H., & Selman, B. (1999) · Cited by 429
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
Methodologies for Intelligent Systems
(1991) · Lecture notes in computer science · doi:10.1007/3-540-54563-8 · Cited by 404
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
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
Linear-space best-first search
Korf, R. E. (1993) · Artificial Intelligence · doi:10.1016/0004-3702(93)90045-d · Cited by 305
Suboptimal Variants of the Conflict-Based Search Algorithm for the Multi-Agent Pathfinding Problem
Barer, M., Sharon, G., Stern, R., & Felner, A. (2021) · Proceedings of the International Symposium on Combinatorial Search · doi:10.1609/socs.v5i1.18315 · Cited by 274
Ferguson, D., Kalra, N., & Stentz, A. (2006) · Proceedings 2006 IEEE International Conference on Robotics and Automation, 2006. ICRA 2006. · doi:10.1109/robot.2006.1641879 · Cited by 272
On Delaying Collision Checking in PRM Planning: Application to Multi-Robot Coordination
Sánchez, G., & Latombe, J.-C. (2002) · The International Journal of Robotics Research · doi:10.1177/027836402320556458 · Cited by 248
Coordinating Multiple Robots with Kinodynamic Constraints Along Specified Paths
Peng, J., & Akella, S. (2005) · The International Journal of Robotics Research · doi:10.1177/0278364905051974 · Cited by 229
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
Self-citationA General Formal Framework for Pathfinding Problems with Multiple Agents
Erdem, E., Kisa, D., Öztok, U., & Schüller, P. (2013) · Proceedings of the AAAI Conference on Artificial Intelligence · doi:10.1609/aaai.v27i1.8592 · Cited by 202
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
Using a PRM planner to compare centralized and decoupled planning for multi-robot systems
Sanchez, G., & Latombe, J.-C. (2003) · Proceedings 2002 IEEE International Conference on Robotics and Automation (Cat. No.02CH37292) · doi:10.1109/robot.2002.1014852 · Cited by 189
Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence
Dean, T. (1999) · Cited by 186
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
Finding a shortest solution for the N x N extension of the 15- Puzzle is intractable
Ratner, D., & Warmuth, M. K. (1986) · National Conference on Artificial Intelligence · 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
MAPP: a Scalable Multi-Agent Path Planning Algorithm with Tractability and Completeness Guarantees
Wang, K.-H. C., & Botea, A. (2014) · arXiv (Cornell University) · doi:10.48550/arxiv.1401.3905 · Cited by 162
Albrecht, S. V., & Ramamoorthy, R. (2012) · Adaptive Agents and Multi-Agents Systems · Cited by 161
Pohl, I. (1973) · International Joint Conference on Artificial Intelligence · Cited by 153
Goldenberg, M., Felner, A., Stern, R., Sharon, G., Sturtevant, N., Holte, R. C., & Schaeffer, J. (2014) · Journal of Artificial Intelligence Research · doi:10.1613/jair.4171 · Cited by 149
Decentralized path planning for multi-agent teams with complex constraints
Desaraju, V. R., & How, J. P. (2012) · Autonomous Robots · doi:10.1007/s10514-012-9275-2 · Cited by 125
Solovey, K., Salzman, O., & Halperin, D. (2015) · Springer tracts in advanced robotics · doi:10.1007/978-3-319-16595-0_34 · Cited by 118
Multi-Robot Motion Planning by Incremental Coordination
Saha, M., & Isto, P. (2006) · IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS) · doi:10.1109/iros.2006.282536 · Cited by 100
Conflict-Based Search For Optimal Multi-Agent Path Finding
Sharon, G., Stern, R., Felner, A., & Sturtevant, N. (2021) · Proceedings of the AAAI Conference on Artificial Intelligence · doi:10.1609/aaai.v26i1.8140 · Cited by 93
ODrM* optimal multirobot path planning in low dimensional search spaces
Ferner, C., Wagner, G., & Choset, H. (2013) · Proceedings - IEEE International Conference on Robotics and Automation/Proceedings · doi:10.1109/icra.2013.6631119 · Cited by 93
Self-citationProbabilistic path planning for multiple robots with subdimensional expansion
Wagner, G., Kang, M.-S., & Choset, H. (2012) · Proceedings - IEEE International Conference on Robotics and Automation/Proceedings · doi:10.1109/icra.2012.6225297 · Cited by 77
Self-citationMulti-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 75
Incorporating opponent models into adversary search
Carmel, D., & Markovitch, S. (1996) · Cited by 73
On Parallel RRTs for Multi-robot Systems
Carpin, S., & Pagello, E. (2002) · Cited by 70
Cooperative Multi-Robot Path Planning by Heuristic Priority Adjustment
Regele, R., & Levi, P. A. (2006) · IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS) · doi:10.1109/iros.2006.282480 · Cited by 69
Pareto-optimal coordination of multiple robots with safety guarantees
Cui, R., Gao, B., & Ji, G. L. (2011) · Autonomous Robots · doi:10.1007/s10514-011-9265-9 · Cited by 66
Multi-agent RRT: sampling-based cooperative pathfinding
Čáp, M., Novák, P., Vokřínek, J., & Pěchouček, M. (2013) · Adaptive Agents and Multi-Agents Systems · doi:10.5555/2484920.2485174 · Cited by 64
Cited by
A review of cooperative multi-agent deep reinforcement learning
Oroojlooy, A., & Hajinezhad, D. (2023) · Applied Intelligence · doi:10.1007/s10489-022-04105-y · Cited by 482
PRIMAL: Pathfinding via Reinforcement and Imitation Multi-Agent Learning
Sartoretti, G., Kerr, J., Shi, Y., Wagner, G., Kumar, T. K. S., Koenig, S., & Choset, H. (2019) · IEEE Robotics and Automation Letters · doi:10.1109/lra.2019.2903261 · Cited by 417
Self-citationFujitani, Y., Yamauchi, T., Miyashita, Y., & Sugawara, T. (2022) · Procedia Computer Science · doi:10.1016/j.procs.2022.09.212 · Cited by 9
Metadata
- Authors
- Wagner, G., & Choset, H.
- Venue
- Artificial Intelligence
- Publisher
- Elsevier BV
- Published
- 2015-02
- Volume
- 219
- Pages
- 1-24
- ISSN
- 0004-3702 (ISSN-L)
- OpenAlex
- W2123030512
- Cited by
- 369
- References
- 47
- FWCI
- 15.13
- Type
- journal article
- Language
- en
- Open access
- bronze
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.