A novel path planning algorithm for visually impaired people | Zendy

Durgesh Nandini | Zendy; K. R. Seeja | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

A novel path planning algorithm for visually impaired people

Author(s) -

Durgesh Nandini,

K. R. Seeja

Publication year - 2017

Publication title -

journal of king saud university - computer and information sciences

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.617

H-Index - 33

eISSN - 2213-1248

pISSN - 1319-1578

DOI - 10.1016/j.jksuci.2017.03.005

Subject(s) - obstacle , novelty , motion planning , path (computing) , visually impaired , computer science , computer vision , obstacle avoidance , routing (electronic design automation) , artificial intelligence , route planning , algorithm , greedy algorithm , path length , mathematical optimization , real time computing , mathematics , human–computer interaction , geography , psychology , mobile robot , robot , computer network , social psychology , archaeology

Visually impaired people require constant assistance for navigating from one location to another. Achieving autonomous shopping experience in a supermarket is a real challenge for them. This paper presents a greedy path planning algorithm for routing a visually impaired person through an obstacle free optimal path through the corridors of the supermarket. The novelty of the proposed path planning algorithm is the minimization of the number of turns along with distance, as visually impaired people prefers to move through straight paths without any turns. The proposed algorithm can be incorporated into any existing shopping assistance systems available in the market with obstacle detection facility in it. The algorithm also reroutes the user in case of an obstacle detected in the path.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research