Resilient coordinated movement of connected autonomous vehicles
From MaRDI portal
Publication:2667540
Abstract: In this paper, we consider coordinated movement of a network of vehicles consisting of a bounded number of malicious agents, that is, vehicles must reach consensus in longitudinal position and a common predefined velocity. The motions of vehicles are modeled by double-integrator dynamics and communications over the network are asynchronous with delays. Each normal vehicle updates its states by utilizing the information it receives from vehicles in its vicinity. On the other hand, misbehaving vehicles make updates arbitrarily and might threaten the consensus within the network by intentionally changing their moving direction or broadcasting faulty information in their neighborhood. We propose an asynchronous updating strategy for normal vehicles, based on filtering extreme values received from neighboring vehicles, to save them from being misguided by malicious vehicles. We show that there exist topological constraints on the network in terms of graph robustness under which the vehicles resiliently achieve coordinated movement. Numerical simulations are provided to evaluate the results.
Recommendations
- Conditions to provable system-wide optimal coordination of connected and automated vehicles
- scientific article; zbMATH DE number 7682269
- Decentralized optimal coordination of connected and automated vehicles for multiple traffic scenarios
- Coordinated motion of autonomous vehicles with the use of a distributed gradient algorithm
- Coordinated control of networked vehicles: specification and control
- Optimal time trajectory and coordination for connected and automated vehicles
- A combinatorial dynamic network trajectory reservation algorithm for connected autonomous vehicles
- Cooperative optimal control for connected and automated vehicles platoon
Cites work
- A Notion of Robustness in Complex Networks
- A Sufficient Condition for Convergence of Sampled-Data Consensus for Double-Integrator Dynamics With Nonuniform and Time-Varying Communication Delays
- Consensus Computation in Unreliable Networks: A System Theoretic Approach
- Consensus of multiple double-integrator agents with intermittent measurement
- Consensus of second-order multi-agent systems in the presence of locally bounded faults
- Distributed consensus tracking for multi-agent systems under two types of attacks
- Distributed coordination of multi-agent networks. Emergent problems, models, and issues.
- Distributed fault detection for interconnected second-order systems
- Dynamical consensus seeking of second-order multi-agent systems based on delayed state compensation
- Graph theoretic methods in multiagent networks
- scientific article; zbMATH DE number 996442 (Why is no real title available?)
- scientific article; zbMATH DE number 51132 (Why is no real title available?)
- Iterative approximate Byzantine consensus in arbitrary directed graphs
- Optimal Byzantine-resilient convergence in uni-dimensional robot networks
- Reaching a Consensus in a Dynamically Changing Environment: A Graphical Approach
- Resilient consensus of second-order agent networks: asynchronous update rules with delays
- State consensus for multi-agent systems with switching topologies and time-varying delays
Cited in
(4)- Distributed resilient consensus on general digraphs under cyber-attacks
- Optimal time trajectory and coordination for connected and automated vehicles
- Managing traffic evacuation with multiclass connected and autonomous vehicles
- On the non-resiliency of subsequence reduced resilient consensus in multiagent networks
This page was built for publication: Resilient coordinated movement of connected autonomous vehicles
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2667540)
