DYNAMIC PROGRAMMING APPLIED TO AN OCEANOGRAPHIC CAMPAIGN PLANNING

Conteúdo do artigo principal

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

Resumo

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

Não há dados estatísticos.

Métricas

Carregando Métricas ...

Detalhes do artigo

Como Citar
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. Revista Brasileira de Cartografia, [S. l.], v. 67, n. 5, 2015. Disponível em: https://seer.ufu.br/index.php/revistabrasileiracartografia/article/view/44619. Acesso em: 12 ago. 2022.
Seção
Artigos