دورية أكاديمية
An Effective Algorithm for Finding Shortest Paths in Tubular Spaces
العنوان: | An Effective Algorithm for Finding Shortest Paths in Tubular Spaces |
---|---|
المؤلفون: | Dang-Viet-Anh Nguyen, Jérôme Szewczyk, Kanty Rabenorosoa |
المصدر: | Algorithms, Vol 15, Iss 3, p 79 (2022) |
بيانات النشر: | MDPI AG, 2022. |
سنة النشر: | 2022 |
المجموعة: | LCC:Industrial engineering. Management engineering LCC:Electronic computers. Computer science |
مصطلحات موضوعية: | Euclidean shortest path, tubular space, reactive algorithm, visibility, oriented drilling process, Dijkstra’s algorithm, Industrial engineering. Management engineering, T55.4-60.8, Electronic computers. Computer science, QA75.5-76.95 |
الوصف: | 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 properties of the shortest path inside the considered space are presented and proven. Utilizing these properties, the desired ESP can be segmented into three partitions depending on the visibility of the VP. Our algorithm will check which partition the VP belongs to and calculate the correct direction of its movement, and thus the shortest path will be traced. The proposed method is then compared to Dijkstra’s algorithm, considering different types of tubular spaces. In all cases, the solution provided by the proposed algorithm is smoother, shorter, and has a higher accuracy with a faster calculation speed than that obtained by Dijkstra’s method. |
نوع الوثيقة: | article |
وصف الملف: | electronic resource |
اللغة: | English |
تدمد: | 1999-4893 |
Relation: | https://www.mdpi.com/1999-4893/15/3/79; https://doaj.org/toc/1999-4893 |
DOI: | 10.3390/a15030079 |
URL الوصول: | https://doaj.org/article/932f03233a3048d6a9758887464b60ae |
رقم الأكسشن: | edsdoj.932f03233a3048d6a9758887464b60ae |
قاعدة البيانات: | Directory of Open Access Journals |
تدمد: | 19994893 |
---|---|
DOI: | 10.3390/a15030079 |