Abstract
An agent that interacts with a nondeterministic environment can often only partially observe the surroundings. This necessitates observations via sensors rendering more information about the current world state. Sensors can be expensive in many regards therefore it can be essential to minimize the amount of sensors an agents requires to solve given tasks. A limitation for sensor minimization is given by essential sensors which are always required to solve particular problems. In this paper we present an efficient algorithm which determines a set of necessary observation variables. More specifically, we develop a bottom-up algorithm which computes a set of variables which are always necessary to observe, in order to always reach a goal state. Our experimental results show that the knowledge about necessary observation variables can be used to minimize the number of sensors of an agent.
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.
Similar content being viewed by others
References
Mattmüller, R., Ortlieb, M., Wacker, E.: Minimizing necessary observations for nondeterministic planning. In: Lutz, C., Thielscher, M. (eds.) KI 2014. LNCS, vol. 8736, pp. 309–320. Springer, Heidelberg (2014)
Huang, W., Wen, Z., Jiang, Y., Wu, L.: Observation reduction for strong plans. In: Proc. 20th International Joint Conference on Artificial Intelligence (IJCAI 2007), pp. 1930–1935 (2007)
Huang, W., Wen, Z., Jiang, Y., Peng., H.: Structured plans and observation reduction for plans with contexts. In: Proc. 21st International Joint Conference on Artificial Intelligence (IJCAI 2009), pp. 1721–1727 (2009)
Cimatti, A., Pistore, M., Roveri, M., Traverso, P.: Weak, strong, and strong cyclic planning via symbolic model checking. Artificial Intelligence 147(1–2), 35–84 (2003)
Helmert, M., Domshlak, C.: LM-cut: Optimal planning with the landmark-cut heuristic. In: Seventh International Planning Competition (IPC 2011), pp. 103–105 (2011)
Helmert, M., Domshlak, C.: Landmarks, critical paths and abstraction: what’s the difference anyway? In: Proc. 21st International Joint Conference on Artificial Intelligence (IJCAI 2009), pp. 162–169 (2009)
Rintanen, J.: Complexity of planning with partial observability. In: Proc. 14th International Conference on Automated Planning and Scheduling (ICAPS 2004), pp. 345–354 (2004)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2015 Springer International Publishing Switzerland
About this paper
Cite this paper
Speck, D., Ortlieb, M., Mattmüller, R. (2015). Necessary Observations in Nondeterministic Planning. In: Hölldobler, S., , Peñaloza, R., Rudolph, S. (eds) KI 2015: Advances in Artificial Intelligence. KI 2015. Lecture Notes in Computer Science(), vol 9324. Springer, Cham. https://doi.org/10.1007/978-3-319-24489-1_14
Download citation
DOI: https://doi.org/10.1007/978-3-319-24489-1_14
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-24488-4
Online ISBN: 978-3-319-24489-1
eBook Packages: Computer ScienceComputer Science (R0)