Skip to main content

Reactive Maintenance Policies over Equalized States in Dynamic Environments

  • Conference paper
  • First Online:
Progress in Artificial Intelligence (EPIA 2017)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 10423))

Included in the following conference series:

  • 2897 Accesses

Abstract

We address the problem of representing and verifying the behavior of an agent following a policy in dynamic environments. Our focus is on policies that yield sequences of actions, according to the present knowledge in the state, with the aim of reaching some main goal. We distinguish certain cases where the dynamic nature of the environment may require the agent to stop and revise its next actions. We employ the notion of maintenance to check whether a given policy can maintain the conditions of the main goal, given a respite from environment actions. Furthermore, we apply state clustering to mitigate the large state spaces caused by having irrelevant information in the states, and under some conditions this clustering might change the worst-case complexity. By preserving the behavior of the policy, it helps in checking for maintenance with a guarantee that the result also holds in the original system.

This work has been supported by Austrian Science Fund (FWF) project W1255-N23, and Zeynep G. Saribatur’s visit to ASU was supported by the Austrian Marshall Plan Foundation.

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

Access this chapter

Institutional subscriptions

Similar content being viewed by others

References

  1. Balcázar, J.L.: The complexity of searching implicit graphs. AIJ 86(1), 171–188 (1996)

    MathSciNet  Google Scholar 

  2. Banihashemi, B., De Giacomo, G., Lespérance, Y.: Abstraction in situation calculus action theories. In: Proceedings of AAAI, pp. 1048–1055 (2017)

    Google Scholar 

  3. Baral, C., Eiter, T., Bjäreland, M., Nakamura, M.: Maintenance goals of agents in a dynamic environment: formulation and policy construction. AIJ 172(12), 1429–1469 (2008)

    MathSciNet  MATH  Google Scholar 

  4. Behnke, G., Höller, D., Biundo, S.: On the complexity of HTN plan verification and its implications for plan recognition. In: Proceedings of ICAPS, pp. 25–33 (2015)

    Google Scholar 

  5. Blount, J., Gelfond, M., Balduccini, M.: A theory of intentions for intelligent agents. In: Calimeri, F., Ianni, G., Truszczynski, M. (eds.) LPNMR 2015. LNCS, vol. 9345, pp. 134–142. Springer, Cham (2015). doi:10.1007/978-3-319-23264-5_12

    Chapter  Google Scholar 

  6. De Giacomo, G., Lespérance, Y., Patrizi, F., Vassos, S.: LTL verification of online executions with sensing in bounded situation calculus. In: Proceedings of ECAI, pp. 369–374. IOS Press (2014)

    Google Scholar 

  7. Eiter, T., Gottlob, G.: The complexity class \(\Theta _{{\text{ p }}}^{2}\): recent results and applications in AI and modal logic. In: Chlebus, B.S., Czaja, L. (eds.) FCT 1997. LNCS, vol. 1279, pp. 1–18. Springer, Heidelberg (1997). doi:10.1007/BFb0036168

    Chapter  MATH  Google Scholar 

  8. Eiter, T., Lukasiewicz, T., Predoiu, L.: Generalized consistent query answering under existential rules. In: Baral, C., Delgrande, J., Wolter, F. (eds.) Proceedings of KR, pp. 359–368 (2016)

    Google Scholar 

  9. Hoffmann, J., Sabharwal, A., Domshlak, C.: Friends or foes? An AI planning perspective on abstraction and search. In: ICAPS, pp. 294–303 (2006)

    Google Scholar 

  10. Kabanza, F., Barbeau, M., St-Denis, R.: Planning control rules for reactive agents. AIJ 95(1), 67–113 (1997)

    MATH  Google Scholar 

  11. Lomuscio, A., Michliszyn, J.: Verification of multi-agent systems via predicate abstraction against ATLK specifications. In: Proceedings of AAMAS, pp. 662–670 (2016)

    Google Scholar 

  12. Nebel, B., Dimopoulos, Y., Koehler, J.: Ignoring irrelevant facts and operators in plan generation. In: Steel, S., Alami, R. (eds.) ECP 1997. LNCS, vol. 1348, pp. 338–350. Springer, Heidelberg (1997). doi:10.1007/3-540-63912-8_97

    Chapter  Google Scholar 

  13. Saribatur, Z.G., Eiter, T.: Reactive policies with planning for action languages. In: Michael, L., Kakas, A. (eds.) JELIA 2016. LNCS, vol. 10021, pp. 463–480. Springer, Cham (2016). doi:10.1007/978-3-319-48758-8_30

    Chapter  Google Scholar 

  14. Wagner, K.: Bounded query classes. SIAM J. Comput. 19(5), 833–846 (1990)

    Article  MathSciNet  Google Scholar 

  15. Wooldridge, M., Dunne, P.E.: Optimistic and disjunctive agent design problems. In: Castelfranchi, C., Lespérance, Y. (eds.) ATAL 2000. LNCS, vol. 1986, pp. 1–14. Springer, Heidelberg (2001). doi:10.1007/3-540-44631-1_1

    Chapter  Google Scholar 

  16. Zarrieß, B., Claßen, J.: Decidable verification of Golog programs over non-local effect actions. In: Proceedings of AAAI, pp. 1109–1115 (2016)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Zeynep G. Saribatur .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2017 Springer International Publishing AG

About this paper

Cite this paper

Saribatur, Z.G., Baral, C., Eiter, T. (2017). Reactive Maintenance Policies over Equalized States in Dynamic Environments. In: Oliveira, E., Gama, J., Vale, Z., Lopes Cardoso, H. (eds) Progress in Artificial Intelligence. EPIA 2017. Lecture Notes in Computer Science(), vol 10423. Springer, Cham. https://doi.org/10.1007/978-3-319-65340-2_58

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-65340-2_58

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-65339-6

  • Online ISBN: 978-3-319-65340-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy