Landmark-based heuristic online contingent planning | Autonomous Agents and Multi-Agent Systems Skip to main content
Springer Nature Link
Log in

Landmark-based heuristic online contingent planning

  • Published:
Autonomous Agents and Multi-Agent Systems Aims and scope Submit manuscript

    We’re sorry, something doesn't seem to be working properly.

    Please try refreshing the page. If that doesn't work, please contact support so we can address the problem.

Abstract

In contingent planning problems, agents have partial information about their state and use sensing actions to learn the value of some variables. When sensing and actuation are separated, plans for such problems can often be viewed as a tree of sensing actions, separated by conformant plans consisting of non-sensing actions that enable the execution of the next sensing action. We propose a heuristic, online method for contingent planning which focuses on identifying the next useful sensing action. We select the next sensing action based on a landmark heuristic, adapted from classical planning. We discuss landmarks for plan trees, providing several alternative definitions and discussing their merits. The key part of our planner is the novel landmarks-based heuristic, together with a projection method that uses classical planning to solve the intermediate conformant planning problems. The resulting heuristic contingent planner solves many more problems than state-of-the-art, translation-based online contingent planners, and in most cases, much faster, up to 3 times faster on simple problems, and 200 times faster on non-simple domains.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
¥17,985 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price includes VAT (Japan)

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2

Similar content being viewed by others

Explore related subjects

Discover the latest articles, news and stories from top researchers in related subjects.

Notes

  1. One can define \(\exists \) knowledge landmarks, but as we explained above, these are of limited usefulness in our online planning case.

  2. The term complete is justified here only because we have assumed that action preconditions and goals are conjunctions of literals.

  3. This generalization was not implemented.

