Adapting Best Path for Mobile Robot By Predicting Obstacle Size
Ramesh Dadi1, Sallauddin MD2, Syed Nawaz Pasha3, A. Harshavardhan4, P.Kumarawamy5
1Ramesh Dadi, Computer Science & Engineering, S R Engineering College, Warangal, India.
2Sallauddin MD, Computer Science & Engineering, S R Engineering College, Warangal, India.
3Syed Nawaz Pasha, Computer Science & Engineering, S REngineering College, Warangal, India.
4A. Harshavardhan, Computer Science & Engineering, S R Engineering College, Warangal, India. Nirzari Pa Computer Science & Engineering, S R Engineering College, Warangal, India.
5P.Kumarawamy, Computer Science & Engineering, S R Engineering College, Warangal, India.
Manuscript received on 09 August 2019 | Revised Manuscript received on 16 August 2019 | Manuscript Published on 31 August 2019 | PP: 200-202 | Volume-8 Issue-9S2 August 2019 | Retrieval Number: I10390789S219/19©BEIESP DOI: 10.35940/ijitee.I1039.0789S219
Open Access | Editorial and Publishing Policies | Cite | Mendeley | Indexing and Abstracting
© The Authors. Blue Eyes Intelligence Engineering and Sciences Publication (BEIESP). This is an open-access article under the CC-BY-NC-ND license (http://creativecommons.org/licenses/by-nc-nd/4.0/)
Abstract: In this paper we are proposing an approach to find obstacle size to reduce the searching area for path planning for mobile robot. With this approach, the vehicle is able to reduce searching area compare to other algorithms. This is main problem normally all the algorithms were concentrate how to optimal path but without reducing searching area it’s not possible .The approach we use in our model consists of various kinds of obstacles such as motor cycles, pedestrians, animals, etc. The presence of and the appropriate path is planned according to the dimensions of the obstacle as different obstacles have different dimensions.
Keywords: Optimal Path, Varying Obstacle, Dynamic Environment.
Scope of the Article: Foundations Dynamics