Searcharxiv⌕ Search

arXiv subjects

Karl H. Johansson

Publications and source records attributed to Karl H. Johansson.

At least 217 records · Page 12Linked to original sources

Learning-based Traffic State Reconstruction using Probe Vehicles

This article investigates the use of a model-based neural-network for the traffic reconstruction problem using noisy measurements coming from probe vehicles. The traffic state is assumed to be the density only, modeled by a partial differential equation. There exist various methods for reconstructing the density in that case. However, none of them perform well with noise and very few deal with lagrangian measurements. This paper introduces a method that can reduce the processes of identification, reconstruction, prediction, and noise rejection into a single optimization problem. Numerical simulations, based either on a macroscopic or a microscopic model, show good performance for a moderate computational burden.

math.OC↗

Networked Multi-Virus Spread with a Shared Resource: Analysis and Mitigation Strategies

The paper studies multi-competitive continuous-time epidemic processes in the presence of a shared resource. We consider the setting where multiple viruses are simultaneously prevalent in the population, and the spread occurs due to not only individual-to-individual interaction but also due to individual-to-resource interaction. In such a setting, an individual is either not affected by any of the viruses, or infected by one and exactly one of the multiple viruses. We classify the equilibria into three classes: a) the healthy state (all viruses are eradicated), b) single-virus endemic equilibria (all but one viruses are eradicated), and c) coexisting equilibria (multiple viruses simultaneously infect separate fractions of the population). We provide i) a sufficient condition for exponential (resp. asymptotic) eradication of a virus; ii) a sufficient condition for the existence, uniqueness and asymptotic stability of a single-virus endemic equilibrium; iii) a necessary and sufficient condition for the healthy state to be the unique equilibrium; and iv) for the bi-virus setting (i.e., two competing viruses), a sufficient condition and a necessary condition for the existence of a coexisting equilibrium. Building on these analytical results, we provide two mitigation strategies: a technique that guarantees convergence to the healthy state; and, in a bi-virus setup, a scheme that employs one virus to ensure that the other virus is eradicated. The results are illustrated in a numerical study of a spread scenario in Stockholm city.

eess.SY↗

Analysis and Design of Vehicle Platooning Operations on Mixed-Traffic Highways

Platooning of connected and autonomous vehicles (CAVs) has a significant potential for throughput improvement. However, the interaction between CAVs and non-CAVs may limit the practically attainable improvement due to platooning. To better understand and address this limitation, we introduce a new fluid model of mixed-autonomy traffic flow and use this model to analyze and design platoon coordination strategies. We propose tandem-link fluid model that considers randomly arriving platoons sharing highway capacity with non-CAVs. We derive verifiable conditions for stability of the fluid model by analyzing an underlying M/D/1 queuing process and establishing a Foster-Lyapunov drift condition for the fluid model. These stability conditions enable a quantitative analysis of highway throughput under various scenarios. The model is useful for designing platoon coordination strategies that maximize throughput and minimize delay. Such coordination strategies are provably optimal in the fluid model and are practically relevant. We also validate our results using standard macroscopic (cell transmission model, CTM) and microscopic (Simulation for Urban Mobility, SUMO) simulation models.

math.OC↗

Distributed control under compromised measurements:Resilient estimation, attack detection, and vehicle platooning

We study how to design a secure observer-based distributed controller such that a group of vehicles can achieve accurate state estimates and formation control even if the measurements of a subset of vehicle sensors are compromised by a malicious attacker. We propose an architecture consisting of a resilient observer, an attack detector, and an observer-based distributed controller. The distributed detector is able to update three sets of vehicle sensors: the ones surely under attack, surely attack-free, and suspected to be under attack. The adaptive observer saturates the measurement innovation through a preset static or time-varying threshold, such that the potentially compromised measurements have limited influence on the estimation. Essential properties of the proposed architecture include: 1) The detector is fault-free, and the attacked and attack-free vehicle sensors can be identified in finite time; 2) The observer guarantees both real-time error bounds and asymptotic error bounds, with tighter bounds when more attacked or attack-free vehicle sensors are identified by the detector; 3) The distributed controller ensures closed-loop stability. The effectiveness of the proposed methods is evaluated through simulations by an application to vehicle platooning.

eess.SY↗

On Spectral Properties of Signed Laplacians with Connections to Eventual Positivity

Signed graphs have appeared in a broad variety of applications, ranging from social networks to biological networks, from distributed control and computation to power systems. In this paper, we investigate spectral properties of signed Laplacians for undirected signed graphs. We find conditions on the negative weights under which a signed Laplacian is positive semidefinite via the Kron reduction and multiport network theory. For signed Laplacians that are indefinite, we characterize their inertias with the same framework. Furthermore, we build connections between signed Laplacians, generalized M-matrices, and eventually exponentially positive matrices.

