Constraint-Based Controller Synthesis in Non-Deterministic and Partially Observable Domains

  title={Constraint-Based Controller Synthesis in Non-Deterministic and Partially Observable Domains},
  author={C. Pralet and G. Verfaillie and M. Lema{\^i}tre and G. Infantes},
Controller synthesis consists in automatically building controllers taking as inputs observation data and returning outputs guaranteeing that the controlled system satisfies some desired properties. In system specification, these properties may be safety properties specifying that some conditions must always hold. In planning, they express that the evolution of the controlled system must terminate in a goal state. In this paper, we propose a generic approach able to synthesize memoryless or… Expand
Maximally permissive controlled system synthesis for non-determinism and modal logic
It is shown that the proposed synthesis theory allows full expressibility of Ramadge-Wonham supervisory control theory and its applicability in two small industrial case studies is illustrated, including an analysis with regard to scalability. Expand
Constraint Programming for Controller Synthesis
In this paper, we show how the problem of synthesis of a controller for a dynamic system that must satisfy some safety properties, possibly in a non deterministic and partially observable setting,Expand
A Generic Technique for Synthesizing Bounded Finite-State Controllers
This paper proposes a generic framework and related solver for synthesizing bounded finite-state controllers, and shows its instantiations to three different applications, including generalized planning, planning programs and service composition under partial observability and controllability. Expand
A Generic Framework and Solver for Synthesizing Finite-State Controllers
Experimental results show that instantiations of the proposed generic solver to the problems above outperform most of the tailored approaches in the literature, suggesting that the proposal is a promising base point for future research on finite-state controller synthesis. Expand
Single State Trackability of Discrete Event Systems
A necessary and sufficient condition for single state trackability of a discrete event system and a recursive algorithm to check this property is provided and validated with a set of benchmarks. Expand
A Correctness Result for Synthesizing Plans With Loops in Stochastic Domains
New theoretical results are presented on a generic technique for synthesizing FSCs in stochastic environments, allowing for highly granular specifications on termination and goal satisfaction. Expand
Controller Synthesis for Autonomous Systems: a Constraint-Based Approach
Controller synthesis can be seen as an alternative to controller verification, in which controllers are directly synthesized from a model of the possible evolutions of a system to be controlled andExpand
Beyond QCSP for Solving Control Problems
A new constraint-based framework which does not suffer from the drawbacks of QCSP or QCSP+ is proposed, and experiments show orders of magnitude improvements when compared with QCSP/QCSP+ solvers. Expand
Properly Acting under Partial Observability with Action Feasibility Constraints
This work introduces Action-Constrained Partially Observable Markov Decision Process (AC-POMDP), which arose from studying critical robotic applications with damaging actions, and proposes an algorithm named PreCondition Value Iteration (PCVI), which fully exploits this specific property of AC-PomDPs about α-vectors. Expand
Generation and verification of plans with loops
This thesis studies planning problems whose solution plans are program-like structures that contain branches and loops. Such problems are a generalization of classical and conditional planning, andExpand


Automatic Derivation of Memoryless Policies and Finite-State Controllers Using Classical Planners
This work develops a method for deriving finite-state controllers automatically from models that represent a class of contingent problems where actions are deterministic and some fluents are observable, and converted into a conformant planning problem that is solved using classical planners. Expand
Planning in Nondeterministic Domains under Partial Observability via Symbolic Model Checking
An algorithm is proposed that searches through a (possibly cyclic) and-or graph induced by the domain and generates conditional plans that are guaranteed to achieve the goal despite of the uncertainty in the initial condition, the uncertain effects of actions, and the partial observability of the domain. Expand
Learning Finite-State Controllers for Partially Observable Environments
Because it performs stochastic gradient descent, this algorithm can be shown to converge to a locally optimal finitestate controller and the ability of the algorithm to extract the useful information contained in the sequence of past observations to compensate for the lack of observability at each time-step is shown. Expand
Planning and Acting in Partially Observable Stochastic Domains
A novel algorithm for solving pomdps off line and how, in some cases, a finite-memory controller can be extracted from the solution to a POMDP is outlined. Expand
Bounded Finite State Controllers
A new approximation algorithm for solving partially observable MDPs is described, combining several advantages of gradient ascent, efficiency, and policy iteration through the space of bounded-size, stochastic finite state controllers. Expand
Planning with Incomplete Information as Heuristic Search in Belief Space
The formulation of planning as heuristic search with heuristics derived from problem representations in the context planning with incomplete information is made explicit, to test it over a number of domains, and to extend it to tasks like planning with sensing where the standard search algorithms do not apply. Expand
Temporal and Modal Logic
  • E. Emerson
  • Computer Science, Mathematics
  • Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics
  • 1990
The chapter describes the framework of linear temporal logic, which has been widely employed in the specification and verification of programs and explains how temporal logic structures can be used to model concurrent programs using non-determinism and fairness. Expand
Markov Decision Processes: Discrete Stochastic Dynamic Programming
  • M. Puterman
  • Mathematics, Computer Science
  • Wiley Series in Probability and Statistics
  • 1994
Markov Decision Processes covers recent research advances in such areas as countable state space models with average reward criterion, constrained models, and models with risk sensitive optimality criteria, and explores several topics that have received little or no attention in other books. Expand
Handbook of Theoretical Computer Science, Volume B: Formal Models and Semantics
As one of the products to see in internet, this website becomes a very available place to look for countless handbook of theoretical computer science volume b formal models and semantics sources. Expand
Gecode: Generic Constraint Development Environment
  • Gecode: Generic Constraint Development Environment
  • 2006