Method for planning shortest path of agricultural machinery based on Dijkstra algorithm

Abstract

The invention discloses a method for planning a shortest path of agricultural machinery based on a Dijkstra algorithm, and relates to a method for planning a shortest path. The method comprises the following specific operation steps of: constructing a grid map of an operation area of the agricultural machinery, the grid width being divided according to a vehicle body width; enabling the vehicle body width to be (2i+1) times the grid width according to an accuracy requirement and an actual need; dividing the grid map into a passable state and an impassable state according to unmanned aerial vehicle aerial survey and obstacle distribution fed back by a sensor; and in order to control the diffusion of optimized nodes in a reasonable range, introducing a maximum estimation value K. According to the method provided by the invention, a group of better nodes are selected and the maximum estimation K is introduced to limit the diffusion degree of the group of nodes, and the group of better nodes is taken as a vertex set of the Dijkstra algorithm, so that the search time is reduced, and meanwhile, a found path is guaranteed to be an optimal path rather than a better path.

Description

technical field [0001] The invention relates to a method for planning the shortest path, in particular to a method for planning the shortest path of agricultural machinery based on Dijkstra algorithm. Background technique [0002] As we all know, with the development of artificial intelligence, the term unmanned has gradually entered people's field of vision. The research on unmanned agriculture is an important research direction to reduce the burden on farmers and improve production efficiency; automatic navigation of agricultural vehicles is an important research direction. The most critical part of the study of automation, and when studying projects related to automatic navigation, it is often necessary to face the problem of shortest path planning. The shortest path problem is one of the hottest issues at the moment. It has been studied by various disciplines and widely used in various fields, such as: urban planning, transportation, robot path planning, vehicle routing,...

AI Technical Summary

Problems solved by technology

In this way, it is not necessary to search all the nodes, but to use the selected heuristic function to evaluate the dominant nodes, and each step can automatically select the node with the smallest estimated cost, that is, the node closest to the target, which greatly improves the search efficiency; However, there is a problem of local optimum in the algorithm, and the path finally determined by it is often a better path rather than an optimal path.

Images