Alexander Pogromsky

Alexander Pogromsky

orcid

Research Focus & Metrics

Academic Career Length

27Years (2000-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
20 May 2011 in Nonlinearity
Verified
Journal Article
Closed access
PDF file
APAlexander Pogromsky
Alexander Pogromsky
AMAlexey Matveev
Alexey Matveev


21 January 2019 in IEEE Transactions on Automatic Control
Verified
Journal Article
Closed access
AMAlexey Matveev
Alexey Matveev
APAnton Proskurnikov
Anton Proskurnikov
APAlexander Pogromsky
Alexander Pogromsky
EFEmilia Fridman
Emilia Fridman
The paper is concerned with the rate at which a discrete-time, deterministic, and possibly large network of nonlinear systems generates information, and so with the minimum rate of data transfer under which the addressee can maintain the level of awareness about the current state of the network. While being aimed at development of tractable techniques for estimation of this rate, the paper advocates benefits from directly treating the dynamical system as a set of interacting subsystems. To this end, a novel estimation method is elaborated that is alike in flavor to the small gain theorem on input-to-output stability. The utility of this approach is demonstrated by rigorously justifying an experimentally discovered phenomenon: The topological entropy of nonlinear time-delay systems stays bounded as the delay grows without limits. This is extended on the studied observability rates and appended by constructive upper bounds independent of the delay. It is shown that these bounds are asymptotically tight for a time-delay analog of the bouncing ball dynamics.

15 April 2000 in International Journal of Robust and Nonlinear Control
Verified
Journal Article
Closed access
PDF file
ASA. Shiriaev
A. Shiriaev
APAlexander Pogromsky
Alexander Pogromsky
HLH. Ludvigsen
H. Ludvigsen
OEO. Egeland
O. Egeland

26 September 2014
Verified
Book Chapter
Closed access
PDF file
QLQin Li
Qin Li
JUJan Tijmen Udding
Jan Tijmen Udding
APAlexander Pogromsky
Alexander Pogromsky

14 March 2019 in Entropy
Verified
Journal Article
Open access
PDF file
QVQuentin Voortman
Quentin Voortman
APAlexander Pogromsky
Alexander Pogromsky
AMAlexey S. Matveev
Alexey S. Matveev
Henk NijmeijerHenk Nijmeijer
Henk Nijmeijer
In this paper, the design of a data-rate constrained observer for a dynamical system is presented. This observer is designed to function both in discrete time and continuous time. The system is connected to a remote location via a communication channel which can transmit limited amounts of data per unit of time. The objective of the observer is to provide estimates of the state at the remote location through messages that are sent via the channel. The observer is designed such that it is robust toward losses in the communication channel. Upper bounds on the required communication rate to implement the observer are provided in terms of the upper box dimension of the state space and an upper bound on the largest singular value of the system’s Jacobian. Results that provide an analytical bound on the required minimum communication rate are then presented. These bounds are obtained by using the Lyapunov dimension of the dynamical system rather than the upper box dimension in the rate. The observer is tested through simulations for the Lozi map and the Lorenz system. For the Lozi map, the Lyapunov dimension is computed. For both systems, the theoretical bounds on the communication rate are compared to the simulated rates.