A Model of Dual Fabry-Perot Etalon-Based External-Cavity Tunable Laser Us...
Internal motion within pulsating pure-quartic soliton molecules in a fibe...
Enhanced light emission of germanium light-emitting-diode on 150 mm germa...
The Fabrication of GaN Nanostructures Using Cost-Effective Methods for Ap...
Negative-to-Positive Tunnel Magnetoresistance in van der Waals Fe3GeTe2/C...
Quantum Light Source Based on Semiconductor Quantum Dots: A Review
A High-Reliability RF MEMS Metal-Contact Switch Based on Al-Sc Alloy
Development of a Mode-Locked Fiber Laser Utilizing a Niobium Diselenide S...
Development of Multiple Fano-Resonance-Based All-Dielectric Metastructure...
Traffic Vibration Signal Analysis of DAS Fiber Optic Cables with Differen...
官方微信
友情链接

An Adaptive Clustering-Based Algorithm for Automatic Path Planning of Heterogeneous UAVs

2022-01-06

 

Author(s): Chen, JC (Chen, Jinchao); Zhang, Y (Zhang, Ying); Wu, LW (Wu, Lianwei); You, T (You, Tao); Ning, X (Ning, Xin)

Source: IEEE TRANSACTIONS ON INTELLIGENT TRANSPORTATION SYSTEMS DOI: 10.1109/TITS.2021.3131473 Early Access Date: DEC 2021

Abstract: Due to the high maneuverability and strong adaptability, autonomous unmanned aerial vehicles (UAVs) are of high interest to many civilian and military organizations around the world. Automatic path planning which autonomously finds a good enough path that covers the whole area of interest, is an essential aspect of UAV autonomy. In this study, we focus on the automatic path planning of heterogeneous UAVs with different flight and scan capabilities, and try to present an efficient algorithm to produce appropriate paths for UAVs. First, models of heterogeneous UAVs are built, and the automatic path planning is abstracted as a multi-constraint optimization problem and solved by a linear programming formulation. Then, inspired by the density-based clustering analysis and symbiotic interaction behaviours of organisms, an adaptive clustering-based algorithm with a symbiotic organisms search-based optimization strategy is proposed to efficiently settle the path planning problem and generate feasible paths for heterogeneous UAVs with a view to minimizing the time consumption of the search tasks. Experiments on randomly generated regions are conducted to evaluate the performance of the proposed approach in terms of task completion time, execution time and deviation ratio.

Accession Number: WOS:000733529900001

ISSN: 1524-9050

eISSN: 1558-0016

Full Text: https://ieeexplore.ieee.org/document/9641740



关于我们
下载视频观看
联系方式
通信地址

北京市海淀区清华东路甲35号(林大北路中段) 北京912信箱 (100083)

电话

010-82304210/010-82305052(传真)

E-mail

semi@semi.ac.cn

交通地图
版权所有 中国科学院半导体研究所

备案号:京ICP备05085259-1号 京公网安备110402500052 中国科学院半导体所声明