期刊文献+

基于平均一致协议的分布式自适应多智能体聚集控制

Distributed Adaptive Multi-agent Rendezvous Control Based on Average Consensus Protocol
下载PDF
导出
摘要 分布式聚集控制问题是多智能体协同控制中的一个重要问题。由于智能体的可移动性和感知能力有限,传统的分布式聚集算法难以保证连通性,从而聚集成多个簇群。此外,去中心化的大规模聚集控制给获取全局聚集点带来了巨大的挑战。针对连通性保护问题,基于平均一致协议与约束集,提出了一个带有连通性约束的多智能体聚集协议(Multi-Agent Rendezvous Protocol with Connectivity constraints,MARP-CC)。然后针对聚集点无法预测的问题,提出了位置合成(Location Synthesis Strategy,LSS)和位置重定向(Location Redirection Strategy,LRS)两种控制策略。智能体根据当前连通情况,自适应选择最优的控制策略进行迭代。结合这两种控制策略,提出了带连通性约束的分布式自适应多智能体聚集算法(Distributed Adaptive Multi-Agent Rendezvous algorithm with Connectivity Constraints,DAMAR-CC)。对算法的收敛性和连通性进行了分析,并通过大量的仿真说明了DAMAR-CC可以引导智能体稳定地聚集在初始拓扑的几何中心。 Distributed rendezvous control is an important issue in multi-agent collaborative control.Due to the limited mobility and perception capabilities of agents,traditional distributed rendezvous algorithms are difficult to ensure connectivity,thereby aggregating multiple clusters.In addition,decentralized large-scale rendezvous control poses a huge challenge to obtaining global rendezvous points.For the connectivity protection problem,based on the average consensus protocol and constraint set,a multi-agent rendezvous protocol with connectivity constraints(MARP-CC)is proposed.Then,for the rendezvous point unpredictability problem,location synthesis(LSS)and location redirection(LRS)control strategies are proposed.The agent adaptively selects the optimal control strategy for iteration based on the current connectivity situation.Finally,combining these two control strategies,a distributed adaptive multi-agent rendezvous algorithm with connectivity constraints(DAMAR-CC)is proposed.The conver-gence and connectivity analysis of the algorithm are given,and a large number of simulations show that DAMAR-CC can make agents stably rendezvous at the geometric center of the initial topology.
作者 谢光强 钟必为 李杨 XIE Guangqiang;ZHONG Biwei;LI Yang(School of Computer Science and Technology,Guangdong University of Technology,Guangzhou 510006,China)
出处 《计算机科学》 CSCD 北大核心 2024年第5期242-249,共8页 Computer Science
基金 国家自然科学基金(62006047) 广东省重点领域研发计划项目(2021B0101220004)。
关键词 平均一致 连通性保持 多智能体聚集 约束集 Average consensus Connectivity maintenance Multi-agent rendezvous Constraint set
  • 相关文献

参考文献4

二级参考文献38

  • 1原魁,李园,房立新.多移动机器人系统研究发展近况[J].自动化学报,2007,33(8):785-794. 被引量:73
  • 2Ando H, Suzuki I, Yamashita M. Formation and agreement problems for synchronous mobile robots with limited visibility[C]. Proc of IEEE Int Symposium on Intelligent Control. Monterey: IEEE Press, 1995: 453-460.
  • 3Dimarogonas D V, Kyriakopoulos K J. On the rendezvous problem for multiple nonholonomic agents[J]. IEEE Trans on Automatic Control, 2007, 52(5): 916-922.
  • 4Martinez S, Bullo F, Cortes Jetal. On synchronous robotic networks, Part II: Time complexity of rendezvous and deployment algorithms[J]. IEEE Trans on Automatic Control, 2007, 52(12): 2214-2226.
  • 5Li D, Spong M W. Stable flocking of multiple inertial agents on balanced graphs[J]. IEEE Trans on Automatic Control, 2007, 52(8): 1469-1475.
  • 6Litus Y, Zebrowski P, Vaughan R T. A distributed heuristic for energy efficient multirobot multiplace rendezvous[J]. IEEE Trans on Robotics, 2009, 25(1): 130-135.
  • 7Ando H, Oasa Y, Suzuki Ietal. Distributed memoryless point convergence algorithm for mobile robots with limited visibility[J]. IEEE Trans on Robotics and Automation, 1999, 15(5): 818-828.
  • 8Ji M, Egerstedt M. Distributed coordination control of multi-agent systems while preserving connectedness[J]. IEEE Trans on Robotics, 2007, 23(4): 693-703.
  • 9Zavlanos M M, Jadbabaie A, Pappas G J. Flocking while preserving network connectivity[C]. Proc of the 46th IEEE Conf on Decision and Control. New Orleans: IEEE Press, 2007: 2919-2924.
  • 10Su H,Wang X, Chen G. A connectivity-preserving flocking algorithm for multi-agent systems based only on position measurements[J]. Int J of Control, 2009, 82(7): 1334-1343.

共引文献38

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部