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. |
---|---|
Format: | Conference or Workshop Item |
Language: | English |
Published: |
2016
|
Subjects: | |
Online Access: | http://eprints.unisza.edu.my/1147/1/FH03-FIK-16-05803.jpg http://eprints.unisza.edu.my/1147/ |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Indoor global path planning based on critical cells using dijkstra algorithm
by: Azrul Amri, Jamal, et al.
Published: (2015) -
Shortest Path Trajectory System Based on Dijkstra Algorithm
by: Putri, Indah Pratiwi
Published: (2012) -
Dijkstra’s algorithm based on 3D CAD network module for spatial indoor environment
by: Ujang, Muhamad Uznir, et al.
Published: (2008) -
Transforming Semi-Structured Indigenous Dictionary into Machine-Readable Dictionary
by: Bali, Ranaivo-Malancon, et al.
Published: (2017) -
A Dijkstra’s Mobile Web Application Engine for Generating Integrated Light Rail Transit Route
by: Haziq Lim, AM, et al.
Published: (2010)