基于元胞自动机的无人机覆盖路径规划算法*

Zhihua Song, Han Zhang, Fei Liu, Shitao Chen, Fa Zhang
{"title":"基于元胞自动机的无人机覆盖路径规划算法*","authors":"Zhihua Song, Han Zhang, Fei Liu, Shitao Chen, Fa Zhang","doi":"10.1109/ICISCAE.2018.8666895","DOIUrl":null,"url":null,"abstract":"Real-time unmanned aerial vehicle coverage path planning is a challenging task. Although different patterns are outlined and optimized, the algorithm of patterns generation given the width of the sensor’s footprint and the map with obstacles is rarely studied. A Cellular Automaton (CA) based algorithm is proposed and implemented for the spiral pattern and tested in maps with obstacles on the corner and off the edge. The CA is asynchronously updated and there is only one UAV- cell, whose time series indexes through the computing can be assigned as the coverage path. The coverage path planning algorithm proposed in the paper is fast because of the intrinsic discreteness of CA.","PeriodicalId":129861,"journal":{"name":"2018 International Conference on Information Systems and Computer Aided Education (ICISCAE)","volume":"28 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"16","resultStr":"{\"title\":\"Unmanned Aerial Vehicle Coverage Path Planning Algorithm Based on Cellular Automata*\",\"authors\":\"Zhihua Song, Han Zhang, Fei Liu, Shitao Chen, Fa Zhang\",\"doi\":\"10.1109/ICISCAE.2018.8666895\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Real-time unmanned aerial vehicle coverage path planning is a challenging task. Although different patterns are outlined and optimized, the algorithm of patterns generation given the width of the sensor’s footprint and the map with obstacles is rarely studied. A Cellular Automaton (CA) based algorithm is proposed and implemented for the spiral pattern and tested in maps with obstacles on the corner and off the edge. The CA is asynchronously updated and there is only one UAV- cell, whose time series indexes through the computing can be assigned as the coverage path. The coverage path planning algorithm proposed in the paper is fast because of the intrinsic discreteness of CA.\",\"PeriodicalId\":129861,\"journal\":{\"name\":\"2018 International Conference on Information Systems and Computer Aided Education (ICISCAE)\",\"volume\":\"28 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2018-07-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"16\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2018 International Conference on Information Systems and Computer Aided Education (ICISCAE)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICISCAE.2018.8666895\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2018 International Conference on Information Systems and Computer Aided Education (ICISCAE)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICISCAE.2018.8666895","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 16

摘要

无人机实时覆盖路径规划是一项具有挑战性的任务。虽然对不同的模式进行了概述和优化,但对基于传感器足迹宽度和障碍物地图的模式生成算法的研究很少。提出并实现了一种基于元胞自动机(CA)的螺旋图形算法,并在具有拐角和边缘障碍物的地图中进行了测试。CA是异步更新的,并且只有一个UAV- cell,通过计算可以分配其时间序列索引作为覆盖路径。由于CA的固有离散性,本文提出的覆盖路径规划算法具有较快的速度。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Unmanned Aerial Vehicle Coverage Path Planning Algorithm Based on Cellular Automata*
Real-time unmanned aerial vehicle coverage path planning is a challenging task. Although different patterns are outlined and optimized, the algorithm of patterns generation given the width of the sensor’s footprint and the map with obstacles is rarely studied. A Cellular Automaton (CA) based algorithm is proposed and implemented for the spiral pattern and tested in maps with obstacles on the corner and off the edge. The CA is asynchronously updated and there is only one UAV- cell, whose time series indexes through the computing can be assigned as the coverage path. The coverage path planning algorithm proposed in the paper is fast because of the intrinsic discreteness of CA.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术文献互助群
群 号:604180095
Book学术官方微信