Motion planning for mobile robot navigation using combine Quad-Tree Decomposition and Voronoi Diagrams

This paper presents a novel method for mobile robot navigation by visual environments where there are obstacles in the workspace. The method uses a path selection mechanism that creates innovative paths through the workspace and learns to use trajectory that are more assured. This approach is implemented on motion robots which verified the shortest path via Quad-tree Decomposition (QD) and then used Voronoi Diagrams (VD(S)) algorithm we called (Q&V) algorithm. Based on the experimental data, we claim the robot's trajectory planned by Q&V algorithm is the better find and control the roadmap is completely modeled and hasn't the localization errors. We show that even small modeled obstacles can cause large used from the preplanned path. Our complementary approach of path selection decreases the risk of path following and increases the predictability of robot's behavior.

[1]  John H. Holland,et al.  On an Application of Dynamic Programming to the Synthesis of Logical Systems , 1959, JACM.

[2]  Luis Moreno,et al.  Path Planning for Mobile Robot Navigation using Voronoi Diagram and Fast Marching , 2006, 2006 IEEE/RSJ International Conference on Intelligent Robots and Systems.

[3]  Atsuyuki Okabe,et al.  Spatial Tessellations: Concepts and Applications of Voronoi Diagrams , 1992, Wiley Series in Probability and Mathematical Statistics.

[4]  Thierry Fraichard,et al.  Robust motion planning using Markov decision processes and quadtree decomposition , 2004, IEEE International Conference on Robotics and Automation, 2004. Proceedings. ICRA '04. 2004.

[5]  M. Carter.  Computer graphics: Principles and practice , 1997 .

[6]  Ronald A. Howard,et al.  Dynamic Programming and Markov Processes , 1960 .

[7]  Sang Won Bae,et al.  Shortest Paths and Voronoi Diagrams with Transportation Networks Under General Distances , 2005, ISAAC.

[8]  Narendra Ahuja,et al.  Gross motion planning—a survey , 1992, CSUR.

[9]  Imma Boada,et al.  Approximations of 3D generalized Voronoi diagrams , 2005, EuroCG.

[10]  Illah R. Nourbakhsh,et al.  A Robust Visual Odometry and Precipice Detection System Using Consumer-grade Monocular Vision , 2005, Proceedings of the 2005 IEEE International Conference on Robotics and Automation.

[11]  Jean-Claude Latombe,et al.  Robot motion planning , 1970, The Kluwer international series in engineering and computer science.

[12]  Reji Mathew,et al.  Motion modeling with separate quad-tree structures for geometry and motion , 2008, 2008 IEEE 10th Workshop on Multimedia Signal Processing.

[13]  Ellips Masehian,et al.  Robot Path Planning in 3D Space Using Binary Integer Programming , 2007 .

[14]  Steven K. Feiner,et al.  Computer graphics: principles and practice (2nd ed.) , 1990 .

[15]  Spyros G. Tzafestas,et al.  The Approximate Cell Decomposition with Local Node Refinement Global Path Planning Method: Path Nodes Refinement and Curve Parametric Interpolation , 1998, J. Intell. Robotic Syst..

[16]  Meir Feder,et al.  Image compression via improved quadtree decomposition algorithms , 1994, IEEE Trans. Image Process..

[17]  E. Masehian,et al.  Binary Integer Programming Model of Point Robot Path Planning , 2007, IECON 2007 - 33rd Annual Conference of the IEEE Industrial Electronics Society.

[18]  John Anderson,et al.  Flexible binary space partitioning for robotic rescue , 2003, Proceedings 2003 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS 2003) (Cat. No.03CH37453).