Probabilistic planning in the graphplan framework

Lecture Notes in Artificial Intelligence (Subseries of Lecture Notes in Computer Science)

Volumn 1809, Issue , 2000, Pages 319-332

  Blum, Avrim L ^a   Langford, John C ^a  

^a Carnegie Mellon University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

PLANNING;

BACKWARD CHAINING; FINITE HORIZONS; GRAPHPLAN; GRAPHPLAN ALGORITHM; OPTIMAL POLICIES; PLANNING ALGORITHMS; PROBABILISTIC PLANNING; PROBABILITY OF SUCCESS;

ALGORITHMS;

EID: 84943242075     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/10720246_25     Document Type: Conference Paper

References (19)

1. C.R.Anderson, D.E.Smith, and D.S.Weld.Conditional eects in Graphplan.unpublished manuscript, 1997.
2. C.Boutilier, R.I.Brafman, and C.Geib.Structured reachability analysis for Markov Decision Processes.In Proceedings of the Fourteenth Annual Conference on Uncertainty in Artificial Intelligence (UAI-98), pages 24-32, 1998.
3. C.Boutilier, R.Dearden, and M.Goldszmidt.Exploiting structure in policy construction.In IJCAI95, pages 1104-1111, Montreal, 1995.
4. A.Blum and M.Furst.Fast planning through planning graph analysis.Artificial Intelligence, 90:281-300, 1997.
5. T.Bylander.Linear programming heuristic for optimal planning.In Pro-ceedings of the Fourteenth National Conference on Artificial Intelligence, 1997.
6. D.Draper, S.Hanks, and D.Weld.Probabilistic planning with information gathering and contingent execution.In Proceedings of the 2nd Internatio-nal Conference on Artificial Intelligence Planning Systems, pages 31-37, 1994.
7. T.Dean, L.P.Kaelbling, J.Kirman, and A.Nicholson.Planning under time constraints in stochastic domains.Artificial Intelligence, 76, 1995.
8. B.C.Gazen and C.A.Knoblock.Combining the expressiveness of UCPOP with the eciency of Graphplan.In Proceedings of the Fourth European Conference on Planning, 1997.
9. N.Kushmerick, S.Hanks, and D.Weld.An algorithm for probabilistic planning.Artificial Intelligence, 76:239-286, 1995.
10. S.Kambhampati, E.Lambrecht, and E.Parker.Understanding and ex-tending Graphplan.In Proceedings of the Fourth European Conference on Planning, September 1997.
11. J.Koehler, B.Nebel, J.Homan, and Y.Dimopoulos.Extending plan-ning graphs to an ADL subset.In Proceedings of the Fourth European Conference on Planning, September 1997.
12. C.Knoblock.Automatically generating abstractions for planning.Artifi-cial Intelligence, 68(2):243-302, 1994.
13. S.Kambhampati and E.Parker.Making graphplan goal-directed.In ECP99, September 1999.
14. H.Kautz and B.Selman.Unifying SAT-based and graph-based planning.In IJCAI99, 1999.
15. S.M.Majercik and M.L.Littman.MAXPLAN: A new approach to pro-babilistic planning.In AIPS, pages 86-93, 1998.
16. S.M.Majercik and M.L.Littman.Contingent planning under uncertainty via stochastic satisfiability.In AAAI, 1999.
17. B.Nebel, Y.Dimopoulos, and J.Koehler.Ignoring irrelevant facts and operations in plan generation.In Proceedings of the Fourth European Conference on Planning, pages 338-350, September 1997.
18. D.E.Smith and D.S.Weld.Conformant graphplan.In AAAI98, 1998.
19. D.S.Weld, C.R Anderson, and D.E.Smith.Extending graphplan to handle uncertainty and sensing actions.In AAAI98, 1998.