Searcharxiv⌕ Search

arXiv subjects

Anton V. Proskurnikov

Publications and source records attributed to Anton V. Proskurnikov.

At least 37 records · Page 2Linked to original sources

Output corridor control via design of impulsive Goodwin's oscillator

In the Impulsive Goodwin's oscillator (IGO), a continuous positive linear time-invariant (LTI) plant is controlled by an amplitude- and frequency-modulated feedback into an oscillating solution. Self-sustained oscillations in the IGO model have been extensively used to portray periodic rhythms in endocrine systems, whereas the potential of the concept as a controller design approach still remains mainly unexplored. This paper proposes an algorithm to design the feedback of the IGO so that the output of the continuous plant is kept (at stationary conditions) within a pre-defined corridor, i.e. within a bounded interval of values. The presented framework covers single-input single-output LTI plants as well as positive Wiener and Hammerstein models that often appear in process and biomedical control. A potential application of the developed impulsive control approach to a minimal Wiener model of pharmacokinetics and pharmacodynamics of a muscle relaxant used in general anesthesia is discussed.

math.OC↗

On the Benefit of Nonlinear Control for Robust Logarithmic Growth: Coin Flipping Games as a Demonstration Case

The takeoff point for this paper is the voluminous body of literature addressing recursive betting games with expected logarithmic growth of wealth being the performance criterion. Whereas almost all existing papers involve use of linear feedback, the use of nonlinear control is conspicuously absent. This is epitomized by the large subset of this literature dealing with Kelly Betting. With this as the high-level motivation, we study the potential for use of nonlinear control in this framework. To this end, we consider a ``demonstration case'' which is one of the simplest scenarios encountered in this line of research: repeated flips of a biased coin with probability of heads~$p$, and even-money payoff on each flip. First, we formulate a new robust nonlinear control problem which we believe is both simple to understand and apropos for dealing with concerns about distributional robustness; i.e., instead of assuming that~$p$ is perfectly known as in the case of the classical Kelly formulation, we begin with a bounding set ~${\cal P} \subseteq [0,1]$ for this probability. Then, we provide a theorem, our main result, which gives a closed-form description of the optimal robust nonlinear controller and a corollary which establishes that it robustly outperforms linear controllers such as those found in the literature. A second, less significant, contribution of this paper bears upon the computability of our solution. For an $n$-flip game, whereas an admissible controller has~$2^n-1$ parameters, at the optimum only~$O(n^2)$ of them turn out to be distinct. Finally, it is noted that the initial assumptions on payoffs and the use of the uniform distribution on~$p$ are made solely for simplicity of the exposition and compliance with length requirements for a Letter. Accordingly, the paper also includes a new section with a discussion indicating how these assumptions can be relaxed.

math.OC↗

Design of the Impulsive Goodwin's Oscillator: A Case Study

The impulsive Goodwin's oscillator (IGO) is a hybrid model composed of a third-order continuous linear part and a pulse-modulated feedback. This paper introduces a design problem of the IGO to admit a desired periodic solution. The dynamics of the continuous states represent the plant to be controlled, whereas the parameters of the impulsive feedback constitute design degrees of freedom. The design objective is to select the free parameters so that the IGO exhibits a stable 1-cycle with desired characteristics. The impulse-to-impulse map of the oscillator is demonstrated to always possess a positive fixed point that corresponds to the desired periodic solution; the closed-form expressions to evaluate this fixed point are provided. Necessary and sufficient conditions for orbital stability of the 1-cycle are presented in terms of the oscillator parameters and exhibit similarity to the problem of static output control. An IGO design procedure is proposed and validated by simulation. The nonlinear dynamics of the designed IGO are reviewed by means of bifurcation analysis. Applications of the design procedure to dosing problems in chemical industry and biomedicine are envisioned.

eess.SY↗

Cycles in Impulsive Goodwin's Oscillators of Arbitrary Order

Existence of periodical solutions, i.e. cycles, in the Impulsive Goodwin's Oscillator (IGO) with the continuous part of an arbitrary order m is considered. The original IGO with a third-order continuous part is a hybrid model that portrays a chemical or biochemical system composed of three substances represented by their concentrations and arranged in a cascade. The first substance in the chain is introduced via an impulsive feedback where both the impulse frequency and weights are modulated by the measured output of the continuous part. It is shown that, under the standard assumptions on the IGO, a positive periodic solution with one firing of the pulse-modulated feedback in the least period also exists in models with any m >= 1. Furthermore, the uniqueness of this 1-cycle is proved for the IGO with m <= 10 whereas, for m > 10, the uniqueness can still be guaranteed under mild assumptions on the frequency modulation function.

math.OC↗

The Yakubovich S-Lemma Revisited: Stability and Contractivity in Non-Euclidean Norms

The celebrated S-Lemma was originally proposed to ensure the existence of a quadratic Lyapunov function in the Lur'e problem of absolute stability. A quadratic Lyapunov function is, however, nothing else than a squared Euclidean norm on the state space (that is, a norm induced by an inner product). A natural question arises as to whether squared non-Euclidean norms $V(x)=\|x\|^2$ may serve as Lyapunov functions in stability problems. This paper presents a novel non-polynomial S-Lemma that leads to constructive criteria for the existence of such functions defined by weighted $\ell_p$ norms. Our generalized S-Lemma leads to new absolute stability and absolute contractivity criteria for Lur'e-type systems, including, for example, a new simple proof of the Aizerman and Kalman conjectures for positive Lur'e systems.

math.OC↗

Reaching optimal distributed estimation through myopic self-confidence adaptation

Consider discrete-time linear distributed averaging dynamics, whereby agents in a network start with uncorrelated and unbiased noisy measurements of a common underlying parameter (state of the world) and iteratively update their estimates following a non-Bayesian rule. Specifically, let every agent update her estimate to a convex combination of her own current estimate and those of her neighbors in the network. As a result of this iterative averaging, each agent obtains an asymptotic estimate of the state of the world, and the variance of this individual estimate depends on the matrix of weights the agents assign to self and to the others. We study a game-theoretic multi-objective optimization problem whereby every agent seeks to choose her self-weight in such a convex combination in a way to minimize the variance of her asymptotic estimate of the state of the unknown parameters. Assuming that the relative influence weights assigned by the agents to their neighbors in the network remain fixed and form an irreducible and aperiodic relative influence matrix, we characterize the Pareto frontier of the problem, as well as the set of Nash equilibria in the resulting game.

math.OC↗

Non-Euclidean Monotone Operator Theory with Applications to Recurrent Neural Networks

We provide a novel transcription of monotone operator theory to the non-Euclidean finite-dimensional spaces $\ell_1$ and $\ell_{\infty}$. We first establish properties of mappings which are monotone with respect to the non-Euclidean norms $\ell_1$ or $\ell_{\infty}$. In analogy with their Euclidean counterparts, mappings which are monotone with respect to a non-Euclidean norm are amenable to numerous algorithms for computing their zeros. We demonstrate that several classic iterative methods for computing zeros of monotone operators are directly applicable in the non-Euclidean framework. We present a case-study in the equilibrium computation of recurrent neural networks and demonstrate that casting the computation as a suitable operator splitting problem improves convergence rates.

math.OC↗

Control of Dynamic Financial Networks (The Extended Version)

The current global financial system forms a highly interconnected network where a default in one of its nodes can propagate to many other nodes, causing a catastrophic avalanche effect. In this paper we consider the problem of reducing the financial contagion by introducing some targeted interventions that can mitigate the cascaded failure effects. We consider a multi-step dynamic model of clearing payments and introduce an external control term that represents corrective cash injections made by a ruling authority. The proposed control model can be cast and efficiently solved as a linear program. We show via numerical examples that the proposed approach can significantly reduce the default propagation by applying small targeted cash injections.

math.OC↗

Clearing Payments in Dynamic Financial Networks

This paper proposes a novel dynamical model for determining clearing payments in financial networks. We extend the classical Eisenberg-Noe model of financial contagion to multiple time periods, allowing financial operations to continue after possible initial pseudo defaults, thus permitting nodes to recover and eventually fulfil their liabilities. Optimal clearing payments in our model are computed by solving a suitable linear program, both in the full matrix payments case and in the pro-rata constrained case. We prove that the proposed model obeys the \emph{priority of debt claims} requirement, that is, each node at every step either pays its liabilities in full, or it pays out all its balance. In the pro-rata case, the optimal dynamic clearing payments are unique, and can be determined via a time-decoupled sequential optimization approach.

math.OC↗

Robust Implicit Networks via Non-Euclidean Contractions

Implicit neural networks, a.k.a., deep equilibrium networks, are a class of implicit-depth learning models where function evaluation is performed by solving a fixed point equation. They generalize classic feedforward models and are equivalent to infinite-depth weight-tied feedforward networks. While implicit models show improved accuracy and significant reduction in memory consumption, they can suffer from ill-posedness and convergence instability. This paper provides a new framework, which we call Non-Euclidean Monotone Operator Network (NEMON), to design well-posed and robust implicit neural networks based upon contraction theory for the non-Euclidean norm $\ell_{\infty}$. Our framework includes (i) a novel condition for well-posedness based on one-sided Lipschitz constants, (ii) an average iteration for computing fixed-points, and (iii) explicit estimates on input-output Lipschitz constants. Additionally, we design a training problem with the well-posedness condition and the average iteration as constraints and, to achieve robust models, with the input-output Lipschitz constant as a regularizer. Our $\ell_{\infty}$ well-posedness condition leads to a larger polytopic training search space than existing conditions and our average iteration enjoys accelerated convergence. Finally, we evaluate our framework in image classification through the MNIST and the CIFAR-10 datasets. Our numerical results demonstrate improved accuracy and robustness of the implicit models with smaller input-output Lipschitz bounds. Code is available at https://github.com/davydovalexander/Non-Euclidean_Mon_Op_Net.

cs.LG↗

Robust Output Regulation: Optimization-Based Synthesis and Event-Triggered Implementation

We investigate the problem of practical output regulation, i.e., to design a controller that brings the system output in the vicinity of a desired target value while keeping the other variables bounded. We consider uncertain systems that are possibly nonlinear and the uncertainty of their linear parts is modeled element-wise through a parametric family of matrix boxes. An optimization-based design procedure is proposed that delivers a continuous-time control and estimates the maximal regulation error. We also analyze an event-triggered emulation of this controller, which can be implemented on a digital platform, along with an explicit estimates of the regulation error.

math.OC↗

Delay Robustness of Consensus Algorithms: Beyond The Uniform Connectivity (Extended Version)

Consensus of autonomous agents is a benchmark problem in multi-agent control. In this paper, we consider continuous-time averaging consensus policies (or Laplacian flows) and their discrete-time counterparts over time-varying graphs in presence of unknown but bounded communication delays. It is known that consensus is established (no matter how large the delays are) if the graph is periodically, or uniformly quasi-strongly connected (UQSC). The UQSC condition is often believed to be the weakest sufficient condition under which consensus can be proved. We show that the UQSC condition can actually be substantially relaxed and replaced by a condition that we call aperiodic quasi-strong connectivity (AQSC), which, in some sense, proves to be very close to the necessary condition of integral connectivity. Furthermore, in some special situations such as undirected or type-symmetric graph, we find a necessary and sufficient condition for consensus in presence of bounded delay; the relevant results have been previously proved only in the undelayed case. The consensus criteria established in this paper generalize a number of results known in the literature.

math.OC↗

New Results on Delay Robustness of Consensus Algorithms

Consensus of autonomous agents is a benchmark problem in cooperative control. In this paper, we consider standard continuous-time averaging consensus policies (or Laplacian flows) over time-varying graphs and focus on robustness of consensus against communication delays. Such a robustness has been proved under the assumption of uniform quasi-strong connectivity of the graph. It is known, however, that the uniform connectivity is not necessary for consensus. For instance, in the case of undirected graph and undelayed communication consensus requires a much weaker condition of integral connectivity. In this paper, we show that the latter results remain valid in presence of unknown but bounded communication delays, furthermore, the condition of undirected graph can be substantially relaxed and replaced by the conditions of non-instantaneous type-symmetry. Furthermore, consensus can be proved for any feasible solution of the delay differential inequalities associated to the consensus algorithm. Such inequalities naturally arise in problems of containment control, distributed optimization and models of social dynamics.

eess.SY↗

Learning hidden influences in large-scale dynamical social networks: A data-driven sparsity-based approach

