Incremental Generalized Hybrid A*
Sidharth Talia, Oren Salzman, Siddhartha Srinivasa

TL;DR
This paper introduces IGHA*, an incremental hybrid A* algorithm that improves real-time kinodynamic planning by reducing expansions and dynamically organizing search without rigid grid-based pruning.
Contribution
IGHA* offers a novel anytime tree-search framework that outperforms traditional Hybrid A* by adaptively organizing search expansions, enabling faster and more robust planning for complex dynamics.
Findings
IGHA* uses 6x fewer expansions than HA* in planning tasks.
IGHA* achieves real-time performance in simulation and on a small vehicle.
IGHA* outperforms HA* in high-fidelity off-road experiments.
Abstract
We address the problem of efficiently organizing search over very large trees, which arises in many applications ranging from autonomous driving to aerial vehicles. Here, we are motivated by off-road autonomy, where real-time planning is essential. Classical approaches use graphs of motion primitives and exploit dominance to mitigate the curse of dimensionality and prune expansions efficiently. However, for complex dynamics, repeatedly solving two-point boundary-value problems makes graph construction too slow for fast kinodynamic planning. Hybrid A* (HA*) addressed this challenge by searching over a tree of motion primitives and introducing approximate pruning using a grid-based dominance check. However, choosing the grid resolution is difficult: too coarse risks failure, while too fine leads to excessive expansions and slow planning. We propose Incremental Generalized Hybrid A*…
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
TopicsAdvanced Control Systems Optimization
