Sciweavers

87 search results - page 3 / 18
» Generating Parallel Execution Plans with a Partial-order Pla...
Sort
View
CONCUR
1999
Springer
13 years 11 months ago
Partial Order Reduction for Model Checking of Timed Automata
Abstract. The paper presents a partial order reduction method applicable to networks of timed automata. The advantage of the method is that it reduces both the number of explored c...
Marius Minea
AAAI
1996
13 years 8 months ago
Is "Early Commitment" in Plan Generation Ever a Good Idea?
Partial-Order Causal Link planners typically take a "least-commitment" approach to some decisions (notably, step ordering), postponing those decisions until constraints ...
David Joslin, Martha E. Pollack
AAAI
2004
13 years 9 months ago
Branching and Pruning: An Optimal Temporal POCL Planner Based on Constraint Programming
A key feature of modern optimal planners such as Graphplan and Blackbox is their ability to prune large parts of the search space. Previous Partial Order Causal Link (POCL) planne...
Vincent Vidal, Hector Geffner
AIPS
2000
13 years 8 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...
CORR
2011
Springer
142views Education» more  CORR 2011»
12 years 11 months ago
Taming Numbers and Durations in the Model Checking Integrated Planning System
The Model Checking Integrated Planning System (MIPS) has shown distinguished performance in the second and third international planning competitions. With its object-oriented fram...
Stefan Edelkamp