Analysis of Backtracking A for Resource Constrained Shortest Path Problems

The Resource Constrained Shortest Path Problem (RCSPP) requires a minimum-cost simple path between two nodes that is subject to a resource consumption constraint. In this paper, we consider the Backtracking A^{\ast} algorithm presented in previous works applied to the general RCSPP. Backtracking A^{...

Full description

Saved in:
Bibliographic Details
Published inProceedings of the American Control Conference pp. 3545 - 3550
Main Authors Ford, Bryce, Kumar, Mrinal
Format Conference Proceeding
LanguageEnglish
Published AACC 10.07.2024
Subjects
Analytical models
Backtracking
Decision trees
Iterative algorithms
Numerical models
Path Planning
Resource Constrained Shortest Path
Shortest path problem
Time complexity
Online AccessGet full text

Cover

More Information
Summary:The Resource Constrained Shortest Path Problem (RCSPP) requires a minimum-cost simple path between two nodes that is subject to a resource consumption constraint. In this paper, we consider the Backtracking A^{\ast} algorithm presented in previous works applied to the general RCSPP. Backtracking A^{\ast} attempts to solve the RCSPP by iterative modification of paths generated by a shortest path algorithm such as A^{\ast} . We consider the completeness of Backtracking A^{\ast} and demonstrate that it cannot be a complete algorithm. Then we propose a complete, modified version of Backtracking A^{\ast} . Finally, we give a result for the time complexity of Backtracking A^{\ast} , and demonstrate it under worst-case conditions applied to randomly generated graphs.
ISSN:2378-5861
DOI:10.23919/ACC60939.2024.10644796