从应用程序到目标搜索的连接性维护

Hiroaki Kata, S. Ueno
{"title":"从应用程序到目标搜索的连接性维护","authors":"Hiroaki Kata, S. Ueno","doi":"10.1080/18824889.2021.1893971","DOIUrl":null,"url":null,"abstract":"ABSTRACT Connectivity maintenance with application to target search considering the failure of unmanned vehicles is proposed. The unmanned vehicles form a network and exchange information with neighbours. Vehicle failures can cause network disconnection and disruption of information exchange. Therefore, the robust k-connected network, which the network is connected even if less than k unmanned vehicles fail, is configured in a decentralized system. Each vehicle determines the velocity input according to the partial vertex connectivity, which is an evaluation of connectivity for each vehicle, and triangulation input for collision avoidance. Target search simulation in the presence of obstacles shows that the proposed robust k-connected network control law is valid.","PeriodicalId":413922,"journal":{"name":"SICE journal of control, measurement, and system integration","volume":"11 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2021-03-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"Connectivity maintenance with application to target search\",\"authors\":\"Hiroaki Kata, S. Ueno\",\"doi\":\"10.1080/18824889.2021.1893971\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"ABSTRACT Connectivity maintenance with application to target search considering the failure of unmanned vehicles is proposed. The unmanned vehicles form a network and exchange information with neighbours. Vehicle failures can cause network disconnection and disruption of information exchange. Therefore, the robust k-connected network, which the network is connected even if less than k unmanned vehicles fail, is configured in a decentralized system. Each vehicle determines the velocity input according to the partial vertex connectivity, which is an evaluation of connectivity for each vehicle, and triangulation input for collision avoidance. Target search simulation in the presence of obstacles shows that the proposed robust k-connected network control law is valid.\",\"PeriodicalId\":413922,\"journal\":{\"name\":\"SICE journal of control, measurement, and system integration\",\"volume\":\"11 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2021-03-11\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"SICE journal of control, measurement, and system integration\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1080/18824889.2021.1893971\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"SICE journal of control, measurement, and system integration","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1080/18824889.2021.1893971","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

摘要

提出了一种考虑无人驾驶车辆故障的连接维护方法,并将其应用于目标搜索。无人驾驶车辆形成一个网络,并与邻居交换信息。车辆故障可能导致网络中断和信息交换中断。因此,在去中心化系统中配置鲁棒k连接网络,即在少于k辆无人车故障的情况下,网络仍保持连接。每辆车根据部分顶点连通性来确定速度输入,这是对每辆车的连通性的评估,以及避免碰撞的三角化输入。存在障碍物的目标搜索仿真结果表明,所提出的鲁棒k连接网络控制律是有效的。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Connectivity maintenance with application to target search
ABSTRACT Connectivity maintenance with application to target search considering the failure of unmanned vehicles is proposed. The unmanned vehicles form a network and exchange information with neighbours. Vehicle failures can cause network disconnection and disruption of information exchange. Therefore, the robust k-connected network, which the network is connected even if less than k unmanned vehicles fail, is configured in a decentralized system. Each vehicle determines the velocity input according to the partial vertex connectivity, which is an evaluation of connectivity for each vehicle, and triangulation input for collision avoidance. Target search simulation in the presence of obstacles shows that the proposed robust k-connected network control law is valid.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
CiteScore
1.20
自引率
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学术官方微信