跳到主要导航 跳到搜索 跳到主要内容

Region Coverage Path Planning of Multiple Disconnected Convex Polygons Based on Simulated Annealing Algorithm

  • Northwestern Polytechnical University Xian
  • Institute of Army Aviation

科研成果: 书/报告/会议事项章节会议稿件同行评审

17 引用 (Scopus)

摘要

Over the past decades, Unmanned Aerial Vehicles (UAVs) have been widely used in both industrial and military operations around the world. As part of mission planning, path planning will play a key role in improving the viability and mission capabilities of UAVs. However, the problem of multi-region coverage path planning is limited by many factors such as UAV's performance, endurance and target region. In this paper, an improved simulated annealing algorithm (ISA) has been proposed to solve the problem. The ISA method uses simulated annealing algorithm to determine the access order of regions, takes minimum-distance-first strategy to select the entry of region, and uses back-and-forth path (BFP) to cover the convex polygon region. The effectiveness of the proposed method is verified through simulation experiments with randomly generated targets.

源语言英语
主期刊名2021 IEEE 4th International Conference on Computer and Communication Engineering Technology, CCET 2021
出版商Institute of Electrical and Electronics Engineers Inc.
238-242
页数5
ISBN(电子版)9781665438902
DOI
出版状态已出版 - 13 8月 2021
活动4th IEEE International Conference on Computer and Communication Engineering Technology, CCET 2021 - Virtual, Beijing, 中国
期限: 13 8月 202115 8月 2021

出版系列

姓名2021 IEEE 4th International Conference on Computer and Communication Engineering Technology, CCET 2021

会议

会议4th IEEE International Conference on Computer and Communication Engineering Technology, CCET 2021
国家/地区中国
Virtual, Beijing
时期13/08/2115/08/21

指纹

探究 'Region Coverage Path Planning of Multiple Disconnected Convex Polygons Based on Simulated Annealing Algorithm' 的科研主题。它们共同构成独一无二的指纹。

引用此