Sign in
An Algorithm with Improved Complexity for Pebble Motion/Multi-Agent Path Finding on Trees.
Stefano Ardizzoni
Irene Saccani
Luca Consolini
Marco Locatelli
Bernhard Nebel
Published in:
J. Artif. Intell. Res. (2024)
Keyphrases
</>
path finding
multi agent
computational complexity
worst case
dynamic programming
preprocessing
learning algorithm
path planning
complexity analysis
motion estimation
moving objects
search space
np hard
neural network
state space
objective function
data mining algorithms
heuristic search