Skip to main content

A Knowledge and Probabilistic Based Task Planning Architecture for Service Robotics

  • Conference paper
  • First Online:
Advances in Soft Computing (MICAI 2019)

Abstract

Service robots have to face task diversity, large, uncertain and partially observable environments, which are inherent aspects of the domestic domain and increase the task planning problem’s complexity. Thus, in an attempt to overcome these challenges, in this work a task planning architecture for service robotics is proposed, which integrates a knowledge base approach with partially observable Markov decision processes (POMDP), and is constituted by three main components: (a) a knowledge base, (b) a POMDP construction module and (c) a task controller. Through a knowledge representation scheme, domain relevant information is exploited to define useful sub-regions in the planning search space. Once the search space is segmented, local POMDP policies are computed for each sub-region, then, a graph-based policy for the main task is built as a collection of these policies, for which the controller will determine the order in which they will be executed. Additionally, our architecture is able to integrate new functionalities as the robot is endowed with them. For evaluation purposes, a mobile robot navigation problem was used as case study to test our architecture, which shows the advantages of using domain specific knowledge in a task planning problem.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Cassandra, A.R.: Exact and approximate algorithms for partially observable Markov decision processes. Brown University (1998)

    Google Scholar 

  2. Foka, A., Trahanias, P.: Real-time hierarchical pomdps for autonomous robot navigation. Robot. Auton. Syst. 55(7), 561–571 (2007)

    Article  Google Scholar 

  3. Hansen, E.A., Zhou, R.: Synthesis of hierarchical finite-state controllers for POMDPs. In: International Conference on Automated Planning and Scheduling (2003)

    Google Scholar 

  4. Ji, S., Parr, R., Li, H., Liao, X., Carin, L.: Point-based policy iteration. In: AAAI, pp. 1243–1249 (2007)

    Google Scholar 

  5. Juba, B.: Integrated common sense learning and planning in POMDPs. J. Mach. Learn. Res. 17(1), 3276–3312 (2016)

    MathSciNet  MATH  Google Scholar 

  6. Kaelbling, L.P., Littman, M.L., Cassandra, A.R.: Planning and acting in partially observable stochastic domains. Artif. Intell. 101(1–2), 99–134 (1998)

    Article  MathSciNet  Google Scholar 

  7. Moritz, T., Beetz, M.: Representations for robot knowledge in the KnowRob framework. Artif. Intell. 247, 151–169 (2017)

    Article  MathSciNet  Google Scholar 

  8. Pineau, J., Gordon, G., Thrun, S.: Point-based value iteration: an anytime algorithm for POMDPs. In: International Joint Conference on Artificial Intelligence (IJCAI), vol. 3, pp. 1025–1032 (2003)

    Google Scholar 

  9. Pineau, J., Gordon, G.J.: POMDP planning for robust robot control. In: Thrun, S., Brooks, R., Durrant-Whyte, H. (eds.) Robotics Research. STAR, vol. 28, pp. 69–82. Springer, Heidelberg (2007). https://doi.org/10.1007/978-3-540-48113-3_7

    Chapter  Google Scholar 

  10. Pineau, J., Thrun, S.: An integrated approach to hierarchy and abstraction for POMDPs (2002)

    Google Scholar 

  11. Puterman, M.L.: Markov Decision Processes: Discrete Stochastic Dynamic Programming. Wiley Series in Probability and Statistics. Wiley, Hoboken (1994)

    Book  Google Scholar 

  12. Spaan, M.T., Vlassis, N.: Perseus: randomized point-based value iteration for POMDPs. J. Artif. Intell. Res. 24, 195–220 (2005)

    Article  Google Scholar 

  13. Sridharan, M., Gelfond, M., Zhang, S., Wyatt, J.: REBA: a refinement-based architecture for knowledge representation and reasoning in robotics (2018)

    Google Scholar 

  14. Theocharous, G., Mahadevan, S.: Hierarchical learning and planning in partially observable Markov decision processes. Ph.D. thesis, Michigan State University. Department of Computer Science & Engineering (2002)

    Google Scholar 

  15. Toussaint, M., Charlin, L., Pascal, P.: Hierarchical POMDP controller optimization by likelihood maximization. In: UAI (2008)

    Google Scholar 

  16. White, C.C.: A survey of solution techniques for the partially observed Markov decision process. Ann. Oper. Res. 32(1), 215–230 (1991)

    Article  MathSciNet  Google Scholar 

  17. Zaman, S., Haq, N.U., Gul, M.I., Habib, A.: Robotic navigation based on logic-based planning. In: 2017 International Conference on Communication, Computing and Digital Systems (C-CODE), pp. 396–401. IEEE (2017)

    Google Scholar 

Download references

Acknowledgments

Elizabeth Santiago thanks the postdoctoral fellowship support by CONACYT and also to the robotics laboratory of the National Institute of Astrophysics, Optical and Electronic which were important parts for the realization of this work.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Elizabeth Santiago .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2019 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Santiago, E., Serrano, S.A., Sucar, L.E. (2019). A Knowledge and Probabilistic Based Task Planning Architecture for Service Robotics. In: Martínez-Villaseñor, L., Batyrshin, I., Marín-Hernández, A. (eds) Advances in Soft Computing. MICAI 2019. Lecture Notes in Computer Science(), vol 11835. Springer, Cham. https://doi.org/10.1007/978-3-030-33749-0_52

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-33749-0_52

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-33748-3

  • Online ISBN: 978-3-030-33749-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics