| _version_ |
1860799642981105664
|
| building |
INTELEK Repository
|
| collection |
Online Access
|
| collectionurl |
https://intelek.unisza.edu.my/intelek/pages/search.php?search=!collection407072
|
| date |
2016-05-11 15:04:21
|
| eventvenue |
Seoul, South Korea
|
| format |
Restricted Document
|
| id |
6814
|
| institution |
UniSZA
|
| originalfilename |
1147-01-FH03-FIK-16-05803.jpg
|
| person |
norman
|
| recordtype |
oai_dc
|
| resourceurl |
https://intelek.unisza.edu.my/intelek/pages/view.php?ref=6814
|
| spelling |
6814 https://intelek.unisza.edu.my/intelek/pages/view.php?ref=6814 https://intelek.unisza.edu.my/intelek/pages/search.php?search=!collection407072 Restricted Document Conference Conference Paper image/jpeg inches 96 96 norman 63 63 2016-05-11 15:04:21 724 1408x724 1408 1147-01-FH03-FIK-16-05803.jpg UniSZA Private Access 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 multi-layer dictionary is proposed in this work to enhance the storage structure. Previously, the algorithm was used to optimise single parameter (such as distance, time and fuel) for movement between two places. The path computed using the classic Dijkstra's algorithm is the shortest; however, it may not be the most feasible. The algorithm needs to optimise other factors such as energy consumption and the degree of turns a robot need to take. Junction degree of difficulty function is introduced to further improve the output. It is defined as the degree of difficulty of the path between two points in an open environment. The experimental result shows that the proposed path planning method produced the most optimal path between two points when applied to a map of any indoor terrain. 2015 IEEE 2nd International Conference on InformationScience and Security, ICISS 2015 Seoul, South Korea
|
| spellingShingle |
Robotic indoor path planning using dijkstra's algorithm with multi-layer dictionaries
|
| summary |
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 multi-layer dictionary is proposed in this work to enhance the storage structure. Previously, the algorithm was used to optimise single parameter (such as distance, time and fuel) for movement between two places. The path computed using the classic Dijkstra's algorithm is the shortest; however, it may not be the most feasible. The algorithm needs to optimise other factors such as energy consumption and the degree of turns a robot need to take. Junction degree of difficulty function is introduced to further improve the output. It is defined as the degree of difficulty of the path between two points in an open environment. The experimental result shows that the proposed path planning method produced the most optimal path between two points when applied to a map of any indoor terrain.
|
| title |
Robotic indoor path planning using dijkstra's algorithm with multi-layer dictionaries
|
| title_full |
Robotic indoor path planning using dijkstra's algorithm with multi-layer dictionaries
|
| title_fullStr |
Robotic indoor path planning using dijkstra's algorithm with multi-layer dictionaries
|
| title_full_unstemmed |
Robotic indoor path planning using dijkstra's algorithm with multi-layer dictionaries
|
| title_short |
Robotic indoor path planning using dijkstra's algorithm with multi-layer dictionaries
|
| title_sort |
robotic indoor path planning using dijkstra's algorithm with multi-layer dictionaries
|