Add to ORKGIn this paper, 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 prob-lem, the goal is not necessarily to find paths with minimum length. We show that in most cases it is possible to decom-pose 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. 1
AbstractClassic heuristic search algorithms can find solutions that take the form of a simple path (...
In the classical binary search in a path the aim is to detect an unknown target by asking as few que...
Informed search algorithms such as A* use heuristics to focus exploration on states with low total p...
In this paper, we define a class of combinatorial search problems in which the objective is to find ...
This paper addresses the Target-Value Search (TVS) problem, which is the problem of finding a path b...
This paper addresses the Target-Value Search (TVS) problem, which is the problem of finding a path b...
In this paper, we consider how to improve the scalability and efficiency of target-value-path search...
Heuristic search is used to efficiently solve the single-node shortest path problem in weighted gra...
This paper presents a heuristic for guiding A* search for finding the shortest distance path between...
The main focus of this work is about a new special designed algorithm, called Cascading A * (CA*), t...
AbstractWe present a directed search algorithm, called K⁎, for finding the k shortest paths between ...
While heuristics based on geometric constructs of the networks would appear to improve performance o...
We propose shortest path algorithms that use A ∗ search in combination with a new graph-theoretic lo...
We study a new model of combinatorial group testing: the item to be found (a.k.a. the target) occupi...
We present a search algorithm, called K*, for finding the k shortest paths (KSP) between a designate...
AbstractClassic heuristic search algorithms can find solutions that take the form of a simple path (...
In the classical binary search in a path the aim is to detect an unknown target by asking as few que...
Informed search algorithms such as A* use heuristics to focus exploration on states with low total p...
In this paper, we define a class of combinatorial search problems in which the objective is to find ...
This paper addresses the Target-Value Search (TVS) problem, which is the problem of finding a path b...
This paper addresses the Target-Value Search (TVS) problem, which is the problem of finding a path b...
In this paper, we consider how to improve the scalability and efficiency of target-value-path search...
Heuristic search is used to efficiently solve the single-node shortest path problem in weighted gra...
This paper presents a heuristic for guiding A* search for finding the shortest distance path between...
The main focus of this work is about a new special designed algorithm, called Cascading A * (CA*), t...
AbstractWe present a directed search algorithm, called K⁎, for finding the k shortest paths between ...
While heuristics based on geometric constructs of the networks would appear to improve performance o...
We propose shortest path algorithms that use A ∗ search in combination with a new graph-theoretic lo...
We study a new model of combinatorial group testing: the item to be found (a.k.a. the target) occupi...
We present a search algorithm, called K*, for finding the k shortest paths (KSP) between a designate...
AbstractClassic heuristic search algorithms can find solutions that take the form of a simple path (...
In the classical binary search in a path the aim is to detect an unknown target by asking as few que...
Informed search algorithms such as A* use heuristics to focus exploration on states with low total p...