4.7 Article

Multiagent Interval Consensus With Flocking Dynamics

期刊

IEEE TRANSACTIONS ON AUTOMATIC CONTROL
卷 67, 期 8, 页码 3965-3980

出版社

IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
DOI: 10.1109/TAC.2021.3120619

关键词

Stability analysis; Multi-agent systems; Asymptotic stability; Convergence; Social networking (online); Damping; Optimization; Directed network; existence and uniqueness of an equilibrium point; interval consensus; second-order multiagent systems (MASs)

资金

  1. National Natural Science Foundation of China [61922076, 62003322, 62036002, 62003239]

向作者/读者索取更多资源

This article investigates the interval consensus for a network of agents with flocking dynamics. Two different frameworks of interval constraints are studied, and solutions are provided for both cases. The equilibrium points and stability conditions are established. Numerical examples are given to illustrate the theoretical findings.
In this article, we investigate the interval consensus for a network of agents with flocking dynamics, i.e., second-order multiagent systems, where each agent imposes an interval constraint on its preferred consensus values, with the aim of driving the agent into a favorable interval. Specifically, we work on two different frameworks of interval constraints, viz., the first one that the node states are constrained in their own constraint intervals and the second one that the node states are constrained in their neighbors' constraint intervals. For both of the frameworks, we provide a complete solution to the equilibrium seeking problem by resolving a system of nonlinear equations. It is proved that if the underlying graph is strongly connected and the intersection of constraint intervals is empty, then there exists a unique equilibrium point; and if the intersection is nonempty, then there exist multiple equilibrium points, all of which lead to state consensus. We also establish several conditions for the local stability of the unique equilibrium point (corresponding to the case with empty intersection of constraint intervals) or local constraint consensus (corresponding to the case with nonempty intersection of constraint intervals) by invoking Lyapunov's indirect method. Characterization of the global behavior of such a second-order multiagent system is technically rather challenging at this stage. As a first step toward this end, we show in two special cases that global convergence to the unique equilibrium point or state consensus can be guaranteed by employing Lyapunov stability theory and robust analysis techniques. Finally, some numerical examples are provided to illustrate the theoretical findings.

作者

我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。

评论

主要评分

4.7
评分不足

次要评分

新颖性
-
重要性
-
科学严谨性
-
评价这篇论文

推荐

Article Engineering, Electrical & Electronic

Privacy-Preserving Operation Management of Battery Swapping and Charging System With Dual-Based Benders Decomposition

Yanni Wan, Jiahu Qin, Yang Shi, Weiming Fu, Dunfeng Zhang

Summary: This paper investigates the privacy-preserving operation management problem of battery swapping and charging system (BSCS) and proposes a novel dual-based Benders decomposition algorithm to address the challenges of privacy protection and scheduling efficiency.

IEEE TRANSACTIONS ON SMART GRID (2023)

Article Automation & Control Systems

Distributed Linear Equations Over Random Networks

Peng Yi, Jinlong Lei, Jie Chen, Yiguang Hong, Guodong Shi

Summary: In this article, the authors studied the convergence and convergence rate of distributed linear equation protocols over a *-mixing random network. They proposed a distributed projection consensus algorithm and proved its exponential convergence rate in the mean-squared sense for networks with exact solutions. Additionally, they proposed a distributed randomized projection consensus algorithm and established an exponential rate of convergence. Moreover, they proved that a distributed gradient-descent-like algorithm with diminishing step-sizes can drive all nodes' states to a least-squares solution at a sublinear rate for networks without exact solutions.

IEEE TRANSACTIONS ON AUTOMATIC CONTROL (2023)

Article Automation & Control Systems

A Tightly Coupled Feature-Based Visual-Inertial Odometry With Stereo Cameras

Lei Yu, Jiahu Qin, Shuai Wang, Yaonan Wang, Shi Wang

Summary: This article presents a novel feature-based visual-inertial odometry method called FSVIO, which utilizes both visual and inertial information in both the front and the back end. It introduces an IMU-aided feature-based method in the front-end visual processing part to build robust descriptors for image perspective deformation caused by camera motion. It also applies a fast-tracking method to improve feature matching efficiency and reduces outliers caused by dynamic environment or nonconvexity of the image.

IEEE TRANSACTIONS ON INDUSTRIAL ELECTRONICS (2023)

Article Automation & Control Systems

Distributed projection-free algorithm for constrained aggregative optimization

Tongyu Wang, Peng Yi

