arXiv subjects

Frank Allgöwer

Publications and source records attributed to Frank Allgöwer.

At least 181 records · Page 10Linked to original sources

arXiv2016

Fekete points, formation control, and the balancing problem

We study formation control problems. Our approach is to let a group of systems maximize their pairwise distances whilst bringing them all to a given submanifold, determining the shape of the formation. The algorithm we propose allows to initialize the positions of the individual systems in the ambient space of the given submanifold but brings them to the desired formation asymptotically in a stable fashion. Our control inherently consists of a distributed component, maximizing the pairwise distances, and a decentralized component, asymptotically stabilizing the submanifold. We establish a graph-theoretical interpretation of the equilibria that our control enforces and extend our approach to systems living on the special Euclidean group. Throughout the paper, we illustrate our approach on different examples.

math.OC↗

arXiv2016

Geometric stability considerations of the ribosome flow model with pool

In order to better understand the process of gene translation, the ribosome flow model (RFM) with pool was introduced recently. This model describes the movement of several ribosomes along an mRNA template and simultaneously captures the dynamics of the finite pool of ribosomes. Studying this system with respect to the number and stability of its equilibria was so far based on monotone systems theory (Margaliot and Tuller, 2012). We extend the results obtained therein by using a geometric approach, showing that the equilibria of the system constitute a normally hyperbolic invariant submanifold. Subsequently, we analyze the Jacobi linearization of the system evaluated at the equilibria in order to show that the equilibria are asymptotically stable relative to certain affine subspaces. As this approach does not require any monotonicity features of the system, it may also be applied for more complex systems of the same kind such as bi-directional ribosome flows or time-varying template numbers.

q-bio.SC↗

arXiv2016

A resource dependent protein synthesis model for evaluating synthetic circuits

Reliable in-silico design of synthetic gene networks necessitates novel approaches to model the process of protein synthesis under the influence of limited resources. We present such a novel protein synthesis model which originates from the Ribosome Flow Model and among other things describes the movement of RNA-polymerase and Ribosomes on mRNA and DNA templates respectively. By analyzing the convergence properties of this model based upon geometric considerations we present additional insights into the dynamic mechanisms of the process of protein synthesis. Further, we exemplarily show how this model can be used to evaluate the performance of synthetic gene circuits under different loading scenarios.

q-bio.MN↗

arXiv2016

Structured Optimal Feedback in Multi-Agent Systems: A Static Output Feedback Perspective

In this paper we demonstrate how certain structured feedback gains necessarily emerge as the optimal controller gains in two linear optimal control formulations for multi-agent systems. We consider the cases of linear optimal synchronization and linear optimal centroid stabilization. In the former problem, the considered cost functional integrates squared synchronization error and input, and in the latter, the considered cost functional integrates squared sum of the states and input. Our approach is to view the structures in the feedback gains in terms of a static output feedback with suitable output matrices and to relate this fact with the optimal control formulations. We show that the two considered problems are special cases of a more general case in which the optimal feedback to a linear quadratic regulator problem with cost functionals integrating squared outputs and inputs is a static output feedback. A treatment in this light leads to a very simple and general solution which significantly generalizes a recent result for the linear optimal synchronization problem. We illustrate the general problem in a geometric light.

math.OC↗

arXiv2016

Stochastic MPC with Offline Uncertainty Sampling

For discrete-time linear systems subject to parametric uncertainty described by random variables, we develop a sampling-based Stochastic Model Predictive Control algorithm. Unlike earlier results employing a scenario approximation, we propose an offline sampling approach in the design phase instead of online scenario generation. The paper highlights the structural difference between online and offline sampling and provides rigorous bounds on the number of samples needed to guarantee chance constraint satisfaction. The approach does not only significantly speed up the online computation, but furthermore allows to suitably tighten the constraints to guarantee robust recursive feasibility when bounds on the uncertain variables are provided. Under mild assumptions, asymptotic stability of the origin can be established.

eess.SY↗

arXiv2016

Constraint-Tightening and Stability in Stochastic Model Predictive Control

Constraint tightening to non-conservatively guarantee recursive feasibility and stability in Stochastic Model Predictive Control is addressed. Stability and feasibility requirements are considered separately, highlighting the difference between existence of a solution and feasibility of a suitable, a priori known candidate solution. Subsequently, a Stochastic Model Predictive Control algorithm which unifies previous results is derived, leaving the designer the option to balance an increased feasible region against guaranteed bounds on the asymptotic average performance and convergence time. Besides typical performance bounds, under mild assumptions, we prove asymptotic stability in probability of the minimal robust positively invariant set obtained by the unconstrained LQ-optimal controller. A numerical example, demonstrating the efficacy of the proposed approach in comparison with classical, recursively feasible Stochastic MPC and Robust MPC, is provided.

