Cascading A*: a Parallel Approach to Approximate Heuristic Search

06/04/2014
by   Yan Gu, et al.
0

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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
10/12/2011

Anytime Heuristic Search

We describe how to convert the heuristic search algorithm A* into an any...
research
05/09/2020

Learning to Accelerate Heuristic Searching for Large-Scale Maximum Weighted b-Matching Problems in Online Advertising

Bipartite b-matching is fundamental in algorithm design, and has been wi...
research
04/21/2022

A heuristic to determine the initial gravitational constant of the GSA

The Gravitational Search Algorithm (GSA) is an optimization algorithm ba...
research
08/03/2020

Planning to Score a Goal in Robotic Football with Heuristic Search

This paper considers a problem of planning an attack in robotic football...
research
04/11/2011

Rational Deployment of CSP Heuristics

Heuristics are crucial tools in decreasing search effort in varied field...
research
09/02/2016

A heuristic extending the Squarified treemapping algorithm

A heuristic extending the Squarified Treemap technique for the represent...
research
10/18/2017

Minimizing Task Space Frechet Error via Efficient Incremental Graph Search

We present an algorithm that generates a collision-free configuration-sp...

Please sign up or login with your details

Forgot password? Click here to reset