L* Algorithm - A Linear Computational Complexity Graph Searching Algorithm for Path Planning.

Adam Niewola Leszek Podsedkowski

Published in: J. Intell. Robotic Syst. (2018)

Keyphrases

path planning
objective function
dynamic programming
computational complexity
multi robot
np hard
optimal solution
search algorithm
mobile robot
directed graph
obstacle avoidance
path finding
search space
degrees of freedom
collision avoidance