Results 1 - 10 of 70,766

Planning as heuristic search,

by Blai Bonet , Héctor Geffner - 5 – 33, ISSN , 2001
"... Abstract In the AIPS98 Planning Contest, the HSP planner showed that heuristic search planners can be competitive with state-of-the-art Graphplan and SAT planners. Heuristic search planners like HSP transform planning problems into problems of heuristic search by automatically extracting heuristics ..."
Abstract - Cited by 421 (33 self) - Add to MetaCart
Abstract In the AIPS98 Planning Contest, the HSP planner showed that heuristic search planners can be competitive with state-of-the-art Graphplan and SAT planners. Heuristic search planners like HSP transform planning problems into problems of heuristic search by automatically extracting

Heuristic Search

by Stefan Edelkamp, Shahid Jabbar, Fachbereich Informatik, Alberto Lluch Lafuente , 2011
"... Heuristic search is used to efficiently solve the single-node shortest path problem in weighted graphs. In practice, however, one is not only interested in finding a short path, but an optimal path, according to a certain cost notion. We propose an algebraic formalism that captures many cost notions ..."
Abstract - Cited by 46 (24 self) - Add to MetaCart
Heuristic search is used to efficiently solve the single-node shortest path problem in weighted graphs. In practice, however, one is not only interested in finding a short path, but an optimal path, according to a certain cost notion. We propose an algebraic formalism that captures many cost

The FF planning system: Fast plan generation through heuristic search

by Jörg Hoffmann, Bernhard Nebel - Journal of Artificial Intelligence Research , 2001
"... We describe and evaluate the algorithmic techniques that are used in the FF planning system. Like the HSP system, FF relies on forward state space search, using a heuristic that estimates goal distances by ignoring delete lists. Unlike HSP's heuristic, our method does not assume facts to be ind ..."
Abstract - Cited by 830 (55 self) - Add to MetaCart
We describe and evaluate the algorithmic techniques that are used in the FF planning system. Like the HSP system, FF relies on forward state space search, using a heuristic that estimates goal distances by ignoring delete lists. Unlike HSP's heuristic, our method does not assume facts

Planning as Heuristic Search: New Results

by Blai Bonet, Héctor Geffner - IN PROCEEDINGS OF ECP-99 , 1999
"... In the recent AIPS98 Planning Competition, the hsp planner, based on a forward state search and a domain-independent heuristic, showed that heuristic search planners can be competitive with state of the art Graphplan and Satisfiability planners. hsp solved more problems than the other planners b ..."
Abstract - Cited by 200 (14 self) - Add to MetaCart
In the recent AIPS98 Planning Competition, the hsp planner, based on a forward state search and a domain-independent heuristic, showed that heuristic search planners can be competitive with state of the art Graphplan and Satisfiability planners. hsp solved more problems than the other planners

Breadth-first heuristic search

by Rong Zhou, Eric A. Hansen - Artificial Intelligence
"... Recent work shows that the memory requirements of bestfirst heuristic search can be reduced substantially by using a divide-and-conquer method of solution reconstruction. We show that memory requirements can be reduced even further by using a breadth-first instead of a best-first search strategy. We ..."
Abstract - Cited by 55 (11 self) - Add to MetaCart
Recent work shows that the memory requirements of bestfirst heuristic search can be reduced substantially by using a divide-and-conquer method of solution reconstruction. We show that memory requirements can be reduced even further by using a breadth-first instead of a best-first search strategy

Anytime heuristic search

by Eric A. Hansen, Rong Zhou - Journal of Artificial Intelligence Research (JAIR , 2007
"... We describe how to convert the heuristic search algorithm A * into an anytime algorithm that finds a sequence of improved solutions and eventually converges to an optimal solution. The approach we adopt uses weighted heuristic search to find an approximate solution quickly, and then continues the we ..."
Abstract - Cited by 62 (3 self) - Add to MetaCart
We describe how to convert the heuristic search algorithm A * into an anytime algorithm that finds a sequence of improved solutions and eventually converges to an optimal solution. The approach we adopt uses weighted heuristic search to find an approximate solution quickly, and then continues

Bidirectional Heuristic Search Reconsidered

by Hermann Kaindl, Gerhard Kainz - Journal of Artificial Intelligence Research , 1997
"... The assessment of bidirectional heuristic search has been incorrect since it was first published more than a quarter of a century ago. For quite a long time, this search strategy did not achieve the expected results, and there was a major misunderstanding about the reasons behind it. Although there ..."
Abstract - Cited by 42 (3 self) - Add to MetaCart
The assessment of bidirectional heuristic search has been incorrect since it was first published more than a quarter of a century ago. For quite a long time, this search strategy did not achieve the expected results, and there was a major misunderstanding about the reasons behind it. Although

Heuristic Search-Based Replanning

by Sven Koenig, et al. , 2002
"... Many real-world planning problems require one to solve a series of similar planning tasks. In this case, replanning can be much faster than planning from scratch. In this paper, we introduce a novel replanning method for symbolic planning with heuristic search-based planners, currently the most popu ..."
Abstract - Cited by 25 (5 self) - Add to MetaCart
Many real-world planning problems require one to solve a series of similar planning tasks. In this case, replanning can be much faster than planning from scratch. In this paper, we introduce a novel replanning method for symbolic planning with heuristic search-based planners, currently the most

Planning as Heuristic Search

by Frank Hutter, Technische Universitat Darmstadt, Fachbereich Informatik , 2001
"... As shown by the heuristic search planners HSP and FF, heuristic search is a competitive approach in planning. Generating totalordered non-optimal plans, the strength of heuristic search planners is due to their speed: whereas optimal planners are bound to expand every node with estimated costs l ..."
Abstract - Add to MetaCart
As shown by the heuristic search planners HSP and FF, heuristic search is a competitive approach in planning. Generating totalordered non-optimal plans, the strength of heuristic search planners is due to their speed: whereas optimal planners are bound to expand every node with estimated costs

Planning with Incomplete Information as Heuristic Search in Belief Space

by Blai Bonet, Hector Geffner , 2000
"... The formulation of planning as heuristic search with heuristics derived from problem representations has turned out to be a fruitful approach for classical planning. In this paper, we pursue a similar idea in the context planning with incomplete information. Planning with incomplete information ..."
Abstract - Cited by 225 (34 self) - Add to MetaCart
The formulation of planning as heuristic search with heuristics derived from problem representations has turned out to be a fruitful approach for classical planning. In this paper, we pursue a similar idea in the context planning with incomplete information. Planning with incomplete
Results 1 - 10 of 70,766