References

  1. Albore, A., Palacios, H., & Geffner, H. (2009). A translation-based approach to contingent planning. In: IJCAI, pp. 1623–1628.

  2. Bonet, B., & Geffner, H. (2000). Planning with incomplete information as heuristic search in belief space. In: Proceedings of AIPS’00, pp. 52–61.

  3. Bonet, B., & Geffner, H. (2011). Planning under partial observability by classical replanning: Theory and experiments. In: IJCAI, pp. 1936–1941.

  4. Brafman, R. I., & Shani, G. (2012). A multi-path compilation approach to contingent planning. In: AAAI.

  5. Brafman, R. I., & Shani, G. (2012). Replanning in domains with partial information and sensing actions. Journal of Artificial Intelligence Research (JAIR), 45, 565–600.

    Article  MathSciNet  MATH  Google Scholar 

  6. Brafman, R. I., & Shani, G. (2016). Online belief tracking using regression for contingent planning. Artificial Intelligence, 241, 131–152.

    Article  MathSciNet  MATH  Google Scholar 

  7. Bryce, D., Kambhampati, S., & Smith, D. E. (2006). Planning graph heuristics for belief space search. Journal of AI Research, 26, 35–99.

    MATH  Google Scholar 

  8. Heckerman, D., Horvitz, E., & Middleton, B. (1993). An approximate nonmyopic computation for value of information. IEEE Transactions on Pattern Analysis and Machine Intelligence, 15(3), 292–298.

    Article  Google Scholar 

  9. Helmert, M. (2006). The fast downward planning system. Journal of Artificial Intelligence Research, 26, 191–246.

    Article  MATH  Google Scholar 

  10. Hoffmann, J., & Nebel, B. (2001). The FF planning system: Fast plan generation through heuristic search. JAIR, 14, 253–302.

    Article  MATH  Google Scholar 

  11. Hoffmann, J., Porteous, J., & Sebastia, L. (2004). Ordered landmarks in planning. Journal of AI Research, 22, 215–278.

    MathSciNet  MATH  Google Scholar 

  12. Howard, R. A. (1960). Dynamic programming and Markov processes. Cambridge: MIT Press.

    MATH  Google Scholar 

  13. Karpas, E., & Domshlak, C. (2009). Cost-optimal planning with landmarks. In: IJCAI.

  14. Keyder, E., Richter, S., & Helmert, M. (2010). Sound and complete landmarks for and/or graphs. In: Proceedings of the European Conference on Artificial Intelligence (ECAI), pp. 335–340.

  15. Komarnitsky, R., & Shani, G. (2016). Computing contingent plans using online replanning. In: Proceedings of the Thirtieth AAAI Conference on Artificial Intelligence, February 12–17, 2016, Phoenix, Arizona, USA, pp. 3159–3165.

  16. Maliah, S., Brafman, R. I., Karpas, E., & Shani, G. (2014). Partially observable online contingent planning using landmark heuristics. In: Proceedings of the Twenty-Fourth International Conference on Automated Planning and Scheduling, ICAPS 2014, Portsmouth, New Hampshire, USA, June 21–26, 2014.

  17. Maliah, S., Shani, G., & Brafman, R. I. (2016). Online macro generation for privacy preserving planning. In: Proceedings of the Twenty-Sixth International Conference on Automated Planning and Scheduling, ICAPS 2016, London, UK, June 12–17, 2016, pp. 216–220.

  18. Newton, M. A. H. (2009). Wizard: Learning macro-actions comprehensively for planning. Ph.D. thesis, University of Strathclyde.

  19. Richter, S., & Westphal, M. (2010). The LAMA planner: Guiding cost-based anytime planning with landmarks. JAIR, 39, 127–177.

    Article  MATH  Google Scholar 

  20. Richter, S., & Westphal, M. (2010). The lama planner: Guiding cost-based anytime planning with landmarks. Journal of Artificial Intelligence Research, 39(1), 127–177.

    Article  MATH  Google Scholar 

  21. Rintanen, J., Heljanko, K., & Niemelä, I. (2006). Planning as satisfiability: Parallel plans and algorithms for plan search. Artificial Intelligence, 170(12–13), 1031–1080.

    Article  MathSciNet  MATH  Google Scholar 

  22. Shani, G., Brafman, R. I. (2011). Replanning in domains with partial information and sensing actions. In: IJCAI, pp. 2021–2026.

  23. Smith, T., & Simmons, R. (2004). Heuristic search value iteration for POMDPs. In: UAI 2004. Banff, Alberta.

  24. Speck, D., Ortlieb, M., & Mattmüller, R. (2015). Necessary observations in nondeterministic planning. In: KI 2015: Advances in Artificial Intelligence—38th Annual German Conference on AI, Dresden, Germany, September 21–25, 2015, Proceedings, pp. 181–193.

  25. To, S. T., Son, T. C., & Pontelli, E. (2015). A generic approach to planning in the presence of incomplete information: Theory and implementation. Artificial Intelligence, 227, 1–51.

    Article  MathSciNet  MATH  Google Scholar 

  26. To, S. T., Pontelli, E., & Son, T. C. (2009). A conformant planner with explicit disjunctive representation of belief states. In: ICAPS.

  27. Zhu, L., & Givan, R. (2003). Landmark extraction via planning graph propagation. In: ICAPS 2003 Doctoral Consortium, pp. 156–160.

Download references

Acknowledgements

We thank the reviewers for their useful comments. This work was supported by ISF Grant 933/13, by the Israel Ministry of Science and Technology Grant 54178, by the Helmsley Charitable Trust through the Agricultural, Biological and Cognitive Robotics Center of Ben-Gurion University of the Negev, and by the Lynn and William Frankel Center for Computer Science.

Author information

Authors and Affiliations

  1. Information Systems Engineering, Ben Gurion University of the Negev, Beer-Sheva, Israel

    Shlomi Maliah & Guy Shani

  2. Computer Science Department, Ben Gurion University of the Negev, Beer-Sheva, Israel

    Ronen I. Brafman

Authors
  1. Shlomi Maliah
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Guy Shani
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Ronen I. Brafman
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Guy Shani.

Additional information

Parts of this paper appeared in [16].

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Maliah, S., Shani, G. & Brafman, R.I. Landmark-based heuristic online contingent planning. Auton Agent Multi-Agent Syst 32, 602–634 (2018). https://doi.org/10.1007/s10458-018-9389-9

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10458-018-9389-9

Keywords

Search

Navigation