arXiv subjects

Dragan Nešić

Publications and source records attributed to Dragan Nešić.

33 records · Page 2Linked to original sources

arXiv2021

A Sequential Learning Algorithm for Probabilistically Robust Controller Tuning

We introduce a sequential learning algorithm to address a robust controller tuning problem, which in effect, finds (with high probability) a candidate solution satisfying the internal performance constraint to a chance-constrained program which has black-box functions. The algorithm leverages ideas from the areas of randomised algorithms and ordinal optimisation, and also draws comparisons with the scenario approach; these have all been previously applied to finding approximate solutions for difficult design problems. By exploiting statistical correlations through black-box sampling, we formally prove that our algorithm yields a controller meeting the prescribed probabilistic performance specification. Additionally, we characterise the computational requirement of the algorithm with a probabilistic lower bound on the algorithm's stopping time. To validate our work, the algorithm is then demonstrated for tuning model predictive controllers on a diesel engine air-path across a fleet of vehicles. The algorithm successfully tuned a single controller to meet a desired tracking error performance, even in the presence of the plant uncertainty inherent across the fleet. Moreover, the algorithm was shown to exhibit a sample complexity comparable to the scenario approach.

math.OC↗

arXiv2021

Exploiting homogeneity for the optimal control of discrete-time systems: application to value iteration

To investigate solutions of (near-)optimal control problems, we extend and exploit a notion of homogeneity recently proposed in the literature for discrete-time systems. Assuming the plant dynamics is homogeneous, we first derive a scaling property of its solutions along rays provided the sequence of inputs is suitably modified. We then consider homogeneous cost functions and reveal how the optimal value function scales along rays. This result can be used to construct (near-)optimal inputs on the whole state space by only solving the original problem on a given compact manifold of a smaller dimension. Compared to the related works of the literature, we impose no conditions on the homogeneity degrees. We demonstrate the strength of this new result by presenting a new approximate scheme for value iteration, which is one of the pillars of dynamic programming. The new algorithm provides guaranteed lower and upper estimates of the true value function at any iteration and has several appealing features in terms of reduced computation. A numerical case study is provided to illustrate the proposed algorithm.

math.OC↗

arXiv2021

A Robust CACC Scheme Against Cyberattacks Via Multiple Vehicle-to-Vehicle Networks

Cooperative Adaptive Cruise Control (CACC) is a vehicular technology that allows groups of vehicles on the highway to form in closely-coupled automated platoons to increase highway capacity and safety, and decrease fuel consumption and CO2 emissions. The underlying mechanism behind CACC is the use of Vehicle-to-Vehicle (V2V) wireless communication networks to transmit acceleration commands to adjacent vehicles in the platoon. However, the use of V2V networks leads to increased vulnerabilities against faults and cyberattacks at the communication channels. Communication networks serve as new access points for malicious agents trying to deteriorate the platooning performance or even cause crashes. Here, we address the problem of increasing robustness of CACC schemes against cyberattacks by the use of multiple V2V networks and a data fusion algorithm. The idea is to transmit acceleration commands multiple times through different communication networks (channels) to create redundancy at the receiver side. We exploit this redundancy to obtain attack-free estimates of acceleration commands. To accomplish this, we propose a data-fusion algorithm that takes data from all channels, returns an estimate of the true acceleration command, and isolates compromised channels. Note, however, that using estimated data for control introduces uncertainty into the loop and thus decreases performance. To minimize performance degradation, we propose a robust $H_{\infty}$ controller that reduces the joint effect of estimation errors and sensor/channel noise in the platooning performance (tracking performance and string stability). We present simulation results to illustrate the performance of our approach.

eess.SY↗

arXiv2021

Ordinal Optimisation and the Offline Multiple Noisy Secretary Problem

We study the success probability for a variant of the secretary problem, with noisy observations and multiple offline selection. Our formulation emulates, and is motivated by, problems involving noisy selection arising in the disciplines of stochastic simulation and simulation-based optimisation. In addition, we employ the philosophy of ordinal optimisation - involving an ordinal selection rule, and a percentile notion of goal softening for the success probability. As a result, it is shown that the success probability only depends on the underlying copula of the problem. Other general properties for the success probability are also presented. Specialising to the case of Gaussian copulas, we also derive an analytic lower bound for the success probability, which may then be inverted to find sufficiently large sample sizes that guarantee a high success probability arbitrarily close to one.

math.OC↗

arXiv2021

Ordinal Optimisation for the Gaussian Copula Model

