arXiv subjects

Dragan Nesic

Publications and source records attributed to Dragan Nesic.

At least 19 recordsLinked to original sources

arXiv2025

Discounted LQR: stabilizing (near-)optimal state-feedback laws

We study deterministic, discrete linear time-invariant systems with infinite-horizon discounted quadratic cost. It is well-known that standard stabilizability and detectability properties are not enough in general to conclude stability properties for the system in closed-loop with the optimal controller when the discount factor is small. In this context, we first review some of the stability conditions based on the optimal value function found in the learning and control literature and highlight their conservatism. We then propose novel (necessary and) sufficient conditions, still based on the optimal value function, under which stability of the origin for the optimal closed-loop system is guaranteed. Afterwards, we focus on the scenario where the optimal feedback law is not stabilizing because of the discount factor and the goal is to design an alternative stabilizing near-optimal static state-feedback law. We present both linear matrix inequality-based conditions and a variant of policy iteration to construct such stabilizing near-optimal controllers. The methods are illustrated via numerical examples.

math.OC↗

arXiv2024

Emulation-based Stabilization for Networked Control Systems with Stochastic Channels

This paper studies the stabilization problem of networked control systems (NCSs) with random packet dropouts caused by stochastic channels. To describe the effects of stochastic channels on the information transmission, the transmission times are assumed to be deterministic, whereas the packet transmission is assumed to be random. We first propose a stochastic scheduling protocol to model random packet dropouts, and address the properties of the proposed stochastic scheduling protocol. The proposed scheduling protocol provides a unified modelling framework for a general class of random packet dropouts due to different stochastic channels. Next, the proposed scheduling protocol is embedded into the closed-loop system, which leads to a stochastic hybrid model for NCSs with random packet dropouts. Based on this stochastic hybrid model, we follow the emulation approach to establish sufficient conditions to guarantee uniform global asymptotical stability in probability. In particular, an upper bound on the maximally allowable transmission interval is derived explicitly for all stochastic protocols satisfying Lyapunov conditions that guarantee uniform global asymptotic stability in probability. Finally, two numerical examples are presented to demonstrate the derived results.

eess.SY↗

arXiv2023

Attack-Resilient Design for Connected and Automated Vehicles

By sharing local sensor information via Vehicle-to-Vehicle (V2V) wireless communication networks, Cooperative Adaptive Cruise Control (CACC) is a technology that enables Connected and Automated Vehicles (CAVs) to drive autonomously on the highway in closely-coupled platoons. The use of CACC technologies increases safety and the traffic throughput, and decreases fuel consumption and CO2 emissions. However, CAVs heavily rely on embedded software, hardware, and communication networks that make them vulnerable to a range of cyberattacks. Cyberattacks to a particular CAV compromise the entire platoon as CACC schemes propagate corrupted data to neighboring vehicles potentially leading to traffic delays and collisions. Physics-based monitors can be used to detect the presence of False Data Injection (FDI) attacks to CAV sensors; however, unavoidable system disturbances and modelling uncertainty often translates to conservative detection results. Given enough system knowledge, adversaries are still able to launch a range of attacks that can surpass the detection scheme by hiding within the system disturbances and uncertainty -- we refer to this class of attacks as \textit{stealthy FDI attacks}. Stealthy attacks are hard to deal with as they affect the platoon dynamics without being noticed. In this manuscript, we propose a co-design methodology (built around a series convex programs) to synthesize distributed attack monitors and $H_{\infty}$ CACC controllers that minimize the joint effect of stealthy FDI attacks and system disturbances on the platoon dynamics while guaranteeing a prescribed platooning performance (in terms of tracking and string stability). Computer simulations are provided to illustrate the performance of out tools.

eess.SY↗

arXiv2022

Transmit power policies for stochastic stabilisation of multi-link wireless networked control systems

Transmit power control is one of the most important issues in wireless networks, where nodes typically operate on limited battery power. Reducing communicating power consumption is essential for both economic and ecologic reasons. In fact, transmitting at unnecessarily high power not only reduces node lifetime, but also introduces excessive interference and electromagnetic pollution. Existing work in the wireless community mostly focus on designing transmit power policies by taking into account communication aspects like quality of service or network capacity. Wireless networked control systems (WNCSs), on the other hand, have different and specific needs such as stability, which require transmit power policies adapted to the control context. Transmit power design in the control community has recently attracted much attention, and available works mostly consider linear systems or specific classes of non-linear systems with a single-link view of the system. In this paper, we propose a framework for the design of stabilising transmit power levels that applies to much larger classes of non-linear plants, controllers, and multi-link setting. By exploiting the fact that channel success probabilities are related to transmit power in a non-linear fashion, we first derive closed-loop stability conditions that relate channel probabilities with transmission rate. Next, we combine these results together with well-known and realistic interference models to provide a design methodology for stabilising transmit power in non-linear and multi-link WNCSs.

