Communication Resource-Efficient Vehicle Platooning Control With Various Spacing Policies

Platooning represents one of the key features that connected automated vehicles may possess as it allows multiple automated vehicles to be maneuvered cooperatively with small headways on roads. However, a critical challenge in accomplishing automated vehicle platoons is to deal with the effects of intermittent and sporadic vehicle-to-vehicle data transmissions caused by limited wireless communication resources. This paper addresses the co-design problem of dynamic event-triggered communication scheduling and cooperative adaptive cruise control for a convoy of automated vehicles with diverse spacing policies. The central aim is to achieve automated vehicle platooning under various gap references with desired platoon stability and spacing performance requirements, while simultaneously improving communication efficiency. Toward this aim, a dynamic event-triggered scheduling mechanism is developed such that the intervehicle data transmissions are scheduled dynamically and efficiently over time. Then, a tractable co-design criterion on the existence of both the admissible event-driven cooperative adaptive cruise control law and the desired scheduling mechanism is derived. Finally, comparative simulation results are presented to substantiate the effectiveness and merits of the obtained results.

Dynamic Event-Triggered Consensus Control for Input Constrained Multi-Agent Systems With a Designable Minimum Inter-Event Time

This paper investigates the consensus control of multi-agent systems(MASs) with constrained input using the dynamic event-triggered mechanism(ETM).Consider the MASs with small-scale networks where a centralized dynamic ETM with global information of the MASs is first designed.Then,a distributed dynamic ETM which only uses local information is developed for the MASs with large-scale networks.It is shown that the semi-global consensus of the MASs can be achieved by the designed bounded control protocol where the Zeno phenomenon is eliminated by a designable minimum inter-event time.In addition,it is easier to find a trade-off between the convergence rate and the minimum inter-event time by an adjustable parameter.Furthermore,the results are extended to regional consensus of the MASs with the bounded control protocol.Numerical simulations show the effectiveness of the proposed approach.

Event-triggered leader-following formation control for multi-agent systems under communication faults: application to a fleet of unmanned aerial vehicles

The main contribution of this paper is the design of an event-triggered formation control for leader-following consensus in second-order multi-agent systems(MASs)under communication faults.All the agents must follow the trajectories of a virtual leader despite communication faults considered as smooth time-varying delays dependent on the distance between the agents.Linear matrix inequalities(LMIs)-based conditions are obtained to synthesize a controller gain that guarantees stability of the synchronization error.Based on the closed-loop system,an event-triggered mechanism is designed to reduce the control law update and information exchange in order to reduce energy consumption.The proposed approach is implemented in a real platform of a fleet of unmanned aerial vehicles(UAVs)under communication faults.A comparison between a state-of-the-art technique and the proposed technique has been provided,demonstrating the performance improvement brought by the proposed approach.

Neural-network-based fully distributed formation control for nonlinear multi-agent systems with event-triggered communication

This paper investigates the consensus-based formation control problem for multi-agent systems with unknown nonlinear dynamics.To achieve the desired formation,we propose two formation controllers to achieve the desired formation,one based on system states and the other on system outputs.The proposed controllers utilize adaptive gains to avoid global information and neural networks to estimate and compensate for nonlinearities.The proposed event-triggered schemes avoid continuous communication among agents and exclude the Zeno behavior.Stability analysis reveals that formation errors are bounded,and numerical simulations are used to validate the effectiveness of the proposed approaches.

Discontinuous event-trigger scheme for global stabilization of state-dependent switching neural networks with communication delay

This paper is concerned with the global stabilization of state-dependent switching neural networks(SDSNNs)viadiscontinuous event-triggered control with network-induced communication delay.Aiming at decreasing triggering times,a discontinuous event-trigger scheme is utilized to determine whether the sampling information is required to be sent outor not.Meanwhile,under the effect of communication delay,the trigger condition and SDSNNs are transformed into twotractable models by designing a fictitious delay function.Then,using the Lyapunov–Krasovskii stability theory,someinequality estimation techniques,and extended reciprocally convex combination method,two sufficient criteria are established for ensuring the global stabilization of the resulting closed-loop SDSNNs,respectively.A unified framework isderived that has the ability to handle the simultaneous existence of the communication delay,the properties of discontinuousevent-trigger scheme,as well as feedback controller design.Additionally,the developed results demonstrate a quantitativerelationship among the event trigger parameter,communication delay,and triggering times.Finally,two numerical examples are presented to illustrate the usefulness of the developed stabilization scheme.

