554 research outputs found

    Design of a distributed finite-time observer using observability decompositions

    Get PDF
    International audienceIn this paper, a distributed observer is presented to estimate the state of a linear time-invariant plant in finite-time in each observer node. The design is based on a decomposition into locally observable and unobservable substates and on properties of homogeneous systems. Each observer node can reconstruct in finite-time its locally observable substate with its measurements only. Then exploiting the coupling, a finite-time converging observer is constructed for the remaining states by adding the consensus terms. A numerical example illustrates the result

    Design of a distributed finite-time observer using observability decompositions

    Get PDF
    International audienceIn this paper, a distributed observer is presented to estimate the state of a linear time-invariant plant in finite-time in each observer node. The design is based on a decomposition into locally observable and unobservable substates and on properties of homogeneous systems. Each observer node can reconstruct in finite-time its locally observable substate with its measurements only. Then exploiting the coupling, a finite-time converging observer is constructed for the remaining states by adding the consensus terms. A numerical example illustrates the result

    A simple finite-time distributed observer design for linear time-invariant systems

    Get PDF
    International audienceA design of a distributed observer is proposed for continuous-time systems with nonlinear observer nodes such that the estimation errors converge in a finite time to zero. By taking advantage of individual observability decompositions, the designs for the locally observable and the unobservable substate are made independent from each other. For the observable substate of each node, standard centralized finite-time observer techniques are applied. To estimate distributively the unobservable substate, the observer nodes employ consensus coupling in a linear term and an additional term embedded in a fractional power. The approach is derived using homogeneity arguments and it leads to a simple design with an LMI that is guaranteed to be feasible under general conditions

    A decentralized linear quadratic control design method for flexible structures

    Get PDF
    A decentralized suboptimal linear quadratic control design procedure which combines substructural synthesis, model reduction, decentralized control design, subcontroller synthesis, and controller reduction is proposed for the design of reduced-order controllers for flexible structures. The procedure starts with a definition of the continuum structure to be controlled. An evaluation model of finite dimension is obtained by the finite element method. Then, the finite element model is decomposed into several substructures by using a natural decomposition called substructuring decomposition. Each substructure, at this point, still has too large a dimension and must be reduced to a size that is Riccati-solvable. Model reduction of each substructure can be performed by using any existing model reduction method, e.g., modal truncation, balanced reduction, Krylov model reduction, or mixed-mode method. Then, based on the reduced substructure model, a subcontroller is designed by an LQ optimal control method for each substructure independently. After all subcontrollers are designed, a controller synthesis method called substructural controller synthesis is employed to synthesize all subcontrollers into a global controller. The assembling scheme used is the same as that employed for the structure matrices. Finally, a controller reduction scheme, called the equivalent impulse response energy controller (EIREC) reduction algorithm, is used to reduce the global controller to a reasonable size for implementation. The EIREC reduced controller preserves the impulse response energy of the full-order controller and has the property of matching low-frequency moments and low-frequency power moments. An advantage of the substructural controller synthesis method is that it relieves the computational burden associated with dimensionality. Besides that, the SCS design scheme is also a highly adaptable controller synthesis method for structures with varying configuration, or varying mass and stiffness properties

    Towards a minimal order distributed observer for linear systems

    Get PDF
    In this paper we consider the distributed estimation problem for continuous-time linear time-invariant (LTI) systems. A single linear plant is observed by a network of local observers. Each local observer in the network has access to only part of the output of the observed system, but can also receive information on the state estimates of its neigbours. Each local observer should in this way generate an estimate of the plant state. In this paper we study the problem of existence of a reduced order distributed observer. We show that if the observed system is observable and the network graph is a strongly connected directed graph, then a distributed observer exists with state space dimension equal to Nn−∑i=1NpiNn - \sum_{i =1}^N p_i, where NN is the number of network nodes, nn is the state space dimension of the observed plant, and pip_i is the rank of the output matrix of the observed output received by the iith local observer. In the case of a single observer, this result specializes to the well-known minimal order observer in classical observer design.Comment: 12 pages, 1 figur

    Hiding variables when decomposing specifications into GR(1) contracts

    Get PDF
    We propose a method for eliminating variables from component specifications during the decomposition of GR(1) properties into contracts. The variables that can be eliminated are identified by parameterizing the communication architecture to investigate the dependence of realizability on the availability of information. We prove that the selected variables can be hidden from other components, while still expressing the resulting specification as a game with full information with respect to the remaining variables. The values of other variables need not be known all the time, so we hide them for part of the time, thus reducing the amount of information that needs to be communicated between components. We improve on our previous results on algorithmic decomposition of GR(1) properties, and prove existence of decompositions in the full information case. We use semantic methods of computation based on binary decision diagrams. To recover the constructed specifications so that humans can read them, we implement exact symbolic minimal covering over the lattice of integer orthotopes, thus deriving minimal formulae in disjunctive normal form over integer variable intervals

    Coordination Control of Linear Systems

    Get PDF
    Schuppen, J.H. van [Promotor]Ran, A.C.M. [Promotor
    • …
    corecore