Loading...
Publication
Um estudo sobre derrotas na automatização de um sistema de navegação marítima
| Name: | Description: | Size: | Format: | |
|---|---|---|---|---|
| 38.07 MB | Adobe PDF |
Authors
Advisor(s)
Abstract(s)
A falta de marítimos, a necessidade de aumentar a segurança da navegação e a evolução
tecnológica têm contribuído para um aumento do estudo de navios autónomos e não
tripulados. O crescente número de estudos realizados, um pouco por todo o mundo, vem
reforçar o desenvolvimento nesta matéria não apenas do ponto de vista da navegação,
mas também na gestão portuária e na legislação. Estamos perante uma revolução no
transporte marítimo.
O foco deste trabalho foi a navegação costeira numa abordagem extremamente simplificada da realidade. Selecionou-se dois algoritmos amplamente usados e estudados na bibliografia, o algoritmo Dijkstra e o do Polígono Convexo, pelas suas características e
simplicidade. No entanto, e apesar de vários estudos realizados com eles separadamente,
não se encontrou nenhum estudo que punha estes algoritmos a trabalhar em simultâneo
complementando-se mutuamente.
Concluiu-se que os algoritmos propostos minimizam a distância e os pontos de mudança de rumo e que, pela sua versatilidade, podem ser usados em simultâneo, em função
de outras variáveis que não apenas a distância.
The shortage of seafarers, the need to enhance navigation safety and technological ad vancements have contributed to an increase in the study of autonomous and unmanned ships. The growing number of studies conducted worldwide has reinforced development in this area, not only from the perspective of navigation, but also in port management and legislation. We are witnessing a revolution in maritime transport. The focus of this work was coastel navigation through an extremely simpli ed approach to reality. Two widely used and studied algorithms were selected from the literature: Dijkstra's algorithm and the Ruber Band algorithm, due to their characteristics and simplicity. However, despite several studies conducted on them separately, no study was found that employed those algorithms simultaneously to complement each other. It was concluded that the proposed algorithms minimize distance and course change points and that, due to their versatility, they can be used concurrently, depending on other variables beyond just distance.
The shortage of seafarers, the need to enhance navigation safety and technological ad vancements have contributed to an increase in the study of autonomous and unmanned ships. The growing number of studies conducted worldwide has reinforced development in this area, not only from the perspective of navigation, but also in port management and legislation. We are witnessing a revolution in maritime transport. The focus of this work was coastel navigation through an extremely simpli ed approach to reality. Two widely used and studied algorithms were selected from the literature: Dijkstra's algorithm and the Ruber Band algorithm, due to their characteristics and simplicity. However, despite several studies conducted on them separately, no study was found that employed those algorithms simultaneously to complement each other. It was concluded that the proposed algorithms minimize distance and course change points and that, due to their versatility, they can be used concurrently, depending on other variables beyond just distance.
Description
Keywords
Navegação marítima Automatização Algoritmo Dijkstra Polígono convexo Matemática Estatística e Aplicações . Faculdade de Ciências Exatas e da Engenharia