Indoor navigation system using Dijkstra's algorithm for emergency situation / Mohd Faizulhayad Mashuri

This research discuss on an implementation of route planning in Indoor Navigation System (INS) for emergency situation. Global Positioning System (GPS) cannot be used for INS since signals sent by satellites cannot penetrate the construction materials inside a building. Wireless Fidelity (Wi-Fi) is...

Full description

Saved in:

Bibliographic Details
Main Author:	Mashuri, Mohd Faizulhayad
Format:	Thesis
Language:	English
Published:	2015
Online Access:	https://ir.uitm.edu.my/id/eprint/81905/1/81905.pdf
Tags:	Add Tag No Tags, Be the first to tag this record!

id	my-uitm-ir.81905
record_format	uketd_dc
spelling	my-uitm-ir.819052023-11-12T13:15:44Z Indoor navigation system using Dijkstra's algorithm for emergency situation / Mohd Faizulhayad Mashuri 2015 Mashuri, Mohd Faizulhayad This research discuss on an implementation of route planning in Indoor Navigation System (INS) for emergency situation. Global Positioning System (GPS) cannot be used for INS since signals sent by satellites cannot penetrate the construction materials inside a building. Wireless Fidelity (Wi-Fi) is the system that can make INS possible. By implementing Radio Signal Strength (RSS) provided by Wireless Fidelity (Wi-Fi), Reference Points (RP)s with it designated RSS can be setup across the area desired. The connection or paths between each RP can be created to create the best route to the destination. The algorithm used for this route planning is Dijkstra's algorithm. The result of this technique shows higher accuracy in terms of shortest distance taken to the destination compared to other technique and the implementation of this technique are easy since users only have to manipulate the weight between each RPs according to obstacle that exist along the paths. Bigger obstacles will gives higher value of weight. Dijkstra's algorithm can provide shortest route to be used by user in a fast manner due to its medium algorithm complexity compared to the other two (2) algorithms. Dijkstra's algorithm also proved that this algorithm has the capability to provide alternative route in case of unpredicted existence of obstacles along the main route. Thus, it can be conclude that Dijkstra's algorithm is the best algorithm to be used for route planning compared to Bellman-Ford and A* algorithm. 2015 Thesis https://ir.uitm.edu.my/id/eprint/81905/ https://ir.uitm.edu.my/id/eprint/81905/1/81905.pdf text en public degree Universiti Teknologi MARA (UiTM) Faculty of Electrical Engineering Hussin, Mohamad Fahmi
institution	Universiti Teknologi MARA
collection	UiTM Institutional Repository
language	English
advisor	Hussin, Mohamad Fahmi
description	This research discuss on an implementation of route planning in Indoor Navigation System (INS) for emergency situation. Global Positioning System (GPS) cannot be used for INS since signals sent by satellites cannot penetrate the construction materials inside a building. Wireless Fidelity (Wi-Fi) is the system that can make INS possible. By implementing Radio Signal Strength (RSS) provided by Wireless Fidelity (Wi-Fi), Reference Points (RP)s with it designated RSS can be setup across the area desired. The connection or paths between each RP can be created to create the best route to the destination. The algorithm used for this route planning is Dijkstra's algorithm. The result of this technique shows higher accuracy in terms of shortest distance taken to the destination compared to other technique and the implementation of this technique are easy since users only have to manipulate the weight between each RPs according to obstacle that exist along the paths. Bigger obstacles will gives higher value of weight. Dijkstra's algorithm can provide shortest route to be used by user in a fast manner due to its medium algorithm complexity compared to the other two (2) algorithms. Dijkstra's algorithm also proved that this algorithm has the capability to provide alternative route in case of unpredicted existence of obstacles along the main route. Thus, it can be conclude that Dijkstra's algorithm is the best algorithm to be used for route planning compared to Bellman-Ford and A* algorithm.
format	Thesis
qualification_level	Bachelor degree
author	Mashuri, Mohd Faizulhayad
spellingShingle	Mashuri, Mohd Faizulhayad Indoor navigation system using Dijkstra's algorithm for emergency situation / Mohd Faizulhayad Mashuri
author_facet	Mashuri, Mohd Faizulhayad
author_sort	Mashuri, Mohd Faizulhayad
title	Indoor navigation system using Dijkstra's algorithm for emergency situation / Mohd Faizulhayad Mashuri
title_short	Indoor navigation system using Dijkstra's algorithm for emergency situation / Mohd Faizulhayad Mashuri
title_full	Indoor navigation system using Dijkstra's algorithm for emergency situation / Mohd Faizulhayad Mashuri
title_fullStr	Indoor navigation system using Dijkstra's algorithm for emergency situation / Mohd Faizulhayad Mashuri
title_full_unstemmed	Indoor navigation system using Dijkstra's algorithm for emergency situation / Mohd Faizulhayad Mashuri
title_sort	indoor navigation system using dijkstra's algorithm for emergency situation / mohd faizulhayad mashuri
granting_institution	Universiti Teknologi MARA (UiTM)
granting_department	Faculty of Electrical Engineering
publishDate	2015
url	https://ir.uitm.edu.my/id/eprint/81905/1/81905.pdf
_version_	1783736342979543040

Indoor navigation system using Dijkstra's algorithm for emergency situation / Mohd Faizulhayad Mashuri

Similar Items