GDL

Journal from gdlhub / 2019-09-21 09:47:46
Oleh : Durgesh Nandini, K.R. Seeja, King Saud University
Dibuat : 2019-09-21, dengan 1 file

Keyword : Visually impaired people, Greedy algorithm, Shortest path, Obstacle free path
Url : http://www.sciencedirect.com/science/article/pii/S1319157816301392
Sumber pengambilan dokumen : WEB

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.

Beri Komentar ?#(0) | Bookmark

Properti	Nilai Properti
ID Publisher	gdlhub
Organisasi	King Saud University
Nama Kontak	Herti Yani, S.Kom
Alamat	Jln. Jenderal Sudirman
Kota	Jambi
Daerah	Jambi
Negara	Indonesia
Telepon	0741-35095
Fax	0741-35093
E-mail Administrator	elibrarystikom@gmail.com
E-mail CKO	elibrarystikom@gmail.com