Recursos de colección

Caltech Authors (157.532 recursos)

Repository of works by Caltech published authors.

Group = Control and Dynamical Systems Technical Reports

Mostrando recursos 1 - 4 de 4

  1. Decomposing GR(1) Games with Singleton Liveness Guarantees for Efficient Synthesis

    Dathathri, Sumanth; Murray, Richard M.
    Temporal logic based synthesis approaches are often used to find trajectories that are correct-by-construction for tasks in systems with complex behavior. Some examples of such tasks include synchronization for multi-agent hybrid systems, reactive motion planning for robots. However, the scalability of such approaches is of concern and at times a bottleneck when transitioning from theory to practice. In this paper, we identify a class of problems in the GR(1) fragment of linear-time temporal logic (LTL) where the synthesis problem allows for a decomposition that enables easy parallelization. This decomposition also reduces the alternation depth, resulting in more efficient synthesis. A...
    (application/pdf) - 21-sep-2017

  2. Interfacing TuLiP with the JPL Statechart Autocoder: Initial progress toward synthesis of flight software from formal specifications

    Dathathri, Sumanth; Livingston, Scott C.; Reder, Leonard J.; Murray, Richard M.
    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. An interface is built that automatically translates these Mealy machines into UML statecharts. The SCA accepts the UML statecharts (as XML files) to synthesize flight-certified implementation code. The functionality of the interface is demonstrated through three example systems of varying complexity a) a simple...
    (application/pdf) - 28-ago-2017

  3. Convex optimal uncertainty quantification: Algorithms and a case study in energy storage placement for power grids

    Han, Shuo; Topcu, Ufuk; Tao, Molei; Owhadi, Houman; Murray, Richard M.
    How does one evaluate the performance of a stochastic system in the absence of a perfect model (i.e. probability distribution)? We address this question under the framework of optimal uncertainty quantification (OUQ), which is an information-based approach for worst-case analysis of stochastic systems. We are able to generalize previous results and show that the OUQ problem can be solved using convex optimization when the function under evaluation can be expressed in a polytopic canonical form (PCF). We also propose iterative methods for scaling the convex formulation to larger systems. As an application, we study the problem of storage placement in...
    (application/pdf) - 28-ago-2017

  4. Stochastic Distributed Protocol for Electric Vehicle Charging with Discrete Charging Rate

    Gan, Lingwen; Topcu, Ufuk; Low, Steven H.
    To address the grid-side challenges associated with the anticipated high electric vehicle (EV) penetration level, various charging protocols have been proposed in the literature. Most if not all of these protocols assume continuous charging rates and allow intermittent charging. However, due to charging technology limitations, EVs can only be charged at a fixed rate, and the intermittency in charging shortens the battery lifespan. We consider these charging requirements, and formulate EV charging scheduling as a discrete optimization problem. We propose a stochastic distributed algorithm to approximately solve the optimal EV charging scheduling problem in an iterative procedure. In each iteration, the transformer receives charging...
    (application/pdf) - 28-ago-2017

Aviso de cookies: Usamos cookies propias y de terceros para mejorar nuestros servicios, para análisis estadístico y para mostrarle publicidad. Si continua navegando consideramos que acepta su uso en los términos establecidos en la Política de cookies.