Simple and efficient bi-objective search algorithms via fast dominance checks
Simple and efficient bi-objective search algorithms via fast dominance checks
Carlos Hernández,W. Yeoh,4 Authors,Oren Salzman
2022 · DOI: 10.1016/j.artint.2022.103807
Artificial Intelligence · 33 Citations
TLDR
It is shown in the experimental evaluation that both BOA* and BOD are substantially faster than state-of-the-art bi-objective search algorithms.
Abstract
given start state with s . We propose Bi-Objective Dijkstra (BOD), which is based on BOA*, for this problem. A common feature of BOA* and BOD is that all dominance checks are performed in constant time, unlike the dominance checks of previous algorithms. We show in our experimental evaluation that both BOA* and BOD are substantially faster than state-of-the-art bi-objective search algorithms.