The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
We investigate the synthesis of optimal controllers for continuous-time and continuous-state systems under temporal logic specifications. The specification is expressed as a deterministic, finite automaton (the specification automaton) with transition costs, and the optimal system behavior is captured by a cost function that is integrated over time. We construct a dynamic programming problem over...
This paper presents a method for the reactive synthesis of fault-tolerant optimal control protocols for a finite deterministic discrete event system subject to safety specifications. A Deterministic Finite State Machine (DFSM) and Behavior Tree (BT) were used to model the system. The synthesis procedure involves formulating the policy problem as a shortest path dynamic programming problem. The procedure...
We consider identifiability of linear systems driven by white noise using a combination of distributional and time series measurements. Specifically, we assume that the system has no control inputs available and can only be observed at stationarity. The user is able to measure the full stationary state distribution as well as observe time correlations for small subsets of the state. We formulate theoretical...
This paper describes the implementation of an interface connecting the two tools : the JPL SCA (Statechart Autocoder) and TuLiP (Temporal Logic Planning Toolbox) to enable the automatic synthesis of low level implementation code directly from formal specifications. With system dynamics, bounds on uncertainty and formal specifications as inputs, TuLiP synthesizes Mealy machines that are correct-by-construction...
In this paper, we consider the problem of synthesizing correct-by-construction controllers for discrete-time dynamical systems. A commonly adopted approach in the literature is to abstract the dynamical system into a Finite Transition System (FTS) and thus convert the problem into a two player game between the environment and the system on the FTS. The controller design problem can then be solved...
The cost of the great expressivity of motion planning subject to temporal logic formulae is intractability. Recent advances in sampling-based methods seem to be only applicable to “low-level” control. The problem of realizing “high-level” controllers that satisfy a temporal logic specification does not readily admit approximations, unless the notion of correctness is relaxed as might be achieved with...
This paper considers the problem of synthesizing correct-by-construction robotic controllers in environments with uncertain but fixed structure. “Environment” has two notions in this work: a map or “world” in which some controlled agent must operate and navigate (i.e., evolve in a configuration space with obstacles); and an adversarial player that selects continuous and discrete variables to try to...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.