Path Planning of Multiple Unmanned Aerial Vehicles Covering Multiple Regions Based on Minimum Consumption Ratio
Investigating the path planning of multiple unmanned aerial vehicles (UAVs) covering multiple regions, this work proposes an effective heuristic method of region coverage path planning to reduce the complexity of the problem. The proposed method decomposes the solution process into two stages. First...
| Main Authors: | , , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
MDPI AG
2023-01-01
|
| Series: | Aerospace |
| Subjects: | |
| Online Access: | https://www.mdpi.com/2226-4310/10/2/93 |
| _version_ | 1797623036005842944 |
|---|---|
| author | Jian Chen Ruikang Zhang Hongqiang Zhao Jiejie Li Jilin He |
| author_facet | Jian Chen Ruikang Zhang Hongqiang Zhao Jiejie Li Jilin He |
| author_sort | Jian Chen |
| collection | DOAJ |
| description | Investigating the path planning of multiple unmanned aerial vehicles (UAVs) covering multiple regions, this work proposes an effective heuristic method of region coverage path planning to reduce the complexity of the problem. The proposed method decomposes the solution process into two stages. First of all, the two most important parameters affecting the performance of UAV missions were considered, namely, the flying speed and the scan width. According to these two parameters of UAVs, a new multi-regional allocation scheme based on the minimum consumption ratio was proposed. With this allocation scheme, the coverage task allocation and path pre-planning of UAVs were obtained. Then, the UAVs’ trajectory routes were optimized based on the dynamic planning algorithm to reduce the time consumption of UAVs on the transfer path between regions. The method was evaluated with numerical experiments. The results showed that the proposed method can effectively solve the path planning problem of multiple UAVs covering multiple regions. Compared with an advanced algorithm, the time consumption for homogeneous and heterogenous UAV performance was reduced by 5.1% and 3%, respectively. |
| first_indexed | 2024-03-11T09:18:42Z |
| format | Article |
| id | doaj.art-2b2f438580bf465180c66ac815cae62e |
| institution | Directory Open Access Journal |
| issn | 2226-4310 |
| language | English |
| last_indexed | 2024-03-11T09:18:42Z |
| publishDate | 2023-01-01 |
| publisher | MDPI AG |
| record_format | Article |
| series | Aerospace |
| spelling | doaj.art-2b2f438580bf465180c66ac815cae62e2023-11-16T18:26:28ZengMDPI AGAerospace2226-43102023-01-011029310.3390/aerospace10020093Path Planning of Multiple Unmanned Aerial Vehicles Covering Multiple Regions Based on Minimum Consumption RatioJian Chen0Ruikang Zhang1Hongqiang Zhao2Jiejie Li3Jilin He4College of Mechanical and Electrical Engineering, Central South University, Changsha 410083, ChinaCollege of Mechanical and Electrical Engineering, Central South University, Changsha 410083, ChinaCollege of Mechanical and Electrical Engineering, Central South University, Changsha 410083, ChinaCollege of Mechanical and Electrical Engineering, Central South University, Changsha 410083, ChinaCollege of Mechanical and Electrical Engineering, Central South University, Changsha 410083, ChinaInvestigating the path planning of multiple unmanned aerial vehicles (UAVs) covering multiple regions, this work proposes an effective heuristic method of region coverage path planning to reduce the complexity of the problem. The proposed method decomposes the solution process into two stages. First of all, the two most important parameters affecting the performance of UAV missions were considered, namely, the flying speed and the scan width. According to these two parameters of UAVs, a new multi-regional allocation scheme based on the minimum consumption ratio was proposed. With this allocation scheme, the coverage task allocation and path pre-planning of UAVs were obtained. Then, the UAVs’ trajectory routes were optimized based on the dynamic planning algorithm to reduce the time consumption of UAVs on the transfer path between regions. The method was evaluated with numerical experiments. The results showed that the proposed method can effectively solve the path planning problem of multiple UAVs covering multiple regions. Compared with an advanced algorithm, the time consumption for homogeneous and heterogenous UAV performance was reduced by 5.1% and 3%, respectively.https://www.mdpi.com/2226-4310/10/2/93UAVregion allocationdynamic planningpath planningminimum consumption ratio |
| spellingShingle | Jian Chen Ruikang Zhang Hongqiang Zhao Jiejie Li Jilin He Path Planning of Multiple Unmanned Aerial Vehicles Covering Multiple Regions Based on Minimum Consumption Ratio Aerospace UAV region allocation dynamic planning path planning minimum consumption ratio |
| title | Path Planning of Multiple Unmanned Aerial Vehicles Covering Multiple Regions Based on Minimum Consumption Ratio |
| title_full | Path Planning of Multiple Unmanned Aerial Vehicles Covering Multiple Regions Based on Minimum Consumption Ratio |
| title_fullStr | Path Planning of Multiple Unmanned Aerial Vehicles Covering Multiple Regions Based on Minimum Consumption Ratio |
| title_full_unstemmed | Path Planning of Multiple Unmanned Aerial Vehicles Covering Multiple Regions Based on Minimum Consumption Ratio |
| title_short | Path Planning of Multiple Unmanned Aerial Vehicles Covering Multiple Regions Based on Minimum Consumption Ratio |
| title_sort | path planning of multiple unmanned aerial vehicles covering multiple regions based on minimum consumption ratio |
| topic | UAV region allocation dynamic planning path planning minimum consumption ratio |
| url | https://www.mdpi.com/2226-4310/10/2/93 |
| work_keys_str_mv | AT jianchen pathplanningofmultipleunmannedaerialvehiclescoveringmultipleregionsbasedonminimumconsumptionratio AT ruikangzhang pathplanningofmultipleunmannedaerialvehiclescoveringmultipleregionsbasedonminimumconsumptionratio AT hongqiangzhao pathplanningofmultipleunmannedaerialvehiclescoveringmultipleregionsbasedonminimumconsumptionratio AT jiejieli pathplanningofmultipleunmannedaerialvehiclescoveringmultipleregionsbasedonminimumconsumptionratio AT jilinhe pathplanningofmultipleunmannedaerialvehiclescoveringmultipleregionsbasedonminimumconsumptionratio |