Research Proposal in Probabilistic Planning Search

Yazmin S. Villegas-Hernandez, Federico Guedea-Elizalde

2014

Abstract

In planning search, there are different approaches to guide the search, where all of them are focused in have a plan (solution) in less time. Most of the researches are not admissible heuristics, but they have good results in time. For example, using the heuristic-search planning approach plans can be generated in less time than other approaches, but the plans generated by all heuristic planners are sub-optimal, or could have dead ends (states from which the goals get unreachable). We present an approach to guide the search in a probabilistic way in order to do not have the problems of the not admissible approaches. We extended the Bayesian network and Bayesian inferences ideas to our work. Furthermore, we present our way to make Bayesian inferences in order to guide the search in a better way. The results of our experiments of our approach with different well-known benchmarks are presented. The benchmarks used in our experiments are: Driverlog, Zenotravel, Satellite, Rovers, and Freecell.

References

  1. Blum, A. L. and Furst, M. L. (1997). through planning graph analysis. gence, 90(1):281-300.
  2. Bonet, B. and Geffner, H. (2001). Planning as heuristic search. Artificial Intelligence, 129(1):5-33.
  3. Bonet, B. and Geffner, H. (2011). mgpt: A probabilistic planner based on heuristic search. arXiv preprint arXiv:1109.2153.
  4. Ernst, M. D., Millstein, T. D., and Weld, D. S. (1997). Automatic sat-compilation of planning problems. In IJCAI, volume 97, pages 1169-1176. Citeseer.
  5. Fikes, R. E. and Nilsson, N. J. (1994). Strips, a retrospective. Artificial intelligence in perspective, 227.
  6. Fox, M. and Long, D. (2003). Pddl2. 1: An extension to pddl for expressing temporal planning domains. J. Artif. Intell. Res.(JAIR), 20:61-124.
  7. Fox, M. and Long, D. (2011). Efficient implementation of the plan graph in stan. arXiv preprint arXiv:1105.5457.
  8. Geffner, H. (2011). Planning with incomplete information. In Model Checking and Artificial Intelligence, pages 1-11. Springer.
  9. Genesereth, M. and Nourbakhsh, I. (1993). Time-saving tips for problem solving with incomplete information. In Proceedings of the 11th National Conference on Artificial Intelligence.
  10. Gerevini, A., Saetti, A., and Serina, I. (2003). Planning through stochastic local search and temporal action graphs in lpg. J. Artif. Intell. Res.(JAIR), 20:239-290.
  11. Hoffmann, J. and Nebel, B. (2011). The ff planning system: Fast plan generation through heuristic search. arXiv preprint arXiv:1106.0675.
  12. Kautz, H. (2004). Satplan04: Planning as satisfiability. Working Notes on the Fourth International Planning Competition (IPC-2004), pages 44-45.
  13. Kautz, H. and Selman, B. (1999). Unifying sat-based and graph-based planning. In IJCAI, volume 99, pages 318-325.
  14. Kautz, H. A., Selman, B., et al. (1992). Planning as satisfiability. In ECAI, volume 92, pages 359-363.
  15. Koehler, J. (1999). Handling of conditional effects and negative goals in ipp.
  16. Morawski, P. (1989). Understanding bayesian belief networks. AI Expert, 4(5):44-48.
  17. Nilsson, N. J. (2010). The quest for artificial intelligence. Cambridge University Press Cambridge.
  18. O'Hagan, A., Forster, J., and Kendall, M. G. (2004). Bayesian inference. Arnold London.
  19. Russell, S. (2009). Artificial intelligence: A modern approach.
  20. Vector, D. (2003). Routing. Perkins, E. Royer.
  21. Weld, D. S., Anderson, C. R., and Smith, D. E. (1998). Extending graphplan to handle uncertainty & sensing actions. In Aaai/iaai, pages 897-904.
Download


Paper Citation


in Harvard Style

S. Villegas-Hernandez Y. and Guedea-Elizalde F. (2014). Research Proposal in Probabilistic Planning Search . In Proceedings of the 6th International Conference on Agents and Artificial Intelligence - Volume 1: ICAART, ISBN 978-989-758-015-4, pages 586-595. DOI: 10.5220/0004907205860595


in Bibtex Style

@conference{icaart14,
author={Yazmin S. Villegas-Hernandez and Federico Guedea-Elizalde},
title={Research Proposal in Probabilistic Planning Search},
booktitle={Proceedings of the 6th International Conference on Agents and Artificial Intelligence - Volume 1: ICAART,},
year={2014},
pages={586-595},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0004907205860595},
isbn={978-989-758-015-4},
}


in EndNote Style

TY - CONF
JO - Proceedings of the 6th International Conference on Agents and Artificial Intelligence - Volume 1: ICAART,
TI - Research Proposal in Probabilistic Planning Search
SN - 978-989-758-015-4
AU - S. Villegas-Hernandez Y.
AU - Guedea-Elizalde F.
PY - 2014
SP - 586
EP - 595
DO - 10.5220/0004907205860595