Back to Search
Start Over
Optimal dynamic path determination for a mobile robot using the Dijkstra algorithm based on updating weights in MATLAB.
- Source :
-
AIP Conference Proceedings . 2024, Vol. 3091 Issue 1, p1-17. 17p. - Publication Year :
- 2024
-
Abstract
- A number of studies have focused on shortest-path algorithms as a way to pick the most feasible route for a movement task in order to reduce both expense and time complexity. To resolve various difficulties, designers commonly apply shortest-path algorithms in order to pick the most feasible route with the least time or expense; nonetheless, certain difficulties present greater challenges. Dijkstra's technique was thus applied to a specific example utilising two alternative digraphs representing one-way and two-way street routes. Every expense was set to be adjusted as conditions changed, and, by examining the results, the use of the one-way digraph in route mapping was found to result in the goal being achievable, while using a two-way digraph tended to generate confusion despite being the more common real-life scenario. In both cases, the trials showed that re-calculating the shortest-path when halfway to the target did not create any additional computing burden, however. [ABSTRACT FROM AUTHOR]
- Subjects :
- *TIME complexity
*MOBILE robots
*ALGORITHMS
Subjects
Details
- Language :
- English
- ISSN :
- 0094243X
- Volume :
- 3091
- Issue :
- 1
- Database :
- Academic Search Index
- Journal :
- AIP Conference Proceedings
- Publication Type :
- Conference
- Accession number :
- 176993842
- Full Text :
- https://doi.org/10.1063/5.0204972