A Polynomial-Time Algorithm for Non-Optimal Multi-Agent Pathfinding.

Mokhtar M. Khorshid Robert C. Holte Nathan R. Sturtevant

Published in: SOCS (2011)

Keyphrases

path finding
worst case
dynamic programming
computational complexity
optimal solution
multi agent
optimal path
learning algorithm
path planning
preprocessing
np hard
lower bound
search space
objective function
particle swarm optimization
classification algorithm
solution quality
hill climbing
subgroup discovery