Abstract
In modern agriculture, the use of agricultural drones (UAV) has gained significant popularity due to their ability to efficiently monitor and manage vast farmlands. To optimize the drone’s route for tree inspection and pesticide spraying, we propose a novel approach that involves manual collection of tree coordinates (latitude and longitude values) using a mobile device. The collected data is then used to generate a detailed map of the agricultural area. To ensure efficient drone operation, we employ the Haversine method to calculate the distances between trees accurately. This technique accounts for the curvature of the earth, providing precise distance measurements based on the coordinates spherical nature. Subsequently, we utilize Dijkstra’s algorithm and Travelling Salesman Problem algorithm to compute the shortest path between the trees, ensuring that the drone follows an optimized route during its spraying mission. In this research, we present the implementation details and results of our proposed methodology. The experimental evaluation demonstrates the superiority of our approach over traditional methods in terms of minimizing drone travel distance and optimizing data collection.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Maria, E., et al.: Measure distance locating nearest public facilities using Haversine and Euclidean Methods. J. Phys.: Conf. Ser. 1450(1), 012080 (2020)
Chopde, N.R., Nichat, M.: Landmark based shortest path detection by using A* and haversine formula P. Int. J. Innov. Res. Comput. Commun. Eng. 1(2), 298–302 (2013)
Chen, C.J., et al.: Identification of fruit tree pests with deep learning on embedded drone to achieve accurate pesticide spraying. IEEE Access 9, 21986–21997 (2021)
Bandeira, T.W., et al.: Analysis of path planning algorithms based on travelling salesman problem embedded in UAVs. Brazil. Symp. Comput. Syst. Eng. (SBESC) IEEE 2(5), 70–75 (2015)
Prasetya, D.A., et al.: Resolving the shortest path problem using the haversine algorithm. J. Crit. Rev. 7(1), 62–64 (2020)
Khaing, O.: Using Dijkstra’s algorithm for public transportation system in Yangon based on GIS. Int. J. Sci. Eng. Appl. 7(11), 442–447 (2018)
Lagman, A.C., De Angel, R.: I-respond mobile application for emergency response using Dijkstra’s algorithm shortest path. In: IEEE 14th International Conference on Humanoid, Nanotechnology, Information Technology, Communication, pp. 1–5 (2022).https://doi.org/10.1109/HNICEM57413.2022.10109620
Jabbar, L.S.: A modification of shortest path algorithm according to adjustable weights based on Dijkstra algorithm. Eng. Technol. J. (2022)
Yan, H.: Expected length of the shortest path of the traveling salesman problem in 3D space. J. Adv. Transp. (2022). https://doi.org/10.1155/2022/4124950
Bao, C., Yang, Q., Gao, X.-D., Lu, Z.-Y., Zhang, J.: Ant colony optimization with shortest distance biased dispatch for visiting constrained multiple traveling salesmen problem. In: Proceedings of the Genetic and Evolutionary Computation Conference Companion (GECCO 2022), pp. 77–80. Association for Computing Machinery, New York (2022)
Author information
Authors and Affiliations
Corresponding authors
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2024 The Author(s), under exclusive license to Springer Nature Switzerland AG
About this paper
Cite this paper
Girijalaxmi, Houde, K.V., Hegadi, R.S. (2024). Optimizing Drone Navigation Using Shortest Path Algorithms. In: Santosh, K., et al. Recent Trends in Image Processing and Pattern Recognition. RTIP2R 2023. Communications in Computer and Information Science, vol 2026. Springer, Cham. https://doi.org/10.1007/978-3-031-53082-1_24
Download citation
DOI: https://doi.org/10.1007/978-3-031-53082-1_24
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-031-53081-4
Online ISBN: 978-3-031-53082-1
eBook Packages: Computer ScienceComputer Science (R0)