We present results on the estimation and evaluation of success probabilities for ordinal optimisation over uncountable sets (such as subsets of $\mathbb{R}^{d}$). Our formulation invokes an assumption of a Gaussian copula model, and we show that the success probability can be equivalently computed by assuming a special case of additive noise. We formally prove a lower bound on the success probability under the Gaussian copula model, and numerical experiments demonstrate that the lower bound yields a reasonable approximation to the actual success probability. Lastly, we showcase the utility of our results by guaranteeing high success probabilities with ordinal optimisation.

math.OC↗

arXiv2020

When to stop value iteration: stability and near-optimality versus computation

Value iteration (VI) is a ubiquitous algorithm for optimal control, planning, and reinforcement learning schemes. Under the right assumptions, VI is a vital tool to generate inputs with desirable properties for the controlled system, like optimality and Lyapunov stability. As VI usually requires an infinite number of iterations to solve general nonlinear optimal control problems, a key question is when to terminate the algorithm to produce a "good" solution, with a measurable impact on optimality and stability guarantees. By carefully analysing VI under general stabilizability and detectability properties, we provide explicit and novel relationships of the stopping criterion's impact on near-optimality, stability and performance, thus allowing to tune these desirable properties against the induced computational cost. The considered class of stopping criteria encompasses those encountered in the control, dynamic programming and reinforcement learning literature and it allows considering new ones, which may be useful to further reduce the computational cost while endowing and satisfying stability and near-optimality properties. We therefore lay a foundation to endow machine learning schemes based on VI with stability and performance guarantees, while reducing computational complexity.

math.OC↗

arXiv2020

Active Learning for Linear Parameter-Varying System Identification

Active learning is proposed for selection of the next operating points in the design of experiments, for identifying linear parameter-varying systems. We extend existing approaches found in literature to multiple-input multiple-output systems with a multivariate scheduling parameter. Our approach is based on exploiting the probabilistic features of Gaussian process regression to quantify the overall model uncertainty across locally identified models. This results in a flexible framework which accommodates for various techniques to be applied for estimation of local linear models and their corresponding uncertainty. We perform active learning in application to the identification of a diesel engine air-path model, and demonstrate that measures of model uncertainty can be successfully reduced using the proposed framework.

eess.SY↗

arXiv2019

Optimistic planning for the near-optimal control of nonlinear switched discrete-time systems with stability guarantees

Originating in the artificial intelligence literature, optimistic planning (OP) is an algorithm that generates near-optimal control inputs for generic nonlinear discrete-time systems whose input set is finite. This technique is therefore relevant for the near-optimal control of nonlinear switched systems, for which the switching signal is the control. However, OP exhibits several limitations, which prevent its application in a standard control context. First, it requires the stage cost to take values in [0,1], an unnatural prerequisite as it excludes, for instance, quadratic stage costs. Second, it requires the cost function to be discounted. Third, it applies for reward maximization, and not cost minimization. In this paper, we modify OP to overcome these limitations, and we call the new algorithm OPmin. We then make stabilizability and detectability assumptions, under which we derive near-optimality guarantees for OPmin and we show that the obtained bound has major advantages compared to the bound originally given by OP. In addition, we prove that a system whose inputs are generated by OPmin in a receding-horizon fashion exhibits stability properties. As a result, OPmin provides a new tool for the near-optimal, stable control of nonlinear switched discrete-time systems for generic cost functions.

math.OC↗

arXiv2019

A Multi-Observer Approach for Attack Detection and Isolation of Discrete-Time Nonlinear Systems

