pdf

AGV conflict-free path planning based on improved A-star algorithm

  • 2020-11-30
  • 379.09KB
  • Points it Requires : 1

An improved A* algorithm based on time windows is proposed to solve the conflict-free path planning problem for automated guided vehicles (AGVs). In particular, a more accurate estimation of turn times is introduced, which allows for a more accurate prediction of node conflicts during the path planning phase. In addition, a more accurate estimation of the heuristic value in the A* evaluation function is introduced, which can further speed up the path search process since some suboptimal path candidates will not be examined in the process.

unfold

You Might Like

Uploader
太白金星
 

Recommended ContentMore

Popular Components

Just Take a LookMore

EEWorld
subscription
account

EEWorld
service
account

Automotive
development
circle

About Us Customer Service Contact Information Datasheet Sitemap LatestNews


Room 1530, 15th Floor, Building B, No.18 Zhongguancun Street, Haidian District, Beijing, Postal Code: 100190 China Telephone: 008610 8235 0740

Copyright © 2005-2024 EEWORLD.com.cn, Inc. All rights reserved 京ICP证060456号 京ICP备10001474号-1 电信业务审批[2006]字第258号函 京公网安备 11010802033920号
×