COST-OPTIMAL STRONG PLANNING IN NON-DETERMINISTIC DOMAINS

Giuseppe Della Penna, Fabio Mercorio, Benedetto Intrigila, Daniele Magazzeni, Enrico Tronci

2011

Abstract

Many real world domains present a non-deterministic behaviour, mostly due to unpredictable environmental conditions. In this context, strong planning, i.e., finding a plan which is guaranteed to achieve the goal regardless of non-determinism, is a significant research challenge for both the planning and the control communities. In particular, the problem of cost-optimal strong planning has not been addressed so far. In this paper we provide a formal description of the cost-optimal strong planning problem in non-deterministic finite state systems, present an algorithm to solve it with good complexity bounds and formally prove the correctness and completeness of the proposed algorithm. Furthermore, we present experimental results showing the effectiveness of the proposed approach on a meaningful case study.

References

  1. Albore, A., Palacios, H., and Geffner, H. (2010). Compiling uncertainty away in non-deterministic conformant planning. In ECAI, pages 465-470.
  2. Behrends, E. (2000). Vieweg.
  3. Bertoli, P., Cimatti, A., Roveri, M., and Traverso, P. (2001). Planning in nondeterministic domains under partial observability via symbolic model checking. In Proc. 17th IJCAI, pages 473-478. Morgan Kaufmann.
  4. Bertoli, P., Cimatti, A., Roveri, M., and Traverso, P. (2006). Strong planning under partial observability. Artif. Intell., 170:337-384.
  5. Bonet, B. and Geffner, H. (2000). Planning with incomplete information as heuristic search in belief space. In Chien, S., Kambhampati, S., and Knoblock, C., editors, Proc. 6th ICAPS, pages 52-61. AAAI Press.
  6. Bonet, B. and Geffner, H. (2005). mGPT: A probabilistic planner based on heuristic search. JAIR, 24:933-944.
  7. Boutilier, C., Dean, T., and Hanks, S. (1999). Decisiontheoretic planning: Structural assumptions and computational leverage. JAIR, 11:1-94.
  8. Burch, J. R., Clarke, E. M., McMillan, K. L., Dill, D. L., and Hwang, L. J. (1992). Symbolic model checking: 1020 states and beyond. Inf. Comput., 98(2):142-170.
  9. Chesi, G. and Hung, Y. (2007). Global path-planning for constrained and optimal visual servoing. IEEE Trans. on Robotics, 23(5):1050-1060.
  10. Cimatti, A., Roveri, M., and Traverso, P. (1998). Strong planning in non-deterministic domains via model checking. In AIPS, pages 36-43.
  11. Della Penna, G., Intrigila, B., Lauri, N., and Magazzeni, D. (2009a). Fast and compact encoding of numerical controllers using obdds. In Informatics in Control, Automation and Robotics: Selected Papers from ICINCO 2008, pages 75-87. Springer.
  12. Della Penna, G., Intrigila, B., Magazzeni, D., and Mercorio, F. (2009b). UPMurphi: a tool for universal planning on PDDL+ problems. In Proc. ICAPS 2009, pages 106-113. AAAI Press.
  13. Della Penna, G., Intrigila, B., Magazzeni, D., and Mercorio, F. (2010). Non-deterministic inverted pendulum on a cart data set.
  14. Della Penna, G., Intrigila, B., Melatti, I., Tronci, E., and Venturini Zilli, M. (2004). Exploiting transition locality in automatic verification of finite state concurrent systems. STTT, 6(4):320-341.
  15. Della Penna, G., Intrigila, B., Melatti, I., Tronci, E., and Zilli, M. V. (2006). Finite horizon analysis of markov chains with the murphi verifier. STTT, 8(4-5):397- 409.
  16. Fudenberg, D. and Tirole, J. (1991). Game theory. MIT Press.
  17. Huang, W., Wen, Z., Jiang, Y., and Wu, L. (2007). Observation reduction for strong plans. In Proc. 20th IJCAI, pages 1930-1935. Morgan Kaufmann.
  18. Ilcev, S. D. (2009). Antenna systems for mobile satellite applications. In Microwave Telecommunication Technology, 2009. CriMiCo 2009. 19th International Crimean Conference, pages 393 -398.
  19. Kwiatkowska, M. Z., Norman, G., and Parker, D. (2004). Probabilistic symbolic model checking with prism: a hybrid approach. STTT, 6(2):128-142.
  20. Mausam, M., Bertoli, P., and Weld, D. S. (2007). A hybridized planner for stochastic domains. In Proc. 20th IJCAI, pages 1972-1978. Morgan Kaufmann.
  21. Mausam, M. and Weld, D. S. (2008). Planning with durative actions in stochastic domains. JAIR, 31:33-82.
  22. Meuleau, N., Benazera, E., Brafman, R. I., Hansen, E. A., and Mausam, M. (2009). A heuristic search approach to planning with continuous resources in stochastic domains. J. Artif. Int. Res., 34:27-59.
  23. Schoppers, M. (1987). Universal plans of reactive robots in unpredictable environments. In Proc. IJCAI 1987.
  24. Yokoi, K., Kanehiro, F., Kaneko, K., Fujiwara, K., Kajita, S., and Hirukawa, H. (2003). Experimental study of biped locomotion of humanoid robot hrp-1s. In Experimental Robotics VIII, volume 5 of Springer Tracts in Advanced Robotics, pages 75-84. Springer.
  25. Yoon, S. W., Fern, A., and Givan, R. (2002). Inductive policy selection for first-order MDPs. In UAI, pages 568-576.
Download


Paper Citation


in Harvard Style

Della Penna G., Mercorio F., Intrigila B., Magazzeni D. and Tronci E. (2011). COST-OPTIMAL STRONG PLANNING IN NON-DETERMINISTIC DOMAINS . In Proceedings of the 8th International Conference on Informatics in Control, Automation and Robotics - Volume 1: ICINCO, ISBN 978-989-8425-74-4, pages 56-66. DOI: 10.5220/0003448200560066


in Bibtex Style

@conference{icinco11,
author={Giuseppe Della Penna and Fabio Mercorio and Benedetto Intrigila and Daniele Magazzeni and Enrico Tronci},
title={COST-OPTIMAL STRONG PLANNING IN NON-DETERMINISTIC DOMAINS},
booktitle={Proceedings of the 8th International Conference on Informatics in Control, Automation and Robotics - Volume 1: ICINCO,},
year={2011},
pages={56-66},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0003448200560066},
isbn={978-989-8425-74-4},
}


in EndNote Style

TY - CONF
JO - Proceedings of the 8th International Conference on Informatics in Control, Automation and Robotics - Volume 1: ICINCO,
TI - COST-OPTIMAL STRONG PLANNING IN NON-DETERMINISTIC DOMAINS
SN - 978-989-8425-74-4
AU - Della Penna G.
AU - Mercorio F.
AU - Intrigila B.
AU - Magazzeni D.
AU - Tronci E.
PY - 2011
SP - 56
EP - 66
DO - 10.5220/0003448200560066