Earticle

초록

영어

Path planning algorithm is a key issue among robot control areas. In practical engineering applications, traditional methods have some limitations to a certain degrees in key aspects of cost, efficiency, security, flexibility, portability, etc. Through the analysis and comparison of A-star algorithm and Dijkstra algorithm, path planning problem supporting multiple cars run parallely (PPSMC for short) in a static and dynamic obstacles co-existing environment is studied. An A-STAR-Dijkstra-integrated algorithm is promoted to make multiple cars moving parallely without collision or deadlock. Both two algorithms are optimized too. The algorithm has applied in smart park.

목차

Abstract
 1. Introduction
 2. Related Works
 3. Basic Concept
  3.1. Auto Guided Vehicle
  3.2. Smart Park
  3.3. Multi-path Planning
  3.4. Limitations of A-star Algorithm
  3.5. Limitations of Dijkstra Algorithm
 4. Algorithm Design and Implementation
  4.1. Optimized A-star Algorithm
  4.2. Dijkstra Algorithm based on Rasterizing
 5. Conclusion
 Acknowledgements
 References

키워드

저자

• Zhanying Zhang [ College of Computer and Information Engineering, Tianjin Normal University, Tianjin 300387, China ]
• Ziping Zhao [ College of Computer and Information Engineering, Tianjin Normal University, Tianjin 300387, China ]

참고문헌

발행기관

간행물

표지보기 관심저널 등록

• 간행물명

  International Journal of Smart Home

• 간기

  격월간

• pISSN

  1975-4094

• 수록기간

  2008~2016

• 십진분류

  KDC 505 DDC 605