Pathfinding for 10k agents

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

• Dr Keisuke Okumura - Visiting scholar at the Department of Computer Science and Technology, University of Cambridge
• Wednesday 01 November 2023, 15:05-15:55
• Lecture Theatre 1, Computer Laboratory, William Gates Building.

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: https://cam-ac-uk.zoom.us/j/81322468305

A recording of this talk is available at the following link: https://www.cl.cam.ac.uk/seminars/wednesday/video/

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

This talk is included in these lists:

• All Talks (aka the CURE list)
• Cambridge talks
• Chris Davis' list
• Department of Computer Science and Technology talks and seminars
• Graduate-Seminars
• Guy Emerson's list
• Interested Talks
• Lecture Theatre 1, Computer Laboratory, William Gates Building
• School of Technology
• Trust & Technology Initiative - interesting events
• Wednesday Seminars - Department of Computer Science and Technology
• bld31
• computer science
• se393's list

Note that ex-directory lists are not shown.