Search

We consider the design of a new class of passive iFIR controllers given by the parallel action of an integrator and a finite impulse response filter. iFIRs are more expressive than PID controllers but retain their features and simplicity. The paper provides a model-free data-driven design for passive iFIR controllers based on virtual reference feedback tuning. Passivity is enforced through constrained optimization (three different formulations are discussed). The proposed design does not rely on large datasets or accurate plant models., Comment: 6 pages, 7 figures, Accepted by IEEE Control Systems Letters (L-CSS) with the option to present it to 2024 Conference on Decision and Control (CDC 2024)

Following the seminal work of Zames, the input-output theory of the 70s acknowledged that incremental properties (e.g. incremental gain) are the relevant quantities to study in nonlinear feedback system analysis. Yet, non-incremental analysis has dominated the use of dissipativity theory in nonlinear control from the 80s. Results connecting dissipativity theory and incremental analysis are scattered and progress has been limited. This abstract investigates whether this theoretical gap is of fundamental nature and considers new avenues to circumvent it., Comment: To be presented at MTNS 2022

We discuss the role of monotonicity in enabling numerically tractable modular control design for networked nonlinear systems. We first show that the variational systems of monotone systems can be embedded into positive systems. Utilizing this embedding, we show how to solve a network stabilization problem by enforcing monotonicity and exponential dissipativity of the network sub-components. Such modular approach leads to a design algorithm based on a sequence of linear programming problems.

We provide novel dissipativity conditions for bounding the incremental L-1 gain of systems. Moreover, we adapt existing results on the L-infinity gain to the incremental setting and relate the incremental L-1 and L-infinity gain bounds through system adjoints. Building on work on optimization based approaches to constructing polyhedral Lyapunov functions, we make use of these conditions to obtain a Linear Programming based algorithm that can provide increasingly sharp bounds on the gains as a function of a given candidate polyhedral storage function or polyhedral set. The algorithm is also extended to allow for the design of linear feedback controllers for performance, as measured by the bounds on the incremental gains. We apply the algorithm to a couple of numerical examples to illustrate the power, as well as some limitations, of this approach.

We present a design framework to induce stable oscillations through mixed feedback control. We provide conditions on the feedback gain and on the balance between positive and negative feedback contributions to guarantee robust oscillations. Using linear matrix inequalities, we later derive a systematic design for robustness to bounded dynamic uncertainties and for passive interconnections. The results of the paper provide a system-theoretic justification to several observations from system biology and neuroscience pointing at the mixed feedback as a fundamental enabler for robust oscillations. Our results are illustrated through a distributed electrical circuit mimicking (simplified) neural dynamics.

We use the recently introduced concept of a Scaled Relative Graph (SRG) to develop a graphical analysis of input-output properties of feedback systems. The SRG of a nonlinear operator generalizes the Nyquist diagram of an LTI system. In the spirit of classical control theory, important robustness indicators of nonlinear feedback systems are measured as distances between SRGs., Comment: This work has been submitted to the IEEE for possible publication. Copyright may be transferred without notice, after which this version may no longer be accessible

Scaled relative graphs were recently introduced to analyze the convergence of optimization algorithms using two dimensional Euclidean geometry. In this paper, we connect scaled relative graphs to the classical theory of input/output systems. It is shown that the Nyquist diagram of an LTI system on $L_2$ is the convex hull of its scaled relative graph under a particular change of coordinates. The SRG may be used to visualize approximations of static nonlinearities such as the describing function and quadratic constraints, allowing system properties to be verified or disproved. Interconnections of systems correspond to graphical manipulations of their SRGs. This is used to provide a simple, graphical proof of the classical incremental passivity theorem., Comment: Accepted to the 2021 IEEE Conference on Decision and Control

