896,338 research outputs found
Robust Control Synthesis for Gust Load Alleviation from Large Aeroelastic Models with Relaxation of Spatial Discretisation
This paper introduces a methodology for the design of gust load control systems directly from large aeroelastic models with relaxation of spatial discretisation. A convenient state-space representation of the vortex-panel unsteady aerodynamics suitable for control synthesis is presented. This allows a full understanding of the dynamics of the linearized vortex aeroelastic model and is suitable for control system design. Through the use of robust controllers, large reductions in loading could be achieved. Comparisons are also made between robust and classical control methods. It further demonstrates that controllers synthesized from models of coarse spatial discretizations and of an order of magnitude smaller in size were capable of rejecting disturbances on fully converged models, with performances comparable to expensive higher order controllers developed from full models
Towards Scalable Synthesis of Stochastic Control Systems
Formal control synthesis approaches over stochastic systems have received
significant attention in the past few years, in view of their ability to
provide provably correct controllers for complex logical specifications in an
automated fashion. Examples of complex specifications of interest include
properties expressed as formulae in linear temporal logic (LTL) or as automata
on infinite strings. A general methodology to synthesize controllers for such
properties resorts to symbolic abstractions of the given stochastic systems.
Symbolic models are discrete abstractions of the given concrete systems with
the property that a controller designed on the abstraction can be refined (or
implemented) into a controller on the original system. Although the recent
development of techniques for the construction of symbolic models has been
quite encouraging, the general goal of formal synthesis over stochastic control
systems is by no means solved. A fundamental issue with the existing techniques
is the known "curse of dimensionality," which is due to the need to discretize
state and input sets and that results in an exponential complexity over the
number of state and input variables in the concrete system. In this work we
propose a novel abstraction technique for incrementally stable stochastic
control systems, which does not require state-space discretization but only
input set discretization, and that can be potentially more efficient (and thus
scalable) than existing approaches. We elucidate the effectiveness of the
proposed approach by synthesizing a schedule for the coordination of two
traffic lights under some safety and fairness requirements for a road traffic
model. Further we argue that this 5-dimensional linear stochastic control
system cannot be studied with existing approaches based on state-space
discretization due to the very large number of generated discrete states.Comment: 22 pages, 3 figures. arXiv admin note: text overlap with
arXiv:1407.273
Approximately bisimilar symbolic models for nonlinear control systems
Control systems are usually modeled by differential equations describing how
physical phenomena can be influenced by certain control parameters or inputs.
Although these models are very powerful when dealing with physical phenomena,
they are less suitable to describe software and hardware interfacing the
physical world. For this reason there is a growing interest in describing
control systems through symbolic models that are abstract descriptions of the
continuous dynamics, where each "symbol" corresponds to an "aggregate" of
states in the continuous model. Since these symbolic models are of the same
nature of the models used in computer science to describe software and
hardware, they provide a unified language to study problems of control in which
software and hardware interact with the physical world. Furthermore the use of
symbolic models enables one to leverage techniques from supervisory control and
algorithms from game theory for controller synthesis purposes. In this paper we
show that every incrementally globally asymptotically stable nonlinear control
system is approximately equivalent (bisimilar) to a symbolic model. The
approximation error is a design parameter in the construction of the symbolic
model and can be rendered as small as desired. Furthermore if the state space
of the control system is bounded the obtained symbolic model is finite. For
digital control systems, and under the stronger assumption of incremental
input-to-state stability, symbolic models can be constructed through a suitable
quantization of the inputs.Comment: Corrected typo
Towards Efficient Maximum Likelihood Estimation of LPV-SS Models
How to efficiently identify multiple-input multiple-output (MIMO) linear
parameter-varying (LPV) discrete-time state-space (SS) models with affine
dependence on the scheduling variable still remains an open question, as
identification methods proposed in the literature suffer heavily from the curse
of dimensionality and/or depend on over-restrictive approximations of the
measured signal behaviors. However, obtaining an SS model of the targeted
system is crucial for many LPV control synthesis methods, as these synthesis
tools are almost exclusively formulated for the aforementioned representation
of the system dynamics. Therefore, in this paper, we tackle the problem by
combining state-of-the-art LPV input-output (IO) identification methods with an
LPV-IO to LPV-SS realization scheme and a maximum likelihood refinement step.
The resulting modular LPV-SS identification approach achieves statical
efficiency with a relatively low computational load. The method contains the
following three steps: 1) estimation of the Markov coefficient sequence of the
underlying system using correlation analysis or Bayesian impulse response
estimation, then 2) LPV-SS realization of the estimated coefficients by using a
basis reduced Ho-Kalman method, and 3) refinement of the LPV-SS model estimate
from a maximum-likelihood point of view by a gradient-based or an
expectation-maximization optimization methodology. The effectiveness of the
full identification scheme is demonstrated by a Monte Carlo study where our
proposed method is compared to existing schemes for identifying a MIMO LPV
system
Comparing Asynchronous -Complete Approximations and Quotient Based Abstractions
This paper is concerned with a detailed comparison of two different
abstraction techniques for the construction of finite state symbolic models for
controller synthesis of hybrid systems. Namely, we compare quotient based
abstractions (QBA), with different realizations of strongest (asynchronous)
-complete approximations (SAlCA) Even though the idea behind their
construction is very similar, we show that they are generally incomparable both
in terms of behavioral inclusion and similarity relations. We therefore derive
necessary and sufficient conditions for QBA to coincide with particular
realizations of SAlCA. Depending on the original system, either QBA or SAlCA
can be a tighter abstraction
Engineering failure analysis and design optimisation with HiP-HOPS
The scale and complexity of computer-based safety critical systems, like those used in the transport and manufacturing industries, pose significant challenges for failure analysis. Over the last decade, research has focused on automating this task. In one approach, predictive models of system failure are constructed from the topology of the system and local component failure models using a process of composition. An alternative approach employs model-checking of state automata to study the effects of failure and verify system safety properties. In this paper, we discuss these two approaches to failure analysis. We then focus on Hierarchically Performed Hazard Origin & Propagation Studies (HiP-HOPS) - one of the more advanced compositional approaches - and discuss its capabilities for automatic synthesis of fault trees, combinatorial Failure Modes and Effects Analyses, and reliability versus cost optimisation of systems via application of automatic model transformations. We summarise these contributions and demonstrate the application of HiP-HOPS on a simplified fuel oil system for a ship engine. In light of this example, we discuss strengths and limitations of the method in relation to other state-of-the-art techniques. In particular, because HiP-HOPS is deductive in nature, relating system failures back to their causes, it is less prone to combinatorial explosion and can more readily be iterated. For this reason, it enables exhaustive assessment of combinations of failures and design optimisation using computationally expensive meta-heuristics. (C) 2010 Elsevier Ltd. All rights reserved
Compositional synthesis of temporal fault trees from state machines
Dependability analysis of a dynamic system which is embedded with several complex interrelated components raises two main problems. First, it is difficult to represent in a single coherent and complete picture how the system and its constituent parts behave in conditions of failure. Second, the analysis can be unmanageable due to a considerable number of failure events, which increases with the number of components involved. To remedy this problem, in this paper we outline an analysis approach that converts failure behavioural models (state machines) to temporal fault trees (TFTs), which can then be analysed using Pandora -- a recent technique for introducing temporal logic to fault trees. The approach is compositional and potentially more scalable, as it relies on the synthesis of large system TFTs from smaller component TFTs. We show, by using a Generic Triple Redundant (GTR) system, how the approach enables a more accurate and full analysis of an increasingly complex system
- …