Mobile Robot Motion Planning using Bug Algorithms


Abstract in English

Motion Planning is an important and potential issue in Robotics, because it gives the robot the ability to reach its target automatically with collision free, which increase the robot performance and reduce its operational cost. The robot motion planning is commonly divide into two approaches: finding the appropriate path and making the robot tracking this path until it reaches its goal. This research depends on one of the most common obstacles avoidance path planningtechniques (Bug algorithms) to find global path of robot. And make the Boe-Bot robot (differential drive robot) tracking the paths generated by these algorithms in a certain environment.

References used

S. M. LAVALLE, Planning Algorithms, New York, USA. : Cambridge University Press, 2006
P. K. DAS, H. S. BEHERA, P. K. JENA AND B. K. PANIGRAHI, "Multi-robot path planning in a dynamic environment using improved gravitational search algorithm," Journal of Electrical Systems and Information Technology, 2016,vol. 3, pp. 295-313
L. FENG-LI, "Tracking and Following Algorithms of Mobile Robots for Service Activities in Dynamic Environments," International Journal of Automation and Smart Technology, 2015,vol. 4, no. 4, pp. 39-48

Download