A Hybrid Obstacle Avoidance Strategy Based on PSO in Source Location

Mengshi Zhao, Pengzhan Qiu, Junqi Zhang
{"title":"A Hybrid Obstacle Avoidance Strategy Based on PSO in Source Location","authors":"Mengshi Zhao, Pengzhan Qiu, Junqi Zhang","doi":"10.1109/ICACI52617.2021.9435875","DOIUrl":null,"url":null,"abstract":"This paper focuses on obstacle avoidance in the source location problem, in which robots capture the signal strength and find the signal source in an unknown environment. This work proposes a particle swarm optimizer (PSO) with a hybrid obstacle avoidance strategy to solve the problem. The signal strength is considered as the fitness function for PSO to guide robots. During moving, artificial potential fields are adopted to make robots avoid obstacles and each other. A deadlock escaping strategy is put forward to deal with the constraints of concave obstacles. The weighted average velocity of a robot is employed to check whether it is stuck by an obstacle. If so, a tabu area is set to push robots out of the area and prevent them from searching the same place again. These tabu areas offer robots key information about obstacles in an unknown environment and improve robots’ ability of obstacle avoidance. The proposed algorithm is adaptive in unknown environments, meaning that no prior knowledge is needed. Simulation tests verify the effectiveness of the developed algorithm, showing satisfactory performance when dealing with concave obstacles.","PeriodicalId":382483,"journal":{"name":"2021 13th International Conference on Advanced Computational Intelligence (ICACI)","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2021-05-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2021 13th International Conference on Advanced Computational Intelligence (ICACI)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICACI52617.2021.9435875","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

This paper focuses on obstacle avoidance in the source location problem, in which robots capture the signal strength and find the signal source in an unknown environment. This work proposes a particle swarm optimizer (PSO) with a hybrid obstacle avoidance strategy to solve the problem. The signal strength is considered as the fitness function for PSO to guide robots. During moving, artificial potential fields are adopted to make robots avoid obstacles and each other. A deadlock escaping strategy is put forward to deal with the constraints of concave obstacles. The weighted average velocity of a robot is employed to check whether it is stuck by an obstacle. If so, a tabu area is set to push robots out of the area and prevent them from searching the same place again. These tabu areas offer robots key information about obstacles in an unknown environment and improve robots’ ability of obstacle avoidance. The proposed algorithm is adaptive in unknown environments, meaning that no prior knowledge is needed. Simulation tests verify the effectiveness of the developed algorithm, showing satisfactory performance when dealing with concave obstacles.
基于粒子群算法的源定位混合避障策略
本文主要研究避障问题中的避障问题,即机器人在未知环境中捕捉信号强度并找到信号源。本文提出一种混合避障策略的粒子群优化器(PSO)来解决这一问题。将信号强度作为适应度函数,用于粒子群算法引导机器人。在移动过程中,采用人工势场使机器人避开障碍物和彼此避开。针对凹障碍物的约束,提出了一种死锁逃逸策略。利用机器人的加权平均速度来检测机器人是否被障碍物卡住。如果是这样,则设置一个禁忌区域,将机器人赶出该区域,并防止它们再次搜索同一地方。这些禁忌区域为机器人提供了未知环境中障碍物的关键信息,提高了机器人的避障能力。该算法在未知环境下自适应,不需要先验知识。仿真实验验证了该算法的有效性,在处理凹形障碍物时表现出令人满意的性能。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
文献相关原料
公司名称 产品信息 采购帮参考价格
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信