Least commitment in Graphplan

Artificial Intelligence

Volumn 130, Issue 1, 2001, Pages 85-118

  Cayrol, Michel ^a   Régnier, Pierre ^a   Vidal, Vincent ^a  

^a IRIT   (France)

Author keywords

Authorization property; Independence property; Least commitment; Planning; Planning graph

Indexed keywords

GRAPH THEORY; PROBLEM SOLVING;

GRAPHPLAN;

ARTIFICIAL INTELLIGENCE;

EID: 0035399767     PISSN: 00043702     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0004-3702(01)00082-0     Document Type: Article

References (24)

1. Computational aspects of reordering plans
2. Fast planning through planning-graphs analysis
3. Fast planning through planning-graphs analysis
4. LCGP: Une amélioration de Graphplan par relâchement de contraintes entre actions simultanées
5. New results about LCGP, a Least Committed GraphPlan
6. Encoding planning problems in nonmonotonic logic programs
7. The automatic inference of state invariants in TIM
8. The detection and exploitation of symmetry in planning problems
9. A possibilistic planner that deals with non-determinism and contingency
10. Improving Graphplan's search with EBL & DDB techniques
11. Planning graph as a (dynamic) CSP: Exploiting EBL, DDB and other CSP techniques in Graphplan
12. Distance-based goal-ordering heuristics for Graphplan
13. Unifying SAT-based and Graph-based planning
14. Planning under resources constraints
15. Extending planning-graphs to an ADL subset
16. The efficient implementation of the plan-graph in STAN
17. Dynamic constraint satisfaction problems
18. Ignoring irrelevant facts and operators in plan generation
19. Complete determination of parallel actions and temporal optimization in linear plans of actions
20. A planning algorithm not based on directional search
21. Temporal planning with mutual exclusion reasoning
22. Extending Graphplan to handle uncertainty and sensing actions
23. Exploiting symmetry in the planning-graph via explanation-guided search