Second-Generation Multi-Agent Path Finding Algorithms

A Short Abstract in Layman Terms Second-Generation Multi-Agent Path Finding Algorithms Proposal # 2017692 Ariel Felner Ben Gurion University Nathan R. Sturtevant University of Denver Sven Koenig University of Southern California Abstract: There are many environments where collisions between moving agents must be avoided.

This could be a crowd on a street, trains on a track, robots in a room, or airplanes in the sky. This research project is concerned with finding the best ways for cooperation among such agents such that they will not collide but reach their destinations as soon as possible.

Although researchers have looked at sub-portions of this problem, we are studying it from a broader perspective, showing when a particular approach will or will not work, and developing new methods to find the best possible cooperation for different circumstances.