Interpersonal influence estimation from empirical data is a central challenge in the study of social structures and dynamics. Opinion dynamics theory is a young interdisciplinary science that studies opinion formation in social networks and has a huge potential in applications, such as marketing, advertisement and recommendations. The term social influence refers to the behavioral change of individuals due to the interactions with others in a social system, e.g. organization, community, or society in general. The advent of the Internet has made a huge volume of data easily available that can be used to measure social influence over large populations. Here, we aim at qualitatively and quantitatively infer social influence from data using a systems and control viewpoint. First, we introduce some definitions and models of opinions dynamics and review some structural constraints of online social networks, based on the notion of sparsity. Then, we review the main approaches to infer the network's structure from a set of observed data. Finally, we present some algorithms that exploit the introduced models and structural constraints, focusing on the sample complexity and computational requirements.

eess.SY↗

Optimal Universal Controllers for Roll Stabilization

Roll stabilization is an important problem of ship motion control. This problem becomes especially difficult if the same set of actuators (e.g. a single rudder) has to be used for roll stabilization and heading control of the vessel, so that the roll stabilizing system interferes with the ship autopilot. Finding the "trade-off" between the concurrent goals of accurate vessel steering and roll stabilization usually reduces to an optimization problem, which has to be solved in presence of an unknown wave disturbance. Standard approaches to this problem (loop-shaping, LQG, $H_{\infty}$-control etc.) require to know the spectral density of the disturbance, considered to be a \colored noise". In this paper, we propose a novel approach to optimal roll stabilization, approximating the disturbance by a polyharmonic signal with known frequencies yet uncertain amplitudes and phase shifts. Linear quadratic optimization problems in presence of polyharmonic disturbances can be solved by means of the theory of universal controllers developed by V.A. Yakubovich. An optimal universal controller delivers the optimal solution for any uncertain amplitudes and phases. Using Marine Systems Simulator (MSS) Toolbox that provides a realistic vessel's model, we compare our design method with classical approaches to optimal roll stabilization. Among three controllers providing the same quality of yaw steering, OUC stabilizes the roll motion most efficiently.

eess.SY↗

Lyapunov Event-triggered Stabilization with a Known Convergence Rate

A constructive tool of nonlinear control systems design, the method of Control Lyapunov Functions (CLF) has found numerous applications in stabilization problems for continuous time, discrete-time and hybrid systems. In this paper, we address the fundamental question: given a CLF, corresponding to the continuous-time controller with some predefined (e.g. exponential) convergence rate, can the same convergence rate be provided by an event-triggered controller? Under certain assumptions, we give an affirmative answer to this question and show that the corresponding event-based controllers provide positive dwelltimes between the consecutive events. Furthermore, we prove the existence of self-triggered and periodic event-triggered controllers, providing stabilization with a known convergence rate.

eess.SY↗

Recurrent Averaging Inequalities in Multi-Agent Control and Social Dynamics Modeling

Many multi-agent control algorithms and dynamic agent-based models arising in natural and social sciences are based on the principle of iterative averaging. Each agent is associated to a value of interest, which may represent, for instance, the opinion of an individual in a social group, the velocity vector of a mobile robot in a flock, or the measurement of a sensor within a sensor network. This value is updated, at each iteration, to a weighted average of itself and of the values of the adjacent agents. It is well known that, under natural assumptions on the network's graph connectivity, this local averaging procedure eventually leads to global consensus, or synchronization of the values at all nodes. Applications of iterative averaging include, but are not limited to, algorithms for distributed optimization, for solution of linear and nonlinear equations, for multi-robot coordination and for opinion formation in social groups. Although these algorithms have similar structures, the mathematical techniques used for their analysis are diverse, and conditions for their convergence and differ from case to case. In this paper, we review many of these algorithms and we show that their properties can be analyzed in a unified way by using a novel tool based on recurrent averaging inequalities (RAIs). We develop a theory of RAIs and apply it to the analysis of several important multi-agent algorithms recently proposed in the literature.

eess.SY↗

Structural Balance via Gradient Flows over Signed Graphs

Structural balance is a classic property of signed graphs satisfying Heider's seminal axioms. Mathematical sociologists have studied balance theory since its inception in the 1040s. Recent research has focused on the development of dynamic models explaining the emergence of structural balance. In this paper, we introduce a novel class of parsimonious dynamic models for structural balance based on an interpersonal influence process. Our proposed models are gradient flows of an energy function, called the dissonance function, which captures the cognitive dissonance arising from violations of Heider's axioms. Thus, we build a new connection with the literature on energy landscape minimization. This gradient flow characterization allows us to study the transient and asymptotic behaviors of our model. We provide mathematical and numerical results describing the critical points of the dissonance function.

eess.SY↗