Abstract
The article discusses an approach aimed at the development of algorithmic support for unmanned aerial vehicles. This is due to the construction of a flight task based on the optimality criterion for solving the problem of processing fields in precision farming. The shortest path criterion is used in the implementation of the UAV flight plan with a complex trajectory and frequent course changes. Dijkstra’s algorithm is considered as an algorithm that implements this criterion. The article provides an example of calculating a segment of a network of objects, notes the simplicity of the calculations of the algorithm. Suggestions on the use of this algorithm in the construction of a flight task are given.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: IOP Conference Series: Earth and Environmental Science
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
