DYNAMIC PROGRAMMING APPLIED TO AN OCEANOGRAPHIC CAMPAIGN PLANNING
Leonardo Antonio Monteiro Pessôa, Rodrigo Abrunhosa Collazo, Marcos Pereira Estellita Lins, Laura Bahiense, Edilson F. Arruda · Revista Brasileira de Cartografia · 2015
Oceanographic survey planning, as hydrographic survey planning, involves optimizing the path of a survey platform. Such a plat-form must visit a set of target geographic positions, each of which must be visited a single time before the platform returns to the initial harbor. This problem is similar to the Traveling Salesman Problem (TSP), though distinct enough to warrant a dedicated solution. Here this problem is modelled as a sequential optimization problem and is optimally solved using a dynamic programming algorithm.