Dynamic Event-Triggered Scheduling and Platooning Control Co-Design for Automated Vehicles Over Vehicular Ad-Hoc Networks

This paper deals with the co-design problem of event-triggered communication scheduling and platooning control over vehicular ad-hoc networks(VANETs)subject to finite communication resource.First,a unified model is presented to describe the coordinated platoon behavior of leader-follower vehicles in the simultaneous presence of unknown external disturbances and an unknown leader control input.Under such a platoon model,the central aim is to achieve robust platoon formation tracking with desired inter-vehicle spacing and same velocities and accelerations guided by the leader,while attaining improved communication efficiency.Toward this aim,a novel bandwidth-aware dynamic event-triggered scheduling mechanism is developed.One salient feature of the scheduling mechanism is that the threshold parameter in the triggering law is dynamically adjusted over time based on both vehicular state variations and bandwidth status.Then,a sufficient condition for platoon control system stability and performance analysis as well as a co-design criterion of the admissible event-triggered platooning control law and the desired scheduling mechanism are derived.Finally,simulation results are provided to substantiate the effectiveness and merits of the proposed co-design approach for guaranteeing a trade-off between robust platooning control performance and communication efficiency.

Event-Triggered Differentially Private Average Consensus for Multi-agent Network

This paper investigates the differentially private problem of the average consensus for a class of discrete-time multi-agent network systems(MANSs). Based on the MANSs,a new distributed differentially private consensus algorithm(DPCA) is developed. To avoid continuous communication between neighboring agents, a kind of intermittent communication strategy depending on an event-triggered function is established in our DPCA. Based on our algorithm, we carry out the detailed analysis including its convergence, its accuracy, its privacy and the trade-off between the accuracy and the privacy level, respectively. It is found that our algorithm preserves the privacy of initial states of all agents in the whole process of consensus computation. The trade-off motivates us to find the best achievable accuracy of our algorithm under the free parameters and the fixed privacy level. Finally, numerical experiment results testify the validity of our theoretical analysis.

Communication-Censored Distributed Learning for Stochastic Configuration Networks

This paper aims to reduce the communication cost of the distributed learning algorithm for stochastic configuration networks (SCNs), in which information exchange between the learning agents is conducted only at a trigger time. For this purpose, we propose the communication-censored distributed learning algorithm for SCN, namely ADMMM-SCN-ET, by introducing the event-triggered communication mechanism to the alternating direction method of multipliers (ADMM). To avoid unnecessary information transmissions, each learning agent is equipped with a trigger function. Only if the event-trigger error exceeds a specified threshold and meets the trigger condition, the agent will transmit the variable information to its neighbors and update its state in time. The simulation results show that the proposed algorithm can effectively reduce the communication cost for training decentralized SCNs and save communication resources.

Nash equilibrium computation of two-network zero-sum games with event-triggered communication

In this paper,a zero-sum game Nash equilibrium computation problem with event-triggered communication is investigated under an undirected weight-balanced multi-agent network.A novel distributed event-triggered projection subgradient algorithm is developed to reduce the communication burden within the subnetworks.In the proposed algorithm,when the difference between the current state of the agent and the state of the last trigger time exceeds a given threshold,the agent will be triggered to communicate with its neighbours.Moreover,we prove that all agents converge to Nash equilibrium by the proposed algorithm.Finally,two simulation examples verify that our algorithm not only reduces the communication burden but also ensures that the convergence speed and accuracy are close to that of the time-triggered method under the appropriate threshold.

Bipartite quasi-synchronization of multiple neural networks with generalized cooperative-competitive topology

This study examines the bipartite quasi-synchronization(B-Q synchronization)issue of coupled networks with general cooperative-competitive topology and the event-triggered communications between nodes to curb the communication cost.In the existing literature concerning bipartite synchronization,the network topology is required to be structurally balanced,which necessitates that competitive interactions exist only between two distinct subgroups.In this study,we aim to lengthen the network’s topology to a more general signed network in which antagonistic interactions can exist in the same or different subgroups.According to signed graph theory and the markovian stochastic event-triggering mechanism,the dynamical model of multiple neural networks(MNNs)with structurally unbalanced and markovian event-triggered communication is established.By utilizing the stochastic Lyapunov stability analysis,some adequate criteria for B-Q synchronization of MNNs with the structurally unbalanced graph are obtained;also,a bound for the B-Q synchronization error is provided.As a special case,the bipartite synchronization criteria for MNNs with the structurally balanced graph are also obtained.Finally,two simulations are performed to verify the theoretical result.