Multi-Agent Pathfinding: Definitions, Variants, and Benchmarks

1 code implementation • 19 Jun 2019 • Roni Stern, Nathan Sturtevant, Ariel Felner, Sven Koenig, Hang Ma, Thayne Walker, Jiaoyang Li, Dor Atzmon, Liron Cohen, T. K. Satish Kumar, Eli Boyarski, Roman Bartak

The MAPF problem is the fundamental problem of planning paths for multiple agents, where the key constraint is that the agents will be able to follow these paths concurrently without colliding with each other.

Autonomous Vehicles

Planning as Tabled Logic Programming

no code implementations • 14 Jul 2015 • Neng-Fa Zhou, Roman Bartak, Agostino Dovier

This paper describes Picat's planner, its implementation, and planning models for several domains used in International Planning Competition (IPC) 2014.