Cascading A*: a Parallel Approach to Approximate Heuristic Search
Yan Gu
TL;DR
Cascading A* is a novel parallel heuristic search algorithm that combines A* and IDA* using the 'envelope ball' concept, enabling efficient approximate and anytime solutions.
Contribution
The paper introduces Cascading A*, a new two-phase, parallel-friendly heuristic search algorithm that integrates A* and IDA* with a novel 'envelope ball' concept for improved efficiency.
Findings
Efficiently generates approximate solutions.
Supports anytime solution capabilities.
Designed to be parallel-friendly.
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAI-based Problem Solving and Planning · Robotic Path Planning Algorithms · Metaheuristic Optimization Algorithms Research