English

Cascading A*: a Parallel Approach to Approximate Heuristic Search

Artificial Intelligence 2016-05-04 v2

Abstract

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.

Keywords

Cite

@article{arxiv.1406.0955,
  title  = {Cascading A*: a Parallel Approach to Approximate Heuristic Search},
  author = {Yan Gu},
  journal= {arXiv preprint arXiv:1406.0955},
  year   = {2016}
}
R2 v1 2026-06-22T04:30:11.554Z