Search strategy in a complex and dynamic environment: the MH370 case.

Search and detection of objects on the ocean surface is a challenging task due to the complexity of the drift dynamics and lack of known optimal solutions for the path of the search agents. This challenge was highlighted by the unsuccessful search for Malaysian Flight 370 (MH370) which disappeared on March 8, 2014. In this paper, we propose an improvement of a search algorithm rooted in the ergodic theory of dynamical systems which can accommodate complex geometries and uncertainties of the drifting search areas on the ocean surface. We illustrate the effectiveness of this algorithm in a computational replication of the conducted search for MH370. We compare the algorithms using many realizations with random initial positions, and analyze the influence of the stochastic drift on the search success. In comparison to conventional search methods, the proposed algorithm leads to an order of magnitude improvement in success rate over the time period of the actual search operation. Simulations of the proposed search control also indicate that the initial success rate of finding debris increases in the event of delayed search commencement. This is due to the existence of convergence zones in the search area which leads to local aggregation of debris in those zones and hence reduction of the effective size of the area to be searched.

Ergodicity-Based Cooperative Multiagent Area Coverage via a Potential Field.

This paper considers a problem of area coverage where the objective is to achieve given coverage density by use of multiple mobile agents. We present an ergodicity-based coverage algorithm which enables a centralized feedback control for multiagent system based on radial basis function (RBF) representation of the ergodicity problem and a solution of an appropriately designed stationary heat equation for the potential field. The heat equation uses a source term that depends on the difference between the given goal density distribution and the current coverage density (time average of RBFs along trajectories). The agent movement is directed using the gradient of that potential field. The heat equation driven area coverage has a built-in cooperative behavior of agents which includes collision avoidance and coverage coordination. The algorithm is robust, scalable, and computationally inexpensive.