Search Results for author: Dor Atzmon

Found 2 papers, 2 papers with code

Multi-Agent Pathfinding: Definitions, Variants, and Benchmarks

1 code implementation19 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

Multi-Agent Pathfinding with Continuous Time

1 code implementation16 Jan 2019 Anton Andreychuk, Konstantin Yakovlev, Dor Atzmon, Roni Stern

Multi-Agent Pathfinding (MAPF) is the problem of finding paths for multiple agents such that every agent reaches its goal and the agents do not collide.

Cannot find the paper you are looking for? You can Submit a new open access paper.