Alien Registration- Sweeney, Persis M. (Portland, Cumberland County)

https://digitalmaine.com/alien_docs/21332/thumbnail.jp

Alien Registration- Sweeney, Persis M. (Portland, Cumberland County)

https://digitalmaine.com/alien_docs/21332/thumbnail.jp

Distributed Event-Triggered Control for Asymptotic Synchronization of Dynamical Networks

This paper studies synchronization of dynamical networks with event-based communication. Firstly, two estimators are introduced into each node, one to estimate its own state, and the other to estimate the average state of its neighbours. Then, with these two estimators, a distributed event-triggering rule (ETR) with a dwell time is designed such that the network achieves synchronization asymptotically with no Zeno behaviours. The designed ETR only depends on the information that each node can obtain, and thus can be implemented in a decentralized way.Comment: 8 pages, 2 figues, 1 tabl

A Robust Consensus Algorithm for Current Sharing and Voltage Regulation in DC Microgrids

In this paper a novel distributed control algorithm for current sharing and voltage regulation in Direct Current (DC) microgrids is proposed. The DC microgrid is composed of several Distributed Generation units (DGUs), including Buck converters and current loads. The considered model permits an arbitrary network topology and is affected by unknown load demand and modelling uncertainties. The proposed control strategy exploits a communication network to achieve proportional current sharing using a consensus-like algorithm. Voltage regulation is achieved by constraining the system to a suitable manifold. Two robust control strategies of Sliding Mode (SM) type are developed to reach the desired manifold in a finite time. The proposed control scheme is formally analyzed, proving the achievement of proportional current sharing, while guaranteeing that the weighted average voltage of the microgrid is identical to the weighted average of the voltage references.Comment: 12 page

Self-triggered rendezvous of gossiping second-order agents

A recent paper by some of the authors introduced several self-triggered coordination algorithms for first-order continuous-time systems. The extension of these algorithms to second-order agents is relevant in many practical applications but presents some challenges that are tackled in this contribution and that require to depart from the analysis that was carried out before. We design a self-triggered gossiping coordination algorithm that induces a time-varying communication graph, which is enough connected to guarantee useful convergence properties, and allows us to achieve the desired coordination task in a formation of double-integrator agents that (i) establish pair-wise communication at suitably designed times and (ii) exchange relative measurements while reducing the sensing and communication effort

Resilience against misbehaving nodes in asynchronous networks

When dealing with network systems, a fundamental challenge is to ensure their functioning even when some of the network nodes do not operate as intended due to faults or attacks. The objective of this paper is to address the problem of resilient consensus in a context where the nodes have their own clocks, possibly operating in an asynchronous way, and can make updates at arbitrary time instants. The results represent a first step towards the development of resilient event-triggered and self-triggered coordination protocols. (C) 2019 Elsevier Ltd. All rights reserved

Stability of quantized time-delay nonlinear systems: A Lyapunov-Krasowskii-functional approach

Lyapunov-Krasowskii functionals are used to design quantized control laws for nonlinear continuous-time systems in the presence of constant delays in the input. The quantized control law is implemented via hysteresis to prevent chattering. Under appropriate conditions, our analysis applies to stabilizable nonlinear systems for any value of the quantization density. The resulting quantized feedback is parametrized with respect to the quantization density. Moreover, the maximal allowable delay tolerated by the system is characterized as a function of the quantization density.Comment: 31 pages, 3 figures, to appear in Mathematics of Control, Signals, and System

Willems' Fundamental Lemma for State-Space Systems and Its Extension to Multiple Datasets

Willems et al.'s fundamental lemma asserts that all trajectories of a linear system can be obtained from a single given one, assuming that a persistency of excitation and a controllability condition hold. This result has profound implications for system identification and data-driven control, and has seen a revival over the last few years. The purpose of this letter is to extend Willems' lemma to the situation where multiple (possibly short) system trajectories are given instead of a single long one. To this end, we introduce a notion of collective persistency of excitation. We will show that all trajectories of a linear system can be obtained from a given finite number of trajectories, as long as these are collectively persistently exciting. We will demonstrate that this result enables the identification of linear systems from data sets with missing samples. Additionally, we show that the result is of practical significance in data-driven control of unstable systems