Cascading A*: a Parallel Approach to Approximate Heuristic Search

2014/06/04 by Gu, Yan
#Artificial Intelligence (cs.AI) #FOS: Computer and information sciences

paper · doi:10.48550/arxiv.1406.0955

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.

Related

• Evolving Real-Time Heuristics Search Algorithms with Building Blocks
• A*+BFHS: A Hybrid Heuristic Search Algorithm
• Heuristic Search For Physics-Based Problems: Angry Birds in PDDL+
• Hyper-heuristics: a survey of the state of the art
• Rational Deployment of Multiple Heuristics in IDA*