Error Analysis and Correction for Weighted A*'s Suboptimality (Extended Version)
arXiv: Artificial Intelligence, 2019.
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
PPT (Upload PPT)