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. A longer version of this work was accepted to IJCAI-2013 (Linares López et al. 2013)
| Original language | English |
|---|---|
| Pages | 216-217 |
| Number of pages | 2 |
| State | Published - 1 Dec 2013 |
| Event | 6th Annual Symposium on Combinatorial Search, SoCS 2013 - Leavenworth, WA, United States Duration: 11 Jul 2013 → 13 Jul 2013 |
Conference
| Conference | 6th Annual Symposium on Combinatorial Search, SoCS 2013 |
|---|---|
| Country/Territory | United States |
| City | Leavenworth, WA |
| Period | 11/07/13 → 13/07/13 |
ASJC Scopus subject areas
- Computer Networks and Communications