eess.SY↗

arXiv2022

Policy iteration: for want of recursive feasibility, all is not lost

This paper investigates recursive feasibility, recursive robust stability and near-optimality properties of policy iteration (PI). For this purpose, we consider deterministic nonlinear discrete-time systems whose inputs are generated by PI for undiscounted cost functions. We first assume that PI is recursively feasible, in the sense that the optimization problems solved at each iteration admit a solution. In this case, we provide novel conditions to establish recursive robust stability properties for a general attractor, meaning that the policies generated at each iteration ensure a robust \KL-stability property with respect to a general state measure. We then derive novel explicit bounds on the mismatch between the (suboptimal) value function returned by PI at each iteration and the optimal one. Afterwards, motivated by a counter-example that shows that PI may fail to be recursively feasible, we modify PI so that recursive feasibility is guaranteed a priori under mild conditions. This modified algorithm, called PI+, is shown to preserve the recursive robust stability when the attractor is compact. Additionally, PI+ enjoys the same near-optimality properties as its PI counterpart under the same assumptions. Therefore, PI+ is an attractive tool for generating near-optimal stabilizing control of deterministic discrete-time nonlinear systems.

math.OC↗

arXiv2022

Tracking and regret bounds for online zeroth-order Euclidean and Riemannian optimisation

We study numerical optimisation algorithms that use zeroth-order information to minimise time-varying geodesically-convex cost functions on Riemannian manifolds. In the Euclidean setting, zeroth-order algorithms have received a lot of attention in both the time-varying and time-invariant cases. However, the extension to Riemannian manifolds is much less developed. We focus on Hadamard manifolds, which are a special class of Riemannian manifolds with global nonpositive curvature that offer convenient grounds for the generalisation of convexity notions. Specifically, we derive bounds on the expected instantaneous tracking error, and we provide algorithm parameter values that minimise the algorithm's performance. Our results illustrate how the manifold geometry in terms of the sectional curvature affects these bounds. Additionally, we provide dynamic regret bounds for this online optimisation setting. To the best of our knowledge, these are the first regret bounds even for the Euclidean version of the problem. Lastly, via numerical simulations, we demonstrate the applicability of our algorithm on an online Karcher mean problem.

math.OC↗

arXiv2021

On Joint Reconstruction of State and Input-Output Injection Attacks for Nonlinear Systems

We address the problem of robust state reconstruction for discrete-time nonlinear systems when the actuators and sensors are injected with (potentially unbounded) attack signals. Exploiting redundancy in sensors and actuators and using a bank of unknown input observers (UIOs), we propose an observer-based estimator capable of providing asymptotic estimates of the system state and attack signals under the condition that the numbers of sensors and actuators under attack are sufficiently small. Using the proposed estimator, we provide methods for isolating the compromised actuators and sensors. Numerical examples are provided to demonstrate the effectiveness of our methods.

eess.SY↗

arXiv2021

Asynchronous Distributed Optimization via Dual Decomposition and Block Coordinate Subgradient Methods

We study the problem of minimizing the sum of potentially non-differentiable convex cost functions with partially overlapping dependences in an asynchronous manner, where communication in the network is not coordinated. We study the behavior of an asynchronous algorithm based on dual decomposition and block coordinate subgradient methods under assumptions weaker than those used in the literature. At the same time, we allow different agents to use local stepsizes with no global coordination. Sufficient conditions are provided for almost sure convergence to the solution of the optimization problem. Under additional assumptions, we establish a sublinear convergence rate that in turn can be strengthened to linear convergence rate if the problem is strongly convex and has Lipschitz gradients. We also extend available results in the literature by allowing multiple and potentially overlapping blocks to be updated at the same time with non-uniform and potentially time varying probabilities assigned to different blocks. A numerical example is provided to illustrate the effectiveness of the algorithm.

math.OC↗

arXiv2020

On the Latency, Rate and Reliability Tradeoff in Wireless Networked Control Systems for IIoT

