For a visually impaired person, the outdoor navigation is usually difficult and dangerous. The visual impaired, usually, rely on a cane or a guide dog for his navigation. This holds good only if the destination chosen by the person is already known to him. If he has chosen a destination which is unknown to him, then it proves to be a very difficult task.
For a visually impaired person, the outdoor navigation is usually difficult and dangerous. The visual impaired, usually, rely on a cane or a guide dog for his navigation.
Our main aim is to develop a prototype of a navigation system which is effective and highly accurate.
The first essential aspect is to find an application for a pedestrian navigation system with social relevance. The second aspect is to develop an overall outdoor navigation concept i.e. covering everything from positioning to guidance.
In this paper, we have developed an effective navigation system using the Dijkstra algorithm to guide the visually impaired from their starting point to the destination. Since it uses Dijikstra algorithm, it also indicates the shortest
path from the starting point to the destination, thus consuming time and energy. Thus, this paper when utilized in an effective manner can be very helpful to the blind and helps them to overcome the darkness and make them to lead a bright life like us.
The use of existing components for positioning and the man-machine interface.
Software development phase for routing, map matching and guidance.
Supplementing common aids for the blind people. The components shown in the figure appears in three pairs:
The navigable map describes the geographic space in terms of the path network. It computes the shortest optimal path from the source to the destination.
The positioning module has to forward the position of the pedestrian to the map matching module which transforms the absolute position to a location relative to a close by object or a decision point.
Here the ‘shortest’ and ‘optimal’ indicates the safest and the most secure path in guiding the visually impaired.
The formula used for finding cost number is as follows:
c (i,j)= (.6i+.4j)/2 ;
where ‘i’ denotes length of the edge and ‘j’ denotes the obstacles along the edge.
One of the most efficient algorithms computing the shortest path from one point to another is Dijkstra Algorithm.
As far as the positioning is concerned, it is of vital importance in the navigation of a visually impaired because any false positioning may lead to accidents etc.,
A magnetometer triad and a gyro compass for course determination.
The process of map matching projects the pedestrian’s trajectory onto an edge sequence in digital map.
The map matching directly follows Kalman filtering where the observed trajectory is updated.
The main components involved in guiding a visually impaired involves the generation of a maneuver list and the permanent route checking.
In this paper, the following disadvantages can be noted:
The modeling of the navigation environment is an annoying and time consuming one.
Thus an effective navigation system for the visually impaired in an outside environment is provided using Dijkstra’s algorithm. In this project, the blind user’s position is obtained by GPS followed by map matching onto a highly accurate digital map.