Abstract
Many planning and scheduling applications require the ability to deal with uncertainty. Often this uncertainty can be characterized in terms of probability distributions on the initial conditions and on the outcomes of actions. These distributions can be used to guide a planner towards the most likely plan for achieving the goals. This work is focused on developing domain-independent heuristics for probabilistic planning based on this information. The approach is to first search for a low cost deterministic plan using a classical planner. A novel plan graph cost heuristic is used to guide the search towards high probability plans. The resulting plans can be used in a system that handles unexpected outcomes by runtime replanning. The plans can also be incrementally augmented with contingency branches for the most critical action outcomes.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
A. Blum and J. Langford. Probabilistic Planning in the Graphplan Framework. In Proceedings of The 5th European Conference on Planning. Durham, UK, 1999.
A. Blum and M. Furst. Fast Planning Through Planning Graph Analysis. Artificial Intelligence, vol. 90, pp: 281-300, 1997.
B. Bonet and H. Geffner. Planning as Heuristic Search. Artificial Intelligence, vol. 129, pp: 5-33, 2001.
B. Bonet and R. Givan. International Probabilistic Planning Competition. http://www.ldc.usb.ve/~bonet/ipc5, 2006.
D. Bryce and D. E. Smith. Using Interaction to Compute Better Probability Estimates in Plan Graphs. In Proceedings of The ICAPS-06Workshop on Planning Under Uncertainty and Execution Control for Autonomous Systems. The English Lake District, Cumbria, UK, 2006.
F. Teichteil-Königsbuch and U. Kuter and G. Infantes. Incremental Plan Aggregation for Generating Policies in MDPs. In Proceedings of the 9th International Conference on Autonomous Agents and Multiagent Systems. Toronto, Canada, 2010.
H. L. S. Younes, M. L. Littman, D. Weissman and J. Asmuth. The First Probabilistic Track of the International Planning Competition. Journal of Artificial Intelligence Research, 24, pp: 841-887, 2005.
I. Little and S. Thiébaux. Concurrent Probabilistic Planning in the Graphplan Framework. In Proceedings of ICAPS-06 Workshop on Planning Under Uncertainty and Execution Control for Autonomous Systems. The English Lake District, Cumbria, UK, 2006.
I. Little and S. Thiébaux. Probabilistic Planning vs Replanning. In Proceedings of ICAPS-07 Workshop on Planning Competitions. Providence, Rhode Island, USA, 2007.
J. Baxter and P. L. Bartlett. Direct Gradient-Based Reinforcement Learning: I. Gradient Estimation Algorithms. Technical Report. Australian National University, 1999.
J. Hoffmann and B. Nebel. The FF Planning System: Fast Plan Generation Through Heuristic Search. Journal of Artificial Intelligence Research, 14, pp: 253-302, 2001.
O. Buffet and D. Bryce. International Probabilistic Planning Competition. http://ippc-2008.loria.fr/wiki/index.php/Main_Page, 2008.
O. Buffet and D. Aberdeen. The Factored Policy Gradient Planner. Proceedings of the 5th International Planning Competition. The English Lake District, Cumbria, UK, 2006.
S. Jimenez, A. Coles and A. Smith. Planning in Probabilistic Domains using a Deterministic Numeric Planner. Proceedings of the 25th Workshop of the UK Planning and Scheduling Special Interest Group. Nottingham, UK, 2006.
S. Yoon, A. Fern and R. Givan. FF-Replan: A Baseline for Probabilistic Planning. Proceedings of the 17th International Conference on Automated Planning and Scheduling. Providence, Rhode Island, USA, 2007.
S. Yoon, A. Fern, R. Givan and S. Kambhampati. Probabilistic Planning via Determinization in Hindsight. Proceedings of the 23rd AAAI Conference on Artificial Intelligence. Chicago, Illinois, USA, 2008.
S. Yoon, W. Ruml, J. Benton and M. B. Do. Improving Determinization in Hindsight for Online Probabilistic Planning. In Proceedings of the 20th International Conference on Automated Planning and Scheduling. Toronto, Canada, 2010.
Y. E-Martín, M. D. R-Moreno and B. Castaño. PIPSS*: a System based on Temporal Estimates. In Proceedings of the 30th Annual International Conference of the British Computer Society’s Specialist Group on Artificial Intelligence. Cambridge, UK, 2010.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag London Limited
About this paper
Cite this paper
E-Martín, Y., R-Moreno, M.D., Smith, D.E. (2011). Using a Plan Graph with Interaction Estimates for Probabilistic Planning. In: Bramer, M., Petridis, M., Nolle, L. (eds) Research and Development in Intelligent Systems XXVIII. SGAI 2011. Springer, London. https://doi.org/10.1007/978-1-4471-2318-7_4
Download citation
DOI: https://doi.org/10.1007/978-1-4471-2318-7_4
Published:
Publisher Name: Springer, London
Print ISBN: 978-1-4471-2317-0
Online ISBN: 978-1-4471-2318-7
eBook Packages: Computer ScienceComputer Science (R0)