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

EVENT:

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

 

description

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 

Automated Data Integration
Eric Huang, Author, Saigopal Nelaturi
27 October 2014
Conferences & Talks  

Global Competitiveness: The Role of Innovation and Productivity
Stephen Hoover, CEO, PARC
27 October 2014 | Toronto, Canada
Conferences & Talks  

The Internet of Everything
Stephen Hoover, CEO, PARC
28 October 2014 | Toronto, Canada
Conferences & Talks  

Open Forum: Cities and the Digital Frontier
Mike Steep
30 October 2014
George E. Pake Auditorium, PARC | Palo Alto, CA

Churchill Club