Cascading A*: a Parallel Approach to Approximate Heuristic Search
This work addresses the need for faster and more flexible heuristic search algorithms in AI and robotics, though it appears incremental as it builds on existing A* and IDA* methods.
The paper tackled the problem of approximate heuristic search by introducing Cascading A*, a two-phase algorithm combining A* and IDA* using an 'envelope ball' concept, resulting in an efficient method that generates approximate and any-time solutions while being parallel-friendly.
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.