kth.sePublications
Change search
Refine search result
12345 1 - 50 of 246
CiteExportLink to result list
Permanent link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Rows per page
  • 5
  • 10
  • 20
  • 50
  • 100
  • 250
Sort
  • Standard (Relevance)
  • Author A-Ö
  • Author Ö-A
  • Title A-Ö
  • Title Ö-A
  • Publication type A-Ö
  • Publication type Ö-A
  • Issued (Oldest first)
  • Issued (Newest first)
  • Created (Oldest first)
  • Created (Newest first)
  • Last updated (Oldest first)
  • Last updated (Newest first)
  • Disputation date (earliest first)
  • Disputation date (latest first)
  • Standard (Relevance)
  • Author A-Ö
  • Author Ö-A
  • Title A-Ö
  • Title Ö-A
  • Publication type A-Ö
  • Publication type Ö-A
  • Issued (Oldest first)
  • Issued (Newest first)
  • Created (Oldest first)
  • Created (Newest first)
  • Last updated (Oldest first)
  • Last updated (Newest first)
  • Disputation date (earliest first)
  • Disputation date (latest first)
Select
The maximal number of hits you can export is 250. When you want to export more records please use the Create feeds function.
  • 1.
    Alanwar, Amr
    et al.
    KTH, School of Electrical Engineering and Computer Science (EECS), Intelligent systems, Decision and Control Systems (Automatic Control). Constructor University, Bremen, Germany, 28759.
    Koch, Anne
    University of Stuttgart, Institute for Systems Theory and Automatic Control, Stuttgart, Germany, 70174.
    Allgower, Frank
    University of Stuttgart, Institute for Systems Theory and Automatic Control, Stuttgart, Germany, 70174.
    Johansson, Karl H.
    KTH, School of Electrical Engineering and Computer Science (EECS), Intelligent systems, Decision and Control Systems (Automatic Control).
    Data-Driven Reachability Analysis From Noisy Data2023In: IEEE Transactions on Automatic Control, ISSN 0018-9286, E-ISSN 1558-2523, Vol. 68, no 5, p. 3054-3069Article in journal (Refereed)
    Abstract [en]

    We consider the problem of computing reachable sets directly from noisy data without a given system model. Several reachability algorithms are presented for different types of systems generating the data. First, an algorithm for computing over-approximated reachable sets based on matrix zonotopes is proposed for linear systems. Constrained matrix zonotopes are introduced to provide less conservative reachable sets at the cost of increased computational expenses and utilized to incorporate prior knowledge about the unknown system model. Then we extend the approach to polynomial systems and, under the assumption of Lipschitz continuity, to nonlinear systems. Theoretical guarantees are given for these algorithms in that they give a proper over-approximate reachable set containing the true reachable set. Multiple numerical examples and real experiments show the applicability of the introduced algorithms, and comparisons are made between algorithms.

  • 2.
    Almér, Stefan
    et al.
    KTH, School of Engineering Sciences (SCI), Mathematics (Dept.), Optimization and Systems Theory.
    Jönsson, Ulf
    KTH, School of Engineering Sciences (SCI), Mathematics (Dept.), Optimization and Systems Theory.
    Kao, Chung-Yao
    Univ Melbourne, Dept Elect & Elect Engn.
    Mari, Jorge
    GE Global Res, Elect Energy Syst.
    Stability analysis of a class of PWM systems2007In: IEEE Transactions on Automatic Control, ISSN 0018-9286, E-ISSN 1558-2523, Vol. 52, no 6, p. 1072-1078Article in journal (Refereed)
    Abstract [en]

    This note considers stability analysis of a class of pulsewidth modulated (PWM) systems that incorporates several different switched mode dc-de- converters. The systems of the class typically have periodic solutions. A sampled data model is developed and used to prove stability of these solutions. Conditions for global and local exponential stability are derived using quadratic and piecewise quadratic Lyapunov functions. The state space is partitioned and the stability conditions are verified by checking a set of coupled linear matrix inequalities (LMIs).

  • 3.
    Almér, Stefan
    et al.
    KTH, School of Engineering Sciences (SCI), Mathematics (Dept.), Optimization and Systems Theory.
    Jönsson, Ulf T.
    KTH, School of Engineering Sciences (SCI), Mathematics (Dept.), Optimization and Systems Theory.
    Dynamic Phasor Analysis of Periodic Systems2009In: IEEE Transactions on Automatic Control, ISSN 0018-9286, E-ISSN 1558-2523, Vol. 54, no 8, p. 2007-2012Article in journal (Refereed)
    Abstract [en]

    The paper considers stability analysis of linear time-periodic (LTP) systems based on the dynamic phasor model (DPM). The DPM exploits the periodicity of the system by expanding the system state in a Fourier series over a moving time window. This results in an L-2-equivalent representation in terms of an infinite-dimensional LTI system which describes the evolution of time varying Fourier coefficients. To prove stability, we consider quadratic time-periodic Lyapunov candidates. Using the DPM, the corresponding time-periodic Lyapunov inequality can be stated as a finite dimensional inequality and the Lyapunov function can be found by solving a linear matrix inequality.

  • 4. Alur, Rajeev
    et al.
    D'Innocenzo, Alessandro
    Johansson, Karl H.
    KTH, School of Electrical Engineering (EES), Automatic Control. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.
    Pappas, George J.
    Weiss, Gera
    Compositional Modeling and Analysis of Multi-Hop Control Networks2011In: IEEE Transactions on Automatic Control, ISSN 0018-9286, E-ISSN 1558-2523, Vol. 56, no 10, p. 2345-2357Article in journal (Refereed)
    Abstract [en]

    We propose a mathematical framework for modeling and analyzing multi-hop control networks designed for systems consisting of multiple control loops closed over a multi-hop (wireless) communication network. We separate control, topology, routing, and scheduling and propose formal syntax and semantics for the dynamics of the composed system, providing an explicit translation of multi-hop control networks to switched systems. We propose formal models for analyzing robustness of multi-hop control networks, where data is exchanged through a multi-hop communication network subject to disruptions. When communication disruptions are long, compared to the speed of the control system, we propose to model them as permanent link failures. We show that the complexity of analyzing such failures is NP-hard, and discuss a way to overcome this limitation for practical cases using compositional analysis. For typical packet transmission errors, we propose a transient error model where links fail for one time slot independently of the past and of other links. We provide sufficient conditions for almost sure stability in presence of transient link failures, and give efficient decision procedures. We deal with errors that have random time span and show that, under some conditions, the permanent failure model can be used as a reliable abstraction. Our approach is compositional, namely it addresses the problem of designing scalable scheduling and routing policies for multiple control loops closed on the same multi-hop control network. We describe how the translation of multi-hop control networks to switched systems can be automated, and use it to solve control and networking co-design challenges in some representative examples, and to propose a scheduling solution in a mineral floatation control problem that can be implemented on a time triggered communication protocols for wireless networks.

  • 5.
    Andreasson, Martin
    et al.
    KTH, School of Electrical Engineering (EES), Automatic Control. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.
    Dimarogonas, Dimos V.
    KTH, School of Electrical Engineering (EES), Automatic Control. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.
    Sandberg, Henrik
    KTH, School of Electrical Engineering (EES), Automatic Control. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.
    Johansson, Karl Henrik
    KTH, School of Electrical Engineering (EES), Automatic Control. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.
    Distributed Control of Networked Dynamical Systems: Static Feedback, Integral Action and Consensus2014In: IEEE Transactions on Automatic Control, ISSN 0018-9286, E-ISSN 1558-2523, Vol. 59, no 7, p. 1750-1764Article in journal (Refereed)
    Abstract [en]

    This paper analyzes distributed control protocols for first- and second-order networked dynamical systems. We propose a class of nonlinear consensus controllers where the input of each agent can be written as a product of a nonlinear gain, and a sum of nonlinear interaction functions. By using integral Lyapunov functions, we prove the stability of the proposed control protocols, and explicitly characterize the equilibrium set. We also propose a distributed proportional-integral (PI) controller for networked dynamical systems. The PI controllers successfully attenuate constant disturbances in the network. We prove that agents with single-integrator dynamics are stable for any integral gain, and give an explicit tight upper bound on the integral gain for when the system is stable for agents with double-integrator dynamics. Throughout the paper we highlight some possible applications of the proposed controllers by realistic simulations of autonomous satellites, power systems and building temperature control.

  • 6. Anisi, David A.
    et al.
    Ögren, Petter
    Swedish Defence Research Agency (FOI), Sweden.
    Hu, Xiaoming
    KTH, School of Engineering Sciences (SCI), Mathematics (Dept.), Optimization and Systems Theory. KTH, School of Computer Science and Communication (CSC), Centres, Centre for Autonomous Systems, CAS. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.
    Cooperative Minimum Time Surveillance With Multiple Ground Vehicles2010In: IEEE Transactions on Automatic Control, ISSN 0018-9286, E-ISSN 1558-2523, Vol. 55, no 12, p. 2679-2691Article in journal (Refereed)
    Abstract [en]

    In this paper, we formulate and solve two different minimum time problems related to unmanned ground vehicle (UGV) surveillance. The first problem is the following. Given a set of surveillance UGVs and a polyhedral area, find waypoint-paths for all UGVs such that every point of the area is visible from a point on a path and such that the time for executing the search in parallel is minimized. Here, the sensors' field of view are assumed to have a limited coverage range and be occluded by the obstacles. The second problem extends the first by additionally requiring the induced information graph to be connected at the time instants when the UGVs perform the surveillance mission, i.e., when they gather and transmit sensor data. In the context of the second problem, we also introduce and utilize the notion of recurrent connectivity, which is a significantly more flexible connectivity constraint than, e.g., the 1-hop connectivity constraints and use it to discuss consensus filter convergence for the group of UGVs.

  • 7.
    Avventi, Enrico
    et al.
    KTH, School of Engineering Sciences (SCI), Mathematics (Dept.), Optimization and Systems Theory.
    Lindquist, Anders
    KTH, School of Engineering Sciences (SCI), Mathematics (Dept.), Optimization and Systems Theory.
    Wahlberg, Bo
    KTH, School of Engineering Sciences (SCI), Mathematics (Dept.), Optimization and Systems Theory.
    ARMA Identification of Graphical Models2013In: IEEE Transactions on Automatic Control, ISSN 0018-9286, E-ISSN 1558-2523, Vol. 58, no 5, p. 1167-1178Article in journal (Refereed)
    Abstract [en]

    Consider a Gaussian stationary stochastic vector process with the property that designated pairs of components are conditionally independent given the rest of the components. Such processes can be represented on a graph where the components are nodes and the lack of a connecting link between two nodes signifies conditional independence. This leads to a sparsity pattern in the inverse of the matrix-valued spectral density. Such graphical models find applications in speech, bioinformatics, image processing, econometrics and many other fields, where the problem to fit an autoregressive (AR) model to such a process has been considered. In this paper we take this problem one step further, namely to fit an autoregressive moving-average (ARMA) model to the same data. We develop a theoretical framework and an optimization procedure which also spreads further light on previous approaches and results. This procedure is then applied to the identification problem of estimating the ARMA parameters as well as the topology of the graph from statistical data.

    Download full text (pdf)
    fulltext
  • 8. Balaghi I., M. H.
    et al.
    Antunes, D.
    Mamduhi, Mohammad H.
    KTH, School of Electrical Engineering and Computer Science (EECS), Intelligent systems, Decision and Control Systems (Automatic Control).
    Hirche, S.
    Decentralized LQ-Consistent Event-triggered Control over a Shared Contention-based Network2022In: IEEE Transactions on Automatic Control, ISSN 0018-9286, E-ISSN 1558-2523, Vol. 67, no 3, p. 1430-1437Article in journal (Refereed)
    Abstract [en]

    Consider a network of multiple independent stochas-tic linear systems where, for each system, a scheduler collocatedwith the sensors arbitrates data transmissions to a correspondingremote controller through a shared contention-based communi-cation network. While the systems are physically independent,their optimal controller design problems may, in general, becomecoupled, due to network contention, if the schedulers triggertransmissions based on state-dependent events. In this article wepropose a class of probabilistic admissible schedulers for whichthe optimal controllers, with respect to local standard LQG costs,have the certainty equivalence property and can still be determineddecentrally. Then, two subclasses of scheduling policies withinthis class are introduced; a non-event-based subclass, so calledpurely stochastic transmission (PST) policy, and an event-basedsubclass, both with easily adjustable triggering probabilities atevery time step. We then prove that, given a PST policy withgiven triggering probabilities and an associated closed-loop per-formance with optimal control law, we can find an event-basedscheduler from the proposed subclass and with the same trigger-ing probabilities for which the associated closed-loop performancewith optimal control law is strictly superior. Moreover, we showthat, for each closed-loop system, the optimal state estimatorsfor both scheduling policies follows a linear iteration. Finally, weprovide a method to regulate the triggering probabilities of theschedulers by maximizing a network utility function.

  • 9.
    Bao, Lei
    et al.
    KTH, School of Electrical Engineering (EES), Communication Theory. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.
    Skoglund, Mikael
    KTH, School of Electrical Engineering (EES), Communication Theory. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.
    Johansson, Karl Henrik
    KTH, School of Electrical Engineering (EES), Automatic Control. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.
    Iterative Encoder-Controller Design for Feedback Control Over Noisy Channels2011In: IEEE Transactions on Automatic Control, ISSN 0018-9286, E-ISSN 1558-2523, Vol. 56, no 2, p. 265-278Article in journal (Refereed)
    Abstract [en]

    We study a closed-loop control system with state feedback transmitted over a noisy discrete memoryless channel. With the objective to minimize the expected linear quadratic cost over a finite horizon, we propose a joint design of the sensor measurement quantization, channel error protection, and controller actuation. It is argued that despite that this encoder-controller optimization problem is known to be hard in general, an iterative design procedure can be derived in which the controller is optimized for a fixed encoder, then the encoder is optimized for a fixed controller, etc. Several properties of such a scheme are discussed. For a fixed encoder, we study how to optimize the controller given that full or partial side-information is available at the encoder about the symbols received at the controller. It is shown that the certainty equivalence controller is optimal when the encoder is optimal and has full side-information. For a fixed controller, expressions for the optimal encoder are given and implications are discussed for the special cases when process, sensor, or channel noise is not present. Numerical experiments are carried out to demonstrate the performance obtained by employing the proposed iterative design procedure and to compare it with other relevant schemes.

    Download full text (pdf)
    coding-control_ieeetac10
  • 10.
    Barforooshan, Mohsen
    et al.
    Department of Electronic Systems, Aalborg University, DK-9220, Aalborg, Denmark.
    Derpich, Milan Stefan
    Electronic Engineering Department, Universidad Tecnica Federico Santa Maria, Valparaiso, Chile, 2390123 .
    Stavrou, Fotios
    KTH, School of Electrical Engineering and Computer Science (EECS), Intelligent systems, Information Science and Engineering.
    Ostergaard, Jan
    Department of Electronic Systems, Aalborg University, Aalborg, Denmark.
    The Effect of Time Delay on the Average Data Rate and Performance in Networked Control Systems2022In: IEEE Transactions on Automatic Control, ISSN 0018-9286, E-ISSN 1558-2523, Vol. 67, no 1, p. 16-31Article in journal (Refereed)
    Abstract [en]

    This paper studies the performance of a feedback control loop closed via an error-free digital communication channel with transmission delay. The system comprises a discrete-time noisy linear time-invariant (LTI) plant whose single measurement output is mapped into its single control input by a causal, but otherwise arbitrary, coding and control scheme. We consider a single-input multiple-output (SIMO) channel between the encoder-controller and the decoder-controller which is lossless and imposes random time delay. We derive a lower bound on the minimum average feedback data rate that guarantees achieving a certain level of average quadratic performance over all possible realizations of the random delay. For the special case of a constant channel delay, we obtain an upper bound by proposing linear source-coding schemes that attain desired performance levels with rates that are at most 1.254 bits per sample greater than the lower bound. We supplement our results with a numerical experiment demonstrating that the obtained bounds and operational rates are increasing functions of the constant delay.

  • 11.
    Bastianello, Nicola
    et al.
    KTH, School of Electrical Engineering and Computer Science (EECS), Intelligent systems, Decision and Control Systems (Automatic Control).
    Carli, Ruggero
    University of Padova, Department of Information Engineering (DEI), Padova, Italy, 35131.
    Zampieri, Sandro
    University of Padova, Department of Information Engineering (DEI), Padova, Italy, 35131.
    Internal Model-Based Online Optimization2024In: IEEE Transactions on Automatic Control, ISSN 0018-9286, E-ISSN 1558-2523, Vol. 69, no 1, p. 689-696Article in journal (Refereed)
    Abstract [en]

    In this article, we propose a model-based approach to the design of online optimization algorithms, with the goal of improving the tracking of the solution trajectory (trajectories) w.r.t. state-of-the-art methods. We focus first on quadratic problems with a time-varying linear term, and use digital control tools (a robust internal model principle) to propose a novel online algorithm that can achieve zero tracking error by modeling the cost with a dynamical system. We prove the convergence of the algorithm for both strongly convex and convex problems. We further discuss the sensitivity of the proposed method to model uncertainties and quantify its performance. We discuss how the proposed algorithm can be applied to general (nonquadratic) problems using an approximate model of the cost, and analyze the convergence leveraging the small gain theorem. We present numerical results that showcase the superior performance of the proposed algorithms over previous methods for both quadratic and nonquadratic problems.

  • 12.
    Berkane, Soulaimane
    et al.
    Univ Quebec Outaouais, Dept Comp Sci & Engn, Gatineau, PQ J8X 3X7, Canada..
    Bisoffi, Andrea
    Univ Groningen, ENTEG, NL-9747 AG Groningen, Netherlands.;Univ Groningen, JC Willems Ctr Syst & Control, NL-9747 AG Groningen, Netherlands..
    Dimarogonas, Dimos V.
    KTH, School of Electrical Engineering and Computer Science (EECS), Intelligent systems, Decision and Control Systems (Automatic Control).
    Obstacle Avoidance via Hybrid Feedback2022In: IEEE Transactions on Automatic Control, ISSN 0018-9286, E-ISSN 1558-2523, Vol. 67, no 1, p. 512-519Article in journal (Refereed)
    Abstract [en]

    In this article, we present a hybrid feedback approach to solve the navigation problem in the n-dimensional space containing an arbitrary number of ellipsoidal obstacles. The proposed algorithm guarantees both global asymptotic stabilization to a target position and avoidance of the obstacles. The controller, exploiting hysteresis regions, employs a Zeno-free switching between two modes of control: stabilization and avoidance. Simulation results illustrate the performance of the proposed approach for 2-D and 3-D scenarios.

  • 13. Besselink, Bart
    et al.
    Johansson, Karl H.
    KTH, School of Electrical Engineering (EES), Automatic Control.
    String Stability and a Delay-Based Spacing Policy for Vehicle Platoons Subject to Disturbances2017In: IEEE Transactions on Automatic Control, ISSN 0018-9286, E-ISSN 1558-2523, Vol. 62, no 9, p. 4376-4391Article in journal (Refereed)
    Abstract [en]

    A novel delay-based spacing policy for the control of vehicle platoons is introduced together with a notion of disturbance string stability. The delay-based spacing policy specifies the desired intervehicular distance between vehicles and guarantees that all vehicles track the same spatially varying reference velocity profile, as is for example required for heavy-duty vehicles driving over hilly terrain. Disturbance string stability is a notion of string stability of vehicle platoons subject to external disturbances on all vehicles that guarantees that perturbations do not grow unbounded as they propagate through the platoon. Specifically, a control design approach in the spatial domain is presented that achieves tracking of the desired spacing policy and guarantees disturbance string stability with respect to a spatially varying reference velocity. The results are illustrated by means of simulations.

  • 14.
    Besselink, Bart
    et al.
    KTH, School of Electrical Engineering (EES), Automatic Control. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.
    Sandberg, Henrik
    KTH, School of Electrical Engineering (EES), Automatic Control. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.
    Johansson, Karl H.
    KTH, School of Electrical Engineering (EES), Automatic Control. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.
    Clustering-based model reduction of networked passive systems2016In: IEEE Transactions on Automatic Control, ISSN 0018-9286, E-ISSN 1558-2523, Vol. 61, no 10, p. 2958-2973, article id 7350110Article in journal (Refereed)
    Abstract [en]

    The model reduction problem for networks of interconnected dynamical systems is studied in this paper. In particular, networks of identical passive subsystems, which are coupled according to a tree topology, are considered. For such networked systems, reduction is performed by clustering subsystems that show similar behavior and subsequently aggregating their states, leading to a reduced-order networked system that allows for an insightful physical interpretation. The clusters are chosen on the basis of the analysis of controllability and observability properties of associated edge systems, representing the importance of the couplings and providing ameasure of the similarity of the behavior of neighboring subsystems. This reduction procedure is shown to preserve synchronization properties (i.e., the convergence of the subsystem trajectories to each other) and allows for the a priori computation of a bound on the reduction error with respect to external inputs and outputs. The method is illustrated by means of an example of a thermal model of a building.

  • 15.
    Besselink, Bart
    et al.
    KTH, School of Electrical Engineering (EES), Automatic Control. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.
    van de Wouw, Nathan
    Scherpen, Jacquelien M. A.
    Nijmeijer, Henk
    Model Reduction for Nonlinear Systems by Incremental Balanced Truncation2014In: IEEE Transactions on Automatic Control, ISSN 0018-9286, E-ISSN 1558-2523, Vol. 59, no 10, p. 2739-2753Article in journal (Refereed)
    Abstract [en]

    In this paper, the method of incremental balanced truncation is introduced as a tool for model reduction of nonlinear systems. Incremental balanced truncation provides an extension of balanced truncation for linear systems towards the nonlinear case and differs from existing nonlinear balancing techniques in the definition of two novel energy functions. These incremental observability and incremental controllability functions form the basis for a model reduction procedure in which the preservation of stability properties is guaranteed. In particular, the property of incremental stability, which provides a notion of stability for systems with nonzero inputs, is preserved. Moreover, a computable error bound is given. Next, an extension towards so-called generalized incremental balanced truncation is proposed, which provides a reduction technique with increased computational feasibility at the cost of a (potentially) larger error bound. The proposed reduction technique is illustrated by means of application to an example of an electronic circuit with nonlinear elements.

  • 16.
    Bisoffi, Andrea
    et al.
    KTH, School of Electrical Engineering and Computer Science (EECS), Intelligent systems, Decision and Control Systems (Automatic Control).
    Dimarogonas, Dimos V.
    KTH, School of Electrical Engineering and Computer Science (EECS), Intelligent systems, Decision and Control Systems (Automatic Control).
    Satisfaction of Linear Temporal Logic Specifications Through Recurrence Tools for Hybrid Systems2021In: IEEE Transactions on Automatic Control, ISSN 0018-9286, E-ISSN 1558-2523, Vol. 66, no 2, p. 818-825Article in journal (Refereed)
    Abstract [en]

    In this article, we formulate the problem of satisfying a linear temporal logic formula on a linear plant with output feedback, through a recent hybrid systems formalism. We relate this problem to the notion of recurrence introduced for the considered formalism, and we then extend Lyapunov-like conditions for recurrence of an open, unbounded set. One of the proposed relaxed conditions allows certifying recurrence of a suitable set, and this guarantees that the high-level evolution of the plant satisfies the formula, without relying on discretizations of the plant. Simulations illustrate the proposed approach.

  • 17.
    Bottegal, Giulio
    et al.
    KTH, School of Electrical Engineering (EES), Automatic Control. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.
    Picci, Giorgio
    Modeling Complex Systems by Generalized Factor Analysis2015In: IEEE Transactions on Automatic Control, ISSN 0018-9286, E-ISSN 1558-2523, Vol. 60, no 3, p. 759-774Article in journal (Refereed)
    Abstract [en]

    We propose a new modeling paradigm for large dimensional aggregates of stochastic systems by Generalized Factor Analysis (GFA) models. These models describe the data as the sum of a flocking plus an uncorrelated idiosyncratic component. The flocking component describes a sort of collective orderly motion which admits a much simpler mathematical description than the whole ensemble while the idiosyncratic component describes weakly correlated noise. We first discuss static GFA representations and characterize in a rigorous way the properties of the two components. The extraction of the dynamic flocking component is discussed for time-stationary linear systems and for a simple classes of separable random fields.

  • 18.
    Briat, Corentin
    KTH, School of Engineering Sciences (SCI), Mathematics (Dept.), Optimization and Systems Theory. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.
    Convergence and Equivalence Results for the Jensen's Inequality-Application to Time-Delay and Sampled-Data Systems2011In: IEEE Transactions on Automatic Control, ISSN 0018-9286, E-ISSN 1558-2523, Vol. 56, no 7, p. 1660-1665Article in journal (Refereed)
    Abstract [en]

    The Jensen's inequality plays a crucial role in the analysis of time-delay and sampled-data systems. Its conservatism is studied through the use of the Gruss Inequality. It has been reported in the literature that fragmentation (or partitioning) schemes allow to empirically improve the results. We prove here that the Jensen's gap can be made arbitrarily small provided that the order of uniform fragmentation is chosen sufficiently large. Nonuniform fragmentation schemes are also shown to speed up the convergence in certain cases. Finally, a family of bounds is characterized and a comparison with other bounds of the literature is provided. It is shown that the other bounds are equivalent to Jensen's and that they exhibit interesting well-posedness and linearity properties which can be exploited to obtain better numerical results.

  • 19.
    Briat, Corentin
    et al.
    KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.
    Seuret, Alexandre
    Convex Dwell-Time Characterizations for Uncertain Linear Impulsive Systems2012In: IEEE Transactions on Automatic Control, ISSN 0018-9286, E-ISSN 1558-2523, Vol. 57, no 12, p. 3241-3246Article in journal (Refereed)
    Abstract [en]

    New sufficient conditions for the characterization of dwell-times for linear impulsive systems are proposed and shown to coincide with continuous decrease conditions of a certain class of looped-functionals, a recently introduced type of functionals suitable for the analysis of hybrid systems. This approach allows to consider Lyapunov functions that evolve nonmonotonically along the flow of the system in a new way, broadening then the admissible class of systems which may be analyzed. As a byproduct, the particular structure of the obtained conditions makes the method is easily extendable to uncertain systems by exploiting some convexity properties. Several examples illustrate the approach.

  • 20. Cantoni, Michael
    et al.
    Jönsson, Ulf T.
    KTH, School of Engineering Sciences (SCI), Mathematics (Dept.), Optimization and Systems Theory.
    Kao, Chung-Yao
    Robustness Analysis for Feedback Interconnections of Distributed Systems via Integral Quadratic Constraints2012In: IEEE Transactions on Automatic Control, ISSN 0018-9286, E-ISSN 1558-2523, Vol. 57, no 2, p. 302-317Article in journal (Refereed)
    Abstract [en]

    A framework is established for directly accommodating feedback interconnections of unstable distributed-parameter transfer functions in robust stability analysis via integral quadratic constraints (IQCs). This involves transfer function homotopies that are continuous in a nu-gap metric sense. As such, the development includes the extension of nu-gap metric concepts to an irrational setting and the study of uncertainty-set connectedness in these terms. The main IQC based robust stability result is established for constantly-proper transfer functions in the Callier-Desoer algebra; i.e. finitely many unstable poles and a constant limit at infinity. Problems of structured robust stability analysis and robust performance analysis are considered to illustrate use of the main result. Several numerical examples are also presented. These include stability analysis of an autonomous system with uncertain time-delay and a closed-loop control system, accounting for both the gain and phase characteristics of the distributed-parameter uncertainty associated with the nominal rational plant model used for controller synthesis.

  • 21. Cedervall, Simon
    et al.
    Hu, Xiaoming
    KTH, School of Engineering Sciences (SCI), Mathematics (Dept.), Optimization and Systems Theory. KTH, School of Computer Science and Communication (CSC), Centres, Centre for Autonomous Systems, CAS. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.
    Nonlinear observers for unicycle robots with range sensors2007In: IEEE Transactions on Automatic Control, ISSN 0018-9286, E-ISSN 1558-2523, Vol. 52, no 7, p. 1325-1329Article in journal (Refereed)
    Abstract [en]

    For nonlinear mobile systems equipped with exteroceptive sensors, the observability does not only depend on the initial conditions, but also on the control and the environment. This presents an interesting issue: how to design an observer together with the exciting control. In this note, the problem of designing an observer based on range sensor readings is studied. A design method based on periodic excitations is proposed for unicycle robotic systems.

  • 22. Charalambous, Charalambos D.
    et al.
    Tzortzis, Ioannis
    Loyka, Sergey
    Charalambous, Themistoklis
    KTH, School of Electrical Engineering (EES), Automatic Control.
    Extremum Problems With Total Variation Distance and Their Applications2014In: IEEE Transactions on Automatic Control, ISSN 0018-9286, E-ISSN 1558-2523, Vol. 59, no 9, p. 2353-2368Article in journal (Refereed)
    Abstract [en]

    The aim of this paper is to investigate extremum problems with pay-off being the total variation distance metric defined on the space of probability measures, subject to linear functional constraints on the space of probability measures, and vice-versa; that is, with the roles of total variation metric and linear functional interchanged. Utilizing concepts from signed measures, the extremum probability measures of such problems are obtained in closed form, by identifying the partition of the support set and the mass of these extremum measures on the partition. The results are derived for abstract spaces; specifically, complete separable metric spaces known as Polish spaces, while the high level ideas are also discussed for denumerable spaces endowed with the discrete topology. These extremum problems often arise in many areas, such as, approximating a family of probability distributions by a given probability distribution, maximizing or minimizing entropy subject to total variation distance metric constraints, quantifying uncertainty of probability distributions by total variation distance metric, stochastic minimax control, and in many problems of information, decision theory, and minimax theory.

  • 23.
    Charitidou, Maria
    et al.
    KTH, School of Electrical Engineering and Computer Science (EECS), Intelligent systems, Decision and Control Systems (Automatic Control).
    Dimarogonas, Dimos V.
    KTH, School of Electrical Engineering and Computer Science (EECS), Intelligent systems, Decision and Control Systems (Automatic Control).
    Receding Horizon Control with Online Barrier Function Design under Signal Temporal Logic Specifications2023In: IEEE Transactions on Automatic Control, ISSN 0018-9286, E-ISSN 1558-2523, Vol. 68, no 6, p. 3545-3556Article in journal (Refereed)
    Abstract [en]

    Signal Temporal Logic (STL) has been found an expressive language for describing complex, time-constrained tasks in several robotic applications. Existing methods encode such specifications by either using integer constraints or by employing set invariance techniques. While in the first case this results in MILP control problems, in the latter case designer-specific choices may induce conservatism in the robot's performance and the satisfaction of the task. In this paper a continuous-time receding horizon control scheme (RHS) is proposed that exploits the trade-off between task satisfaction and performance costs such as actuation and state costs, traditionally considered in RHS schemes. The satisfaction of the STL tasks is encoded using time-varying control barrier functions (CBFs) that are designed online, thus avoiding the integer expressions that are often used in literature. The recursive feasibility of the proposed scheme is guaranteed by the satisfaction of a time-varying terminal constraint that ensures the satisfaction of the task with pre-determined robustness. The effectiveness of the method is illustrated in a multi-robot simulation scenario.

    Download full text (pdf)
    fulltext
  • 24. Chen, J.
    et al.
    Johansson, Karl Henrik
    KTH, School of Electrical Engineering (EES), Automatic Control. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.
    Olariu, S.
    Paschalidis, I.Ch.
    Stojmenovic, I.
    Guest Editorial Special Issue on Wireless Sensor and Actuator Networks2011In: IEEE Transactions on Automatic Control, ISSN 0018-9286, E-ISSN 1558-2523, Vol. 56, no 10, p. 2244-2246Article in journal (Refereed)
    Download full text (pdf)
    networked_control_si_tac11
  • 25.
    Chen, Wei
    et al.
    KTH, School of Electrical Engineering (EES), Automatic Control. Hong Kong Univ Sci & Technol, Peoples R China.
    Qiu, Li
    Linear Quadratic Optimal Control of Continuous-Time LTI Systems With Random Input Gains2016In: IEEE Transactions on Automatic Control, ISSN 0018-9286, E-ISSN 1558-2523, Vol. 61, no 7, p. 2008-2013Article in journal (Refereed)
    Abstract [en]

    This note studies the linear quadratic ( LQ) optimal control of continuous-time linear time-invariant systems with random gains imposed on the input channels. We start from the indefinite LQ problem, in which the cost weighting matrix can be indefinite. The definite LQ problem is discussed as a special case. The main novelty originates from the point of view that in networked control, designing the channels and controller jointly often leads to an easier problem and achieves better performance than designing them separately. Specifically, we formulate the LQ problem as a channel/controller co-design problem assuming that the channel capacities can be allocated among the input channels subject to an overall capacity constraint. Necessary and sufficient conditions are obtained for the well-posedness and the attainability of the indefinite LQ problem under a given channel capacity allocation satisfying the stabilization requirement. The optimal controller is given by a linear state feedback associated with the mean-square stabilizing solution of a modified algebraic Riccati equation.

  • 26.
    Chen, Wei
    et al.
    Peking Univ, Dept Mech & Engn Sci, Beijing 100871, Peoples R China.;Peking Univ, Beijing Innovat Ctr Engn Sci & Adv Technol, Beijing 100871, Peoples R China..
    Wang, Dan
    Hong Kong Univ Sci & Technol, Dept Elect & Comp Engn, Kowloon, Hong Kong, Peoples R China..
    Liu, Ji
    SUNY Stony Brook, Dept Elect & Comp Engn, Stony Brook, NY 11794 USA..
    Chen, Yongxin
    Georgia Inst Technol, Sch Aerosp Engn, Atlanta, GA 30332 USA..
    Khong, Sei Zhen
    Univ Melbourne, Dept Elect & Elect Engn, Melbourne, Vic, Australia.;Lund Univ, Dept Automat Control, Lund, Sweden.;Univ Minnesota Twin Cities, Inst Math & Its Applicat, Minneapolis, MN USA.;Univ Hong Kong, Dept Elect & Elect Engn, Hong Kong, Peoples R China..
    Basar, Tamer
    Univ Illinois, Coordinated Sci Lab, Urbana, IL 61801 USA..
    Johansson, Karl H.
    KTH, School of Electrical Engineering and Computer Science (EECS), Intelligent systems, Decision and Control Systems (Automatic Control).
    Qiu, Li
    Hong Kong Univ Sci & Technol, Dept Elect & Comp Engn, Kowloon, Hong Kong, Peoples R China..
    On Spectral Properties of Signed Laplacians With Connections to Eventual Positivity2021In: IEEE Transactions on Automatic Control, ISSN 0018-9286, E-ISSN 1558-2523, Vol. 66, no 5, p. 2177-2190Article in journal (Refereed)
    Abstract [en]

    Signed graphs have appeared in a broad variety of applications, ranging from social networks to biological networks, from distributed control and computation to power systems. In this article, we investigate spectral properties of signed Laplacians for undirected signed graphs. We find conditions on the negative weights under which a signed Laplacian is positive semidefinite via the Kron reduction and multiport network theory. For signed Laplacians that are indefinite, we characterize their inertias with the same framework. Furthermore, we build connections between signed Laplacians, generalized M-matrices, and eventually exponentially positive matrices.

  • 27. Cheng, Daizhan
    et al.
    Wang, Jinhuan
    Hu, Xiaoming
    KTH, School of Engineering Sciences (SCI), Mathematics (Dept.), Optimization and Systems Theory. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre. KTH, School of Computer Science and Communication (CSC), Centres, Centre for Autonomous Systems, CAS.
    An extension of LaSalle's invariance principle and its application to multi-agent consensus2008In: IEEE Transactions on Automatic Control, ISSN 0018-9286, E-ISSN 1558-2523, Vol. 53, no 7, p. 1765-1770Article in journal (Refereed)
    Abstract [en]

    In the paper, an extension of LaSalle's Invariance Principle to a class of switched linear systems is studied. One of the motivations is the consensus problem in multi-agent systems. Unlike most existing results in which each switching mode in the system needs to be asymptotically stable, this paper allows that the switching modes are only Lyapunov stable. Under certain ergodicity assumptions, an extension of LaSalle's Invariance Principle for global asymptotic stability is obtained. Then it is used to solve the consensus reaching problem of certain multi-agent systems in which each agent is modeled by a double integrator, and the associated interaction graph is switching and is assumed to be only jointly connected.

  • 28.
    Colombo, Leonardo Jesus
    et al.
    Inst Ciencias Matemat, Madrid 28049, Spain..
    Dimarogonas, Dimos V.
    KTH, School of Electrical Engineering and Computer Science (EECS), Intelligent systems, Decision and Control Systems (Automatic Control).
    Symmetry Reduction in Optimal Control of Multiagent Systems on Lie Groups2020In: IEEE Transactions on Automatic Control, ISSN 0018-9286, E-ISSN 1558-2523, Vol. 65, no 11, p. 4973-4980Article in journal (Refereed)
    Abstract [en]

    We study the reduction of degrees of freedom for the equations that determine necessary optimality conditions for extrema in an optimal control problem for a multiagent system by exploiting the physical symmetries of agents, where the kinematics of each agent is given by a left-invariant control system. Reduced optimality conditions are obtained using techniques from variational calculus and Lagrangian mechanics. A Hamiltonian formalism is also studied, where the problem is explored through an application of Pontryagins maximum principle for left-invariant systems, and the optimality conditions are obtained as integral curves of a reduced Hamiltonian vector field. We apply the results to an energy-minimum control problem for multiple unicycles.

  • 29.
    Cortez, Wenceslao Shaw
    et al.
    Pacific Northwest Natl Lab, Richland, WA 99354 USA..
    Dimarogonas, Dimos V.
    KTH, School of Electrical Engineering and Computer Science (EECS), Intelligent systems, Decision and Control Systems (Automatic Control).
    On Compatibility and Region of Attraction for Safe, Stabilizing Control Laws2022In: IEEE Transactions on Automatic Control, ISSN 0018-9286, E-ISSN 1558-2523, Vol. 67, no 9, p. 4924-4931Article in journal (Refereed)
    Abstract [en]

    A novel method is proposed to ensure stability and constraint satisfaction, i.e., "compatibility," for nonlinear affine systems. We require an asymptotically stabilizing control law and a zeroing control barrier function, and define a region of attraction for which the proposed control safely stabilizes the system. Our methodology requires checking conditions of the system dynamics over the state space, which may be computationally expensive. To facilitate the search for compatibility, we extend the results to a class of nonlinear systems, including mechanical systems, for which a novel controller is designed to guarantee passivity, safety, and stability. The proposed technique is demonstrated using numerical examples.

  • 30. Dai, Li
    et al.
    Xia, Yuanqing
    Gao, Yulong
    KTH, School of Electrical Engineering (EES), Automatic Control. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.
    Cannon, Mark
    Distributed Stochastic MPC of Linear Systems With Additive Uncertainty and Coupled Probabilistic Constraints2017In: IEEE Transactions on Automatic Control, ISSN 0018-9286, E-ISSN 1558-2523, Vol. 62, no 7, p. 3474-3481Article in journal (Refereed)
    Abstract [en]

    This technical note develops a new form of distributed stochastic model predictive control (DSMPC) algorithm for a group of linear stochastic subsystems subject to additive uncertainty and coupled probabilistic constraints. We provide an appropriate way to design the DSMPC algorithm by extending a centralized SMPC (CSMPC) scheme. To achieve the satisfaction of coupled probabilistic constraints in a distributed manner, only one subsystem is permitted to optimize at each time step. In addition, by making explicit use of the probabilistic distribution of the uncertainties, probabilistic constraints are converted into a set of deterministic constraints for the predictions of nominal models. The distributed controller can achieve recursive feasibility and ensure closed-loop stability for any choice of update sequence. Numerical examples illustrate the efficacy of the algorithm.

  • 31.
    Demirel, Burak
    et al.
    KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre. University of Paderborn, Germany.
    Gupta, V.
    Quevedo, D. E.
    Johansson, Mikael
    KTH, School of Electrical Engineering (EES), Automatic Control. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.
    On the Trade-Off between Communication and Control Cost in Event-Triggered Dead-Beat Control2016In: IEEE Transactions on Automatic Control, ISSN 0018-9286, E-ISSN 1558-2523, Vol. PP, no 99, article id 7562376Article in journal (Refereed)
    Abstract [en]

    We consider a stochastic system where the communication between the controller and the actuator is triggered by a thresholdbased rule. The communication is performed across an unreliable link that stochastically erases transmitted packets. To decrease the communication burden, and as a partial protection against dropped packets, the controller sends a sequence of control commands to the actuator in each packet. These commands are stored in a buffer and applied sequentially until the next control packet arrives. In this context, we study dead-beat control laws and compute the expected linear-quadratic loss of the closed-loop system for any given event-threshold. Furthermore, we provide analytical expressions that quantify the trade-off between the communication cost and the control performance of event-triggered control systems. Numerical examples demonstrate the effectiveness of the proposed technique.

  • 32.
    Demirel, Burak
    et al.
    KTH, School of Electrical Engineering (EES), Automatic Control. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.
    Zou, Zhenhua
    KTH, School of Electrical Engineering (EES), Automatic Control. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.
    Soldati, Pablo
    Johansson, Mikael
    KTH, School of Electrical Engineering (EES), Automatic Control. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.
    Modular Design of Jointly Optimal Controllers and Forwarding Policies for Wireless Control2014In: IEEE Transactions on Automatic Control, ISSN 0018-9286, E-ISSN 1558-2523, Vol. 59, no 12, p. 3252-3265Article in journal (Refereed)
    Abstract [en]

    We consider the joint design of packet forwarding policies and controllers for wireless control loops where sensor measurements are sent to the controller over an unreliable and energy-constrained multi-hop wireless network. For fixed sampling rate of the sensor, the co-design problem separates into two well-defined and independent subproblems: transmission scheduling for maximizing the deadline-constrained reliability and optimal control under packet loss. We develop optimal and implementable solutions for these subproblems and show that the optimally co-designed system can be efficiently found. Numerical examples highlight the many trade-offs involved and demonstrate the power of our approach.

  • 33.
    Dimarogonas, Dimos V.
    KTH, School of Electrical Engineering (EES), Automatic Control. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre. KTH, School of Computer Science and Communication (CSC), Centres, Centre for Autonomous Systems, CAS.
    Sufficient Conditions for Decentralized Potential Functions Based Controllers Using Canonical Vector Fields2012In: IEEE Transactions on Automatic Control, ISSN 0018-9286, E-ISSN 1558-2523, Vol. 57, no 10, p. 2621-2626Article in journal (Refereed)
    Abstract [en]

    A combination of dual Lyapunov analysis and properties of decentralized navigation function based controllers is used to check the stability properties of a certain class of decentralized controllers for navigation and collision avoidance in multiagent systems. The derived results yield a less conservative condition from previous approaches, which relates to the negativity of the sum of the minimum eigenvalues of the Hessian matrices at the critical points, instead of requiring each of the eigenvalues to be negative itself. This provides an improved characterization of the reachable set of this class of decentralized navigation function based controllers, which is less conservative than the previous results for the same class of controllers.

  • 34.
    Dimarogonas, Dimos V.
    et al.
    KTH, School of Electrical Engineering (EES), Automatic Control. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre. KTH, School of Computer Science and Communication (CSC), Centres, Centre for Autonomous Systems, CAS.
    Frazzoli, Emilio
    Johansson, Karl H.
    KTH, School of Electrical Engineering (EES), Automatic Control. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.
    Distributed Event-Triggered Control for Multi-Agent Systems2012In: IEEE Transactions on Automatic Control, ISSN 0018-9286, E-ISSN 1558-2523, Vol. 57, no 5, p. 1291-1297Article in journal (Refereed)
    Abstract [en]

    Event-driven strategies for multi-agent systems are motivated by the future use of embedded microprocessors with limited resources that will gather information and actuate the individual agent controller updates. The controller updates considered here are event-driven, depending on the ratio of a certain measurement error with respect to the norm of a function of the state, and are applied to a first order agreement problem. A centralized formulation is considered first and then its distributed counterpart, in which agents require knowledge only of their neighbors' states for the controller implementation. The results are then extended to a self-triggered setup, where each agent computes its next update time at the previous one, without having to keep track of the state error that triggers the actuation between two consecutive update instants. The results are illustrated through simulation examples.

  • 35.
    Dimarogonas, Dimos V.
    et al.
    KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.
    Kyriakopoulos, K. J.
    Inverse Agreement Protocols With Application to Distributed Multi-Agent Dispersion2009In: IEEE Transactions on Automatic Control, ISSN 0018-9286, E-ISSN 1558-2523, Vol. 54, no 3, p. 657-663Article in journal (Refereed)
    Abstract [en]

    We propose a distributed inverse agreement control law for multiple kinematic agents that forces the team members to disperse In the workspace. Both the cases of an unbounded and a circular, bounded workspace are considered. In the first case, we show that the closed-loop system reaches a configuration In which the minimum distance between any pair of agents is larger than a specific lower bound. It is proved that this lower bound coincides with the agents' sensing radius. In the case of a bounded circular workspace, the control law is redefined to force the agents to remain within the workspace boundary. Moreover the proposed control design guarantees collision avoidance between the team members in all cases. The results are supported through relevant computer simulations.

  • 36.
    Djehiche, Boualem
    et al.
    KTH, School of Engineering Sciences (SCI), Mathematics (Dept.), Mathematics (Div.).
    Tcheukam, Alain
    Tembine, Hamidou
    A Mean-Field Game of Evacuation in Multilevel Building2017In: IEEE Transactions on Automatic Control, ISSN 0018-9286, E-ISSN 1558-2523, Vol. 62, no 10, p. 5154-5169Article in journal (Refereed)
  • 37.
    Djehiche, Boualem
    et al.
    KTH, School of Engineering Sciences (SCI), Mathematics (Dept.).
    Tembine, Hamidou
    Tempone, Raul
    A Stochastic Maximum Principle for Risk-Sensitive Mean-Field Type Control2015In: IEEE Transactions on Automatic Control, ISSN 0018-9286, E-ISSN 1558-2523, Vol. 60, no 10, p. 2640-2649Article in journal (Refereed)
    Abstract [en]

    In this paper we study mean-field type control problems with risk-sensitive performance functionals. We establish a stochastic maximum principle (SMP) for optimal control of stochastic differential equations (SDEs) of mean-field type, in which the drift and the diffusion coefficients as well as the performance functional depend not only on the state and the control but also on the mean of the distribution of the state. Our result extends the risk-sensitive SMP (without mean-field coupling) of Lim and Zhou (2005), derived for feedback (or Markov) type optimal controls, to optimal control problems for non-Markovian dynamics which may be time-inconsistent in the sense that the Bellman optimality principle does not hold. In our approach to the risk-sensitive SMP, the smoothness assumption on the valuefunction imposed in Lim and Zhou (2005) needs not be satisfied. For a general action space a Peng's type SMP is derived, specifying the necessary conditions for optimality. Two examples are carried out to illustrate the proposed risk-sensitive mean-field type SMP under linear stochastic dynamics with exponential quadratic cost function. Explicit solutions are given for both mean-field free and mean-field models.

  • 38.
    Doulgeri, Zoe
    et al.
    Department of Electrical and Computer Eng., Aristotle University of Thessaloniki.
    Karayiannidis, Yiannis
    Department of Electrical and Computer Eng., Aristotle University of Thessaloniki.
    Force/Position Regulation for a Robot in Compliant Contact Using Adaptive Surface Slope Identification2008In: IEEE Transactions on Automatic Control, ISSN 0018-9286, E-ISSN 1558-2523, Vol. 53, no 9, p. 2116-2122Article in journal (Refereed)
    Abstract [en]

    This work proposes a control law for the force position regulation problem under surface kinematic uncertainties. A compliant contact with friction is considered. The control law achieves exact regulation of force and position along the surface tangent by identifying the uncertain surface slope without any force, tactile and/or vision sensory requirements. The asymptotic stability of the closed loop system equilibrium point is proved in a local sense and is demonstrated by a simulation example.

  • 39.
    Farokhi, Farhad
    et al.
    KTH, School of Electrical Engineering (EES), Automatic Control. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.
    Johansson, Karl Henrik
    KTH, School of Electrical Engineering (EES), Automatic Control. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.
    Optimal control design under limited model information for discrete-time linear systems with stochastically-varying parameters2015In: IEEE Transactions on Automatic Control, ISSN 0018-9286, E-ISSN 1558-2523, Vol. 60, no 3, p. 684-699Article in journal (Refereed)
    Abstract [en]

    The value of plant model information available in the control design process is discussed. We design optimal state-feedback controllers for interconnected discrete-time linear systems with stochastically-varying parameters. The parameters are assumed to be independently and identically distributed random variables in time. The design of each controller relies only on (i) exact local plant model information and (ii) statistical beliefs about the model of the rest of the system. We consider both finite-horizon and infinite-horizon quadratic cost functions. The optimal state-feedback controller is derived in both cases. The optimal controller is shown to be linear in the state and to depend on the model parameters and their statistics in a particular way. Furthermore, we study the value of model information in optimal control design using the performance degradation ratio which is defined as the supremum (over all possible initial conditions) of the ratio of the cost of the optimal controller with limited model information scaled by the cost of the optimal controller with full model information. An upper bound for the performance degradation ratio is presented for the case of fully-actuated subsystems. Comparisons are made between designs based on limited, statistical, and full model information. Throughout the paper, we use a power network example to illustrate concepts and results.

  • 40.
    Farokhi, Farhad
    et al.
    KTH, School of Electrical Engineering (EES), Automatic Control. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.
    Johansson, Karl Henrik
    KTH, School of Electrical Engineering (EES), Automatic Control. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.
    Stochastic Sensor Scheduling for Networked Control Systems2014In: IEEE Transactions on Automatic Control, ISSN 0018-9286, E-ISSN 1558-2523, Vol. 59, no 5, p. 1147-1162Article in journal (Refereed)
    Abstract [en]

    Optimal sensor scheduling with applications to networked estimation and control systems is considered. We model sensor measurement and transmission instances using jumps between states of a continuous-time Markov chain. We introduce a cost function for this Markov chain as the summation of terms depending on the average sampling frequencies of the subsystems and the effort needed for changing the parameters of the underlying Markov chain. By minimizing this cost function through extending Brockett's recent approach to optimal control of Markov chains, we extract an optimal scheduling policy to fairly allocate the network resources among the control loops. We study the statistical properties of this scheduling policy in order to compute upper bounds for the closed-loop performance of the networked system, where several decoupled scalar subsystems are connected to their corresponding estimator or controller through a shared communication medium. We generalize the estimation results to observable subsystems of arbitrary order. Finally, we illustrate the developed results numerically on a networked system composed of several decoupled water tanks.

  • 41. Feng, Lei
    et al.
    Wonham, W. M.
    Supervisory control architecture for discrete-event systems2008In: IEEE Transactions on Automatic Control, ISSN 0018-9286, E-ISSN 1558-2523, Vol. 53, no 6, p. 1449-1461Article in journal (Refereed)
    Abstract [en]

    A flexible decentralized and hierarchical architecture is presented to reduce computational effort in designing optimal nonblocking supervisors for discrete-event systems (DES). We organize a DES into modular subsystems that embody internal interacting dependencies. Verification of, and coordination among modular subsystems are achieved through their model abstractions. Sufficient conditions are presented to guarantee that coordinators and modular supervisors result in maximally permissive and nonblocking control. A medium-sized example demonstrates the computational effectiveness of our approach.

  • 42.
    Feyzmahdavian, Hamid Reza
    et al.
    KTH, School of Electrical Engineering (EES), Automatic Control.
    Aytekin, Arda
    KTH, School of Electrical Engineering (EES), Automatic Control.
    Johansson, Mikael
    KTH, School of Electrical Engineering (EES), Automatic Control.
    Asynchronous Mini-Batch Algorithm for Regularized Stochastic Optimization2016In: IEEE Transactions on Automatic Control, ISSN 0018-9286, E-ISSN 1558-2523, ISSN 0018-9286Article in journal (Refereed)
    Abstract [en]

    Mini-batch optimization has proven to be a powerful paradigm for large-scale learning. However, the state of the art parallel mini–batch algorithms assume synchronous operation or cyclic update orders. When worker nodes are heterogeneous (due to different computational capabilities or different communication delays), synchronous and cyclic operations are inefficient since they will leave workers idle waiting for the slower nodes to complete their computations. In this paper, we propose an asynchronous mini-batch algorithm for regularized stochastic optimization problems with smooth loss functions that eliminates idle waiting and allows workers to run at their maximal update rates. We show that by suitably choosing the step-size values, the algorithm achieves a rate of the order O(1/ √ T) for general convex regularization functions, and the rate O(1/T ) for strongly convex regularization functions, where T is the number of iterations. In both cases, the impact of asynchrony on the convergence rate of our algorithm is asymptotically negligible, and a nearlinear speedup in the number of workers can be expected. Theoretical results are confirmed in real implementations on a distributed computing infrastructure.

  • 43.
    Feyzmahdavian, Hamid Reza
    et al.
    ABB Corp Res Ctr, S-72226 Vasteras, Sweden..
    Besselink, Bart
    Univ Groningen, Johann Bernoulli Inst Math & Comp Sci, NL-9712 CP Groningen, Netherlands..
    Johansson, Mikael
    KTH, School of Electrical Engineering and Computer Science (EECS), Centres, ACCESS Linnaeus Centre. KTH, School of Electrical Engineering and Computer Science (EECS), Intelligent systems, Decision and Control Systems (Automatic Control).
    Stability Analysis of Monotone Systems via Max-Separable Lyapunov Functions2018In: IEEE Transactions on Automatic Control, ISSN 0018-9286, E-ISSN 1558-2523, Vol. 63, no 3, p. 643-656Article in journal (Refereed)
    Abstract [en]

    We analyze stability properties of monotone nonlinear systems via max-separable Lyapunov functions, motivated by the following observations: first, recent results have shown that asymptotic stability of a monotone nonlinear system implies the existence of a max-separable Lyapunov function on a compact set; second, for monotone linear systems, asymptotic stability implies the stronger properties of D-stability and insensitivity to time delays. This paper establishes that for monotone nonlinear systems, equivalence holds between asymptotic stability, the existence of a max-separable Lyapunov function, D-stability, and insensitivity to bounded and unbounded time-varying delays. In particular, a new and general notion of D-stability for monotone nonlinear systems is discussed, and a set of necessary and sufficient conditions for delay-independent stability are derived. Examples show how the results extend the state of the art.

  • 44.
    Feyzmahdavian, Hamid Reza
    et al.
    KTH, School of Electrical Engineering (EES), Automatic Control.
    Charalambous, Themistoklis
    KTH, School of Electrical Engineering (EES), Automatic Control.
    Johansson, Mikael
    KTH, School of Electrical Engineering (EES), Automatic Control.
    Exponential Stability of Homogeneous Positive Systems of Degree One With Time-Varying Delays2014In: IEEE Transactions on Automatic Control, ISSN 0018-9286, E-ISSN 1558-2523, Vol. 59, no 6, p. 1594-1599Article in journal (Refereed)
    Abstract [en]

    While the asymptotic stability of positive linear systems in the presence of bounded time delays has been thoroughly investigated, the theory for nonlinear positive systems is considerably less well-developed. This paper presents a set of conditions for establishing delay-independent stability and bounding the decay rate of a significant class of nonlinear positive systems which includes positive linear systems as a special case. Specifically, when the time delays have a known upper bound, we derive necessary and sufficient conditions for exponential stability of (a) continuous-time positive systems whose vector fields are homogeneous and cooperative, and (b) discrete-time positive systems whose vector fields are homogeneous and order-preserving. We then present explicit expressions that allow us to quantify the impact of delays on the decay rate and show that the best decay rate of positive linear systems that our bounds provide can be found via convex optimization. Finally, we extend the results to general linear systems with time-varying delays.

  • 45.
    Feyzmahdavian, Hamid Reza
    et al.
    KTH, School of Electrical Engineering (EES), Automatic Control. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.
    Charalambous, Themistoklis
    KTH, School of Electrical Engineering (EES), Automatic Control. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.
    Johansson, Mikael
    KTH, School of Electrical Engineering (EES), Automatic Control. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.
    Stability and Performance of Continuous-Time Power Control in Wireless Networks2014In: IEEE Transactions on Automatic Control, ISSN 0018-9286, E-ISSN 1558-2523, Vol. 59, no 8, p. 2012-2023Article in journal (Refereed)
    Abstract [en]

    This paper develops a comprehensive stability analysis framework for general classes of continuous-time power control algorithms under heterogeneous time-varying delays. Our first set of results establish global asymptotic stability of power control laws involving two-sided scalable interference functions, and include earlier work on standard interference functions as a special case. We then consider contractive interference functions and demonstrate that the associated continuous-time power control laws always have unique fixed points which are exponentially stable, even under bounded heterogeneous time-varying delays. For this class of interference functions, we present explicit bounds on the decay rate that allow us to quantify the impact of delays on the convergence time of the algorithm. When interference functions are linear, we also prove that contractivity is necessary and sufficient for exponential stability of continuous-time power control algorithms with time-varying delays. Finally, numerical simulations illustrate the validity of our theoretical results.

  • 46.
    Fischione, Carlo
    KTH, School of Electrical Engineering (EES), Automatic Control. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.
    Fast-Lipschitz Optimization With Wireless Sensor Networks Applications2011In: IEEE Transactions on Automatic Control, ISSN 0018-9286, E-ISSN 1558-2523, Vol. 56, no 10, p. 2319-2331Article in journal (Refereed)
    Abstract [en]

    Motivated by the need for fast computations in wireless sensor networks, the new F-Lipschitz optimization theory is introduced for a novel class of optimization problems. These problems are defined by simple qualifying properties specified in terms of increasing objective function and contractive constraints. It is shown that feasible F-Lipschitz problems have always a unique optimal solution that satisfies the constraints at equality. The solution is obtained quickly by asynchronous algorithms of certified convergence. F-Lipschitz optimization can be applied to both centralized and distributed optimization. Compared to traditional Lagrangian methods, which often converge linearly, the convergence time of centralized F-Lipschitz problems is at least superlinear. Distributed F-Lipschitz algorithms converge fast, as opposed to traditional Lagrangian decomposition and parallelization methods, which generally converge slowly and at the price of many message passings. In both cases, the computational complexity is much lower than traditional Lagrangian methods. Examples of application of the new optimization method are given for distributed estimation and radio power control in wireless sensor networks. The drawback of the F-Lipschitz optimization is that it might be difficult to check the qualifying properties. For more general optimization problems, it is suggested that it is convenient to have conditions ensuring that the solution satisfies the constraints at equality.

  • 47.
    Fontan, Angela
    et al.
    Linköping Univ, Div Automat Control, Dept Elect Engn, SE-58183 Linköping, Sweden..
    Shi, Guodong
    Univ Sydney, Sch Aerosp Mech & Mechatron Engn, Australian Ctr Field Robot, Sydney, NSW 2008, Australia..
    Hu, Xiaoming
    KTH, School of Engineering Sciences (SCI), Mathematics (Dept.), Optimization and Systems Theory.
    Altafini, Claudio
    Linköping Univ, Div Automat Control, Dept Elect Engn, SE-58183 Linköping, Sweden..
    Interval Consensus for Multiagent Networks2020In: IEEE Transactions on Automatic Control, ISSN 0018-9286, E-ISSN 1558-2523, Vol. 65, no 5, p. 1855-1869Article in journal (Refereed)
    Abstract [en]

    The constrained consensus problem considered in this paper, denoted interval consensus, is characterized by the fact that each agent can impose a lower and upper bound on the achievable consensus value. Such constraints can be encoded in the consensus dynamics by saturating the values that an agent transmits to its neighboring nodes. We show in the paper that when the intersection of the intervals imposed by the agents is nonempty, the resulting constrained consensus problem must converge to a common value inside that intersection. In our algorithm, convergence happens in a fully distributed manner, and without need of sharing any information on the individual constraining intervals. When the intersection of the intervals is an empty set, the intrinsic nonlinearity of the network dynamics raises new challenges in understanding the node state evolution. Using Brouwer fixed-point theorem we prove that in that case there exists at least one equilibrium, and in fact the possible equilibria are locally stable if the constraints are satisfied or dissatisfied at the same time among all nodes. For graphs with sufficient sparsity it is further proven that there is a unique equilibrium that is globally attractive if the constraint intervals are pairwise disjoint.

  • 48.
    Galrinho, Miguel
    et al.
    KTH, School of Electrical Engineering and Computer Science (EECS), Intelligent systems, Decision and Control Systems (Automatic Control). KTH, School of Electrical Engineering and Computer Science (EECS), Centres, ACCESS Linnaeus Centre.
    Rojas, Cristian R.
    KTH, School of Electrical Engineering and Computer Science (EECS), Intelligent systems, Decision and Control Systems (Automatic Control). KTH, School of Electrical Engineering and Computer Science (EECS), Centres, ACCESS Linnaeus Centre.
    Hjalmarsson, Håkan
    KTH, School of Electrical Engineering and Computer Science (EECS), Centres, ACCESS Linnaeus Centre. KTH, School of Electrical Engineering and Computer Science (EECS), Intelligent systems, Decision and Control Systems (Automatic Control).
    Parametric Identification Using Weighted Null-Space Fitting2019In: IEEE Transactions on Automatic Control, ISSN 0018-9286, E-ISSN 1558-2523, Vol. 64, no 7, p. 2798-2813Article in journal (Refereed)
    Abstract [en]

    In identification of dynamical systems, the prediction error method with a quadratic cost function provides asymptotically efficient estimates under Gaussian noise, but in general it requires solving a nonconvex optimization problem, which may imply convergence to nonglobal minima. An alternative class of methods uses a nonparametric model as intermediate step to obtain the model of interest. Weighted null-space fitting (WNSF) belongs to this class, starting with the estimate of a nonparametric ARX model with least squares. Then, the reduction to a parametric model is a multistep procedure where each step consists of the solution of a quadratic optimization problem, which can be obtained with weighted least squares. The method is suitable for both open- and closed-loop data, and can be applied to many common parametric model structures, including output-error, ARMAX, and Box-Jenkins. The price to pay is the increase of dimensionality in the nonparametric model, which needs to tend to infinity as function of the sample size for certain asymptotic statistical properties to hold. In this paper, we conduct a rigorous analysis of these properties: namely, consistency, and asymptotic efficiency. Also, we perform a simulation study illustrating the performance of WNSF and identify scenarios where it can be particularly advantageous compared with state-of-the-art methods.

    Download full text (pdf)
    fulltext
  • 49.
    Gao, Yulong
    et al.
    KTH, School of Electrical Engineering and Computer Science (EECS), Intelligent systems, Decision and Control Systems (Automatic Control).
    Abate, Alessandro
    Department of Computer Science, University of Oxford, Oxford, United Kingdom, OX1 3QD .
    Jiang, Frank
    KTH, School of Electrical Engineering and Computer Science (EECS), Intelligent systems, Decision and Control Systems (Automatic Control).
    Giacobbe, Mirco
    Department of Computer Science, University of Oxford, Oxford, United Kingdom, OX1 3QD .
    Xie, Lihua
    School of Elect. & Electr. Eng., BLK S2, Nanyang Tech. Univ., Singapore, Singapore, Singapore, 639798.
    Johansson, Karl H.
    KTH, School of Electrical Engineering and Computer Science (EECS), Intelligent systems, Decision and Control Systems (Automatic Control).
    Temporal Logic Trees for Model Checking and Control Synthesis of Uncertain Discrete-time Systems2021In: IEEE Transactions on Automatic Control, ISSN 0018-9286, E-ISSN 1558-2523, p. 1-1Article in journal (Refereed)
    Abstract [en]

    We propose algorithms for performing model checking and control synthesis for discrete-time uncertain systems under linear temporal logic (LTL) specifications. We construct temporal logic trees (TLT) from LTL formulae via reachability analysis. In contrast to automaton-based methods, the construction of the TLT is abstraction-free for infinite systems, that is, we do not construct discrete abstractions of the infinite systems. Moreover, for a given transition system and an LTL formula, we prove that there exist both a universal TLT and an existential TLT via minimal and maximal reachability analysis, respectively. We show that the universal TLT is an underapproximation for the LTL formula and the existential TLT is an overapproximation. We provide sufficient conditions and necessary conditions to verify whether a transition system satisfies an LTL formula by using the TLT approximations. As a major contribution of this work, for a controlled transition system and an LTL formula, we prove that a controlled TLT can be constructed from the LTL formula via control-dependent reachability analysis. Based on the controlled TLT, we design an online control synthesis algorithm, under which a set of feasible control inputs can be generated at each time step. We also prove that this algorithm is recursively feasible. We illustrate the proposed methods for both finite and infinite systems and highlight the generality and online scalability with two simulated examples.

  • 50.
    Gao, Yulong
    et al.
    KTH, School of Electrical Engineering and Computer Science (EECS), Intelligent systems, Decision and Control Systems (Automatic Control).
    Johansson, Karl H.
    KTH, School of Electrical Engineering and Computer Science (EECS), Intelligent systems, Decision and Control Systems (Automatic Control).
    Xie, Lihua
    Nanyang Technol Univ, Sch Elect & Elect Engn, Singapore 639798, Singapore..
    Computing Probabilistic Controlled Invariant Sets2021In: IEEE Transactions on Automatic Control, ISSN 0018-9286, E-ISSN 1558-2523, Vol. 66, no 7, p. 3138-3151Article in journal (Refereed)
    Abstract [en]

    This article investigates stochastic invariance for control systems through probabilistic controlled invariant sets (PCISs). As a natural complement to robust controlled invariant sets (RCISs), we propose finite-, and infinite-horizon PCISs, and explore their relation to RICSs. We design iterative algorithms to compute the PCIS within a given set. For systems with discrete spaces, the computations of the finite-, and infinite-horizon PCISs at each iteration are based on linear programming, and mixed integer linear programming, respectively. The algorithms are computationally tractable, and terminate in a finite number of steps. For systems with continuous spaces, we show how to discretize the spaces, and prove the convergence of the approximation when computing the finite-horizon PCISs. In addition, it is shown that an infinite-horizon PCIS can be computed by the stochastic backward reachable set from the RCIS contained in it. These PCIS algorithms are applicable to practical control systems. Simulations are given to illustrate the effectiveness of the theoretical results for motion planning.

12345 1 - 50 of 246
CiteExportLink to result list
Permanent link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf