Walk, Stop, Count, and Swap: Decentralized Multi-Agent Path Finding With Theoretical Guarantees.

Hanlin Wang Michael Rubenstein

Published in: IEEE Robotics Autom. Lett. (2020)

Keyphrases

theoretical guarantees
path finding
multi agent
single agent
heuristic search
worst case
path planning
search algorithm
optimal path
random walk
graph cuts
rule learning
robocup rescue
reinforcement learning
hill climbing
multiple agents
lower bound