New Results about LCGP,a Least Committed GraphPlan

Proceedings of the 5th International Conference on Artificial Intelligence Planning Systems, AIPS 2000

Volumn , Issue , 2000, Pages 273-282

  Cayrol, Michel ^a   Regnier, Pierre ^a   Vidal, Vincent ^a  

^a IRIT   (France)

Author keywords

[No Author keywords available]

Indexed keywords

CLASSICAL PLANNING; DOMAIN INDEPENDENTS; GRAPHPLAN; NEW RESULTS; OPTIMAL SEQUENTIAL; PERFORMANCE; PLANNING DOMAINS; STATE SPACE SEARCH; VALID PLAN;

EID: 0002670841     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (18)

1. Backstrom C. 1998. Computational aspects of reordering plans, in Journal of Artificial Intelligence Research 9:99-137.
2. Blum A. and Furst M. 1995. Fast planning through planning-graphs analysis. In Proceedings of the Fourteenth hzternational Joint Conference on Artificial bztelligence (IJCAI 95), 1636-1642.
3. Bonet B. and Geffner H. 1999. Planning as heuristic search: newresults. In Proceedingsof the bTfth European Conference on Planning (ECP’99).
4. Cayrol M.; Regnier P. and Vidal V. 2000. LCGP: une am6lioration de Graphplanpar relfi, chementde contraintes entre actions simultan6es. To appear in Actes du Congrbs de Reconnaissance des Formes et huelligence Artificielle (RFIA"2000).
5. Fox M. and Long D. 1998. The automatic inference of state invariants in TIM. In Journal of Artificial hzteHigence Research 9:367-421.
6. Fox Mand Long D. 1999. The detection and exploitation of symmetryin planning problems. In Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence (IJCAI’99), 956-96!.
7. Guard E. and Alami R. 1999. A possibilistic planner that deals with non-determinism and ctmtingency. In Proceedings of the Sixteenth hzternational Joint Conference on Artificial Intelligence fiJCAI’99), 996-1001.
8. KambhampatiS. 1999a. Improving Graphplan’s search with EBL& DDBtechniques. In Proceedings of the Sixteenth International Joint Cm!ferenccon Artificial hztelligence (IJCAI’99), 982-987.
9. Kambhampati S. 1999b. Planning-graph as (dynamic) CSP:Exploiting EBI,, DDBand other CSPTechniques in Graphplan. Toappear in Journal of Artificial huelhgence Research.
10. Kautz H. and Selman B. 1999. Unifying SAT-based and Graph-based Planning. In Proceedings of the Sixteenth beternational Joint Conferenceon Artificial hztelligence (IJCAI’99), 318-325.
11. Koehler J. 1998. Planning under resources constraints. In Proceedings of the Thirteenth European Conference on Artificial huelligence (ECAI’98), 489-493.
12. Koehler J.; Nebel B.; Iloffmann J. and DimopoolosY. 1997. Extending planning-graphs to an ADLsubset. In Proceedings of the Fourth European Conference on Planning (ECP’97). 273-285.
13. Long D. and Fox M. 1999. The efficient implementation of the plan-graph in STLMN. In Journal of Artificial huelligence Research 10:87-115.
14. Nebel B.; DimopoulosY. and Koehler J. 1997. Ignoring irrelevant facts and operators in plan generation. In Proceedings of the Fourth European Cot!ference on Planning (ECP’971,338-350.
15. R6gnier P. and Fade B. 1991. Completedetermination of parallel actions and temporaloptimization in linear plans of actions. In Proceedings of the EuropeanWorkshopon Planning (EWSP’91), 100-111.
16. Vidal V. 2000. Contribution h la planification par compilation de plans. Rapport IRIT 00/03-R, Universit6 Paul Sabatier, Toulouse, France.
17. Weld D.; Anderson C. and Smith D. 1998. Extending Graphplanto handle uncertainty and sensing actions. In Proceedings of the Fifteenth National Conference on Artificial hztelligence (AAAI’98),897-904.
18. ZimmermanT. and Kambhampati S. 1999. Exploiting symmetryin the planning-graph via explanation-guided search. In Proceedings of the Sixteenth National Conference on Artificial hzteiligence (AAAl’99), 605-611.