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}
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.