Fully Observable Non-deterministic Planning as Assumption-Based Reactive Synthesis

D'Ippolito, N, Rodriguez, N and Sardina, S 2018, 'Fully Observable Non-deterministic Planning as Assumption-Based Reactive Synthesis', Journal of Artificial Intelligence Research, vol. 61, pp. 593-621.


Document type: Journal Article
Collection: Journal Articles

Title Fully Observable Non-deterministic Planning as Assumption-Based Reactive Synthesis
Author(s) D'Ippolito, N
Rodriguez, N
Sardina, S
Year 2018
Journal name Journal of Artificial Intelligence Research
Volume number 61
Start page 593
End page 621
Total pages 29
Publisher A A A I Press
Abstract We contribute to recent efforts in relating two approaches to automatic synthesis, namely, automated planning and discrete reactive synthesis. First, we develop a declarative characterization of the standard "fairness" assumption on environments in non-deterministic planning, and show that strong-cyclic plans are correct solution concepts for fair environments. This complements, and arguably completes, the existing foundational work on non-deterministic planning, which focuses on characterizing (and computing) plans enjoying special "structural" properties, namely loopy but closed policy structures. Second, we provide an encoding suitable for reactive synthesis that avoids the naive exponential state space blowup. To do so, special care has to be taken to specify the fairness assumption on the environment in a succinct manner.
Subject Adaptive Agents and Intelligent Robotics
Keyword(s) automated planning
control synthesis
AI
Copyright notice © 2018 AI Access Foundation.
ISSN 1076-9757
Versions
Version Filter Type
Citation counts: TR Web of Science Citation Count  Cited 2 times in Thomson Reuters Web of Science Article | Citations
Scopus Citation Count Cited 0 times in Scopus Article
Access Statistics: 13 Abstract Views  -  Detailed Statistics
Created: Thu, 21 Feb 2019, 12:10:00 EST by Catalyst Administrator
© 2014 RMIT Research Repository • Powered by Fez SoftwareContact us