Polyhedral Lyapunov functions can approximate any norm arbitrarily well. Because of this, they are used to study the stability of linear time varying and linear parameter varying systems without being conservative. However, the computational cost associated with using them grows unbounded as the size of their representation increases. Finding them is also a hard computational problem. Here we present an algorithm that attempts to find polyhedral functions while keeping the size of the representation fixed, to limit computational costs. We do this by measuring the gap from contraction for a given polyhedral set. The solution is then used to find perturbations on the polyhedral set that reduce the contraction gap. The process is repeated until a valid polyhedral Lyapunov function is obtained. The approach is rooted in linear programming. This leads to a flexible method capable of handling additional linear constraints and objectives, and enables the use of the algorithm for control synthesis.

The interplay of positive and negative feedback loops on different time scales appears to be a fundamental mechanisms for robust and tunable oscillations in both biological systems and electro-mechanical systems. We develop a detailed analysis of a basic three dimensional Lure model to show how controlled oscillations arise from the tuning of positive and negative feedback strengths. Our analysis is based on dominance theory and confirms, from a system-theoretic perspective, that the mixed feedback is a fundamental enabler of robust oscillations. Our results are not limited to three dimensional systems and extend to larger systems via passivity theory, and to uncertain systems via small gain arguments., Comment: Submitted to European Control Conference 2021

The paper presents a model reduction framework geared towards the analysis and design of systems that switch and oscillate. While such phenomena are ubiquitous in nature and engineering, model reduction methods are not well developed for non-equilibrium behaviors. The proposed framework addresses this need by exploiting recent advances on dominance theory. Classical balanced truncation for linear time-invariant systems is used to develop a dominance-preserving model reduction method for Lure systems, i.e. systems that can be decomposed as the feedback interconnection of a linear system and a static nonlinearity. The method is illustrated by approximating the oscillatory behavior of a discretized heat flow control system., Comment: 6 pages, 6 figures, submitted to the IFAC World Congress 2020

Systems whose variable are constrained to be positive allow computationally efficient control design. We generalize these results to linear systems which leave a cone invariant. This is a wider class of systems than positive systems. We revisit classical results on stability and dissipativity of positive linear systems and show how scalable conditions on linear programming can be extended to cone invariant linear systems. Our results are illustrated by scalable stabilizing controller design for mass-spring systems.

Differential positivity and K-cooperativity, a special case of differential positivity, extend differential approaches to control to nonlinear systems with multiple equilibria, such as switches or multi-agent consensus. To apply this theory, we reframe conditions for strict K-cooperativity as an optimization problem. Geometrically, the conditions correspond to finding a cone that a set of linear operators leave invariant. Even though solving the optimization problem is hard, we combine the optimization perspective with the geometric intuition to construct a heuristic cone-finding algorithm centered around Linear Programming (LP). The algorithm we obtain is unique in that it modifies existing rays of a candidate cone instead of adding new ones. This enables us to also take a first step in tackling the synthesis problem for K-cooperative systems. We demonstrate our approach on some examples, including one in which we repurpose our algorithm to obtain a novel alternative tool for computing polyhedral Lyapunov functions of bounded complexity., Comment: 8 pages, to be presented in the 21st IFAC World Congress

The differential $\mathcal{L}_{2,p}$ gain of a linear, time-invariant, $p$-dominant system is shown to coincide with the $\mathcal{H}_{\infty,p}$ norm of its transfer function $G$, defined as the essential supremum of the absolute value of $G$ over a vertical strip in the complex plane such that $p$ poles of $G$ lie to right of the strip. The close analogy between the $\mathcal{H}_{\infty,p}$ norm and the classical $\mathcal{H}_{\infty}$ norm suggests that robust dominance of linear systems can be studied along the same lines as robust stability. This property can be exploited in the analysis and design of nonlinear uncertain systems that can be decomposed as the feedback interconnection of a linear, time-invariant system with bounded gain uncertainties or nonlinearities., Comment: 6 pages, 3 figures, 58th IEEE Conf. Decision and Control

