Cooperative task planning for multiple autonomous UAVs with graph representation and genetic algorithm

L. Geng, Yunfeng Zhang, J. Wang, J. Fuh, Swee Huat Rodney Teo
{"title":"Cooperative task planning for multiple autonomous UAVs with graph representation and genetic algorithm","authors":"L. Geng, Yunfeng Zhang, J. Wang, J. Fuh, Swee Huat Rodney Teo","doi":"10.1109/ICCA.2013.6564991","DOIUrl":null,"url":null,"abstract":"This paper addresses the mission planning issues for guiding a group of UAVs to carry out a series of tasks, namely classification, attack, and verification, against multiple targets. The flying space is constrained with the presence of flight prohibit zones (FPZs) and enemy radar sites. The solution space for task assignment and sequencing is modeled with a graph representation. With a path formation based on Dubins vehicle paths, a genetic algorithm (GA) has been developed for finding the optimal solution from the graph to achieve the following goals: (1) completion of the three tasks on each target, (2) avoidance of FPZs, (3) low level of exposure to enemy radar detection, and (4) short overall flying path length. A case study is presented to demonstrate the effectiveness of the proposed methods.","PeriodicalId":336534,"journal":{"name":"2013 10th IEEE International Conference on Control and Automation (ICCA)","volume":"288 5-6","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2013-07-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"13","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2013 10th IEEE International Conference on Control and Automation (ICCA)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCA.2013.6564991","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 13

Abstract

This paper addresses the mission planning issues for guiding a group of UAVs to carry out a series of tasks, namely classification, attack, and verification, against multiple targets. The flying space is constrained with the presence of flight prohibit zones (FPZs) and enemy radar sites. The solution space for task assignment and sequencing is modeled with a graph representation. With a path formation based on Dubins vehicle paths, a genetic algorithm (GA) has been developed for finding the optimal solution from the graph to achieve the following goals: (1) completion of the three tasks on each target, (2) avoidance of FPZs, (3) low level of exposure to enemy radar detection, and (4) short overall flying path length. A case study is presented to demonstrate the effectiveness of the proposed methods.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
基于图表示和遗传算法的多自主无人机协同任务规划
本文研究了指导一组无人机对多个目标执行分类、攻击和验证等一系列任务的任务规划问题。飞行空间受到飞行禁区(FPZs)和敌方雷达站点的限制。任务分配和排序的解空间用图表示建模。利用基于dubin飞行器路径的路径编队,开发了一种遗传算法(GA),从图中寻找最优解,以实现以下目标:(1)完成每个目标上的三个任务;(2)避免fpz;(3)低暴露于敌方雷达探测水平;(4)总飞行路径长度短。最后,通过实例分析验证了所提方法的有效性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Cooperative task planning for multiple autonomous UAVs with graph representation and genetic algorithm Real-time measure and control system of biped walking robot based on sensor Simultaneously scheduling production plan and maintenance policy for a single machine with failure uncertainty Fuzzy grey sliding mode control for maximum power point tracking of photovoltaic systems A data-driven approach for sensor fault diagnosis in gearbox of wind energy conversion system
×
引用
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