Archive for the ‘Multi-Agent Pathfinding’ Category

Multi-Agent Path Planning

Posted on May 29th, 2011
Multi-Agent Path Planning

Many tasks, such as computer games, street sweeping, mail delivery, and robotic surveillance and patrol, vehicle routing, environmental monitoring, require multiple agents to visit points in an environment to accomplish a goal, ensuring that they do not collide with static obstacles or other moving agents.

We study such problems in a general framework using high-level representation formalism and efficient solvers of the declarative programming paradigm Answer Set Programming.

read more