Research on the route of ground search
Qiming Feng · International Conference on Artificial Intelligence and Intelligent Information Processing (AIIIP 2022) · 2022
According to the specific situation of the designated area, the appropriate search route is formulated to complete the comprehensive search of the predetermined area in the shortest time. In this model, the search problem is transformed into an approximate Hamiltonian problem, that is, each grid center is regarded as a point in the graph, and a search route with the shortest total distance and as balanced as possible for everyone is designed. The optimization principle is used to solve the ground search problem intuitively, and the optimal search time is obtained.