Skip to main content
Log in

Non-smooth environment modeling and global path planning for mobile robots

  • Published:
Journal of Central South University of Technology Aims and scope Submit manuscript

Abstract

An Approximate Voronoi Boundary Network is constructed as the environmental model by way of enlarging the obstacle raster. The connectivity of the path network under complex environment is ensured through building the second order Approximate Voronoi Boundary Network after adding virtual obstacles at joint-close grids. This method embodies the network structure of the free area of environment with less nodes, so the complexity of path planning problem is reduced largely. An optimized path for mobile robot under complex environment is obtained through the Genetic Algorithm based on the elitist rule and re-optimized by using the path-tightening method. Since the elitist one has the only authority of crossover, the management of one group becomes simple, which makes for obtaining the optimized path quickly. The Approximate Voronoi Boundary Network has a good tolerance to the imprecise a priori information and the noises of sensors under complex environment. Especially it is robust in dealing with the local or partial changes, so a small quantity of dynamic obstacles is difficult to alter the overall character of its connectivity, which means that it can also be adopted in dynamic environment by fusing the local path planning.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. WU Li-juan, XU Xin-he. Design of an obstacle-avoidance strategy based on genetic algorithms in robot soccer competition[J]. Robot(in Chinese), 2001, 23(2): 142–145.

    Google Scholar 

  2. Janet Jason A, Luo R C, Kay M G. Autonomous mobile robot global motion planning and geometric beacon collection using traversability vectors[J]. IEEE Transactions on Robotics and Automation, 1997, 13(1):132–140.

    Article  Google Scholar 

  3. Jiang Kai-chun, Seneviratne L D, Earles P W E. A shortest path based path planning algorithm for non-holonomic mobile robots[J]. Journal of Intelligent and Robotics Systems, 1999, 24: 347–366.

    Article  MATH  Google Scholar 

  4. ZHOU Ming, SUN Shu-dong, PENG Yan-wu. A centralized coordinated path planning method based on genetic algorithm for multiple mobile robots[J]. Acta Aeronautica et Astronautica Sinica(in Chinese), 2000, 21(2):146–149.

    Google Scholar 

  5. Canny J F, Donald B R. Simplified Voronoi diagrams [J]. Discrete and Computational Geometry, 1988, 24(3): 219–236.

    MathSciNet  Google Scholar 

  6. Osamu Takahashi, Schilling R J. Motion planning in a plane using generalized Voronoi diagrams[J]. IEEE Transactions on Robotics and Automation, 1989, 5(2): 143–150.

    Article  Google Scholar 

  7. Choset Howie, Burdick Joel. Sensor-based exploration: the hierarchical generalized Voronoi graph [J]. International Journal of Robotics Research, 2000, 19(2): 96–125.

    Article  Google Scholar 

  8. Ford L R, Fulkerson D R. Flows in Networks[M]. Princeton: Princeton University Press, 1962.

    Google Scholar 

  9. Preparata F, Shamos M. Computational Geometry: An Introduction [M]. New York: Springer Verlag, 1985.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Zou Xiao-bing PhD candidate.

Additional information

Foundation item: Project (60234030) supported by the National Natural Science Foundation of China

Rights and permissions

Reprints and permissions

About this article

Cite this article

Zou, Xb., Cai, Zx. & Sun, Gr. Non-smooth environment modeling and global path planning for mobile robots. J Cent. South Univ. Technol. 10, 248–254 (2003). https://doi.org/10.1007/s11771-003-0018-6

Download citation

  • Received:

  • Accepted:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11771-003-0018-6

Key words

CLC number

Navigation