An Effective Algorithm for Finding Shortest Paths in Tubular Spaces

We propose a novel algorithm to determine the Euclidean shortest path (ESP) from a given point (source) to another point (destination) inside a tubular space. The method is based on the observation data of a virtual particle (VP) assumed to move along this path. In the first step, the geometric prop...

Full description

Saved in:

Bibliographic Details
Published in:	Algorithms Vol. 15; no. 3; p. 79
Main Authors:	Nguyen, Dang-Viet-Anh, Szewczyk, Jérôme, Rabenorosoa, Kanty
Format:	Journal Article
Language:	English
Published:	Basel MDPI AG 01.03.2022 MDPI
Subjects:	Algorithms Approximation Automatic Computer Science Data Structures and Algorithms Dijkstra’s algorithm Engineering Sciences Euclidean shortest path Geometry Graphs Mathematical analysis oriented drilling process reactive algorithm tubular space Unmanned aerial vehicles Visibility
ISSN:	1999-4893, 1999-4893
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!