可实现性
弹道
计算机科学
趋同(经济学)
多智能体系统
图形
数学优化
控制理论(社会学)
收敛速度
补偿(心理学)
机器人
计算
算法
数学
人工智能
钥匙(锁)
理论计算机科学
控制(管理)
经济增长
经济
物理
天文
计算机安全
心理学
精神分析
作者
Yunkai Lv,Hao Zhang,Zhuping Wang,Huaicheng Yan
标识
DOI:10.1109/tie.2021.3111571
摘要
This article considered the persistent real-time localization problem of dynamic multiagent systems with repetitive running characteristics under directed graph. The trajectory length of the agent is randomly varying caused by system constraints and external environment. A novel distributed iterative learning localization estimation method with full historical average data compensation is designed. The average value of all available historical data in the previous operations is used to compensate the incomplete trajectory. The designed diagnosis mechanism and search mechanism are used to determine whether the agent has stopped running and to screen out the available historical data. In order to reduce the computation burden, an improved distributed localization algorithm with receding horizon historical average data compensation is proposed. The asymptotic convergence of the estimation algorithms in the sense of mathematical expectation is derived through the rigorous analysis. Meanwhile, the influence of the incomplete repetitive trajectory of the agent on estimation error and convergence rate is also analyzed. The experimental result based on QBot-2e robot platform verifies the realizability of the proposed method.
科研通智能强力驱动
Strongly Powered by AbleSci AI