A Lyapunov Analysis of a Most Probable Path Finding Algorithm.

Yuanqiu Mo Soura Dasgupta Jacob Beal

Published in: IEEE Control. Syst. Lett. (2022)

Keyphrases

path finding
optimal solution
preprocessing
dynamic programming
learning algorithm
objective function
computational complexity
np hard
knowledge representation
simulated annealing
sufficient conditions
theoretical analysis
path planning
complexity analysis
linear programming
shortest path