Fast and memory-efficient multi-agent pathfinding

ICAPS 2008 - Proceedings of the 18th International Conference on Automated Planning and Scheduling

Volumn , Issue , 2008, Pages 380-387

  Wang, Ko Hsin Cindy ^a   Botea, Adi ^a  

^a AUSTRALIAN NATIONAL UNIVERSITY   (Australia)

Author keywords

[No Author keywords available]

Indexed keywords

BRANCHING FACTORS; COMPLETE SEARCHES; COMPUTER GAMES; FLOW RESTRICTIONS; GLOBAL LEVELS; GRID MAPS; HARD PROBLEMS; HEURISTIC PROCEDURES; MEMORY RESOURCES; MOBILE UNITS; MULTI AGENTS; NUMBER OF STATE; PATH FINDINGS; PATH-PLANNING; PLAN EXECUTIONS; RE-PLANNING; REAL TIME; REAL-LIFE APPLICATIONS; ROAD NETWORKS; SCALE-UP;

COMPUTER APPLICATIONS; DATA STORAGE EQUIPMENT; ECONOMIC ANALYSIS; GAME THEORY; HEURISTIC METHODS; MOTOR TRANSPORTATION; MULTI AGENT SYSTEMS; OBJECT RECOGNITION; OPTICAL PROJECTORS; SCHEDULING; WIRELESS TELECOMMUNICATION SYSTEMS;

WIRELESS NETWORKS;

EID: 58849143928     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (27)

1. Alexander, Z. 1992. A mobile robot navigation exploration algorithm. IEEE Transactions of Robotics and Automation.
2. Arikan, O.; Chenney, S.; and Forsyth, D. A. 2001. Efficient multi-agent path planning. In In Proceedings of the Eurographic Workshop on Computer Animation and Simulation.
3. Barraquand, J., and Latombe, J.-C. 1991. Robot motion planning: a distributed representation approach. International Journal of Robotics Research.
4. Bennewitz, M; Burgard, W.; and Thrun, S. 2002. Finding and optimizing solvable priority schemes for decoupled path planning techniques for teams of mobile robots. Robotics and Autonomous Systems.
5. Botea, A.; Miiller, M.; and Schaeffer, J. 2004. Near optimal hierarchical path-finding. Journal of Game Development.
6. Bulitko, V.; Bjornsson, Y.; Luvstrek, M.; Schaeffer, J.; and Sigmundarson, S. 2007. Dynamic Control in Path-Planning with Real-Time Heuristic Search. In Proceedings of the International Conference on Automated Planning and Scheduling (ICAPS).
7. Buro, M, and Furtak, T. 2004. RTS games and real-time AI research. In Proceedings of the Behaviour Representation in Modeling and Simulation Conference.
8. Coffman, E. G.; Elphick, M.; and Shoshani, A. 1971. System deadlocks. ACM Comput. Surv.
9. Erdmann, M, and Lozano-Perez, T. 1986. On multiple moving objects. In IEEE International Conference on Robotics and Automation.
10. Hopcroft, J. E.; Schwartz, J. T.; and Sharir, M. 1984. On the complexity of motion planning for multiple independent objects: PSPACE-hardness of the "warehouseman's problem". International Journal of Robotics Research.
11. Kitano, H.; Tadokor, S.; Noda, H.; Matsubara, I.; Takhasi, T.; Shinjou, A.; and Shimada, S. 1999. Robocup-rescue: Search and rescue for large scale disasters as a domain for multi-agent research. In In Proceedings of the IEEE Conference on Systems, Men, and Cybernetics.
12. LaValle, S., and Hutchinson, S. A. 1998. Optimal motion planning for multiple robots having independent goals. IEEE Transactions on Robotics and Automation.
13. Leroy, S.; Laumond, J.-P; and Siméon, T. 1999. Multiple path coordination for mobile robots: A geometric algorithm. In International Joint Conference on Artificial Intelligence.
14. Lumelsky, V. J., and Harinarayan, K. R. 1997. Decentralized motion planning for multiple mobile robots: The cocktail party model. Autonomous Robots.
15. Pallottino, L.; Scordio, V. G.; Frazzoli, E.; and Bicchi, A. 2007.
16. Decentralized cooperative policy for conflict resolution in multivehicle systems. IEEE Transactions on Robotics.
17. Pearl, J. 1984. Heuristics - Intelligent Search Strategies for Computer Problem Solving. Addison-Wesley.
18. Pottinger, D. C. 1999. Coordinated unit movement. Game Developer Magazine.
19. Reif, J. 1979. Complexity of the mover's problem and generalizations. In Proceedings of IEEE Symposium on Foundations of Computer Science.
20. Ryan, M. R. K. 2008. Exploiting Subgraph Structure in Multi-Robot Path Planning. Journal of Artificial Intelligence Research.
21. Sharma, V.; Savchenko, M.; Frazzoli, E.; and Voulgaris, P. G. 2007. Transfer time complexity of conflict-free vehicle routing with no communications. The International Journal of Robotics Research.
22. Silver, D. 2006. Cooperative pathfinding. AI Programming Wisdom.
23. Stout, B. 1996. Smart moves: Intelligent pathfinding. Game Developer Magazine.
24. Sturtevant, N. R., and Buro, M. 2005. Partial pathfinding using map abstraction and refinement. In Association for the Advancement of Artificial Intelligence (AAAI).
25. Sturtevant, N. R., and Buro, M. 2006. Improving collaborative pathfinding using map abstraction. In Artificial Intelligence and Interactive Digital Entertainment (AIIDE).
26. Sud, A.; Andersen, E.; Curtis, S.; Lin, M. C.; and Manocha, D. 2008. Real-time path planning in dynamic virtual environments using multiagent navigation graphs. IEEE Transactions on Visualization and Computer Graphics.
27. Tomlin, C.; Pappas, G.; and Sastry, S. 1998. Conflict resolution for air traffic management: A study in muti-agent hybrid systems. IEEE Transactions on Automatic Control.