Wireless networked control systems (WNCSs) provide a key enabling technique for Industry Internet of Things (IIoT). However, in the literature of WNCSs, most of the research focuses on the control perspective, and has considered oversimplified models of wireless communications which do not capture the key parameters of a practical wireless communication system, such as latency, data rate and reliability. In this paper, we focus on a WNCS, where a controller transmits quantized and encoded control codewords to a remote actuator through a wireless channel, and adopt a detailed model of the wireless communication system, which jointly considers the inter-related communication parameters. We derive the stability region of the WNCS. If and only if the tuple of the communication parameters lies in the region, the average cost function, i.e., a performance metric of the WNCS, is bounded. We further obtain a necessary and sufficient condition under which the stability region is $n$-bounded, where $n$ is the control codeword blocklength. We also analyze the average cost function of the WNCS. Such analysis is non-trivial because the finite-bit control-signal quantizer introduces a non-linear and discontinuous quantization function which makes the performance analysis very difficult. We derive tight upper and lower bounds on the average cost function in terms of latency, data rate and reliability. Our analytical results provide important insights into the design of the optimal parameters to minimize the average cost within the stability region.

cs.IT↗

arXiv2020

Tuning of multivariable model predictive controllersthrough expert bandit feedback

For certain industrial control applications an explicit function capturing the nontrivial trade-off between competing objectives in closed loop performance is not available. In such scenarios it is common practice to use the human innate ability to implicitly learn such a relationship and manually tune the corresponding controller to achieve the desirable closed loop performance. This approach has its deficiencies because of individual variations due to experience levels and preferences in the absence of an explicit calibration metric. Moreover, as the complexity of the underlying system and/or the controller increase, in the effort to achieve better performance, so does the tuning time and the associated tuning cost. To reduce the overall tuning cost, a tuning framework is proposed herein, whereby a supervised machine learning is used to extract the human-learned cost function and an optimization algorithm that can efficiently deal with a large number of variables, is used for optimizing the extracted cost function. Given the interest in the implementation across many industrial domains and the associated high degree of freedom present in the corresponding tuning process, a Model Predictive Controller applied to air path control in a diesel engine is tuned for the purpose of demonstrating the potential of the framework.

eess.SY↗

arXiv2019

Information-Theoretic Privacy through Chaos Synchronization and Optimal Additive Noise

We study the problem of maximizing privacy of data sets by adding random vectors generated via synchronized chaotic oscillators. In particular, we consider the setup where information about data sets, queries, is sent through public (unsecured) communication channels to a remote station. To hide private features (specific entries) within the data set, we corrupt the response to queries by adding random vectors. We send the distorted query (the sum of the requested query and the random vector) through the public channel. The distribution of the additive random vector is designed to minimize the mutual information (our privacy metric) between private entries of the data set and the distorted query. We cast the synthesis of this distribution as a convex program in the probabilities of the additive random vector. Once we have the optimal distribution, we propose an algorithm to generate pseudo-random realizations from this distribution using trajectories of a chaotic oscillator. At the other end of the channel, we have a second chaotic oscillator, which we use to generate realizations from the same distribution. Note that if we obtain the same realizations on both sides of the channel, we can simply subtract the realization from the distorted query to recover the requested query. To generate equal realizations, we need the two chaotic oscillators to be synchronized, i.e., we need them to generate exactly the same trajectories on both sides of the channel synchronously in time. We force the two chaotic oscillators into exponential synchronization using a driving signal. Simulations are presented to illustrate our results.

eess.SY↗

arXiv2019

Security Metrics of Networked Control Systems under Sensor Attacks (extended preprint)

As more attention is paid to security in the context of control systems and as attacks occur to real control systems throughout the world, it has become clear that some of the most nefarious attacks are those that evade detection. The term stealthy has come to encompass a variety of techniques that attackers can employ to avoid being detected. In this manuscript, for a class of perturbed linear time-invariant systems, we propose two security metrics to quantify the potential impact that stealthy attacks could have on the system dynamics by tampering with sensor measurements. We provide analysis mathematical tools (in terms of linear matrix inequalities) to quantify these metrics for given system dynamics, control structure, system monitor, and set of sensors being attacked. Then, we provide synthesis tools (in terms of semidefinite programs) to redesign controllers and monitors such that the impact of stealthy attacks is minimized and the required attack-free system performance is guaranteed.

eess.SY↗

arXiv2019

A Multi-Observer Based Estimation Framework for Nonlinear Systems under Sensor Attacks

