Work

A Bucket-Based Priority Queue for Bounded-Suboptimal and Anytime A* Search

Year: 2025

Type: conference-paper

Abstract: We introduce a priority queue data structure, called a bucket heap, which generalizes the bucket queue commonly used to accelerate A* search for shortest-path problems with a small range of integer transition costs. Unlike a bucket queue, a bucket heap speeds up priority queue operations for bounded-suboptimal and Anytime A* algorithms guided by non-admissible node evaluation functions. It also provides direct access---without any additional overhead---to the underlying bucket queue of A*, which we show can be used to improve search performance in further ways.

Source: Proceedings of the International Symposium on Combinatorial Search

DOI: 10.1609/socs.v18i1.35976

Authors: Garrett M. Fereday, Eric A. Hansen

Institution: Mississippi State University

Language: English

Topic: AI-based Problem Solving and Planning

Subfield: Artificial Intelligence

Field: Computer Science

Domain: Physical Sciences

Open Access status: diamond

Funder: National Science Foundation

Award: RI: Small: A New Approach to Integrating Graphical Models in Decision-Theoretic Planning