A bidirectional path-finding algorithm and data structure for maritime routing
| hal.structure.identifier | Institut de Recherche de l'Ecole Navale [IRENAV] | |
| dc.contributor.author | TSATCHA, Dieudonné | |
| hal.structure.identifier | Institut de Recherche de l'Ecole Navale [IRENAV] | |
| dc.contributor.author | SAUX, Eric | |
| hal.structure.identifier | Institut de Recherche de l'Ecole Navale [IRENAV] | |
| dc.contributor.author | CLARAMUNT, Christophe | |
| dc.date.accessioned | 2021-05-14T09:59:23Z | |
| dc.date.available | 2021-05-14T09:59:23Z | |
| dc.date.issued | 2014 | |
| dc.identifier.issn | 1365-8816 | |
| dc.identifier.uri | https://oskar-bordeaux.fr/handle/20.500.12278/78042 | |
| dc.description.abstractEn | Route planning is an important problem for many real-time applications in open and complex environments. The maritime domain is a relevant example of such environments where dynamic phenomena and navigation constraints generate difficult route finding problems. This paper develops a spatial data structure that supports the search for an optimal route between two locations while minimizing a cost function. Although various search algorithms have been proposed so far (e.g. breadth-first search, bidirectional breadth-first search, Dijkstra's algorithm, A*, etc.), this approach provides a bidirectional dynamic routing algorithm which is based on hexagonal meshes and an iterative deepening A* (IDA*) algorithm, and a front to front strategy using a dynamic graph that facilitates data accessibility. The whole approach is applied to the context of maritime navigation, taking into account navigation hazards and restricted areas. The algorithm developed searches for optimal routes while minimizing distance and computational time. | |
| dc.language.iso | en | |
| dc.publisher | Taylor & Francis | |
| dc.subject.en | Navigation aids | |
| dc.subject.en | Geographic Information Science | |
| dc.subject.en | Artificial intelligence | |
| dc.subject.en | Maritime routing | |
| dc.subject.en | Computational geometry | |
| dc.title.en | A bidirectional path-finding algorithm and data structure for maritime routing | |
| dc.type | Article de revue | |
| dc.identifier.doi | 10.1080/13658816.2014.887087 | |
| dc.subject.hal | Informatique [cs]/Intelligence artificielle [cs.AI] | |
| dc.subject.hal | Informatique [cs]/Modélisation et simulation | |
| bordeaux.journal | International Journal of Geographical Information Science | |
| bordeaux.page | 1355-1377 | |
| bordeaux.volume | 28 | |
| bordeaux.hal.laboratories | Institut de Mécanique et d’Ingénierie de Bordeaux (I2M) - UMR 5295 | * |
| bordeaux.issue | 7 | |
| bordeaux.institution | Université de Bordeaux | |
| bordeaux.institution | Bordeaux INP | |
| bordeaux.institution | CNRS | |
| bordeaux.institution | INRAE | |
| bordeaux.institution | Arts et Métiers | |
| bordeaux.peerReviewed | oui | |
| hal.identifier | hal-01073178 | |
| hal.version | 1 | |
| hal.origin.link | https://hal.archives-ouvertes.fr//hal-01073178v1 | |
| bordeaux.COinS | ctx_ver=Z39.88-2004&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.jtitle=International%20Journal%20of%20Geographical%20Information%20Science&rft.date=2014&rft.volume=28&rft.issue=7&rft.spage=1355-1377&rft.epage=1355-1377&rft.eissn=1365-8816&rft.issn=1365-8816&rft.au=TSATCHA,%20Dieudonn%C3%A9&SAUX,%20Eric&CLARAMUNT,%20Christophe&rft.genre=article |
Fichier(s) constituant ce document
| Fichiers | Taille | Format | Vue |
|---|---|---|---|
|
Il n'y a pas de fichiers associés à ce document. |
|||