A dynamic path planning method for wheeled mobile robots (Dyna-bug).

Main Article Content

Abstract

Abstract


 


In this study, a hybrid path-planning scheme is presented. The main contribution of this paper is merging the static grid costs of the global map and the immediate environmental structure of the local map. The stationary condition of the map and the instant local goal is weighted by certain coefficients in order to determine the next move of the wheeled mobile robot (WMR). Thus, the cost function is defined in terms of the grid costs and the dynamic parameters. The main assumption is that the WMR on which this scheme is executed must be equipped with a field scanning sensor. The sensor readings in each processing cycle are pre-processed before plugging in the cost function. The passages in the local map are extracted from the sensor data, then the optimal collision-free point lying on the passages is obtained via the cost function.


Keywords: Path planning, collision avoidance, mobile robot.


 

Downloads

Download data is not yet available.

Article Details

How to Cite
A dynamic path planning method for wheeled mobile robots (Dyna-bug). (2017). Global Journal of Computer Sciences: Theory and Research, 7(3), 123–128. https://doi.org/10.18844/gjcs.v7i3.2791
Section
Articles