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
Evaluating Robustness of Consensus Algorithms Under Measurement Error over Digraphs
Consensus algorithms constitute a powerful tool for computing average values or coordinating agents in many distributed applications. Unfortunately, the same property that allows this computation (i.e., the nontrivial nullspace of the state matrix) leads to unbounded state variance in the presence of measurement errors. In this work, we explore the trade-off between relative and absolute communication (feedback) in the presence of measurement errors. We evaluate the robustness of first and second-order integrator systems under a parameterized family of controllers (homotopy), that continuously trade between relative and absolute feedback interconnections, in terms of the H 2 norm of an appropriately defined input-output system. Our approach extends the previous H 2 norm-based analysis to systems with directed feedback interconnections whose underlying weighted graph Laplacians are diagonalizable. Our results indicate that any level of absolute communication is sufficient to achieve a finite H 2 norm, but purely relative feedback can only achieve finite norms when the measurement error is not exciting the subspace associated with the consensus state. Numerical examples demonstrate that smoothly reducing the proportion of absolute feedback in double integrator systems smoothly decreases the system performance (increases the H 2 norm) and that this performance degradation is more rapid in systems with relative feedback in only the first state (position).
more »
« less
- PAR ID:
- 10106059
- Date Published:
- Journal Name:
- 2018 IEEE Conference on Decision and Control (CDC)
- Page Range / eLocation ID:
- 1238 to 1244
- Format(s):
- Medium: X
- Sponsoring Org:
- National Science Foundation
More Like this
-
-
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
-
This letter addresses the challenge of network synchronization under limited communication, involving heterogeneous agents with different dynamics and various network topologies, to achieve a consensus. We investigate the distributed adaptive control for interconnected unknown linear subsystems with a leader and followers, with the presence of input-output disturbance. We enhance the communication within multi-agent systems to achieve consensus under the leadership’s guidance. While the measured variable is similar among the followers, the incoming measurements are weighted and constructed based on their proximity to the leader. We also explore the convergence rates across various balanced topologies (Star-like, Cyclic-like, Path, Random), featuring different numbers of agents, using distributed first and high-order tuners. Moreover, we conduct several numerical simulations across various networks, agents and tuners to evaluate the effects of sparsity in the interaction between subsystems using the L2− norm and L∞− norm. Some networks exhibit a trend where an increasing number of agents results in smaller errors, although this is not universally the case. Additionally, patterns observed at initial times may not reliably predict overall performance across different networks. Finally, we demonstrate that the proposed modified high-order tuners outperform its counterpart, and we provide related insights along with our conclusions.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
-
This paper provides a framework to evaluate the performance of single and double integrator networks over arbitrary directed graphs. Adopting vehicular network terminology, we consider quadratic performance metrics defined by the L2-norm of position and velocity based response functions given impulsive inputs to each vehicle. We exploit the spectral properties of weighted graph Laplacians and output performance matrices to derive a novel method of computing the closed-form solutions for this general class of performance metrics, which include H2-norm based quantities as special cases. We then explore the effect of the interplay between network properties (such as edge directionality and connectivity) and the control strategy on the overall network performance. More precisely, for systems whose interconnection is described by graphs with normal Laplacian L, we characterize the role of directionality by comparing their performance with that of their undirected counterparts, represented by the Hermitian part of L. We show that, for single-integrator networks, directed and undirected graphs perform identically. However, for double-integrator networks, graph directionality -expressed by the eigenvalues of L with nonzero imaginary part- can significantly degrade performance. Interestingly, in many cases, well-designed feedback can also exploit directionality to mitigate degradation or even improve the performance to exceed that of the undirected case. Finally we focus on a system coherence metric -aggregate deviation from the state average- to investigate the relationship between performance and degree of connectivity, leading to somewhat surprising findings. For example, increasing the number of neighbors on a ω-nearest neighbor directed graph does not necessarily improve performance. Similarly, we demonstrate equivalence in performance between all-to-one and all-to-all communication graphs.more » « less
- Free Publicly Accessible Full Text
-
Accepted Manuscript1.0
- Conference Paper:
- https://doi.org/10.1109/CDC.2018.8619283