We address the problem of attack detection and isolation for a class of discrete-time nonlinear systems under (potentially unbounded) sensor attacks and measurement noise. We consider the case when a subset of sensors is subject to additive false data injection attacks. Using a bank of observers, each observer leading to an Input-to-State Stable (ISS) estimation error, we propose two algorithms for detecting and isolating sensor attacks. These algorithms make use of the ISS property of the observers to check whether the trajectories of observers are `consistent' with the attack-free trajectories of the system. Simulations results are presented to illustrate the performance of the proposed algorithms.

eess.SY↗

arXiv2018

A Robust Circle-criterion Observer-based Estimator for Discrete-time Nonlinear Systems in the Presence of Sensor Attacks and Measurement Noise

We address the problem of robust state estimation of a class of discrete-time nonlinear systems with positive-slope nonlinearities when the sensors are corrupted by (potentially unbounded) attack signals and bounded measurement noise. We propose an observer-based estimator, using a bank of circle-criterion observers, which provides a robust estimate of the system state in spite of sensor attacks and measurement noise. We first consider the attack-free case where there is measurement noise and we provide a design method for a robust circle-criterion observer. Then, we consider the case when a sufficiently small subset of sensors are subject to attacks and all sensors are affected by measurement noise. We use our robust circle-criterion observer as the main ingredient in building an estimator that provides robust state estimation in this case. Finally, we propose an algorithm for isolating attacked sensors in the case of bounded measurement noise. We test this algorithm through simulations.

eess.SP↗

arXiv2014

Co-design of output feedback laws and event-triggering conditions for linear systems

We present a procedure to simultaneously design the output feedback law and the event-triggering condition to stabilize linear systems. The closed-loop system is shown to satisfy a global asymptotic stability property and the existence of a strictly positive minimum amount of time between two transmissions is guaranteed. The event-triggered controller is obtained by solving linear matrix inequalities (LMIs). We then exploit the flexibility of the method to maximize the guaranteed minimum amount of time between two transmissions. Finally, we provide a (heuristic) method to reduce the amount of transmissions, which is supported by numerical simulations.

eess.SY↗

arXiv2014

Stabilization of nonlinear systems using event-triggered output feedback controllers

The objective is to design output feedback event-triggered controllers to stabilize a class of nonlinear systems. One of the main difficulties of the problem is to ensure the existence of a minimum amount of time between two consecutive transmissions, which is essential in practice. We solve this issue by combining techniques from event-triggered and time-triggered control. The idea is to turn on the event-triggering mechanism only after a fixed amount of time has elapsed since the last transmission. This time is computed based on results on the stabilization of time-driven sampled-data systems. The overall strategy ensures an asymptotic stability property for the closed-loop system. The results are proved to be applicable to linear time-invariant (LTI) systems as a particular case.

eess.SY↗

arXiv2014

A Local Characterization of Lyapunov Functions and Robust Stability of Perturbed Systems on Riemannian Manifolds

This paper proposes several Converse Lyapunov Theorems for nonlinear dynamical systems defined on smooth connected Riemannian manifolds and characterizes properties of corresponding Lyapunov functions in a normal neighborhood of an equilibrium. We extend the methods of constructing of Lyapunov functions for ordinary differential equations on $\mathds{R}^{n}$ to dynamical systems defined on Riemannian manifolds by employing the differential geometry. By employing the derived properties of Lyapunov functions, we obtained the stability of perturbed dynamical systems on Riemannian manifolds. The results are obtained by employing the notions of normal neighborhoods, the injectivity radius on Riemannian manifolds and existence of bump functions on manifolds.

math.OC↗

arXiv2014

Averaging for nonlinear systems evolving on Riemannian manifolds

This paper presents an averaging method for nonlinear systems defined on Riemannian manifolds. We extend closeness of solutions results for ordinary differential equations on $R^{n}$ to dynamical systems defined on Riemannian manifolds by employing differential geometry. A generalization of closeness of solutions for periodic dynamical systems on compact time intervals is derived for dynamical systems evolving on compact Riemannian manifolds. Under local asymptotic (exponential) stability of the average vector field, we further relax the compactness of the ambient Riemannian manifold and obtain the closeness of solutions on the infinite time interval by employing the notion of uniform normal neighborhoods of an equilibrium point of a vector field. These results are also presented for time-varying dynamical systems where their averaged systems are almost globally asymptotically or exponentially stable on compact manifolds. The main results of the paper are illustrated by several examples.

math.OC↗

arXiv2014

Parameter and state estimation of nonlinear systems using a multi-observer under the supervisory framework

We present a hybrid scheme for the parameter and state estimation of nonlinear continuous-time systems, which is inspired by the supervisory setup used for control. State observers are synthesized for some nominal parameter values and a criterion is designed to select one of these observers at any given time instant, which provides state and parameter estimates. Assuming that a persistency of excitation condition holds, the convergence of the parameter and state estimation errors to zero is ensured up to a margin, which can be made as small as desired by increasing the number of observers. To reduce the potential computational complexity of the scheme, we explain how the sampling of the parameter set can be dynamically updated using a zoom-in procedure. This strategy typically requires a fewer number of observers for a given estimation error margin compared to the static sampling policy. The results are shown to be applicable to linear systems and to a class of nonlinear systems. We illustrate the applicability of the approach by estimating the synaptic gains and the mean membrane potentials of a neural mass model.

math.OC↗