2023/05/08 by Hanlan Yang, Yang, Hanlan, Shohin Mukherjee +3 · 1 citation
Computer Science · #AI-based Problem Solving and Planning #Artificial Intelligence (cs.AI) #FOS: Computer and information sciences #Logic, programming, and type systems #Robotics (cs.RO) #Software Testing and Debugging Techniques
paper · pdf · doi:10.48550/arxiv.2305.04408
openalex publication_date 2023/05/08 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
Anytime search algorithms are useful for planning problems where a solution is desired under a limited time budget. Anytime algorithms first aim to provide a feasible solution quickly and then attempt to improve it until the time budget expires. On the other hand, parallel search algorithms utilize the multithreading capability of modern processors to speed up the search. One such algorithm, ePA*SE (Edge-Based Parallel A* for Slow Evaluations), parallelizes edge evaluations to achieve faster planning and is especially useful in domains with expensive-to-compute edges. In this work, we propose an extension that brings the anytime property to ePA*SE, resulting in A-ePA*SE. We evaluate A-ePA*SE experimentally and show that it is significantly more efficient than other anytime search methods. The open-source code for A-ePA*SE, along with the baselines, is available here: https://github.com/shohinm/parallelsearch