Distributed Shape Formation of Multirobot Systems via Dynamic Assignment

IF 7.2 1区 工程技术 Q1 AUTOMATION & CONTROL SYSTEMS IEEE Transactions on Industrial Electronics Pub Date : 2024-09-04 DOI:10.1109/TIE.2024.3436657
Xing Li;Rui Zhou;Yunjie Zhang;Guibin Sun
{"title":"Distributed Shape Formation of Multirobot Systems via Dynamic Assignment","authors":"Xing Li;Rui Zhou;Yunjie Zhang;Guibin Sun","doi":"10.1109/TIE.2024.3436657","DOIUrl":null,"url":null,"abstract":"In this article, we propose a fully distributed algorithm that leverages the concept of exploration behavior to achieve the shape formation control of multirobot systems. Here, the exploration behavior means that each robot can actively explore the unoccupied goal locations in the shape, thus removing the prior goal assignment for each robot and increasing the system's flexibility. This exploration behavior can be realized by mimicking the negative phototaxis observed in nature. To be specific, each robot can dynamically choose multiple goal locations with the light intensity less than a given value in its sensing range, which can be computed by local information. Furthermore, we employ local peer-to-peer communications to propagate the unoccupied goal, and then the trapped robots will move toward the remote unoccupied goal, thus ensuring and speeding up the convergence. In the meantime, the control command can be obtained by solving a constrained optimization function. Moreover, the theoretical analysis reveals that our algorithm can drive robots to achieve the desired shape if the initial distance between robots’ positions and goal locations satisfies the distance condition. Finally, simulation and physical experiment results demonstrate adaptability to complex shapes and swarm sizes and high efficiency of our algorithm.","PeriodicalId":13402,"journal":{"name":"IEEE Transactions on Industrial Electronics","volume":"72 3","pages":"3017-3027"},"PeriodicalIF":7.2000,"publicationDate":"2024-09-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE Transactions on Industrial Electronics","FirstCategoryId":"94","ListUrlMain":"https://ieeexplore.ieee.org/document/10665965/","RegionNum":1,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"AUTOMATION & CONTROL SYSTEMS","Score":null,"Total":0}
引用次数: 0

Abstract

In this article, we propose a fully distributed algorithm that leverages the concept of exploration behavior to achieve the shape formation control of multirobot systems. Here, the exploration behavior means that each robot can actively explore the unoccupied goal locations in the shape, thus removing the prior goal assignment for each robot and increasing the system's flexibility. This exploration behavior can be realized by mimicking the negative phototaxis observed in nature. To be specific, each robot can dynamically choose multiple goal locations with the light intensity less than a given value in its sensing range, which can be computed by local information. Furthermore, we employ local peer-to-peer communications to propagate the unoccupied goal, and then the trapped robots will move toward the remote unoccupied goal, thus ensuring and speeding up the convergence. In the meantime, the control command can be obtained by solving a constrained optimization function. Moreover, the theoretical analysis reveals that our algorithm can drive robots to achieve the desired shape if the initial distance between robots’ positions and goal locations satisfies the distance condition. Finally, simulation and physical experiment results demonstrate adaptability to complex shapes and swarm sizes and high efficiency of our algorithm.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
通过动态分配实现多机器人系统的分布式形状形成
在本文中,我们提出了一种利用探索行为概念来实现多机器人系统形状形成控制的全分布式算法。这里的探索行为是指每个机器人可以主动探索形状中未被占用的目标位置,从而消除了每个机器人的先验目标分配,增加了系统的灵活性。这种探索行为可以通过模仿自然界中观察到的负趋光性来实现。具体而言,每个机器人可以动态选择多个目标位置,光强小于其感知范围内的给定值,这些位置可以通过局部信息计算得到。此外,我们采用本地点对点通信来传播未被占用的目标,然后被困机器人将向远程未被占用的目标移动,从而保证和加快收敛速度。同时,通过求解约束优化函数得到控制命令。理论分析表明,当机器人位置与目标位置之间的初始距离满足距离条件时,我们的算法可以驱动机器人达到期望的形状。最后,仿真和物理实验结果证明了该算法对复杂形状和群体规模的适应性和高效率。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
IEEE Transactions on Industrial Electronics
IEEE Transactions on Industrial Electronics 工程技术-工程:电子与电气
CiteScore
16.80
自引率
9.10%
发文量
1396
审稿时长
6.3 months
期刊介绍: Journal Name: IEEE Transactions on Industrial Electronics Publication Frequency: Monthly Scope: The scope of IEEE Transactions on Industrial Electronics encompasses the following areas: Applications of electronics, controls, and communications in industrial and manufacturing systems and processes. Power electronics and drive control techniques. System control and signal processing. Fault detection and diagnosis. Power systems. Instrumentation, measurement, and testing. Modeling and simulation. Motion control. Robotics. Sensors and actuators. Implementation of neural networks, fuzzy logic, and artificial intelligence in industrial systems. Factory automation. Communication and computer networks.
期刊最新文献
Research on Improving Maximum Torque of Interior PMSM Based on Shift Structure and Magnetic Field Phase Characteristics Autonomous Predefined-Time Distributed Control for Multihybrid Energy Storage Systems With State-of-Charge Balance Security-Oriented Gain-Scheduling Mechanism for Minecart Switched Active Suspension Systems Under Redundant Channel Transmission Protocol Intelligent Servo Motor Diagnosis via Control-Sensing Consistency Contrast in Industrial Environments: Toward Noninvasive Monitoring Multisensor Fusion Enhanced Evidential Space Transformation Model (ESTM) for Structural Defects Inspection of Porcelain Bushings in Power Systems
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1