This paper deals with the analysis of nonlinear circuits that interconnect passive elements (capacitors, inductors, and resistors) with nonlinear resistors exhibiting a range of $\it{negative}$ resistance. Such active elements are necessary to design circuits that switch and oscillate. We generalize the classical passivity theory of circuit analysis to account for such non-equilibrium behaviors. The approach closely mimics the classical methodology of (incremental) dissipativity theory, but with dissipation inequalities that combine $\it{signed}$ storage functions and $\it{signed}$ supply rates to account for the mixture of passive and active elements.

The paper introduces notions of robustness margins geared towards the analysis and design of systems that switch and oscillate. While such phenomena are ubiquitous in nature and in engineering, a theory of robustness for behaviors away from equilibria is lacking. The proposed framework addresses this need in the framework of p-dominance theory, which aims at generalizing stability theory for the analysis of systems with low-dimensional attractors. Dominance margins are introduced as natural generalisations of stability margins in the context of p-dominance analysis. In analogy with stability margins, dominance margins are shown to admit simple interpretations in terms of familiar frequency domain tools and to provide quantitative measures of robustness for multistable and oscillatory behaviors in Lure systems. The theory is illustrated by means of an elementary mechanical example., Comment: 11th IFAC Symposium on Nonlinear Control Systems

We design and test a cone finding algorithm to robustly address nonlinear system analysis through differential positivity. The approach provides a numerical tool to study multi-stable systems, beyond Lyapunov analysis. The theory is illustrated on two examples: a consensus problem with some repulsive interactions and second order agent dynamics, and a controlled duffing oscillator., Comment: 6 pages, to be presented in the 58th IEEE Conference on Decision and Control (CDC)

The notion of path-complete $p$-dominance for switching linear systems (in short, path-dominance) is introduced as a way to generalize the notion of dominant/slow modes for LTI systems. Path-dominance is characterized by the contraction property of a set of quadratic cones in the state space. We show that path-dominant systems have a low-dimensional dominant behavior, and hence allow for a simplified analysis of their dynamics. An algorithm for deciding the path-dominance of a given system is presented., Comment: 6 pages, 5 figures, to be presented at IEEE Conference on Decision and Control 2018

High-dimensional systems that have a low-dimensional dominant behavior allow for model reduction and simplified analysis. We use differential analysis to formalize this important concept in a nonlinear setting. We show that dominance can be studied through linear dissipation inequalities and an interconnection theory that closely mimics the classical analysis of stability by means of dissipativity theory. In this approach, stability is seen as the limiting situation where the dominant behavior is 0-dimensional. The generalization opens novel tractable avenues to study multistability through 1-dominance and limit cycle oscillations through 2-dominance., Comment: 11 pages, 7 figures, IEEE Transaction of Automatic control

We revisit the classical dissipativity theorem of linear-quadratic theory in a generalized framework where the quadratic storage is negative definite in a p-dimensional subspace and positive definite in a complementary subspace. The classical theory assumes p = 0 and provides an inter- connection theory for stability analysis, i.e. convergence to a zero dimensional attractor. The generalized theory is shown to provide an interconnection theory for p-dominance analysis, i.e. convergence to a p-dimensional dominant subspace. In turn, this property is the differential characterization of a generalized contraction property for nonlinear systems. The proposed generalization opens a novel avenue for the analysis of interconnected systems with low-dimensional attractors., Comment: 6 pages, 2 figures, in 56th IEEE Conference on Decision and Control (CDC 2017)

The notion of path-complete positivity is introduced as a way to generalize the property of positivity from one LTI system to a family of switched LTI systems whose switching rule is constrained by a finite automaton. The generalization builds upon the analogy between stability and positivity, the former referring to the contraction of a norm, the latter referring to the contraction of a cone (or, equivalently, a projective norm). We motivate and investigate the potential of path-positivity and we propose an algorithm for the automatic verification of positivity., Comment: 7 pages