Summary: In this paper, a distributed Frank-Wolfe algorithm based on gradient tracking is proposed to solve a distributed convex aggregative optimization problem in a network. The algorithm minimizes the sum of cost functions by maintaining two estimates at each node. The proposed algorithm is projection-free and only involves solving a linear optimization problem at each step. Convergence and computational efficiency of the algorithm are demonstrated through numerical simulations.

INTERNATIONAL JOURNAL OF ROBUST AND NONLINEAR CONTROL (2023)

Article Automation & Control Systems

Generalized multi-cluster game under partial-decision information with applications to management of energy internet

Yue Chen, Peng Yi

Summary: This study focuses on the decision making and management of engineering networks that involve conflicting interests among multiple parties, treated as a multi-cluster game. Each cluster is a self-interested player in a non-cooperative game, optimizing the cost function of the cluster. Challenges arise in large-scale networks where agent information is not immediately available beyond the cluster, challenging existing Nash equilibrium seeking algorithms. A distributed generalized Nash equilibrium seeking algorithm is proposed, allowing agents to estimate strategies of other clusters via communication with neighbors using an undirected network. The algorithm is proven to converge.

JOURNAL OF THE FRANKLIN INSTITUTE-ENGINEERING AND APPLIED MATHEMATICS (2023)

Article Automation & Control Systems

Security Analysis for Dynamic State Estimation of Power Systems With Measurement Delays

Zhijian Cheng, Hongru Ren, Jiahu Qin, Renquan Lu

Summary: This article focuses on the cybersecurity research of dynamic state estimation for power systems with measurement delays. A delayed measurement model is constructed based on mixed measurements from PMUs and RTUs. A modified state estimator using the Kalman filter is designed, and a chi-square-based attack detection method is proposed.

IEEE TRANSACTIONS ON CYBERNETICS (2023)

Article Automation & Control Systems

Distributed Bayesian Inference Over Sensor Networks

Baijia Ye, Jiahu Qin, Weiming Fu, Yingda Zhu, Yaonan Wang, Yu Kang

Summary: In this article, two novel distributed variational Bayesian algorithms are proposed for a general class of conjugate-exponential models over synchronous and asynchronous sensor networks. The PB-DVB algorithm is designed for synchronous networks, introducing a penalty function based on KL divergence to penalize the difference of posterior distributions between nodes. The TPB-DVB algorithm is developed for asynchronous networks by borrowing the token-passing approach and stochastic variational inference. Applications of the proposed algorithm on the GMM are exhibited, showing good performance in estimation/inference ability, robustness against initialization, and convergence speed for PB-DVB algorithm and superiority over existing token-passing-based distributed clustering algorithms for TPB-DVB algorithm.

IEEE TRANSACTIONS ON CYBERNETICS (2023)

Article Automation & Control Systems

Nash Equilibrium Seeking for High-Order Multiagent Systems With Unknown Dynamics

Yutao Tang, Peng Yi

Summary: In this article, a Nash equilibrium seeking problem for a class of high-order multiagent systems with unknown dynamics is considered. The objective is to steer the outputs of these uncertain high-order agents to the Nash equilibrium of some noncooperative game in a distributed manner. To overcome the difficulties brought by the high-order structure, unknown nonlinearities, and the regulation requirement, a virtual player is introduced for each agent and an auxiliary noncooperative game is solved. A distributed adaptive protocol is developed by embedding this auxiliary game dynamics into some proper tracking controller for the original agent to resolve this problem. The parameter convergence issue is also discussed under certain persistence of excitation conditions. The efficacy of the algorithms is verified by numerical examples.

IEEE TRANSACTIONS ON CONTROL OF NETWORK SYSTEMS (2023)

Article Computer Science, Artificial Intelligence

DAGCRN: Graph convolutional recurrent network for traffic forecasting with dynamic adjacency matrix

Zheng Shi, Yingjun Zhang, Jingping Wang, Jiahu Qin, Xiaoqian Liu, Hui Yin, Hua Huang

Summary: Accurate and real-time traffic forecasting is crucial for urban traffic planning, control, and management. However, considering the time-varying dynamic spatial relations and complex spatial-temporal dependencies remains an open problem. To address this, we propose DAGCRN, a graph convolutional recurrent network that incorporates a dynamic adjacency matrix and an encoder-decoder framework for traffic forecasting. DAGCRN includes modules for relation extraction, adjacency matrix update, dynamic graph convolution, and global temporal attention. Experimental results on real-world traffic speed datasets demonstrate that DAGCRN consistently outperforms several representative baselines.

EXPERT SYSTEMS WITH APPLICATIONS (2023)

