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 

Next Frontier of AI
Tolga Kurtoglu
3 May 2017 - 4 May 2017 | Istanbul, Turkey
Conferences & Talks  

Tutorial: Printing 3D Functional Objects and Devices
14 May 2017
Conferences & Talks  

Defining Your IoT Strategy: Executives as IoT Adoption Influencers (panel)
Markus Larsson, Speaker
17 May 2017 | Santa Clara, CA
Conferences & Talks  

Thinking About Security and Privacy with AI and ML (panel)
Raj Minhas, Moderator
17 May 2017 | Santa Clara, CA
Conferences & Talks