Target-value search revisited (extended abstract)

Carlos Linares López, Roni Stern, Ariel Felner

Research output: Contribution to conferencePaperpeer-review

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 languageEnglish
Pages216-217
Number of pages2
StatePublished - 1 Dec 2013
Event6th Annual Symposium on Combinatorial Search, SoCS 2013 - Leavenworth, WA, United States
Duration: 11 Jul 201313 Jul 2013

Conference

Conference6th Annual Symposium on Combinatorial Search, SoCS 2013
Country/TerritoryUnited States
CityLeavenworth, WA
Period11/07/1313/07/13

Fingerprint

Dive into the research topics of 'Target-value search revisited (extended abstract)'. Together they form a unique fingerprint.

Cite this