DYNAMIC PROGRAMMING APPLIED TO AN OCEANOGRAPHIC CAMPAIGN PLANNING

Main Article Content

Leonardo Antonio Monteiro Pessôa
Rodrigo Abrunhosa Collazo
Marcos Pereira Estellita Lins
Laura Bahiense
Edilson Fernandes de Arruda

Abstract

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.

Downloads

Download data is not yet available.

Metrics

Metrics Loading ...

Article Details

How to Cite
PESSÔA, L. A. M.; COLLAZO, R. A.; LINS, M. P. E.; BAHIENSE, L.; ARRUDA, E. F. de. DYNAMIC PROGRAMMING APPLIED TO AN OCEANOGRAPHIC CAMPAIGN PLANNING. Brazilian Journal of Cartography, [S. l.], v. 67, n. 5, 2015. DOI: 10.14393/rbcv67n5-44619. Disponível em: https://seer.ufu.br/index.php/revistabrasileiracartografia/article/view/44619. Acesso em: 22 dec. 2024.
Section
Artigos