rar

Research on a Path Planning Algorithm under Multiple Constraints

  • 2013-09-22
  • 469.52KB
  • Points it Requires : 1

    Aiming at the important path planning function under multiple constraints in the current navigation system, a new uncertain algorithm is proposed by combining the A* algorithm and the ant colony algorithm. The algorithm first integrates multiple constraints to make it suitable for ant colony transfer, and adopts the evaluation index of the A* algorithm on the basis of the basic ant colony algorithm to provide the optimal prediction convergence point for ant colony transfer. Experiments have proved that the algorithm can greatly reduce time consumption, has strong global convergence, and stable calculation results.    

unfold

You Might Like

Uploader
nkyqsl
 

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号
×