Skip to main content

Robot Path Planning Based on Random Expansion of Ant Colony Optimization

  • Chapter
  • First Online:
Recent Advances in Computer Science and Information Engineering

Part of the book series: Lecture Notes in Electrical Engineering ((LNEE,volume 125))

Abstract

Aimed at the shortcomings of the ant colony algorithm in robot path planning, which need much time and easy to fall in premature stagnation. This paper proposes a random expansion ant colony optimization algorithm through giving a possible way in the initial pheromone distribution to narrow the searching range of algorithm and raise the searching speed. At the same time random expansion factor is introduced to ant colony optimization algorithm, improved the diversity of routes and global optimization properties. The simulations result shows that the algorithm has excellent global optimization property and fast convergence speed.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 169.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 219.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 219.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Bonabeau, E., Dorigo, M., Theraulaz, G.: Swarm Intelligence: From Natural to Artificial Systems. Oxford University Press, New York (1999)

    MATH  Google Scholar 

  2. Dorigo, M., Caro, G.D.: The Modified Swarm Optimization Metaheuristic. In: Come, D., Mdorigo, Glover, F. (eds.) New Ideas in Optimization, pp. 11–32. Graw Hill, Mc London (1999)

    Google Scholar 

  3. Gong, B.C., Li, L.Y., Jiang, Y.T.: Ant colony algorithm based on local optimization for TSP. Application Research of Computers 25(7), 1974–1976 (2008)

    Google Scholar 

  4. Hua, J.N., Zhao, Y.W., Wang, Y.C.: New Global Path Planning Algorithm for Mobile Robot. Robot 28(6), 548–597 (2006)

    Google Scholar 

  5. Keron, Y., Borenstein, J.: Potential field methods and their inherent limitations for mobile robot navigation. In: Proceedings of the IEEE International Conference on Robotics and Automation, pp. 1398–1404. IEEE, Piscata way (1991)

    Google Scholar 

  6. Li, L., Ye, T., Tan, M.: Present state and future development of mobile robot technology research. Robot 24(5), 475–480 (2002)

    MATH  Google Scholar 

  7. Ma, Z.Q., Yuan, Z.R.: Real time navigation and obstacle avoidance based on grids method for fast mobile robot. Robot 18(6), 344–348 (1996)

    Google Scholar 

  8. Oommen, B., Iyengar, S., Rao, N., Kashyap, R.: Robot navigation in unknown terrains using learned visibility graphs. Part I: The disjoint convex obstacle case. Robotics and Automation 3(6), 672–681 (1987)

    Article  Google Scholar 

  9. Pintea, C.M., Dumitrescu, D.: Improving ant systems using a local updating rule. In: Proc. of the 7th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, pp. 295–298 (2005)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2012 Springer-Verlag GmbH Berlin Heidelberg

About this chapter

Cite this chapter

Bai, J., Chen, L., Jin, H., Chen, R., Mao, H. (2012). Robot Path Planning Based on Random Expansion of Ant Colony Optimization. In: Qian, Z., Cao, L., Su, W., Wang, T., Yang, H. (eds) Recent Advances in Computer Science and Information Engineering. Lecture Notes in Electrical Engineering, vol 125. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-25789-6_21

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-25789-6_21

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-25788-9

  • Online ISBN: 978-3-642-25789-6

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics