Problems of the Whole Coverage Path Planning Based on the Ground Search Areas
Huang Shi-hu · 2013
Continuous problem can be discretized.Based on this idea,we can explore the problems of the fixed ground search.Number of people of each group multiplying by actual search width of each person,and using their product as the width of square,rectangular target area can be divided into several small square areas.After this,from the central point all the areas were searched without repletion and missing according to the idea of parity,and massed at rally points.As described above,optimization model of ground search was explored,using the principle of optimality the most optimal search route,time were put forward,thus the problems of ground search were solved intuitively.