Combining Strengths of Optimal Multi-Agent Path Finding Algorithms.

Jirí Svancara Roman Barták

Published in: ICAART (1) (2019)

Keyphrases

path finding
multi agent
nearest neighbor
computational complexity
dynamic programming
simulated annealing
hill climbing
genetic algorithm
learning algorithm
reinforcement learning
search algorithm
artificial neural networks
optimization problems
theoretical analysis
error rate
evolutionary computation