Sciweavers

703 search results - page 4 / 141
» Using Cases Utility for Heuristic Planning Improvement
Sort
View
CP
2010
Springer
13 years 4 months ago
Heuristics for Planning with SAT
Generic SAT solvers have been very successful in solving hard combinatorial problems in various application areas, including AI planning. There is potential for improved performanc...
Jussi Rintanen
CP
2007
Springer
13 years 12 months ago
An LP-Based Heuristic for Optimal Planning
Abstract. One of the most successful approaches in automated planning is to use heuristic state-space search. A popular heuristic that is used by a number of state-space planners i...
Menkes van den Briel, J. Benton, Subbarao Kambhamp...
AIPS
2010
13 years 8 months ago
The Joy of Forgetting: Faster Anytime Search via Restarting
Anytime search algorithms solve optimisation problems by quickly finding a usually suboptimal solution and then finding improved solutions when given additional time. To deliver a...
Silvia Richter, Jordan Tyler Thayer, Wheeler Ruml
IJCAI
2007
13 years 7 months ago
Transferring Learned Control-Knowledge between Planners
As any other problem solving task that employs search, AI Planning needs heuristics to efficiently guide the problem-space exploration. Machine learning (ML) provides several tec...
Susana Fernández, Ricardo Aler, Daniel Borr...
FLAIRS
2004
13 years 7 months ago
Mixed-Initiative Case Replay
Mixed-initiative case replay introduces an active human into the case-based planning process. The goals of this novel technique are to utilize the strengths of machine-based case ...
Michael T. Cox