The rescue strategy of the search for a losing aircraft by planes

Abstract

This paper solves the problem based on the accident of the lost Malaysian flight MH370. Because lacking of the flight data after the plane losing contact, we define an enough big object searching region. According to the search area all the recue planes can search one day and the distribution of the wreckages, we divides the region into several parts, build an math model to find an order strategy to rescue each areas. Introduction With the rapid development of the transport, more and more people would like to travel around the world. However, the news about the airplane crashes becomes more and more frequent nowadays. which makes our heart up and down. Typically, the lost Malaysian flight MH370 is still not been found yet. Although there are several methods have been found, it’s a big challenge to search for a lost plane without any flight data. Region division We lack the flight data after the plane losing contact, what’s more, the black box does not have power to send signals. It’s difficult to know the accurate location of the crashed plane. So,we define an enough big object searching area, the possibility that the plane crashes in it is 100% . And we use the symbol  to stand for the area. To find the plane, we need a more precise area. We call it the key area. According to the number of debris, wreckage location, ocean currents and wind direction, we can find some suspected crash sites. After consult material, we find the rescue plane usually carry out the parallel scanning mode as Figure 1. Figure 1: parallel scanning mode In this way, we can maximize the search area with the minimum time. We think that the searching planes can explore a size of 1 s a day and the target region  sized S can be found by the satellite. We divide the part to 1 n ( ) parts. 1 S n s         Then we can see the target area will be devided to 12 pieces. It’s shown as Figure 2, Each of their size is equal to the area rescued planes searched a day. 3rd International Conference on Materials Engineering, Manufacturing Technology and Control (ICMEMTC 2016) © 2016. The authors Published by Atlantis Press 942 Figure 2: Region division for recusing In the above picture, we define 1,2,3,4 area as the part A ,which has a white figure in the middle. The white figures in the middle are the envelope area of the crashed plane wreckage. When the number of the wreckages in the part is less than 3, we can’t obtain the envelope graph. We define 5,6,7,8 area as the part B , where is called the surrounding area of the plane wreckage envelope. And the area 9,10,11,12 is the edge part C of the satellite searching. When we search the divided areas, we want the area include more wreckages. Therefore, Part C has the minimum possibility and Part A has the maximum possibility to find the black box. Probability Analysis Through Analytic Hierarchy Process,we can get the probability the black box in the Part A is about 40%, the probability in the Part B is about 35% and the probability in the Part C is about 25%. Part C and Part B follow evenly distribution. Therefore, the probability of each area numbered 5 to 8 is 0.0875, the probability of areas numbered 9 to 12 is 0.0625. But, the probability of each area in Part A have positive correlation with the number and the convex hull’s area of the wreckages inside. Through the statistics and the calculation of the software, we can get a number array N and an area array about the wreckages in each area, as:   4,9,17,13 N    9413.99,11897.79,4905.04,4415.2 S  Then, we normalize the arraies, as:  