BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Talks.cam//talks.cam.ac.uk//
X-WR-CALNAME:Talks.cam
BEGIN:VEVENT
SUMMARY:Pathfinding for 10k agents - Dr Keisuke Okumura - Visiting scholar
  at the Department of Computer Science and Technology\, University of Camb
 ridge
DTSTART:20231101T150500Z
DTEND:20231101T155500Z
UID:TALK204508@talks.cam.ac.uk
CONTACT:Ben Karniely
DESCRIPTION:Path planning for multiple agents is the backbone of many inte
 resting applications\, ranging from video games to warehouse automation. T
 he underlying problem is typically formulated as finding collision-free pa
 ths on graphs\, called multi-agent pathfinding (MAPF). This talk dives dee
 p into an important challenge for MAPF: can we build scalable algorithms\,
  say tailored for 10k agents\, while still having nice theoretical guarant
 ees like completeness and optimality? Traditionally\, these two aspects ha
 ve been considered incompatible\, given the inherent difficulties that gua
 ranteed algorithms face in finding solutions amidst an increasing number o
 f agents. Starting with vanilla approaches to MAPF like A* search\, this t
 alk outlines approaches for this quest.\n\nLink to join virtually: https:/
 /cam-ac-uk.zoom.us/j/81322468305\n\nA recording of this talk is available 
 at the following link: https://www.cl.cam.ac.uk/seminars/wednesday/video/
LOCATION:Lecture Theatre 1\, Computer Laboratory\, William Gates Building
END:VEVENT
END:VCALENDAR