University of Cambridge > > Wednesday Seminars - Department of Computer Science and Technology  > Pathfinding for 10k agents

Pathfinding for 10k agents

Add to your list(s) Download to your calendar using vCal

If you have a question about this talk, please contact Ben Karniely.

Path planning for multiple agents is the backbone of many interesting applications, ranging from video games to warehouse automation. The underlying problem is typically formulated as finding collision-free paths on graphs, called multi-agent pathfinding (MAPF). This talk dives deep into an important challenge for MAPF : can we build scalable algorithms, say tailored for 10k agents, while still having nice theoretical guarantees like completeness and optimality? Traditionally, these two aspects have been considered incompatible, given the inherent difficulties that guaranteed algorithms face in finding solutions amidst an increasing number of agents. Starting with vanilla approaches to MAPF like A* search, this talk outlines approaches for this quest.

Link to join virtually:

A recording of this talk is available at the following link:

This talk is part of the Wednesday Seminars - Department of Computer Science and Technology series.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.


© 2006-2023, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity