基于图解分析的地面搜索模型研究

his thesis first focuses on test No.C competition problem of “Higher Educational Press Cup”for national university student mathematical modeling competition in 2008,then it analyses test No.C competition problem by means of graphic analysis, which makes each kind of equipment satisfied on the basis of finishing each other’s mission, identifies each rescue personnel’s hunting region and the march line, establishes the optimizing chart model of time, and obtains directly the fast algorithm, finally, it comes to the following conclusion:about problem No.1 that wether the oppointed missin will be completed within 48 hours, it is proved that if one more rescue personnel is added, the oppoined mission will be completed within 48 hours,about problem No.2, it will take at least 22.13 hours to search the whole region.