检索结果-内蒙古大学图书馆

Resilient algorithm for distributed resource allocation under false data injection attacks

ASIAN JOURNAL OF CONTROL 2024年第4期26卷 1635-1645页

作者： Chen, Xingzhi Cai, Xin Gao, Bingpeng Nan, Xinyuan Xinjiang Univ Sch Elect Engn Urumqi 830017 Peoples R China

For a first-order nonlinear multi-agent system who is subject to false data injection (FDI) attacks on agents' actuators and sensors, agents execute a distributed resource allocation algorithm according to the compromised control inputs and interactive information such that the multi-agent system is unstable and agents' decisions deviate from the optimal resource allocation. At first, we analyze the robustness of the distributed resource allocation algorithm under the FDI attacks. Then, a resilient distributed algorithm is proposed to solve the distributed resource allocation problem by resisting the adverse effect of the attacks. In detail, the unknown nonlinear term and the false data injected in agents are considered as extended states that can be estimated by extended state observers. The estimation is used in the feedback control to suppress the effect of the FDI attacks. As a result, the designed resilient algorithm ensures that agents' decisions converge to the optimal allocation without requiring any information about the nature of the attacks. An example is given to illustrate the results.

关键词： distributed algorithm false data injection attacks nonlinear dynamics resilient algorithm resource allocation

来源：评论

学校读者我要写书评

暂无评论

Provably-Good distributed algorithm for Constrained Multi-Robot Task Assignment for Grouped Tasks

引用

IEEE TRANSACTIONS ON ROBOTICS 2015年第1期31卷 19-30页

作者： Luo, Lingzhi Chakraborty, Nilanjan Sycara, Katia Carnegie Mellon Univ Inst Robot Pittsburgh PA 15213 USA SUNY Stony Brook Dept Mech Engn Stony Brook NY 11794 USA

In this paper, we present provably-good distributed task assignment algorithms for a heterogeneous multi-robot system, in which the tasks form disjoint groups and there are constraints on the number of tasks a robot can do (both within the overall mission and within each task group). Each robot obtains a payoff (or incurs a cost) for each task and the overall objective for task allocation is to maximize (minimize) the total payoff (cost) of the robots. In general, existing algorithms for task allocation either assume that tasks are independent or do not provide performance guarantee for the situation, in which task constraints exist. We present a distributed algorithm to provide an almost optimal solution for our problem. The key aspect of our distributed algorithm is that the overall objective is (almost) maximized by each robot maximizing its own objective iteratively (using a modified payoff function based on an auxiliary variable, called price of a task). Our distributed algorithm is polynomial in the number of tasks, as well as the number of robots.

关键词： Auction algorithm distributed algorithm multirobot task assignment task allocation

来源：评论

学校读者我要写书评

暂无评论

Hierarchically distributed Optimization with a Flexible and Complexity-Reducing algorithm

引用

Journal of Systems Science & Complexity 2024年第6期37卷 2530-2555页

作者： LIANG Shu ZHANG Lei WEI Yiheng LIU Yemo Department of Control Science and Engineering Tongji UniversityShanghai 200092China Shanghai Research Institute for Intelligent Autonomous Systems Shanghai 200092China School of Mathematics Southeast UniversityNanjing 211189China Beijing Aerospace Automatic Control Institute Beijing 100854China

In this paper,the authors consider distributed convex optimization over hierarchical *** authors exploit the hierarchical architecture to design specialized distributed algorithms so that the complexity can be reduced compared with that of non-hierarchically distributed *** this end,the authors use local agents to process local functions in the same manner as other distributed algorithms that take advantage of multiple agents'computing ***,the authors use pseudocenters to directly integrate lower-level agents'computation results in each iteration step and then share the outcomes through the higher-level network formed by *** authors prove that the complexity of the proposed algorithm exponentially decreases with respect to the total number of *** support the proposed decomposition-composition method for agents and pseudocenters,the authors develop a class of *** operators are generalizations of the widely-used subgradient based operator and the proximal operator and can be used in distributed convex ***,these operators are closed with respect to the addition and composition operations;thus,they are suitable to guide hierarchically distributed design and ***,these operators make the algorithm flexible since agents with different local functions can adopt suitable operators to simplify their ***,numerical examples also illustrate the effectiveness of the method.

