Particle swarm optimization approach in route navigation for PoSVI-Cane

Conventional white canes have been used for ages to help those with visual impairment to scan their surroundings as well as detecting potential obstacles. But these canes are not capable of providing any other information, nor helping the blinds to travel independently and efficiently. Hence, numero...

Full description

Saved in:
Bibliographic Details
Main Authors: Toha, Siti Fauziah, Nordin, Nor Hidayati Diyana, Md. Zain, Mohd Zarhamdy
Format: Article
Language:English
Published: Universiti Teknikal Malaysia Melaka (UTeM) 2023
Subjects:
Online Access:http://irep.iium.edu.my/103509/2/103509_Particle%20swarm%20optimization%20approach%20in%20route%20navigation.pdf
http://irep.iium.edu.my/103509/
https://jet.utem.edu.my/jet/article/view/6280/4225
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Conventional white canes have been used for ages to help those with visual impairment to scan their surroundings as well as detecting potential obstacles. But these canes are not capable of providing any other information, nor helping the blinds to travel independently and efficiently. Hence, numerous research and solutions have been proposed to overcome and improve the function of white canes. These devices are nevertheless expensive, becoming more unaffordable for low-income categories. Therefore, this paper presents the development of a low-cost navigation device – White Cane with Positioning Solution for Visually Impaired (PoSVI-Cane) that can assist those who are visually impaired to travel confidently, even with unfamiliar routes. In this work, path planning component is embedded to the normal white cane, which further improve its function. Here, Particle Swarm Optimization (PSO) path planning algorithm computes the shortest possible path based on the collection of coordinates along the pedestrian walkway. Results from the experiments shows that employing PSO algorithm in the device manage to assist VIP to travel independently. The cost of path at the optimal route is 823 at 40 iterations. In addition, only low-cost components are used to ensure that the total cost of the proposed cane is low, without jeopardizing its function.