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...
保存先:
主要な著者: | 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, 等
出版事項: (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, 等
出版事項: (2008) -
Transforming Semi-Structured Indigenous Dictionary into Machine-Readable Dictionary
著者:: Bali, Ranaivo-Malancon, 等
出版事項: (2017) -
A Dijkstra’s Mobile Web Application Engine for Generating Integrated Light Rail Transit Route
著者:: Haziq Lim, AM, 等
出版事項: (2010)