5 April 2023 in IEEE Transactions on Control of Network Systems
In this paper, we study the problem of consensus-based distributed optimization, where a network of agents, abstracted as a directed graph, aims to minimize the sum of all agents' cost functions collaboratively. In existing distributed optimization approaches (Push-Pull/AB) for directed graphs, all agents exchange their states with neighbors to achieve the optimal solution with a constant stepsize, which may lead to the disclosure of sensitive and private information. For privacy preservation, we propose a novel state-decomposition based gradient tracking approach (SD-Push-Pull) for distributed optimization over directed networks that preserves differential privacy, which is a strong notion that protects agents' privacy against an adversary with arbitrary auxiliary information. The main idea of the proposed approach is to decompose the gradient state of each agent into two sub-states. Only one substate is exchanged by the agent with its neighbours over time, and the other one is not shared. That is to say, only one substate is visible to an adversary, protecting the sensitive information from being leaked. It is proved that under certain decomposition principles, a bound for the sub-optimality of the proposed algorithm can be derived and the differential privacy is achieved simultaneously. Moreover, the trade-off between differential privacy and the optimization accuracy is also characterized. Finally, a numerical simulation is provided to illustrate the effectiveness of the proposed approach.
26 November 2024 in IEEE Transactions on Industrial Informatics
Although distributed renewable energy sources (DRESs) provide a sustainable solution to future microgrids (MGs), their fluctuant power outputs can incur frequency instability. The work studies the load frequency control (LFC) for MGs with the integration of wind energy under a hierarchical architecture. At the DRES level, a model predictive control method is employed together with an intensified event-triggered scheme considering multiple historic released signals to improve the computation efficiency. At the MG level, robustness specification is addressed in mean-square asymptotic stability to relieve the fluctuations caused by wind power penetration. Furthermore, the phasor measurement unit (PMU) failure and intermittent transmissions are considered in the control design, leading to the resilient control policy. Besides, this article extends the applicability of conventional small-signal LFC model by adding an uncertain matrix to tolerant the parameter variation due to the shift of the steady-state operating point caused by wind energy integration. The closed-loop performance based on the deployed resilient LFC strategy is verified through hardware-in-the-loop experiments, by which the frequency regulations against PMU failures and intermittent communication at different levels are effectively exhibited.
13 March 2023 in IEEE Transactions on Automatic Control
Average consensus is extensively used in distributed networks for computation and control, where all the agents constantly communicate with each other and update their states in order to reach an agreement. Under a general average consensus algorithm, information exchanged through wireless or wired communication networks could lead to the disclosure of sensitive and private information. In this paper, we propose a privacy-preserving push-sum approach for directed networks that can protect the privacy of all agents while achieving average consensus simultaneously. Each node decomposes its initial state arbitrarily into two substates, and their average equals to the initial state, guaranteeing that the agent's state will converge to the accurate average consensus. Only one substate is exchanged by the node with its neighbours over time, and the other one is reserved. That is to say, only the exchanged substate would be visible to an adversary, preventing the initial state information from leakage. Different from the existing state-decomposition approach which only applies to undirected graphs, our proposed approach is applicable to strongly connected digraphs. In addition, in direct contrast to offset-adding based privacy-preserving push-sum algorithm, which is vulnerable to an external eavesdropper, our proposed approach can ensure privacy against both an honest-but-curious node and an external eavesdropper. A numerical simulation is provided to illustrate the effectiveness of the proposed approach.
10 January 2024 in IEEE Transactions on Automatic Control
In recent years, there has been a growing interest in distributed optimization, which collaboratively attains an optimum by exchanging information with neighbours. Among the various distributed algorithms available, optimization with gradient tracking is particularly notable for its superior convergence results, especially in the context of directed graphs. However, privacy concerns arise when gradient information is transmitted directly which would induce more information leakage. Surprisingly, the literature has not adequately addressed the associated privacy issues. In response to the gap, our paper proposes a privacy-preserving distributed optimization algorithm with gradient tracking by adding noises to transmitted messages, namely, the decision variables and the estimate of the aggregated gradient. We prove two dilemmas for this kind of algorithm. In the first dilemma, we reveal that this distributed optimization algorithm with gradient tracking cannot achieve $ \epsilon$ -differential privacy (DP) and exact convergence simultaneously. Building on this, we subsequently highlight that the algorithm fails to achieve $ \epsilon$ -DP when employing non-summable stepsizes in the presence of Laplace noises. It is crucial to emphasize that these findings hold true regardless of the size of the privacy metric $ \epsilon$ . After that, we rigorously analyse the convergence performance and privacy level given summable stepsize sequences under Laplace distribution since it is only with summable stepsizes that is meaningful for us to study. We derive sufficient conditions that allow for the simultaneous stochastically bounded accuracy and $ \epsilon$ -DP. Recognizing that several options can meet these conditions, we further derive an upper bound of the mean error's variance and specify the mathematical expression of $ \epsilon$ under such conditions. Numerical simulations are provided to demonstrate the effectiveness of our proposed algorithm.
5 September 2022 in IEEE Transactions on Intelligent Transportation Systems
A vehicle platoon is a group of vehicles driving together with a harmonized speed and a short inter-vehicle gap by using vehicle automation and vehicle-to-vehicle communication. Platoons have to share road with human-driven vehicles (HDVs) and can only be applied in heterogeneous traffic flow for a long period. Driver cut-in behavior (DCB) towards a platoon can be frequently expected in such driving context. In this paper, to understand and simulate such behavior, we propose a platoon-oriented cut-in behavior (POCB) model by fusing a lateral and a longitudinal control model into the queuing network (QN) cognitive architecture. Platoon-oriented cut-in experiments are conducted to collect driver data under cut-in from back and front scenarios, which both include six sub-scenarios with different platoon gaps or initial velocities. We demonstrate the effectiveness of the proposed model in simulating the DCB towards platoons by comparing experimental and simulation results under various driving scenarios across different subjects.
14 May 2024 in IEEE Transactions on Automatic Control
In this article, we propose a dynamic platoon management and cooperative driving framework for a mixed traffic flow consisting of multiple connected automated vehicles (CAVs) and possible human-driven vehicles (HDVs) that can be regarded as the surrounding vehicles (SVs). Specifically, the proposed framework consists of three stages. At the first stage, the cruising information of all the SVs will be collected by the leader CAV through the cellular-vehicle-to-X (C-V2X) infrastructure, while an automatic decision-making driving assistance system(ADMDSS) is constructed to determine the driving states of the platoon. When the HDVs approach the communication range of the platoon, in the second stage, the trajectories of the HDVs will be estimated and the reference trajectory planning for the leader CAV and the cooperative controller design for the follower CAVs will be activated, respectively, by using C-V2X infrastructure. We consider two types of social driving behaviors (SDBs): courteous and rude, where the optimal trajectory estimation for the SDBs will be obtained by the known social preferences of the SVs. While the HDVs enable to impose their social cut-in intentions into the platoon, the ADMDSS will provide a high-level driving guidance to the platoon to adjust the time-varying space error among the CAVs rejecting the potential cut-in behaviors. For this case, the problems of collision avoidance, energy efficiency, and stability of the platoon will be solved at the third stage within a finite time by designing a cooperative trajectory tracking optimization algorithm. Simulation cases are presented to illustrate the effectiveness of the proposed approaches.