Error Analysis and Correction for Weighted A*'s Suboptimality (Extended Version)

Ruben Majadas
Ruben Majadas
Alberto Pozanco
Alberto Pozanco

arXiv: Artificial Intelligence, 2019.

Cited by: 0|Bibtex|Views23
EI
Other Links: dblp.uni-trier.de|academic.microsoft.com|arxiv.org

Abstract:

Weighted A* (wA*) is a widely used algorithm for rapidly, but suboptimally, solving planning and search problems. The cost of the solution it produces is guaranteed to be at most W times the optimal solution cost, where W is the weight wA* uses in prioritizing open nodes. W is therefore a suboptimality bound for the solution produced by...More

Code:

Data:

Full Text
Your rating :
0

 

Tags
Comments