eess.SY↗

arXiv2016

Distributed Nonlinear Observer with Robust Performance - A Circle Criterion Approach

In this paper, we present a distributed version of the KYP-Lemma with the goal to express the strictly positive real-property for a class of physically interconnected systems by a set of local LMI-conditions. The resulting conditions are subsequently used to constructively design distributed circle criterion estimators, which are able to collectively estimate an underlying linear system with a sector bounded nonlinearity.

eess.SY↗

arXiv2015

Cooperative Estimation for Synchronization of Heterogeneous Multi-Agent Systems Using Relative Information

In this paper, we present a distributed estimation setup where local agents estimate their states from relative measurements received from their neighbours. In the case of heterogeneous multi-agent systems, where only relative measurements are available, this is of high relevance. The objective is to improve the scalability of the existing distributed estimation algorithms by restricting the agents to estimating only their local states and those of immediate neighbours. The presented estimation algorithm also guarantees robust performance against model and measurement disturbances. It is shown that it can be integrated into output synchronization algorithms.

eess.SY↗

arXiv2015

Distributed Filter Design for Cooperative H-Infinity-Type Estimation

In this paper, we consider the distributed robust filtering problem, where estimator design is based on a set of coupled linear matrix inequalities (LMIs). We separate the problem and show that the method of multipliers can be applied to obtain a solution efficiently and in a decentralized fashion, i.e. all local estimators can compute their filter gains locally and iteratively, with communications restricted to their neighbours. The convergence properties of the iterative algorithm are analyzed and interpreted.

eess.SY↗

arXiv2015

Cooperative H-infinity Estimation for Large-Scale Interconnected Linear Systems

In this paper, a synthesis method for distributed estimation is presented, which is suitable for dealing with large-scale interconnected linear systems with disturbance. The main feature of the proposed method is that local estimators only estimate a reduced set of state variables and their complexity does not increase with the size of the system. Nevertheless, the local estimators are able to deal with lack of local detectability. Moreover, the estimators guarantee H-infinity-performance of the estimates with respect to model and measurement disturbances.

eess.SY↗

arXiv2014

An Improved Constraint-Tightening Approach for Stochastic MPC

The problem of achieving a good trade-off in Stochastic Model Predictive Control between the competing goals of improving the average performance and reducing conservativeness, while still guaranteeing recursive feasibility and low computational complexity, is addressed. We propose a novel, less restrictive scheme which is based on considering stability and recursive feasibility separately. Through an explicit first step constraint we guarantee recursive feasibility. In particular we guarantee the existence of a feasible input trajectory at each time instant, but we only require that the input sequence computed at time $k$ remains feasible at time $k+1$ for most disturbances but not necessarily for all, which suffices for stability. To overcome the computational complexity of probabilistic constraints, we propose an offline constraint-tightening procedure, which can be efficiently solved via a sampling approach to the desired accuracy. The online computational complexity of the resulting Model Predictive Control (MPC) algorithm is similar to that of a nominal MPC with terminal region. A numerical example, which provides a comparison with classical, recursively feasible Stochastic MPC and Robust MPC, shows the efficacy of the proposed approach.

math.OC↗

arXiv2014

Cooperative Control of Linear Multi-Agent Systems via Distributed Output Regulation and Transient Synchronization

A wide range of multi-agent coordination problems including reference tracking and disturbance rejection requirements can be formulated as a cooperative output regulation problem. The general framework captures typical problems such as output synchronization, leader-follower synchronization, and many more. In the present paper, we propose a novel distributed regulator for groups of identical and non-identical linear agents. We consider global external signals affecting all agents and local external signals affecting only individual agents in the group. Both signal types may contain references and disturbances. Our main contribution is a novel coupling among the agents based on their transient state components or estimates thereof in the output feedback case. This coupling achieves transient synchronization in order to improve the cooperative behavior of the group in transient phases and guarantee a desired decay rate of the synchronization error. This leads to a cooperative reaction of the group on local disturbances acting on individual agents. The effectiveness of the proposed distributed regulator is illustrated by a vehicle platooning example and a coordination example for a group of four non-identical 3-DoF helicopter models.

eess.SY↗

arXiv2014

Optimal pricing control in distribution networks with time-varying supply and demand

This paper studies the problem of optimal flow control in dynamic inventory systems. A dynamic optimal distribution problem, including time-varying supply and demand, capacity constraints on the transportation lines, and convex flow cost functions of Legendre-type, is formalized and solved. The time-varying optimal flow is characterized in terms of the time-varying dual variables of a corresponding network optimization problem. A dynamic feedback controller is proposed that regulates the flows asymptotically to the optimal flows and achieves in addition a balancing of all storage levels.