Article Engineering, Electrical & Electronic

Predefined-Time Distributed Nash Equilibrium Seeking for Noncooperative Games With Event-Triggered Communication

Jiehan Liu, Peng Yi

Summary: This paper investigates a predefined-time distributed Nash equilibrium seeking problem for a class of noncooperative games under an event-triggered scenario. A novel approach is proposed to achieve fast convergence while reducing communication and computation costs by using gradient play, consensus-based estimator, and a time base generator (TBG).

IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS II-EXPRESS BRIEFS (2023)

Article Automation & Control Systems

Mapless Navigation With Safety-Enhanced Imitation Learning

Chengzhen Yan, Jiahu Qin, Qingchen Liu, Qichao Ma, Yu Kang

Summary: This article presents a method for safely training a mapless navigation policy using imitation learning with 2-D LiDAR inputs. The proposed training scheme includes controlled exploration strategy, safety-enhanced loss function, and a data augmentation technique. The method demonstrates remarkable performance in terms of training safety and navigation success rate.

IEEE TRANSACTIONS ON INDUSTRIAL ELECTRONICS (2023)

Article Engineering, Civil

A Game-Based Battery Swapping Station Recommendation Approach for Electric Vehicles

Lili Ran, Yanni Wan, Jiahu Qin, Weiming Fu, Dunfeng Zhang, Yu Kang

Summary: It is important to develop a coordinated battery swapping station (BSS) recommendation method to reduce the cost of electric vehicles (EVs) and optimize the operation of BSS system. This paper proposes a game theory-based approach to recommend suitable BSSs for EVs by considering the battery swapping cost, diversity of BSS capacities, and differentiated demands of EVs. A price function is designed to regulate the swapping price of each BSS, and an iterative algorithm is employed to seek the Nash equilibrium. The proposed approach effectively reduces the average cost of EVs, improves the success rate of battery swapping, and balances the utilization ratio of BSSs compared to the shortest distance approach.

IEEE TRANSACTIONS ON INTELLIGENT TRANSPORTATION SYSTEMS (2023)

Article Computer Science, Artificial Intelligence

An Efficient Deep Reinforcement Learning Algorithm for Mapless Navigation with Gap-Guided Switching Strategy

Heng Li, Jiahu Qin, Qingchen Liu, Chengzhen Yan

Summary: In this paper, a gap-guided controller switching strategy is proposed to improve the training efficiency of deep reinforcement learning. By incorporating prior knowledge into network training through the combination of an online-mapless planner and expert demonstration, random exploration and sparse rewards in complex scenarios are avoided.

JOURNAL OF INTELLIGENT & ROBOTIC SYSTEMS (2023)

Article Automation & Control Systems

Adaptive ELM-Based Security Control for a Class of Nonlinear-Interconnected Systems With DoS Attacks

Xiaozheng Jin, Shaoyu Lu, Jiahu Qin, Wei Xing Zheng, Qingchen Liu

Summary: This article focuses on the output feedback security control of high-order nonlinear-interconnected systems with denial-of-service attacks, nonlinear dynamics, and exogenous disturbances. It adopts extreme learning machine (ELM) and adaptive techniques for nonlinear approximation and develops novel adaptive ELM-based nonlinear state observers to estimate unmeasurable states during DoS attacks under the influence of disturbances. Additionally, adaptive ELM-based controllers are proposed to achieve uniformly ultimately bounded results by combining with backstepping control and filtering techniques under the influence of DoS attacks, nonlinear dynamics, and exogenous disturbances. Comparative studies validate the effectiveness of the developed ELM-based adaptive observation and control strategies for two interconnected power systems.

IEEE TRANSACTIONS ON CYBERNETICS (2023)

Article Automation & Control Systems

Distributed Optimization With Projection-Free Dynamics: A Frank-Wolfe Perspective

Guanpu Chen, Peng Yi, Yiguang Hong, Jie Chen

Summary: In this article, we focus on solving distributed constrained optimization problems. We propose a distributed projection-free dynamics based on the Frank-Wolfe method to avoid projection operations caused by constraints. The approach finds a feasible descent direction through solving an alternative linear suboptimization problem. We also analyze the convergence of the continuous-time dynamical systems and derive a discrete-time scheme with a proved convergence rate of $O(1/k)$. Moreover, we compare our proposed dynamics with existing distributed projection-based dynamics and other distributed Frank-Wolfe algorithms to demonstrate its advantage.

IEEE TRANSACTIONS ON CYBERNETICS (2023)

暂无数据