دورية أكاديمية
Algorithm Based on Morphological Operators for Shortness Path Planning
| العنوان: | Algorithm Based on Morphological Operators for Shortness Path Planning |
|---|---|
| المؤلفون: | Jorge L. Perez-Ramos, Selene Ramirez-Rosales, Daniel Canton-Enriquez, Luis A. Diaz-Jimenez, Gabriela Xicotencatl-Ramirez, Ana M. Herrera-Navarro, Hugo Jimenez-Hernandez |
| المصدر: | Algorithms, Vol 17, Iss 5, p 184 (2024) |
| بيانات النشر: | MDPI AG, 2024. |
| سنة النشر: | 2024 |
| المجموعة: | LCC:Industrial engineering. Management engineering LCC:Electronic computers. Computer science |
| مصطلحات موضوعية: | graph search, logistical process, routing algorithms, shortness path trajectory, mathematical morphology, morphological covering operator, Industrial engineering. Management engineering, T55.4-60.8, Electronic computers. Computer science, QA75.5-76.95 |
| الوصف: | The problem of finding the best path trajectory in a graph is highly complex due to its combinatorial nature, making it difficult to solve. Standard search algorithms focus on selecting the best path trajectory by introducing constraints to estimate a suitable solution, but this approach may overlook potentially better alternatives. Despite the number of restrictions and variables in path planning, no solution minimizes the computational resources used to reach the goal. To address this issue, a framework is proposed to compute the best trajectory in a graph by introducing the mathematical morphology concept. The framework builds a lattice over the graph space using mathematical morphology operators. The searching algorithm creates a metric space by applying the morphological covering operator to the graph and weighing the cost of traveling across the lattice. Ultimately, the cumulative traveling criterion creates the optimal path trajectory by selecting the minima/maxima cost. A test is introduced to validate the framework’s functionality, and a sample application is presented to validate its usefulness. The application uses the structure of the avenues as a graph. It proposes a computable approach to find the most suitable paths from a given start and destination reference. The results confirm that this is a generalized graph search framework based on morphological operators that can be compared to the Dijkstra approach. |
| نوع الوثيقة: | article |
| وصف الملف: | electronic resource |
| اللغة: | English |
| تدمد: | 1999-4893 |
| العلاقة: | https://www.mdpi.com/1999-4893/17/5/184Test; https://doaj.org/toc/1999-4893Test |
| DOI: | 10.3390/a17050184 |
| الوصول الحر: | https://doaj.org/article/a4b3992cb9d14a5ba945bc97c704587dTest |
| رقم الانضمام: | edsdoj.4b3992cb9d14a5ba945bc97c704587d |
| قاعدة البيانات: | Directory of Open Access Journals |
Full Text Finder | تدمد: | 19994893 |
|---|---|
| DOI: | 10.3390/a17050184 |