Reviving partial order planning

IJCAI International Joint Conference on Artificial Intelligence

Volumn , Issue , 2001, Pages 459-464

  Nguyen, XuanLong ^a   Kambhampati, Subbarao ^a  

^a Arizona State University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DISJUNCTIVE CONSTRAINTS; DISTANCE-BASED; GRAPHPLAN; HEURISTIC CONTROL; PARTIAL ORDER PLANNING; PLAN SYNTHESIS; REACHABILITY ANALYSIS; STATE OF THE ART;

ARTIFICIAL INTELLIGENCE; PLANNING;

HEURISTIC ALGORITHMS;

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

References (27)

1. C. Backstrom. Computational aspects of reordering plans. JAIR. Vol. 9. pp. 99-137.
2. A. Blum and M.L. Furst. Fast planning through planning graph analysis. Artificial Intelligence. 90(1-2). 1997.
3. B. Bonet and H. Geffner. Planning as heuristic search: New results. In Proc. ECP-99, 1999.
4. T. Bylander. A Linear programming heuristic for optimal planning. In Proc. AAAI-97, 1997.
5. M. Fox and D. Long. Automatic inference of state invariants in TIM. JAIR. Vol. 9. 1998.
6. M. Ghallab and H. Laruelle. Representation and control in Ix-TeT. In Proc. AIPS-94, 1994.
7. A. Gerevini and L. Schubert. Inferring state constraints for domain-independent planning. In Proc. AAAI-98, 1998.
8. P. Haslum and H. Geffner. Admissible Heuristics for Optimal Planning. In Proc. AIPS-2000, 2000.
9. J. Hoffman and B. Nebel. The FF Planning System: Fast Plan Generation Through Heuristic Search. Submitted, 2000.
10. A. Johnson, P. Morris, N. Muscettola and K. Rajan. Planning in Interplanetary Space: Theory and Practice. In Proc. AIPS-2000.
11. D. Joslin and M. Pollack. Least-cost flaw repair: A plan refinement strategy for partial-order planning. In Proc. AAAI-94.
12. D. Joslin, M. Pollack. Passive and active decision postponement in plan generation. Proc. 3rd European Conf. on Planning. 1995.
13. A. Gerevini and L. Schubert. Accelerating partial-order planners: Some techniques for effective search control and pruning. JAIR, 5:95-137, 1996. (Pubitemid 126646166)
14. H. Kautz and B. Selman. Pushing the envelope: Planning, propositional logic and stochastic search. In Proc. AAAI-96.
15. S. Kambhampati, C. Knoblock and Q. Yang. Planning as Refinement Search: A unified framework for evaluating design tradeoffs in partial-order planning. In Artificial Intelligence, 1995.
16. S. Kambhampati and X. Yang. On the role of Disjunctive representations and Constraint Propagation in Refinement Planning In Proc. KR-96.
17. S. Kambhampati. Planning Graph as (dynamic) CSP: Exploiting EBL, DDB and other CSP Techniques in Graphplan. JAIR. Vol. 12. pp. 1-34. 2000.
18. D. Long and M. Fox. Efficient implementation of the plan graph in STAN. JAIR, 10(1-2) 1999.
19. D. McAllester and D. Rosenblitt. Systematic nonlinear planning. In Proc. AAAI-91.
20. D. McDermott. Using regression graphs to control search in planning. Artificial Intelligence, 109(1-2):111-160, 1999.
21. X. Nguyen and S. Kambhampati. Extracting effective and admissible state space heuristics from the planning graph. In Proc. AAAI-2000.
22. X. Nguyen, S. Kambhampati and R. Nigenda. Planning Graph as the Basis for deriving Heuristics for Plan Synthesis by State Space and CSP Search. To appear in Artificial Intelligence.
23. M. Peot and D. Smith. Threat-removal strategies for partial-order planning. In Proc. AAAI-93.
24. D. Smith and M. Peot. Suspending Recursion Causal-link Planning. In Proc. AIPS-96.
25. D. Smith, J. Frank and A. Jonsson. Bridging the gap between planning and scheduling. In Knowledge Engineering Review, 15(1):47-83. 2000.
26. D. Smith and D. Weld. Temporal planning with mutual exclusion reasoning. In Proc. IJCAI-99, 1999.
27. D. Weld. An introduction to least commitment planning. AI magazine, 1994.