Abstract
The paper presents a novel global path planning approach for mobile robot navigation in two dimensional workspace cluttered by polygonal obstacles. The core of the planning method introduced is based on the approximate cell decomposition method. The advantage of the new method is the employment of novel path refinement procedures of the paths produced by approximate cell decomposition that are based on local characteriscics of the workspace. Furthermore, the refined path is parametrically interpolated by cubic splines via a physical centripetal model, introducing the dynamic constraints of mobile robots' motion to the path construction. The method has been implemented both in a computer graphics simulation and on a real mobile robot cruising at indoor environments. Planned paths on several configurations are presented.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Jackins, C. L. and Tanimoto, S. L.: Octrees and their use in representing 3-dimensional objects, Comput. Graph. Inform. Processing 14(3) (1980).
Samet, H.: Region representation: Quadtrees from boundary codes, Commun. ACM 23(3) (1980), 163–170.
Meagher, D.: Geometric modeling using octree encoding, Comput. Graph. Image Processing 19 (1982), 129–147.
Ayala, D., Brunet, P., Juan, R., and Navazo, I.: Object representation by means of nonminimal division quadtrees and octrees, ACM Trans. Graph. 4(1) (1985), 41–50.
Faverjon, B.: Obstacle avoidance using an octree in the configuration space of a manipulator, in: Proc. of the IEEE Internat. Conf. on Robotics and Automation, Atlanta, 1984, pp. 504–512.
Boaz, M. and Roach, J.: An octree representation for three dimensional motion and collision detection, in: Proc. of the SIAM Conf. on Geometrical Modeling and Robotics, Albany, NY, 1985.
Hayward, V.: Fast collision detection schema by recursive decomposition of a manipulator workspace, in: Proc. of the IEEE Internat. Conf. on Robotics and Automation, San Francisco, 1986, pp. 1044–1049.
Herman, M.: Fast, 3-dimensional, collision-free motion planning, in: Proc. of the IEEE Internat. Conf. on Robotics and Automation, San Francisco, 1986, pp. 1056–1063.
Kambhampati, S. and Davis, L. S.: Multiresolution path planning for mobile robots, IEEE Trans. Robotics Automat. RA-2(3) (1986), 135–145.
Fujimura, K. and Samet, H.: A hierarchical strategy for path planning among moving obstacles, IEEE Trans. Robotics Automat. RA-5(1) (1989), 61–69.
Latombe, J.-C.: Robot Motion Planning, Kluwer Academic Publishers, Dordrecht, 1991.
Katevas, N.: Intelligent autonomous mobile robots - Contribution to system architecture and path planning, PhD Thesis, National Technical University of Athens, 1997.
Hill, Jr.: Curve and surface design for CAD, in: Computer Graphics, Macmillan, New York, 1990, pp. 66–80.
Tenenbaum, M. A. and Augenstein, M. J.: Data Structures, Prentice-Hall, Englewood Cliffs, NJ, pp. 575–646.
Sheu, P. C.-Y. and Xue, Q.: Intelligent Robotic Planning Systems, World Scientific, Singapore, 1993.
Press, W. H., Teukolsky, S. A., Vetterling, W. T., and Flannery, B. P.: Cubic spline interpolation, in: Numerical Recipies in C, Cambridge Univ. Press, New York, 1992, pp. 113–117.
Yamaguchi, F.; Spline interpolation - The Berstein approximation, in: Curves and Surfaces in Computer Aided Geometric Design, Springer, Berlin, 1988, pp. 135–232.
Lee, E.: Choosing nodes in parametric curve interpolation, Comput. Aided Design 21(6) (1989), 363–370.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Katevas, N.I., Tzafestas, S.G. & Pnevmatikatos, C.G. The Approximate Cell Decomposition with Local Node Refinement Global Path Planning Method: Path Nodes Refinement and Curve Parametric Interpolation. Journal of Intelligent and Robotic Systems 22, 289–314 (1998). https://doi.org/10.1023/A:1008034314006
Issue Date:
DOI: https://doi.org/10.1023/A:1008034314006