Sciweavers

317 search results - page 3 / 64
» Improving Planning Performance Using Low-Conflict Relaxed Pl...
Sort
View
ATAL
2000
Springer
15 years 2 months ago
Performance of Coordinating Concurrent Hierarchical Planning Agents Using Summary Information
Abstract. Recent research has provided methods for coordinating the individually formed concurrent hierarchical plans (CHiPs) of a group of agents in a shared environment. A reason...
Bradley J. Clement, Edmund H. Durfee
AIPS
2000
14 years 12 months ago
New Results about LCGP, a Least Committed GraphPlan
Planners from the family of Graphplan (Graphplan, IPP, STAN...) are presently considered as the most efficient ones on numerous planning domains. Their partially ordered plans can...
Michel Cayrol, Pierre Régnier, Vincent Vida...
AIPS
2008
15 years 27 days ago
A Compact and Efficient SAT Encoding for Planning
In the planning-as-SAT paradigm there have been numerous recent developments towards improving the speed and scalability of planning at the cost of finding a step-optimal parallel...
Nathan Robinson, Charles Gretton, Duc Nghia Pham, ...
AIPS
2004
14 years 12 months ago
A Lookahead Strategy for Heuristic Search Planning
The planning as heuristic search framework, initiated by the planners ASP from Bonet, Loerincs and Geffner, and HSP from Bonet and Geffner, lead to some of the most performant pla...
Vincent Vidal
CP
2010
Springer
14 years 9 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