In this paper, we proposed a new approximate heuristic search algorithm: Cascading A*, which is a two-phrase algorithm combining A* and IDA* by a new concept "envelope ball". The new algorithm CA* is efficient, able to generate approximate solution and any-time solution, and parallel friendly.
from cs.AI updates on arXiv.org http://ift.tt/1mc4Lyt
via IFTTT
No comments:
Post a Comment