Finding Diverse Paths for Robot Navigation Using a Fast Random Walk Approach
Journal: International Journal of Electrical, Electronics & Computer Science Engineering (Vol.4, No. 1)Publication Date: 2017-02-28
Authors : R. Sarathkumar Kithiyon S .Immanuel Prabaharan A. Samsu Nighar C. David J. Gold Beulah Patturose;
Page : 10-18
Keywords : Nonholonomic Motion Planning; Motion And Path Planning; Reactive And Sensor-Based Planning.;
Abstract
Finding a set of diverse paths among dynamic obstacles is an appealing navigation strategy for mobile robots to qualitatively reason about multiple path hypotheses to the goal. We introduce an efficient randomized approach, based on weighted random walks, that finds K diverse paths on the Voronoi diagram of the environment, where each path represents a distinct homotopy class. We show experimentally that our approach is significantly faster at finding paths of higher diversity in distinct homotopy classes than two state-of-the-art methods. Moreover, we prove that our method is probabilistically complete.
Other Latest Articles
- PHILOSOPHICAL UNDERSTANDING OF THE ARCHETIPOLOGICAL BLOCK OF MEMORY IN COMPARATIVE ANALYSIS OF K.G. JUNG AND G. POPOV APPROACHES
- A Novel Case Study on Energy Management
- PEDAGOGICAL CONCEPT “SCIENCE EDUCATION”
- INTEGRITY OF THE PEDAGOGICAL PROCESS IN SCHOOLS WITH INCLUSIVE FORM OF EDUCATION
- A Novel Secure Data Storage with Unsigned Authentication in Cloud Computing used in Spread Access Control Framework
Last modified: 2021-05-30 23:55:21