Obstacle avoidance and collision avoidance of UAV swarm based on improved VFH algorithm and information sharing strategy

避碰 避障 计算机科学 偏移量(计算机科学) 障碍物 群体行为 排队 计算机视觉 碰撞 控制理论(社会学) 算法 人工智能 实时计算 机器人 移动机器人 控制(管理) 计算机网络 计算机安全 程序设计语言 法学 政治学
作者
Xiaowei Fu,ChenYuan Zhi,Di Wu
出处
期刊:Computers & Industrial Engineering [Elsevier BV]
卷期号:186: 109761-109761 被引量:7
标识
DOI:10.1016/j.cie.2023.109761
摘要

An obstacle avoidance and collision avoidance approach based on an improved VFH algorithm with Apollonius circle and information sharing strategy is put forward with the goal of guiding UAV swarms in formation flight in an unknown complex environment. For the second-order consensus protocol, a cooperative control law with the virtual leader is presented. For collision avoidance, the vector field histogram algorithm with Apollonius circle is proposed, and the obstacle sharing strategy is proposed to avoid obstacles in advance and solve the formation separation problem. The Apollonius circle is introduced to prevent the entanglement problem brought on by symmetry conflicts, and this approach aims to address the problem of collision avoidance among UAVs by updating the polar coordinate histogram based on the VFH algorithm in accordance with the motion state and relative position of other UAVs in the communication neighborhood. The equivalent detection range of UAVs in the swarm connected topology can be increased by sharing the locations of identified obstacles, improving total obstacle avoidance. Also, to reduce repetitive data interactions and communication loads when sharing obstacle information, a data offset mechanism is proposed, which stores the obstacle information in a chronological queue and sets a data offset in the queue for each UAV in the communication neighborhood to indicate the degree of synchronization with the data in the queue. Finally, simulation results show the effectiveness of the algorithm in collision avoidance and real-time obstacle avoidance of UAV swarm. Additionally, a data offset mechanism is suggested, which stores obstacle information in a chronological queue and sets a data offset in the queue for each UAV in the communication neighborhood to represent the degree of synchronization with the data in the queue, to reduce repetitive data interactions and communication loads when sharing obstacle information. Finally, simulation results demonstrate the algorithm's effectiveness in real-time obstacle avoidance and collision avoidance for UAV swarms.
最长约 10秒,即可获得该文献文件

科研通智能强力驱动
Strongly Powered by AbleSci AI
科研通是完全免费的文献互助平台,具备全网最快的应助速度,最高的求助完成率。 对每一个文献求助,科研通都将尽心尽力,给求助人一个满意的交代。
实时播报
KanmenRider发布了新的文献求助10
1秒前
CipherSage应助852采纳,获得10
3秒前
4秒前
大虫子发布了新的文献求助10
4秒前
8R60d8应助夏瑞采纳,获得10
4秒前
8秒前
8秒前
文章多多发布了新的文献求助10
9秒前
啊哈完成签到 ,获得积分10
12秒前
haozi王完成签到,获得积分10
13秒前
shuaideyapi完成签到,获得积分10
13秒前
13秒前
ShawnLyu应助KanmenRider采纳,获得20
14秒前
zz发布了新的文献求助10
14秒前
夏瑞完成签到,获得积分10
15秒前
传奇3应助酷炫灵安采纳,获得10
16秒前
请记住这个女人叫小美完成签到,获得积分10
16秒前
123发布了新的文献求助10
18秒前
852发布了新的文献求助10
18秒前
wjjjj完成签到 ,获得积分10
18秒前
汌舟完成签到,获得积分10
20秒前
23秒前
JamesPei应助沉默的幻枫采纳,获得10
24秒前
完美世界应助klxz采纳,获得10
26秒前
27秒前
111111发布了新的文献求助10
30秒前
31秒前
IMkily发布了新的文献求助10
32秒前
呆萌幻竹完成签到 ,获得积分10
34秒前
万能图书馆应助Kyle采纳,获得10
34秒前
34秒前
35秒前
An发布了新的文献求助10
36秒前
38秒前
klxz发布了新的文献求助10
39秒前
乐乐应助QianShenYu采纳,获得10
40秒前
40秒前
科研通AI2S应助文章多多采纳,获得10
42秒前
调皮醉波发布了新的文献求助10
44秒前
叶凡完成签到,获得积分10
45秒前
高分求助中
Encyclopedia of Mathematical Physics 2nd edition 888
Introduction to Strong Mixing Conditions Volumes 1-3 500
Tip60 complex regulates eggshell formation and oviposition in the white-backed planthopper, providing effective targets for pest control 400
Optical and electric properties of monocrystalline synthetic diamond irradiated by neutrons 320
共融服務學習指南 300
Essentials of Pharmacoeconomics: Health Economics and Outcomes Research 3rd Edition. by Karen Rascati 300
Peking Blues // Liao San 300
热门求助领域 (近24小时)
化学 材料科学 医学 生物 工程类 有机化学 物理 生物化学 纳米技术 计算机科学 化学工程 内科学 复合材料 物理化学 电极 遗传学 量子力学 基因 冶金 催化作用
热门帖子
关注 科研通微信公众号,转发送积分 3803708
求助须知:如何正确求助?哪些是违规求助? 3348555
关于积分的说明 10339310
捐赠科研通 3064745
什么是DOI,文献DOI怎么找? 1682727
邀请新用户注册赠送积分活动 808390
科研通“疑难数据库(出版商)”最低求助积分说明 764082