Robotic indoor path planning using dijkstra's algorithm with multi-layer dictionaries
Dijkstra's algorithm is a classic algorithm for finding the shortest path between two points due to its optimisation capability. The adjacency matrix is the naive storage structure of the algorithm. This storage structure has limited the use of the algorithm as it expands large storage space. A...
Saved in:
Main Authors: | Fadzli, S.A., Abdulkadir, S.I., Makhtar, M., Jamal, A.A. |
---|---|
格式: | Conference or Workshop Item |
語言: | English |
出版: |
2016
|
主題: | |
在線閱讀: | http://eprints.unisza.edu.my/1147/1/FH03-FIK-16-05803.jpg http://eprints.unisza.edu.my/1147/ |
標簽: |
添加標簽
沒有標簽, 成為第一個標記此記錄!
|
相似書籍
-
Indoor global path planning based on critical cells using dijkstra algorithm
由: Azrul Amri, Jamal, et al.
出版: (2015) -
Shortest Path Trajectory System Based on Dijkstra Algorithm
由: Putri, Indah Pratiwi
出版: (2012) -
Dijkstra’s algorithm based on 3D CAD network module for spatial indoor environment
由: Ujang, Muhamad Uznir, et al.
出版: (2008) -
Transforming Semi-Structured Indigenous Dictionary into Machine-Readable Dictionary
由: Bali, Ranaivo-Malancon, et al.
出版: (2017) -
A Dijkstra’s Mobile Web Application Engine for Generating Integrated Light Rail Transit Route
由: Haziq Lim, AM, et al.
出版: (2010)