eess.SY↗

Delay-sensitive Joint Optimal Control and Resource Management in Multi-loop Networked Control Systems

In the operation of networked control systems, where multiple processes share a resource-limited and time-varying cost-sensitive network, communication delay is inevitable and primarily influenced by, first, the control systems deploying intermittent sensor sampling to reduce the communication cost by restricting non-urgent transmissions, and second, the network performing resource management to minimize excessive traffic and eventually data loss. In a heterogeneous scenario, where control systems may tolerate only specific levels of sensor-to-controller latency, delay sensitivities need to be considered in the design of control and network policies to achieve the desired performance guarantees. We propose a cross-layer optimal co-design of control, sampling and resource management policies for an NCS consisting of multiple stochastic linear time-invariant systems which close their sensor-to-controller loops over a shared network. Aligned with advanced communication technology, we assume that the network offers a range of latency-varying transmission services for given prices. Local samplers decide either to pay higher cost to access a low-latency channel, or to delay sending a state sample at a reduced price. A resource manager residing in the network data-link layer arbitrates channel access and re-allocates resources if link capacities are exceeded. The performance of the local closed-loop systems is measured by a combination of linear-quadratic Gaussian cost and a suitable communication cost, and the overall objective is to minimize a defined social cost by all three policy makers. We derive optimal control, sampling and resource allocation policies under different cross-layer awareness models, including constant and time-varying parameters, and show that higher awareness generally leads to performance enhancement at the expense of higher computational complexity.

eess.SY↗

Temporal Logic Trees for Model Checking and Control Synthesis of Uncertain Discrete-time Systems

We propose algorithms for performing model checking and control synthesis for discrete-time uncertain systems under linear temporal logic (LTL) specifications. We construct temporal logic trees (TLT) from LTL formulae via reachability analysis. In contrast to automaton-based methods, the construction of the TLT is abstraction-free for infinite systems, that is, we do not construct discrete abstractions of the infinite systems. Moreover, for a given transition system and an LTL formula, we prove that there exist both a universal TLT and an existential TLT via minimal and maximal reachability analysis, respectively. We show that the universal TLT is an underapproximation for the LTL formula and the existential TLT is an overapproximation. We provide sufficient conditions and necessary conditions to verify whether a transition system satisfies an LTL formula by using the TLT approximations. As a major contribution of this work, for a controlled transition system and an LTL formula, we prove that a controlled TLT can be constructed from the LTL formula via control-dependent reachability analysis. Based on the controlled TLT, we design an online control synthesis algorithm, under which a set of feasible control inputs can be generated at each time step. We also prove that this algorithm is recursively feasible. We illustrate the proposed methods for both finite and infinite systems and highlight the generality and online scalability with two simulated examples.

eess.SY↗

Distributed Learning Model Predictive Control for Linear Systems

This paper presents a distributed learning model predictive control (DLMPC) scheme for distributed linear time invariant systems with coupled dynamics and state constraints. The proposed solution method is based on an online distributed optimization scheme with nearest-neighbor communication. If the control task is iterative and data from previous feasible iterations are available, local data are exploited by the subsystems in order to construct the local terminal set and terminal cost, which guarantee recursive feasibility and asymptotic stability, as well as performance improvement over iterations. In case a first feasible trajectory is difficult to obtain, or the task is non-iterative, we further propose an algorithm that efficiently explores the state-space and generates the data required for the construction of the terminal cost and terminal constraint in the MPC problem in a safe and distributed way. In contrast to other distributed MPC schemes which use structured positive invariant sets, the proposed approach involves a control invariant set as the terminal set, on which we do not impose any distributed structure. The proposed iterative scheme converges to the global optimal solution of the underlying infinite horizon optimal control problem under mild conditions. Numerical experiments demonstrate the effectiveness of the proposed DLMPC scheme.

eess.SY↗

Lambda-Policy Iteration with Randomization for Contractive Models with Infinite Policies: Well-Posedness and Convergence (Extended Version)

Abstract dynamic programming models are used to analyze $λ$-policy iteration with randomization algorithms. Particularly, contractive models with infinite policies are considered and it is shown that well-posedness of the $λ$-operator plays a central role in the algorithm. The operator is known to be well-posed for problems with finite states, but our analysis shows that it is also well-defined for the contractive models with infinite states studied. Similarly, the algorithm we analyze is known to converge for problems with finite policies, but we identify the conditions required to guarantee convergence with probability one when the policy space is infinite regardless of the number of states. Guided by the analysis, we exemplify a data-driven approximated implementation of the algorithm for estimation of optimal costs of constrained linear and nonlinear control problems. Numerical results indicate potentials of this method in practice.

eess.SY↗

Secure Platooning of Autonomous Vehicles Under Attacked GPS Data

In this paper, we study how to secure the platooning of autonomous vehicles when an unknown vehicle is under attack and bounded system uncertainties exist. For the attacked vehicle, its position and speed measurements from GPS can be manipulated arbitrarily by a malicious attacker. First, to find out which vehicle is under attack, two detectors are proposed by using the relative measurements (by camera or radar) and the local innovation obtained through measurements from neighboring vehicles. Then, based on the results of the detectors, we design a local state observer for each vehicle by applying a saturation method to the measurement innovation. Moreover, based on the neighbor state estimates provided by the observer, a distributed controller is proposed to achieve the consensus in vehicle speed and keep fixed desired distance between two neighboring vehicles. The estimation error by the observer and the platooning error by the controller are shown to be asymptotically upper bounded under certain conditions. The effectiveness of the proposed methods is also evaluated in numerical simulations.

eess.SY↗

Analysis, Online Estimation, and Validation of a Competing Virus Model

In this paper we introduce a discrete time competing virus model and the assumptions necessary for the model to be well posed. We analyze the system exploring its different equilibria. We provide necessary and sufficient conditions for the estimation of the model parameters from time series data and introduce an online estimation algorithm. We employ a dataset of two competing subsidy programs from the US Department of Agriculture to validate the model by employing the identification techniques. To the best of our knowledge, this work is the first to study competing virus models in discrete-time, online identification of spread parameters from time series data, and validation of said models using real data. These new contributions are important for applications since real data is naturally sampled.

eess.SY↗

Secure State Estimation with Byzantine Sensors: A Probabilistic Approach

This paper studies static state estimation in multi-sensor settings, with a caveat that an unknown subset of the sensors are compromised by an adversary, whose measurements can be manipulated arbitrarily. The attacker is able to compromise $q$ out of $m$ sensors. A new performance metric, which quantifies the asymptotic decay rate for the probability of having an estimation error larger than $δ$, is proposed. We develop an optimal estimator for the new performance metric with a fixed $δ$, which is the Chebyshev center of a union of ellipsoids. We further provide an estimator that is optimal for every $δ$, for the special case where the sensors are homogeneous. Numerical examples are given to elaborate the results.

eess.SY↗

Distributed Bandit Online Convex Optimization with Time-Varying Coupled Inequality Constraints

This paper considers the problem of distributed bandit online convex optimization with time-varying coupled inequality constraints. This problem can be defined as a repeated game between a group of learners and an adversary. The learners attempt to minimize a sequence of global loss functions and at the same time satisfy a sequence of coupled constraint functions. The global loss and the coupled constraint functions are the sum of local convex loss and constraint functions, respectively, which are adaptively generated by the adversary. The local loss and constraint functions are revealed in a bandit manner, i.e., only the values of loss and constraint functions at sampled points are revealed to the learners, and the revealed function values are held privately by each learner. We consider two scenarios, one- and two-point bandit feedback, and propose two corresponding distributed bandit online algorithms used by the learners. We show that sublinear expected regret and constraint violation are achieved by these two algorithms, if the accumulated variation of the comparator sequence also grows sublinearly. In particular, we show that $\mathcal{O}(T^{θ_1})$ expected static regret and $\mathcal{O}(T^{7/4-θ_1})$ constraint violation are achieved in the one-point bandit feedback setting, and $\mathcal{O}(T^{\max\{κ,1-κ\}})$ expected static regret and $\mathcal{O}(T^{1-κ/2})$ constraint violation in the two-point bandit feedback setting, where $θ_1\in(3/4,5/6]$ and $κ\in(0,1)$ are user-defined trade-off parameters. Finally, these theoretical results are illustrated by numerical simulations of a simple power grid example.

math.OC↗

Event-triggered Add-on Safety for Connected and Automated Vehicles Using Road-side Network Infrastructure

This paper proposes an event-triggered add-on safety mechanism to adjust the control parameters for timely braking in a networked vehicular system while maintaining maneuverability. Passenger vehicle maneuverability is significantly affected by the combined-slip friction effect, in which larger longitudinal tire slips result in considerable drop in lateral tire forces. This is of higher importance when unexpected dangerous situations occur on the road and immediate actions, such as braking, need to be taken to avoid collision. Harsh braking can lead to high-slip and loss of maneuverability, hence, timely braking is essential to reduce high-slip scenarios. In addition to the vehicles own active safety systems, the proposed event-triggered add-on safety is activated upon being informed about dangers by the road-side infrastructure. The aim is to incorporate the add-on safety feature to adjust the automatic control parameters for smooth and timely braking such that a collision is avoided while vehicle's maneuverability is maintained. We study two different wireless technologies for communication between the infrastructure and the vehicles, the Long-Term Evolution (LTE) and the fifth generation (5G) schemes. The framework is validated through high-fidelity software simulations and the advantages of including the add-on feature to augment the safety margins for each communication technology is evaluated.

eess.SY↗

An Online Approach to Physical Watermark Design

This paper considers the problem of designing physical watermark signals in order to optimally detect possible replay attack in a linear time-invariant system, under the assumption that the system parameters are unknown and need to be identified online. We first provide a replay attack model, where an adversary replays the previous sensor data in order to fool the system. A physical watermarking scheme, which leverages a random control input as a watermark to detect the replay attack, is then introduced. The optimal watermark signal design problem is cast as an optimization problem, which aims to achieve the optimal trade-off between control performance and intrusion detection. An online watermarking design and system identification algorithm is provided to deal with systems with unknown parameters. We prove that the proposed algorithm converges to the optimal one and characterize the almost sure convergence rate. A numerical example and an industrial process example are provided to illustrate the effectiveness of the proposed strategy.

eess.SY↗

Joint Cross-layer Optimization in Real-Time Networked Control Systems

Networked control system (NCS) refer to a set of control loops that are closed over a communication network. In this article, the joint operation of control and networking for NCS is investigated wherein the network serves the sensor-to-controller communication links for multiple stochastic linear time-invariant (LTI) sub-systems. The sensors sample packets based on the observed plant state, which they send over a shared multi-hop network. The network has limited communication resources, which need to be assigned to competing links to support proper control loop operation. In this set-up, we formulate an optimization problem to minimize the weighted-sum linear-quadratic-Gaussian (LQG) cost of all loops, taking into account the admissible sampling, control, congestion control and scheduling policies. Under some mild assumptions on the sampling frequencies of the control loops and the communication network, we find the joint optimal solution to be given by a certainty equivalence control with threshold-based sampling policy, as well as a back-pressure type scheduler with a simple pass-through congestion control. The interface between network and control loops is identified to be the buffer state of the sensor node, which can be interpreted as network price for sampling a packet from control perspective. We validate our theoretical claims by simulating NCSs comprising of multiple LTI stochastic control loops communicating over a two-hop cellular network.

eess.SY↗

Exponential Convergence for Distributed Smooth Optimization Under the Restricted Secant Inequality Condition

This paper considers the distributed smooth optimization problem in which the objective is to minimize a global cost function formed by a sum of local smooth cost functions, by using local information exchange. The standard assumption for proving exponential/linear convergence of first-order methods is the strong convexity of the cost functions, which does not hold for many practical applications. In this paper, we first show that the continuous-time distributed primal-dual gradient algorithm converges to one global minimizer exponentially under the assumption that the global cost function satisfies the restricted secant inequality condition. This condition is weaker than the strong convexity condition since it does not require convexity and the global minimizers are not necessary to be unique. We then show that the discrete-time distributed primal-dual algorithm constructed by using the Euler's approximation method converges to one global minimizer linearly under the same condition. The theoretical results are illustrated by numerical simulations.

math.OC↗

Performance Characterization Using AoI in a Single-loop Networked Control System

The joint design of control and communication scheduling in a Networked Control System (NCS) is known to be a hard problem. Several research works have successfully designed optimal sampling and/or control strategies under simplified communication models, where transmission delays/times are negligible or fixed. However, considering sophisticated communication models, with random transmission times, result in highly coupled and difficult-to-solve optimal design problems due to the parameter inter-dependencies between estimation/control and communication layers. To tackle this problem, in this work, we investigate the applicability of Age-of-Information (AoI) for solving control/estimation problems in an NCS under i.i.d. transmission times. Our motivation for this investigation stems from the following facts: 1) recent results indicate that AoI can be tackled under relatively sophisticated communication models, and 2) a lower AoI in an NCS may result in a lower estimation/control cost. We study a joint optimization of sampling and scheduling for a single-loop stochastic LTI networked system with the objective of minimizing the time-average squared norm of the estimation error. We first show that under mild assumptions on information structure the optimal control policy can be designed independently from the sampling and scheduling policies. We then derive a key result that minimizing the estimation error is equivalent to minimizing a function of AoI when the sampling decisions are independent of the state of the LTI system. Noting that minimizing the function of AoI is a stochastic combinatorial optimization problem and is hard to solve, we resort to heuristic algorithms obtained by extending existing algorithms in the AoI literature. We also identify a class of LTI system dynamics for which minimizing the estimation error is equivalent to minimizing the expected AoI.

eess.SY↗