Bi-Objective Search with Bi-directional A* (Extended Abstract)
DOI:
https://doi.org/10.1609/socs.v12i1.18563Keywords:
Analysis Of Search Algorithms, Bounding And Pruning TechniquesAbstract
Bi-objective search is a problem of finding a set of optimal solutions in a two-dimensional domain. This study proposes several enhancements to the state-of-the-art bi-objective search with A* and develops its bi-directional variant. Our experimental results on benchmark instances show that our enhanced algorithm is on average five times faster than the state of the art bi-objective search algorithms.Downloads
Published
2021-07-22
Issue
Section
Extended Abstracts