Pathfinding Benchmark Papers
Back to benchmark problems
The following papers all use maps and/or benchmark sets from those posted here:
- Real-Time Adaptive A* with Depression Avoidance. Hernandez, C., and Baier, J. A. 2011. In Proceedings of the Seventh Annual International AIIDE Conference (AIIDE-11), Stanford, USA. October.
- Real-Time Heuristic Search with Depression Avoidance. Hernandez, C., and Baier, J. A. 2011. In Proceedings of the 22nd International Joint Conference on Artificial Intelligence (IJCAI-11), Barcelona, Spain, July
- Fast Subgoaling for Pathfinding via Real-Time Search. Hernandez, C., and Baier, J. A. 2011. In Proceedings of the 21st International Conference on Automated Planning and Scheduling (ICAPS-11), Freiburg, Germany, June.
- Escaping Heuristic Depressions in Real-Time Heuristic Search (Extended Abstract). Hernandez, C., and Baier, J. A. 2011. In Proceedings of the 10th International Conference on Autonomous Agents and Multi-Agent Systems (AAMAS-11), Taipei, Taiwan, May.
- Meir Goldenberg, Nathan R. Sturtevant, Ariel Felner, Jonathan Schaeffer: The Compressed Differential Heuristic. AAAI 2011
- Guni Sharon, Roni Stern, Meir Goldenberg, Ariel Felner: The Increasing Cost Tree Search for Optimal Multi-Agent Pathfinding. IJCAI 2011: 662-667
- Ko-Hsin Cindy Wang, Adi Botea. 2011. MAPP: a Scalable Multi-Agent Path Planning Algorithm with Tractability and Completeness Guarantees. Journal of Artificial Intelligence Research (JAIR). To appear. http://abotea.rsise.anu.edu.au/data/wang-botea-jair11.pdf
- Adi Botea. 2011. Ultra-fast Optimal Pathfinding without Runtime Search. To appear in Proceedings of the Conference on AI and Interactive Digital Entertainment (AIIDE-11). Palo Alto, California, USA. http://abotea.rsise.anu.edu.au/data/botea-aiide11.pdf
- Harabor, Daniel; Botea, Adi; Kilby, Philip. 2011. Path Symmetries in Undirected Uniform-cost Grids (Extended Abstract). In Proceedings of the Ninth Symposium on Abstraction, Reformulation, and Approximation (SARA-11). Barcelona, Spain. http://abotea.rsise.anu.edu.au/data/harabor-etal-sara11.pdf
- Wang, Ko-Hsin Cindy; Botea, Adi; Kilby, Philip. 2011. On Improving the Quality of Solutions in Large-Scale Cooperative Multi-Agent Pathfinding. In Proceedings of the Symposium on Combinatorial Search (SoCS-11). Research abstract. Barcelona, Spain. http://abotea.rsise.anu.edu.au/data/ko-hsin-etal-socs11.pdf
- Wang, Ko-Hsin Cindy; Botea, Adi; Kilby, Philip. 2011. Solution Quality Improvements for Massively Multi-Agent Pathfinding. In the AAAI-11 Student Abstract and Poster Program. San Francisco, USA. http://abotea.rsise.anu.edu.au/data/ko-hsin-etal-stud-abstract-aaai11.pdf
- Harabor D., Botea A. 2010. Breaking Path Symmetries in 4-connected Grid Maps. In Proceedings of the AI and Interactive Digital Entertainment Conference AIIDE-2010, Stanford University, Palo Alto, CA, USA. http://abotea.rsise.anu.edu.au/data/harabor-botea-aiide10.pdf
- Wang K-H. C., Botea A. 2010. Scalable Multi-Agent Pathfinding on Grid Maps with Tractability and Completeness Guarantees. In Proceedings of the European Conference on AI ECAI-2010, Lisbon, Portugal. Short paper. http://abotea.rsise.anu.edu.au/data/wang-botea-ecai10.pdf
- Ko-Hsin Cindy Wang and Adi Botea. 2008. Fast and Memory-Efficient Multi-Agent Pathfinding. In Proceedings of the International Conference on Automated Planning and Scheduling ICAPS-08, Sydney, Australia. http://users.rsise.anu.edu.au/~cwang/icaps08-paper.pdf
- Daniel Harabor and Adi Botea. 2008. Hierarchical Path Planning with Multi-Size Agents in Heterogenous Environments. In the IEEE Symposium on Computational Intelligence and Games CIG-08. Also, in the ICAPS-08 Workshop KEPS-08. http://abotea.rsise.anu.edu.au/data/ahastar.pdf
- Botea A., Mueller M., and Schaeffer J. 2004. Near Optimal Hierarchical Path-Finding. In Journal of Game Development, volume 1, issue 1, 7-28. http://abotea.rsise.anu.edu.au/data/hpastar.pdf
- Block A*: Database-Driven Search with Applications in Any-angle
Path-Planning. Peter Yap, Neil Burch, Rob Holte, and Jonathan
Schaeffer (2011), Proceedings of the Twenty-Fifth AAAI Conference on
Artificial Intelligence (AAAI-11).
- Abstract: Block A* and Any-angle Path-Planning, Peter Yap, Neil Burch,
Robert C. Holte, and Jonathan Schaeffer (2011), Proc. 4th Symposium on
Combinatorial Search (SoCS).
- Any-Angle Path Planning For Computer Game, Peter Yap, Neil Burch,
Robert C. Holte, and Jonathan Schaeffer (2011), Seventh AAAI
Conference on Artificial Intelligence and Interactive Digital
Entertainment (AIIDE11).
- A Comparison of High-Level Approaches for Speeding Up Pathfinding Nathan Sturtevant and Robert Geisberger, AIIDE 2010.
- Single-Frontier Bidirectional Search Ariel Felner, Carsten Moldenhauer, Nathan Sturtevant and Jonathan Schaeffer, AAAI 2010.
- On Learning in Real-Time Heuristic Search, Nathan Sturtevant, Vadim Bulitko, Yngvi Bjornsson, AAMAS 2010.
- Portal-Based True-Distance Heuristics for Path Finding, Meir Goldenberg, Ariel Felner, Nathan Sturtevant and Jonathan Schaeffer, SoCS 2010
- Memory-Based Heuristics for Explicit State Spaces, Nathan Sturtevant, Ariel Felner, Max Barer, Jonathan Schaeffer, Neil Burch, IJCAI 2009.
- Evaluating Strategies for Running from the Cops, Carsten Moldenhauer and Nathan Sturtevant, IJCAI 2009.
- A* Search with Inconsistent Heuristics, Zhifu Zhang, Nathan Sturtevant, Jonathan Schaeffer, Robert Holte, Ariel Felner, IJCAI 2009.
- TBA*: Time-Bounded A*, Yngvi Bjornsson, Vadim Bulitko and Nathan Sturtevant, IJCAI 2009.
- Optimizing Motion-Constrained Pathfinding, Nathan Sturtevant, AIIDE 2009.
- Graph Abstraction in Real-time Heuristic Search, Vadim Bulitko, Nathan Sturtevant, Jieshan Lu, Timothy Yau, Journal of Artificial Intelligence Research (JAIR)
- An Analysis of Map-Based Abstraction and Refinement, Nathan Sturtevant and Renee Jansen, SARA-2007, Whistler, BC.
- Memory-Efficient Abstractions for Pathfinding, Nathan Sturtevant, AIIDE-2007, Stanford, CA
- Partial Pathfinding Using Map Abstraction and Refinement, Nathan Sturtevant and Michael Buro, Proceedings AAAI-2005, July, 2005.