关键词： Complexity convergence convex optimization distributed algorithm hierarchical network

来源：评论

学校读者我要写书评

暂无评论

A Serial Game distributed algorithmto ε-Minimum Vertex Cover of Networks in Finite Time

引用

IEEE TRANSACTIONS ON AUTOMATION SCIENCE AND ENGINEERING 2024年 22卷 1534-1542页

作者： Chen, Jie Zhou, Rongpei Gui, Weihua Natl Univ Def Technol Coll Elect Engn Hefei 230037 Peoples R China Nanchang Univ Sch Informat Engn Nanchang 330036 Peoples R China Cent South Univ Sch Automat Changsha 410083 Peoples R China

Vertex cover problem is a typical nondeterministic polynomial combinatorial optimization problem with wide applications. In order to seek a near-optimal solution in finite time, this article achieves the goal from the perspective of serial potential game optimization. Specifically, we present the vertex cover problem as a potential game, where the corresponding potential function minimizers are equivalent to the minimum vertex cover state. Then, we propose a novel polynomial-based serial game distributed algorithm, and prove that the algorithm can guarantee that strategies of all vertices converge to a epsilon-minimum vertex cover (epsilon-MVC) state in finite time. Compared with the existing representative optimization algorithms on networks and standard benchmarks, numerical simulations demonstrate our proposed algorithm can effectively balance solution efficiency and computation time. We hope this work provides insight for decision-makers designing a reasonable algorithm when solving nondeterministic polynomial optimization problems, so as to guarantee both solution quality and computation time. Note to Practitioners-Vertex cover problem has a wide range of practical applications. Many distributed optimization algorithms for the vertex cover problem are available in the existing literatures. However, those algorithms mainly pursue high-quality solutions in infinite time. Thus, one of the main challenges is to design a distributed algorithm that guarantees both solution quality and computation time. This article design a polynomial-based serial game algorithm, and prove that it can converge to the epsilon-MVC state in finite time. This article can serve as a supplement to the existing optimization algorithms for solving the vertex cover problem.

关键词： epsilon-minimum vertex cover serial game distributed algorithm finite time standard benchmark

来源：评论

学校读者我要写书评

暂无评论

Analysis of Ground Anchor Stations' Influence on Autonomous Orbit Determination with distributed algorithm

Analysis of Ground Anchor Stations' Influence on Autonomous ...

引用

第七届中国卫星导航学术年会

作者： Fanghong Huang Wende Huang Yueke Wang Yifan Zhou Kui Lin College of Mechatronics Engineering and Automation National University of Defense Technology

ISBN: (纸本)9789811009396

The orbit determination of the navigation constellation is the premise for navigation satellite system to realize navigation and position. Autonomous orbit determination based on ground anchor stations can improve the accuracy and survivability of the navigation system, but it has the rotation error. The addition of the ground anchor stations is a valid way to solve the problem. And because of the limited calculation resources on the satellite boards, the algorithm should be a distributed one which however is not the optimal. So it is meaningful to study the influence of the ground anchor stations on the distributed orbit determination algorithm. According to the requirement, first, this article describes the principle of distributed orbit determination algorithm. Second, it analyses the characteristics of it. Third, it studies the effect of ground anchor stations. In the last, it designs a work way in period and test the feasibility of it. The simulation result shows that ground anchor stations can control the rotation error well, but the simple EKF algorithm used to fuse the data of inter-satellite and satellite-to-ground range measurements constricts slow. In the last an improving algorithm is raised.

关键词： Autonomous orbit determination distributed algorithm anchor stations navigation constellation

来源：评论

