考虑未知移动障碍物回避的覆盖控制

Marzieh Kooshkbaghi, F. Abdollahi
{"title":"考虑未知移动障碍物回避的覆盖控制","authors":"Marzieh Kooshkbaghi, F. Abdollahi","doi":"10.1109/ICROM.2014.6990882","DOIUrl":null,"url":null,"abstract":"This paper presents a new approach for coverage an environment in the presence of unknown moving obstacles. A time varying density function is proposed which represents the importance of each point and causes system to avoid collision with obstacles. A control law is presented to make agents follow the density function and avoid unknown moving obstacles while they provide the optimal coverage. The proposed algorithm is decentralized and less computationally expensive comparing to the previous related approaches.","PeriodicalId":177375,"journal":{"name":"2014 Second RSI/ISM International Conference on Robotics and Mechatronics (ICRoM)","volume":"191 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2014-12-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"Coverage control considering unknown moving obstacles avoidance\",\"authors\":\"Marzieh Kooshkbaghi, F. Abdollahi\",\"doi\":\"10.1109/ICROM.2014.6990882\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper presents a new approach for coverage an environment in the presence of unknown moving obstacles. A time varying density function is proposed which represents the importance of each point and causes system to avoid collision with obstacles. A control law is presented to make agents follow the density function and avoid unknown moving obstacles while they provide the optimal coverage. The proposed algorithm is decentralized and less computationally expensive comparing to the previous related approaches.\",\"PeriodicalId\":177375,\"journal\":{\"name\":\"2014 Second RSI/ISM International Conference on Robotics and Mechatronics (ICRoM)\",\"volume\":\"191 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2014-12-18\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2014 Second RSI/ISM International Conference on Robotics and Mechatronics (ICRoM)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICROM.2014.6990882\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2014 Second RSI/ISM International Conference on Robotics and Mechatronics (ICRoM)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICROM.2014.6990882","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

摘要

本文提出了一种覆盖未知移动障碍物环境的新方法。提出了一个时变的密度函数,表示每个点的重要性,使系统避免与障碍物碰撞。提出了一种控制律,使智能体遵循密度函数,在提供最优覆盖的同时避开未知的移动障碍物。与先前的相关方法相比,该算法具有分散性和计算成本较低的特点。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Coverage control considering unknown moving obstacles avoidance
This paper presents a new approach for coverage an environment in the presence of unknown moving obstacles. A time varying density function is proposed which represents the importance of each point and causes system to avoid collision with obstacles. A control law is presented to make agents follow the density function and avoid unknown moving obstacles while they provide the optimal coverage. The proposed algorithm is decentralized and less computationally expensive comparing to the previous related approaches.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信