home › event - heuristic search for target-value path problem


Heuristic search for target-value path problem
Conferences & Talks

The First International Symposium on Search Techniques in Artificial Intelligence and Robotics

13 July 2008 - 14 July 2008
Chicago, Illinois, USA



We define a class of combinatorial search problems in which the objective is to find a set of paths in a graph whose elements’ value is as close as possible to some target value. Unlike the usual shortest path problem, the goal is not necessarily to find paths with minimum length. We show that in most cases it is possible to decompose the problem into components where heuristic search can be used. We demonstrate the benefits of this approach on a synthetic domain and illustrate an instantiation of the approach for a problem in model-based diagnosis.


upcoming events   view all 

The Experience When Business Meets Design
Brian Solis
27 October 2016
PARC Forum  

AI Case Studies: Pushing the Frontiers of Systems Engineering
Tolga Kurtoglu
9 November 2016 | San Francisco, CA
Conferences & Talks  

2016 AIChE Annual Meeting: Energy and Transport Processes
Corie L. Cobb
14 November 2016 - 15 November 2016 | San Francisco, CA
Conferences & Talks  

Printed Electronics USA 2016 - Visit PARC’s Booth #T20
Ross Bringans, Markus Larsson, Janos Veres
16 November 2016 - 17 November 2016 | Santa Clara, CA
Conferences & Talks