Education, Science, Technology, Innovation and Life
Open Access
Sign In

Research on UAV scheduling problem in fire

Download as PDF

DOI: 10.23977/geors.2021.040103 | Downloads: 4 | Views: 490

Author(s)

Jiaxin Kong 1

Affiliation(s)

1 School of Finance, Inner Mongolia University of Finance and economics, Hohhot city, Inner Mongolia Autonomous Region

Corresponding Author

Jiaxin Kong

ABSTRACT

Drones have been very important in the Australian forest fire’s rescue activity. As one of the most severely affected areas the fire, Victoria deservedly has more demands for drones with different functions. Considering the risk, terrain, observation and communication mission requirements and other factors, we first establish a cost model. Then, the minimum spanning tree algorithm is combined with the three-dimensional spatial data of longitude, latitude and altitude of all five points at a certain time in 2019 to get the shortest path. Finally, the optimal number of SSA UAVs and radio relay UAVs is determined.

KEYWORDS

Drone scheduling, Optimal quantity, Combination, Cost mode

CITE THIS PAPER

Jiaxin Kong. Research on UAV scheduling problem in fire. Geoscience and Remote Sensing (2021) Vol. 4: 21-24. DOI: http://dx.doi.org/10.23977/geors.2021.040103

REFERENCES

[1] Liang Yu. AGV smart car path planning based on improved Dijkstra algorithm [J]. Science and Technology and Innovation, 2020(24): 159-161.
[2] Ma Chunchao, Yin Dong, Zhu Huayong. Multi-UAV scheduling problem in a networked battlefield environment [J]. Firepower and Command Control, 2015, 40(10): 31-36.

Downloads: 316
Visits: 30141

Sponsors, Associates, and Links


All published work is licensed under a Creative Commons Attribution 4.0 International License.

Copyright © 2016 - 2031 Clausius Scientific Press Inc. All Rights Reserved.