zip

Research and application of the shortest path algorithm in robot obstacle avoidance

  • 2014-03-05
  • 1.39MB
  • Points it Requires : 2

Based on the obstacle avoidance problem of the robot moving in the planar area, the algorithm is designed through the length of a single obstacle path, and MATLAB software is used to perform separate calculations. After comprehensive comparison, the shortest obstacle avoidance path for the robot to reach the target point from the starting point of the area is obtained.

unfold

You Might Like

Uploader
solarelec
 

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