基于贪婪策略的协同区域覆盖检测无人机群任务自动规划

Rentuo Tao, Shikang Li, Xianzhe Xu, Yawei Chen, Linghao Xia, Yuhao Yang
{"title":"基于贪婪策略的协同区域覆盖检测无人机群任务自动规划","authors":"Rentuo Tao, Shikang Li, Xianzhe Xu, Yawei Chen, Linghao Xia, Yuhao Yang","doi":"10.1109/ICUS55513.2022.9986918","DOIUrl":null,"url":null,"abstract":"Unmanned Aerial Vehicle(UAVs) swarm has great advantage over traditional equipment in cooperative detection scenario for its easy-maneuverability, no human injury and low cost, etc. As a representative task in cooperative detection, region coverage has widely applications in environmental monitoring, search and rescue, etc. In UAV cooperative detection tasks, the most critical step is task planning, which has direct impact on the overall detection performance. The target of task planning is to generate planned actions and flight route for UAVs to complete specific detection task according to UAV swarm locations, sensor ability, task region, etc. However, traditional task planning methods for UAV cooperative detection that based on evolutionary computing or reinforcement learning always need plenty of time for getting planning results. In this paper, we proposed a top-down task planning algorithm based on greedy policy to tackle this problem. The core idea of the proposed method lies in that we choose optimal detection trace from all trace candidates during each planning step in a greedy manner via a predefined performance indicator. Moreover, we also proposed a simple but effective procedure for generate detection trace candidates by corner points and nearest border points extraction. To evaluate the effectiveness of the proposed method, we conducted comprehensive experiments for the representative swarm detection task region coverage. Experiment results demonstrated the effectiveness of the proposed method and superiority over traditional methods on task planning speed.","PeriodicalId":345773,"journal":{"name":"2022 IEEE International Conference on Unmanned Systems (ICUS)","volume":"60 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2022-10-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Automatic UAV Swarm Task Planning in Cooperative Region Coverage Detection based on Greedy Policy\",\"authors\":\"Rentuo Tao, Shikang Li, Xianzhe Xu, Yawei Chen, Linghao Xia, Yuhao Yang\",\"doi\":\"10.1109/ICUS55513.2022.9986918\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Unmanned Aerial Vehicle(UAVs) swarm has great advantage over traditional equipment in cooperative detection scenario for its easy-maneuverability, no human injury and low cost, etc. As a representative task in cooperative detection, region coverage has widely applications in environmental monitoring, search and rescue, etc. In UAV cooperative detection tasks, the most critical step is task planning, which has direct impact on the overall detection performance. The target of task planning is to generate planned actions and flight route for UAVs to complete specific detection task according to UAV swarm locations, sensor ability, task region, etc. However, traditional task planning methods for UAV cooperative detection that based on evolutionary computing or reinforcement learning always need plenty of time for getting planning results. In this paper, we proposed a top-down task planning algorithm based on greedy policy to tackle this problem. The core idea of the proposed method lies in that we choose optimal detection trace from all trace candidates during each planning step in a greedy manner via a predefined performance indicator. Moreover, we also proposed a simple but effective procedure for generate detection trace candidates by corner points and nearest border points extraction. To evaluate the effectiveness of the proposed method, we conducted comprehensive experiments for the representative swarm detection task region coverage. Experiment results demonstrated the effectiveness of the proposed method and superiority over traditional methods on task planning speed.\",\"PeriodicalId\":345773,\"journal\":{\"name\":\"2022 IEEE International Conference on Unmanned Systems (ICUS)\",\"volume\":\"60 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2022-10-28\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2022 IEEE International Conference on Unmanned Systems (ICUS)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICUS55513.2022.9986918\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2022 IEEE International Conference on Unmanned Systems (ICUS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICUS55513.2022.9986918","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

摘要

在协同探测场景下,无人机群具有机动性好、无人员伤害、成本低等优点。区域覆盖作为协同探测中的一项代表性任务,在环境监测、搜救等领域有着广泛的应用。在无人机协同探测任务中,任务规划是最关键的一步,它直接影响到整体探测性能。任务规划的目标是根据无人机群位置、传感器能力、任务区域等,生成无人机完成特定探测任务的计划动作和飞行路线。然而,传统的基于进化计算或强化学习的无人机协同检测任务规划方法往往需要大量的时间来获得规划结果。本文提出了一种基于贪婪策略的自顶向下任务规划算法来解决这一问题。该方法的核心思想是通过预定义的性能指标,在每个规划步骤中以贪婪的方式从所有候选轨迹中选择最优检测轨迹。此外,我们还提出了一种简单而有效的方法,通过提取角点和最近边界点来生成检测候选迹。为了评估该方法的有效性,我们对具有代表性的群体检测任务区域覆盖率进行了综合实验。实验结果证明了该方法的有效性,在任务规划速度上优于传统方法。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Automatic UAV Swarm Task Planning in Cooperative Region Coverage Detection based on Greedy Policy
Unmanned Aerial Vehicle(UAVs) swarm has great advantage over traditional equipment in cooperative detection scenario for its easy-maneuverability, no human injury and low cost, etc. As a representative task in cooperative detection, region coverage has widely applications in environmental monitoring, search and rescue, etc. In UAV cooperative detection tasks, the most critical step is task planning, which has direct impact on the overall detection performance. The target of task planning is to generate planned actions and flight route for UAVs to complete specific detection task according to UAV swarm locations, sensor ability, task region, etc. However, traditional task planning methods for UAV cooperative detection that based on evolutionary computing or reinforcement learning always need plenty of time for getting planning results. In this paper, we proposed a top-down task planning algorithm based on greedy policy to tackle this problem. The core idea of the proposed method lies in that we choose optimal detection trace from all trace candidates during each planning step in a greedy manner via a predefined performance indicator. Moreover, we also proposed a simple but effective procedure for generate detection trace candidates by corner points and nearest border points extraction. To evaluate the effectiveness of the proposed method, we conducted comprehensive experiments for the representative swarm detection task region coverage. Experiment results demonstrated the effectiveness of the proposed method and superiority over traditional methods on task planning speed.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
UNF-SLAM: Unsupervised Feature Extraction Network for Visual-Laser Fusion SLAM Automatic Spinal Ultrasound Image Segmentation and Deployment for Real-time Spine Volumetric Reconstruction Track Matching Method of Sea Surface Targets Based on Improved Longest Common Subsequence Algorithm A dynamic event-triggered leader-following consensus algorithm for multi-AUVs system Adaptive Multi-feature Fusion Improved ECO-HC Image Tracking Algorithm Based on Confidence Judgement for UAV Reconnaissance
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1