学校读者我要写书评

暂无评论

A Survey of distributed algorithms for Aggregative Games

引用

IEEE-CAA JOURNAL OF AUTOMATICA SINICA 2025年第5期12卷 859-871页

作者： Li, Huaqing Li, Jun Ran, Liang Zheng, Lifeng Huang, Tingwen Southwest Univ Coll Elect & Informat Engn Chongqing Key Lab Nonlinear Circuits & Intelligent Chongqing 400715 Peoples R China Chongqing Univ Technol Coll Comp Sci & Engn Chongqing 400054 Peoples R China Shenzhen Univ Adv Technol Sch Comp Sci & Control Engn Shenzhen 518107 Peoples R China

Game theory-based models and design tools have gained substantial prominence for controlling and optimizing behavior within distributed engineering systems due to the inherent distribution of decisions among individuals. In non-cooperative settings, aggregative games serve as a mathematical framework model for the interdependent optimal decision-making problem among a group of non-cooperative players. In such scenarios, each player's decision is influenced by an aggregation of all players' decisions. Nash equilibrium (NE) seeking in aggregative games has emerged as a vibrant topic driven by applications that harness the aggregation property. This paper presents a comprehensive overview of the current research on aggregative games with a focus on communication topology. A systematic classification is conducted on distributed algorithm research based on communication topologies such as undirected networks, directed networks, and time-varying networks. Furthermore, it sorts out the challenges and compares the algorithms' convergence performance. It also delves into real-world applications of distributed optimization techniques grounded in aggregative games. Finally, it proposes several challenges that can guide future research directions.

关键词： Aggregative game distributed algorithm Nash equi-librium (NE) Nash equi-librium (NE) networked control networked control

来源：评论

学校读者我要写书评

暂无评论

DPkCR: distributed Proactive k-Connectivity Recovery algorithm for UAV-Based MANETs

引用

IEEE TRANSACTIONS ON RELIABILITY 2024年第4期73卷 1918-1932页

作者： Tosun, Mustafa Cabuk, Umut Can Haytaoglu, Elif Dagdeviren, Orhan Ozturk, Yusuf Pamukkale Univ Dept Comp Engn TR-20160 Denizli Turkiye San Diego State Univ Dept Elect & Comp Engn San Diego CA 92182 USA Ege Univ Int Comp Inst TR-35040 Izmir Turkiye Ege Univ Dept Comp Engn TR-35040 Izmir Turkiye

Maintenance of connectivity in mobile ad hoc networks (MANETs) and especially in flying ad hoc networks, consisting of unmanned aerial vehicles (UAV), has crucial importance. Missions planned within these types of networks can be interrupted due to node failures, link errors, etc. This case becomes more critical when the application is heavily communication-dependent. To alleviate such problems, in this article, we propose a distributed proactive k-connectivity recovery algorithm (DPkCR) for UAV-based MANETs. To this end, the algorithm has been developed and tested by providing realistic scenarios. The time and message complexity analysis of the algorithm is presented. Moreover, to analyze the performance of the proposed algorithm, we compared it with other k-connectivity restoration algorithms in the literature. Simulation results revealed that DPkCR outperforms the alternatives in terms of convergence time for the recovery phase and, subsequently, in terms of energy consumption. Furthermore, DPkCR provides improvements to the bandwidth requirements for the restoration.

关键词： Peer-to-peer computing Autonomous aerial vehicles Ad hoc networks Mobile computing Energy consumption Costs Topology Connectivity restoration distributed algorithm fault tolerance k-connectivity mobile ad hoc network (MANET) unmanned aerial vehicle (UAV)

来源：评论

学校读者我要写书评

暂无评论

distributed generalized Nash equilibrium seeking: A backward-reflected-forward-backward-based algorithm

引用

JOURNAL OF THE FRANKLIN INSTITUTE-ENGINEERING AND APPLIED MATHEMATICS 2024年第1期361卷 150-163页