We address the problem of state estimation and attack isolation for general discrete-time nonlinear systems when sensors are corrupted by (potentially unbounded) attack signals. For a large class of nonlinear plants and observers, we provide a general estimation scheme, built around the idea of sensor redundancy and multi-observer, capable of reconstructing the system state in spite of sensor attacks and noise. This scheme has been proposed by others for linear systems/observers and here we propose a unifying framework for a much larger class of nonlinear systems/observers. Using the proposed estimator, we provide an isolation algorithm to pinpoint attacks on sensors during sliding time windows. Simulation results are presented to illustrate the performance of our tools.

eess.SY↗

arXiv2019

An Unknown Input Multi-Observer Approach for Estimation and Control under Adversarial Attacks

We address the problem of state estimation, attack isolation, and control of discrete-time linear time-invariant systems under (potentially unbounded) actuator and sensor false data injection attacks. Using a bank of unknown input observers, each observer leading to an exponentially stable estimation error (in the attack-free case), we propose an observer-based estimator that provides exponential estimates of the system state in spite of actuator and sensor attacks. Exploiting sensor and actuator redundancy, the estimation scheme is guaranteed to work if a sufficiently small subset of sensors and actuators are under attack. Using the proposed estimator, we provide tools for reconstructing and isolating actuator and sensor attacks; and a control scheme capable of stabilizing the closed-loop dynamics by switching off isolated actuators. Simulation results are presented to illustrate the performance of our tools.

eess.SY↗

arXiv2019

Adaptive Scan for Atomic Force Microscopy Based on Online Optimisation: Theory and Experiment

A major challenge in Atomic Force Microscopy (AFM) is to reduce the scan duration while retaining the image quality. Conventionally, the scan rate is restricted to a sufficiently small value in order to ensure a desirable image quality as well as a safe tip-sample contact force. This usually results in a conservative scan rate for samples that have a large variation in aspect ratio and/or for scan patterns that have a varying linear velocity. In this paper, an adaptive scan scheme is proposed to alleviate this problem. A scan line-based performance metric balancing both imaging speed and accuracy is proposed, and the scan rate is adapted such that the metric is optimised online in the presence of aspect ratio and/or linear velocity variations. The online optimisation is achieved using an extremum-seeking (ES) approach, and a semi-global practical asymptotic stability (SGPAS) result is shown for the overall system. Finally, the proposed scheme is demonstrated via both simulation and experiment.

eess.SP↗

arXiv2018

An Unknown Input Multi-Observer Approach for Estimation, Attack Isolation, and Control of LTI Systems under Actuator Attacks

We address the problem of state estimation, attack isolation, and control for discrete-time Linear Time Invariant (LTI) systems under (potentially unbounded) actuator false data injection attacks. Using a bank of Unknown Input Observers (UIOs), each observer leading to an exponentially stable estimation error in the attack-free case, we propose an estimator that provides exponential estimates of the system state and the attack signals when a sufficiently small number of actuators are attacked. We use these estimates to control the system and isolate actuator attacks. Simulations results are presented to illustrate the performance of the results.

eess.SY↗

arXiv2018

Closeness of Solutions for Singularly Perturbed Systems via Averaging

This paper studies the behavior of singularly perturbed nonlinear differential equations with boundary-layer solutions that do not necessarily converge to an equilibrium. Using the average of the fast variable and assuming the boundary layer solutions converge to a bounded set, results on the closeness of solutions of the singularly perturbed system to the solutions of the reduced average and boundary layer systems over a finite time interval are presented. The closeness of solutions error is shown to be of order O(\sqrt(ε)), where εis the perturbation parameter.

eess.SY↗

arXiv2018

On Privacy of Quantized Sensor Measurements through Additive Noise

We study the problem of maximizing privacy of quantized sensor measurements by adding random variables. In particular, we consider the setting where information about the state of a process is obtained using noisy sensor measurements. This information is quantized and sent to a remote station through an unsecured communication network. It is desired to keep the state of the process private; however, because the network is not secure, adversaries might have access to sensor information, which could be used to estimate the process state. To avoid an accurate state estimation, we add random numbers to the quantized sensor measurements and send the sum to the remote station instead. The distribution of these random variables is designed to minimize the mutual information between the sum and the quantized sensor measurements for a desired level of distortion -- how different the sum and the quantized sensor measurements are allowed to be. Simulations are presented to illustrate our results.

eess.SY↗