math.OC↗

arXiv2014

Generalization of the construction method for multistability-equivalent gene regulatory networks to systems with multi-input multi-output loopbreaking

The problem of equivalence in terms of multistability properties between gene regulatory network models of different dimensionality has been recently addressed by Schittler et al. (2013). The authors in that work proposed construction rules for a high-dimensional dynamical system, when given a low-dimensional dynamical system and the high-dimensional network structure. However, the proof therein was restricted to the class of systems for which all internal feedback loops can be broken by a loopbreaking approach yielding a single-input single-output (SISO) system. In this report, we present the generalization of the proof to systems with any number of internal feedback loops, which will be broken by a generalized loopbreaking approach resulting in a multi-input multi-output (MIMO) system. This generalization of the method renders the construction method applicable to a broad class of gene regulatory network models, thus promoting the transfer of results from core motif models to more realistic, high-dimensional models of gene regulation. We demonstrate the potential and value of our method by applying it to an example of a gene regulatory network in mesenchymal stem cell differentiation.

math.DS↗

arXiv2013

Duality and Network Theory in Passivity-based Cooperative Control

This paper presents a class of passivity-based cooperative control problems that have an explicit connection to convex network optimization problems. The new notion of maximal equilibrium independent passivity is introduced and it is shown that networks of systems possessing this property asymptotically approach the solutions of a dual pair of network optimization problems, namely an optimal potential and an optimal flow problem. This connection leads to an interpretation of the dynamic variables, such as system inputs and outputs, to variables in a network optimization framework, such as divergences and potentials, and reveals that several duality relations known in convex network optimization theory translate directly to passivity-based cooperative control problems. The presented results establish a strong and explicit connection between passivity-based cooperative control theory on the one side and network optimization theory on the other, and they provide a unifying framework for network analysis and optimal design. The results are illustrated on a nonlinear traffic dynamics model that is shown to be asymptotically clustering.

math.OC↗

arXiv2013

On the differential equation $\dotΘ=(Θ^{T}-Θ)Θ$ with $Θ\in{SO(n)}$

In this note we consider the global convergence properties of the differential equation $\dotΘ=(Θ^{T}-Θ)Θ$ with $Θ\in{SO(n)}$, which is a gradient flow of the function $f:SO(n)\rightarrow\mathbb{R},Θ\mapsto{2n-2\trΘ}$. Many of the presented results are not new, but scattered throughout literature. The motivation of this note is to summarize and extend the convergence results known from literature. Rather than giving an exhaustive list of references, the results are presented in a self-contained fashion.

math.CA↗

arXiv2013

A Polyhedral Approximation Framework for Convex and Robust Distributed Optimization

In this paper we consider a general problem set-up for a wide class of convex and robust distributed optimization problems in peer-to-peer networks. In this set-up convex constraint sets are distributed to the network processors who have to compute the optimizer of a linear cost function subject to the constraints. We propose a novel fully distributed algorithm, named cutting-plane consensus, to solve the problem, based on an outer polyhedral approximation of the constraint sets. Processors running the algorithm compute and exchange linear approximations of their locally feasible sets. Independently of the number of processors in the network, each processor stores only a small number of linear constraints, making the algorithm scalable to large networks. The cutting-plane consensus algorithm is presented and analyzed for the general framework. Specifically, we prove that all processors running the algorithm agree on an optimizer of the global problem, and that the algorithm is tolerant to node and link failures as long as network connectivity is preserved. Then, the cutting plane consensus algorithm is specified to three different classes of distributed optimization problems, namely (i) inequality constrained problems, (ii) robust optimization problems, and (iii) almost separable optimization problems with separable objective functions and coupling constraints. For each one of these problem classes we solve a concrete problem that can be expressed in that framework and present computational results. That is, we show how to solve: position estimation in wireless sensor networks, a distributed robust linear program and, a distributed microgrid control problem.

eess.SY↗

arXiv2012

Network-level dynamics of diffusively coupled cells

We study molecular dynamics within populations of diffusively coupled cells under the assumption of fast diffusive exchange. As a technical tool, we propose conditions on boundedness and ultimate boundedness for systems with a singular perturbation, which extend the classical asymptotic stability results for singularly perturbed systems. Based on these results, we show that with common models of intracellular dynamics, the cell population is coordinated in the sense that all cells converge close to a common equilibrium point. We then study a more specific example of coupled cells which behave as bistable switches, where the intracellular dynamics are such that cells may be in one of two equilibrium points. Here, we find that the whole population is bistable in the sense that it converges to a population state where either all cells are close to the one equilibrium point, or all cells are close to the other equilibrium point. Finally, we discuss applications of these results for the robustness of cellular decision making in coupled populations.

q-bio.CB↗