skip to main content
10.1145/3373724.3373736acmotherconferencesArticle/Chapter ViewAbstractPublication PagesicraiConference Proceedingsconference-collections
research-article

Path Planning of Lunar Robot Based on an Adaptive Ant Colony Algorithm

Authors Info & Claims
Published:03 February 2020Publication History

ABSTRACT

Path planning of lunar robots is the guarantee that lunar robots can complete tasks safely and accurately. Aiming at the shortest path and the least energy consumption, an adaptive potential field ant colony algorithm (A-APFACO) suitable for path planning of lunar robot was proposed to solve the problems of slow convergence speed and easy to fall into local optimum of ant colony algorithm. This algorithm combines the artificial potential field method with ant colony algorithm, introduces the inducement heuristic factor, and adjusts the state transition rule of the ant colony algorithm dynamically, so that the algorithm has higher global search ability and faster convergence speed. The simulation experiment results show that the convergence speed of the improved adaptive ant colony algorithm is significantly faster, and the success rate of global searching for the shortest path can reach 96%.

References

  1. Ammar, A., Bennaceur, H., and Chaari, I., et al. 2016. Relaxed Dijkstra and A* with linear complexity for robot path planning problems in large-scale grid environments. SOFT COMPUT. 20, 10 (July. 2015), 4149--4171. DOI= 10.1007/s00500-015-1750-1.Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. Hayat, S. and Kausar, Z. 2015. Mobile Robot Path Planning for Circular Shaped Obstacles Using Simulated Annealing. 2015 SCIE/ IEEE. (May. 2015). DOI= 10.1109/ICCAR.2015.7166004.Google ScholarGoogle Scholar
  3. Patle, B. K., Parhi, D. R. K., and Jagadeesh, A., et al. 2017. Matrix-Binary Codes based Genetic Algorithm for path planning of mobile robot. COMPUT ELECTR ENG. (Dec. 2017). DOI= 10.1016/j.compeleceng.2017.12.011.Google ScholarGoogle Scholar
  4. Stutzle, T. and Hoos, H. 1997. MAX-MIN Ant System and local search for the traveling salesman problem. INT C COMP AID DES C. (May. 1997). DOI: 10.1109/ICEC.1997.592327.Google ScholarGoogle Scholar
  5. Liu, J., Yang, J., and Liu, H. et al. 2016. An improved ant colony algorithm for robot path planning. SOFT COMPUT. 21, 19 (May. 2016), 5829--5839. DOI= 10.1007/s00500-016-2161-7.Google ScholarGoogle Scholar
  6. Cheng, J., Miao, Z., Li, B., et al. 2017. An improved ACO algorithm for mobile robot path planning. IEEE International Conference on Information & Automation. (Aug. 2017), 963--968. DOI: 10.1109/ICInfA.2016.7831958.Google ScholarGoogle Scholar
  7. Long, S., Gong, D., Dai, X., and Zhang, Z. 2019. Mobile Robot Path Planning Based on Ant Colony Algorithm With A* Heuristic Method. FRONT NEUROINFORM. (Apr. 2019). DOI: 10.3389/fnbot.2019.00015.Google ScholarGoogle Scholar
  8. Akka, K. and Khaber, F. 2018. Mobile robot path planning using an improved ant colony optimization. INT J ADV ROBOT SYST, 15, 3. (Sep. 2018). DOI: 10.1109/ROMA.2016.7847836.Google ScholarGoogle ScholarCross RefCross Ref
  9. Yang, H., Qi, J., and Miao, Y., et al. 2018. A new robot navigation algorithm based on a double-layer ant algorithm and trajectory optimization. IEEE T IND ELECTRON. (Dec. 2018), 1--1. DOI: 10.1109/TIE.2018.2886798.Google ScholarGoogle Scholar
  10. Wang, X., Yang, L., and Zhang, Y., et al., 2018. Robot path planning, control and decision-making based on improved potential field ant colony algorithm. Control and Decision, 33, 10 (Oct. 2018), 50--56. DOI: 10.13195/j.kzyjc.2017.0639.Google ScholarGoogle Scholar

Index Terms

  1. Path Planning of Lunar Robot Based on an Adaptive Ant Colony Algorithm

    Recommendations

    Comments

    Login options

    Check if you have access through your login credentials or your institution to get full access on this article.

    Sign in
    • Published in

      cover image ACM Other conferences
      ICRAI '19: Proceedings of the 5th International Conference on Robotics and Artificial Intelligence
      November 2019
      108 pages
      ISBN:9781450372350
      DOI:10.1145/3373724

      Copyright © 2019 ACM

      Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

      Publisher

      Association for Computing Machinery

      New York, NY, United States

      Publication History

      • Published: 3 February 2020

      Permissions

      Request permissions about this article.

      Request Permissions

      Check for updates

      Qualifiers

      • research-article
      • Research
      • Refereed limited
    • Article Metrics

      • Downloads (Last 12 months)12
      • Downloads (Last 6 weeks)0

      Other Metrics

    PDF Format

    View or Download as a PDF file.

    PDF

    eReader

    View online with eReader.

    eReader