Target-value search revisited

Authors:
Carlos Linares López;Roni Stern;Ariel Felner
Affiliations:
Planning and Learning Group, Universidad Carlos III de Madrid, Leganés, Madrid, Spain;SEAS, Harvard University, Cambridge, MA;Information Systems Engineering, Ben Gurion University, Beer-Sheva, Israel
Venue:
IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
Year:
2013

Citing 2
Cited 0

Depth-first iterative-deepening: an optimal admissible tree search

Artificial Intelligence
Searching with Pattern Databases

AI '96 Proceedings of the 11th Biennial Conference of the Canadian Society for Computational Studies of Intelligence on Advances in Artificial Intelligence

Quantified Score

Hi-index	0.00

Visualization

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.