Front-to-End Bidirectional Heuristic Search with Consistent Heuristics: Enumerating and Evaluating Algorithms and Bounds
Abstract
Recent research on bidirectional heuristic search (BiHS) is based on the must-expand pairs theory (MEP theory), which describes which pairs of nodes must be expanded during the search to guarantee the optimality of solutions. A separate line of research in BiHS has proposed algorithms that use lower bounds that are derived from consistent heuristics during search. This paper links these two directions, providing a comprehensive unifying view and showing that both existing and novel algorithms can be derived from the MEP theory. An extended set of bounds is formulated, encompassing both previously discovered bounds and new ones. Finally, the bounds are empirically evaluated by their contribution to the efficiency of the search
Cite
Text
Siag et al. "Front-to-End Bidirectional Heuristic Search with Consistent Heuristics: Enumerating and Evaluating Algorithms and Bounds." International Joint Conference on Artificial Intelligence, 2023. doi:10.24963/IJCAI.2023/625Markdown
[Siag et al. "Front-to-End Bidirectional Heuristic Search with Consistent Heuristics: Enumerating and Evaluating Algorithms and Bounds." International Joint Conference on Artificial Intelligence, 2023.](https://mlanthology.org/ijcai/2023/siag2023ijcai-front/) doi:10.24963/IJCAI.2023/625BibTeX
@inproceedings{siag2023ijcai-front,
title = {{Front-to-End Bidirectional Heuristic Search with Consistent Heuristics: Enumerating and Evaluating Algorithms and Bounds}},
author = {Siag, Lior and Shperberg, Shahaf S. and Felner, Ariel and Sturtevant, Nathan R.},
booktitle = {International Joint Conference on Artificial Intelligence},
year = {2023},
pages = {5631-5638},
doi = {10.24963/IJCAI.2023/625},
url = {https://mlanthology.org/ijcai/2023/siag2023ijcai-front/}
}