Target-Value Search Revisited
Proceedings of the Twenty-Third International Joint Conference on Artificial Intelligence. Pages 601-606.
Abstract
This paper addresses the Target-Value Search (TVS) problem, which is the problem of finding a path between two nodes in a graph whose cost is as close as possible to a given target value, T. This problem has been previously addressed only for directed acyclic graphs. In this work we develop the theory required to solve this problem optimally for any type of graphs. We modify traditional heuristic search algorithms for this setting, and propose a novel bidirectional search algorithm that is specifically suited for TVS. The benefits of this bidirectional search algorithm are discussed both theoretically and experimentally on several domains.
@inproceedings{ijcai2013p96,
title = {Target-Value Search Revisited},
author = {Linares López, Carlos and Stern, Roni and Felner, Ariel},
booktitle = {Proceedings of the Twenty-Third International Joint Conference on
Artificial Intelligence, {IJCAI-13}},
publisher = {AAAI Press / International Joint Conferences on Artificial Intelligence},
editor = {Francesca Rossi},
pages = {601--606},
year = {2013},
month = {8},
url = {https://ijcai.org/proceedings/2013/96},
}
TY - CPAPER TI - Target-Value Search Revisited AU - Linares López, Carlos AU - Stern, Roni AU - Felner, Ariel T2 - Proceedings of the Twenty-Third International Joint Conference on Artificial Intelligence, IJCAI-13 PB - AAAI Press / International Joint Conferences on Artificial Intelligence PY - 2013 SP - 601 EP - 606 UR - https://ijcai.org/proceedings/2013/96 ER -Copied
Machine-readable versions of this paper, for tools and AI agents:
