This article delves into the challenges of ensuring stability (in some sense) and robustness in large-scale second-order consensus networks (SOCNs) and autonomous vehicle platoons in the discrete-time domain. We propose a graph-theoretic methodology for designing a state feedback law for these systems in a discrete-time framework. By analyzing the behavior of the solutions of the networks based on the algebraic properties of the Laplacian matrices of the underlying graphs and on the value of the update cycle (also known as the time step) of each vehicle, we provide a necessary and sufficient condition for the stability of a linear second-order consensus network in the discrete-time domain. We then perform an $\mathcal {H}_{2}$ -based robustness analysis to demonstrate the relationship between the $\mathcal {H}_{2}$ -norm of the system, network size, connectivity, and update cycles, providing insights into how these factors impact the convergence and robustness of the system. A key contribution of this work is the development of a formal framework for understanding the link between an $\mathcal {H}_{2}$ -based performance measure and the restrictions on the update cycle of the vehicles. Specifically, we show that denser networks (i.e., networks with more communication links) might require faster agents (i.e., smaller update cycles) to outperform or achieve the same level of robustness as sparse networks (i.e., networks with fewer communication links) - see Fig. 1. These findings have important implications for the design and implementation of large-scale consensus networks and autonomous vehicle platoons, highlighting the need for a balance between network density and update cycle speed for optimal performance. We finish the article with results from simulations and experiments that illustrate the effectiveness of the proposed framework in predicting the behavior of vehicle platoons, even for more complex agents with nonlinear dynamics, using Quanser's Qlabs and Qcars.
more »
« less
Role of Agent Update Cycle in Stability and Robustness of Second-Order Consensus Networks
We consider the problems of asymptotic stability and robustness in large-scale second-order consensus networks and vehicle platoons in the discrete-time domain. First, we develop a graph-theoretic methodology to design the state feedback law for the second-order consensus networks and vehicle platoons in a discrete-time framework. We analyze the stability of such networks based on algebraic properties of the Laplacian matrices of underlying graphs and each vehicle’s update cycle (also known as the time step). We further provide a necessary and sufficient condition of stability of a linear second-order consensus network in the discrete-time domain. Moreover, we evaluate the robustness of the consensus networks by employing the expected value of the steady-state dispersion of the state of the entire network, also known as squared H2-norm, as a performance measure. We show the connection between performance measures with respect to network size, connectivity, and the update cycle. The main contribution of this work is that we provide a formal framework to quantify the relation between scaling performance measures and restrictions of the vehicles’ update cycles. Specifically, we show that denser networks (i.e., networks with more communications/edges) require faster agents (i.e., smaller update cycles) to outperform or achieve the same level of robustness as sparse networks (i.e., networks with fewer communications/edges).
more »
« less
- Award ID(s):
- 2121121
- PAR ID:
- 10352499
- Date Published:
- Journal Name:
- 2022 30th Mediterranean Conference on Control and Automation (MED)
- Page Range / eLocation ID:
- 643 to 648
- Format(s):
- Medium: X
- Sponsoring Org:
- National Science Foundation
More Like this
-
-
This work investigates local and global measures of disorder in large-scale directed networks of double-integrator systems connected over a multi-dimensional torus. We quantify these performance measures in systems subjected to distributed disturbances using an H2 norm with outputs corresponding to local state errors or deviations from the global average. We consider two directed uni-directional state feedback inter- connections that correspond to relative position and relative velocity feedback in vehicle network applications. Our main result reveals that absolute state feedback plays a critical role in system robustness when local state measurements are uni- directional. Specifically, if absolute measurements of either state variable are available, then systems with uni-directional relative feedback perform as well as their symmetric bi-directional counterparts but have the advantage of reduced communication requirements. However in the absence of absolute feedback their performance is worse; in fact, it is impossible to maintain stability (i.e. a finite H2 norm) with uni-directional state mea- surements for arbitrarily large networks. Numerical examples illustrate the theory.more » « less
-
We consider distributed consensus in networks where the agents have integrator dynamics of order two or higher (n>=2). We assume all feedback to be localized in the sense that each agent has a bounded number of neighbors and consider a scaling of the network through the addition of agents in a modular manner, i.e., without re-tuning controller gains upon addition. We show that standard consensus algorithms, which rely on relative state feedback, are subject to what we term scale fragilities, meaning that stability is lost as the network scales. For high-order agents (n>=3), we prove that no consensus algorithm with fixed gains can achieve consensus in networks of any size. That is, while a given algorithm may allow a small network to converge, it causes instability if the network grows beyond a certain finite size. This holds in families of network graphs whose algebraic connectivity, that is, the smallest non-zero Laplacian eigenvalue, is decreasing towards zero in network size (e.g. all planar graphs). For second-order consensus (n=2) we prove that the same scale fragility applies to directed graphs that have a complex Laplacian eigenvalue approaching the origin (e.g. directed ring graphs). The proofs for both results rely on Routh–Hurwitz criteria for complex-valued polynomials and hold true for general directed network graphs. We survey classes of graphs subject to these scale fragilities, discuss their scaling constants, and finally prove that a sub-linear scaling of nodal neighborhoods can suffice to overcome the issue.more » « less
-
New mobility concepts are at the forefront of research and innovation in smart cities. The introduction of connected and autonomous vehicles enables new possibilities in vehicle routing. Specifically, knowing the origin and destination of each agent in the network can allow for real-time routing of the vehicles to optimize network performance. However, this relies on individual vehicles being "altruistic" i.e., being willing to accept an alternative non-preferred route in order to achieve a network-level performance goal. In this work, we conduct a study to compare different levels of agent altruism and the resulting effect on the network-level traffic performance. Specifically, this study compares the effects of different underlying urban structures on the overall network performance, and investigates which characteristics of the network make it possible to realize routing improvements using a decentralized optimization router. The main finding is that, with increased vehicle altruism, it is possible to balance traffic flow among the links of the network. We show evidence that the decentralized optimization router is more effective with networks of high load while we study the influence of cities characteristics, in particular: networks with a higher number of nodes (intersections) or edges (roads) per unit area allow for more possible alternate routes, and thus higher potential to improve network performance.more » « less
-
This research explores the inherent vulnerability of nonlinear vehicle platoons characterized by the oscillatory behavior triggered by external perturbations. The perturbation exerted on the vehicle platoon is regarded as an external force on an object. Following the mechanical vibration analysis in mechanics, this research proposes a vibration-theoretic approach that advances our understanding of platoon vulnerability from two aspects. First, the proposed approach introduces damping intensity to characterize vehicular platoon vulnerability, which divides platoon oscillations into two types, i.e., underdamped and overdamped. The damping intensity measures the platoon’s recovery strength in responding to perturbations. Second, the proposed approach can obtain the resonance frequency of a nonlinear vehicle platoon, where resonance amplifies platoon oscillation magnitude when the external perturbation frequency equals the platoon’s damping oscillation frequency. The main contribution of this research lies in the analytical derivation of the closed-form formulas of damping intensity and resonance frequency. In particular, the proposed approach formulates platoon dynamics under perturbation as a second-order non-homogeneous ordinary differential equation, enabling rigorous derivations and analyses for platoons with complicated nonlinear car-following behaviors. Through simulations built on real-world data, this paper demonstrates that an overdamped vehicle platoon is more robust against perturbations, and an underdamped platoon can be destabilized easily by exerting a perturbation at the platoon’s resonance frequency. The theoretical derivations and simulation results shed light on the design of reliable platooning control, either for human-driven or automated vehicles, to suppress the adverse effects of oscillations.more » « less
- Free Publicly Accessible Full Text
-
Accepted Manuscript1.0
- Conference Paper:
- https://doi.org/10.1109/MED54222.2022.9837161