作者： Zheng, Zuqing Li, Huaqing Niu, Youcheng Su, Enbing Feng, Liping Southwest Univ Coll Elect & Informat Engn Chongqing Key Lab Nonlinear Circuits & Intelligent Chongqing 400715 Peoples R China Xinzhou Teachers Univ Dept Comp Sci Xinzhou 034000 Peoples R China

This paper studies non-cooperative games, in which each player's local objective function depends on its own decisions as well as those of other players. In these games, each player's local objective function is differentiable, its decision is constrained by a local feasibility constraint, and the decisions of all players are coupled with an equality constraint. By analyzing the variational problem of the games, a distributed generalized Nash equilibrium seeking algorithm with fixed step sizes is developed based on the backward-reflected-forward-backward splitting. Each player performs a backward step followed by a forward-backward step, and the pseudo -gradient is evaluated at a reflection term. Moreover, the convergence of the proposed distributed algorithm is analyzed under standard assumptions using the operator theory and the convex analysis theory. Finally, the simulation results verify the effectiveness of the algorithm and the correctness of the theoretical analysis.

关键词： Generalized Nash equilibrium distributed algorithm Backward-reflected-forward-backward

来源：评论

学校读者我要写书评

暂无评论

distributed Accelerated NE Seeking algorithm With Improved Transient Performance: A Hybrid Approach

引用

IEEE TRANSACTIONS ON SYSTEMS MAN CYBERNETICS-SYSTEMS 2024年第8期54卷 4679-4687页

作者： Cai, Xin Dai, Ming-Zhe Hu, Cheng Xinjiang Univ Sch Intelligence Sci & Technol Urumqi 830017 Peoples R China Cent South Univ Sch Automat Changsha 410083 Peoples R China Xinjiang Univ Sch Math & Syst Sci Urumqi 830017 Peoples R China

This article studies a distributed Nash equilibrium (NE) seeking problem for multiple agents of aggregative games. A novel distributed algorithm is presented to assure both fast convergence and nonovershoot performance by the combination of an accelerated method and a gradient-based NE seeking algorithm. To be specific, an accelerated method (i.e., the heavy-ball method or Nesterov's accelerated method) is introduced in the designed algorithm for the fast convergence of agents' strategies to the NE. Moreover, a suitable switching mechanism is proposed to improve the transient performance by switching the distributed algorithm based on the accelerated method to the gradient-based algorithm. As a result, the presented distributed algorithm is modeled by a hybrid dynamical system (HDS). The semi-globally practical convergence is established by analyzing the stability of a parameterized HDS. An example of distributed energy resources is taken to verify the presented algorithm.

关键词： Accelerated method aggregative games distributed algorithm Nash equilibrium (NE) seeking

来源：评论

学校读者我要写书评

暂无评论

distributed Predefined-Time algorithm for System of Linear Equations Over Directed Networks

引用

IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS II-EXPRESS BRIEFS 2024年第4期71卷 2139-2143页

作者： Lian, Mengke Guo, Zhenyuan Wen, Shiping Huang, Tingwen Res Inst HNU Chongqing Chongqing 401135 Peoples R China Hunan Univ Sch Math Changsha 410082 Peoples R China Univ Technol Sydney Australian AI Inst Fac Engn Informat Technol Ultimo NSW 2007 Australia Texas A&M Univ Qatar Sci Program Doha Qatar

In this brief, we propose a predefined-time algorithm based on multi-agent networks for solving linear equations of the form $Ax = b$ , where the predefined-time can be predesigned by the user and each agent only knows partial rows of the augmented matrix $(A\;b)$ . By reformulating the system of linear equations as an unconstrained optimization problem and applying the time-base generator technology to optimization approaches, we provide a gradient-based predefined-time algorithm over weight-balanced directed graphs, which can converge to a solution at a given time. Finally, this theoretical results are illustrated by a numerical examples.

关键词： distributed algorithm multi-agent network predefined-time directed graphs system of linear equations

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：