Synthesizing strategies under expected and exceptional environment behaviors

We consider an agent that operates with two models of the environment: one that captures expected behaviors and one that captures additional exceptional behaviors. We study the problem of synthesizing agent strategies that enforce a goal against environments operating as expected while also making a best effort against exceptional environment behaviors. We formalize these concepts in the context of linear-temporal logic, and give an algorithm for solving this problem. We also show that there is no trade-off between enforcing the goal under the expected environment specification and making a best-effort for it under the exceptional one.

[1]  Bernd Finkbeiner,et al.  Synthesis of Reactive Systems , 2016, Dependable Software Systems Engineering.

[2]  Giuseppe De Giacomo,et al.  Automata-Theoretic Foundations of FOND Planning for LTLf and LDLf Goals , 2018, IJCAI.

[3]  Alessio Lomuscio,et al.  Verifying Fault Tolerance and Self-Diagnosability of an Autonomous Underwater Vehicle , 2011, IJCAI.

[4]  Krzysztof R. Apt,et al.  Lectures in Game Theory for Computer Scientists , 2011 .

[5]  Giuseppe De Giacomo,et al.  Synthesis under Assumptions , 2018, KR.

[6]  Aniello Murano,et al.  Probabilistic Strategy Logic , 2019, IJCAI.

[7]  Aniello Murano,et al.  Reasoning About Strategies: On the Model-Checking Problem , 2011, ArXiv.

[8]  Vaishak Belle,et al.  On Plans With Loops and Noise , 2018, AAMAS.

[9]  Aniello Murano,et al.  Strategy logic with imperfect information , 2017, 2017 32nd Annual ACM/IEEE Symposium on Logic in Computer Science (LICS).

[10]  Fahiem Bacchus,et al.  Planning for temporally extended goals , 1996, Annals of Mathematics and Artificial Intelligence.

[11]  Alessio Lomuscio,et al.  Verification of Broadcasting Multi-Agent Systems against an Epistemic Strategy Logic , 2017, IJCAI.

[12]  Amir Pnueli,et al.  On the synthesis of a reactive module , 1989, POPL '89.

[13]  Paolo Traverso,et al.  Strong Cyclic Planning Revisited , 1999, ECP.

[14]  Marco Bozzano,et al.  The FSAP/NuSMV-SA Safety Analysis Platform , 2007, International Journal on Software Tools for Technology Transfer.

[15]  Rüdiger Ehlers,et al.  Cooperative Reactive Synthesis , 2015, ATVA.

[16]  Giuseppe De Giacomo,et al.  Generalized Planning: Non-Deterministic Abstractions and Trajectory Constraints , 2017, IJCAI.

[17]  Jean-François Raskin,et al.  Assume-admissible synthesis , 2015, Acta Informatica.

[18]  Véronique Bruyère,et al.  Meet Your Expectations With Guarantees: Beyond Worst-Case Synthesis in Quantitative Games , 2013, STACS.

[19]  Alessio Lomuscio,et al.  Combining fault injection and model checking to verify fault tolerance in multi-agent systems , 2009, AAMAS.

[20]  Krishnendu Chatterjee,et al.  Assume-Guarantee Synthesis , 2007, TACAS.

[21]  Subbarao Kambhampati,et al.  Explicability? Legibility? Predictability? Transparency? Privacy? Security? The Emerging Landscape of Interpretable Agent Behavior , 2018, ICAPS.

[22]  Giuseppe De Giacomo,et al.  Automatic behavior composition synthesis , 2013, Artif. Intell..

[23]  Jonathan Ezekiel,et al.  Combining fault injection and model checking to verify fault tolerance, recoverability, and diagnosability in multi-agent systems , 2017, Inf. Comput..

[24]  Marco Faella,et al.  Admissible Strategies in Infinite Games over Graphs , 2009, MFCS.

[25]  R. Odríguez,et al.  Fully Observable Non-deterministic Planning as Assumption-Based Reactive Synthesis , 2018 .

[26]  Alberto Camacho,et al.  Finite LTL Synthesis with Environment Assumptions and Quality Measures , 2018, KR.

[27]  Aniello Murano,et al.  Reasoning about Knowledge and Strategies under Hierarchical Information , 2018, KR.

[28]  Giuseppe De Giacomo,et al.  Foundations for Restraining Bolts: Reinforcement Learning with LTLf/LDLf Restraining Specifications , 2018, ICAPS.

[29]  Fahiem Bacchus,et al.  Using temporal logics to express search control knowledge for planning , 2000, Artif. Intell..

[30]  Blai Bonet,et al.  A Concise Introduction to Models and Methods for Automated Planning , 2013, A Concise Introduction to Models and Methods for Automated Planning.

[31]  Alberto Camacho,et al.  LTL and Beyond: Formal Languages for Reward Function Specification in Reinforcement Learning , 2019, IJCAI.

[32]  Dietmar Berwanger,et al.  Admissibility in Infinite Games , 2007, STACS.

[33]  Giuseppe De Giacomo,et al.  Automata-Theoretic Approach to Planning for Temporally Extended Goals , 1999, ECP.

[34]  Alex M. Andrew,et al.  Knowledge in Action: Logical Foundations for Specifying and Implementing Dynamical Systems , 2002 .

[35]  Giuseppe De Giacomo,et al.  Stochastic Fairness and Language-Theoretic Fairness in Planning on Nondeterministic Domains , 2019, ICAPS.

[36]  Giuseppe De Giacomo,et al.  Planning under LTL Environment Specifications , 2019, ICAPS.