文献知网节
  • 记笔记
摘要:In the actual path planning of the mobile robot, the algorithm planning of the robot is almost always to find the shortest path, but if the robot is in a narrow working environment with many corners, it will make the robot too close to the obstacle, and the robot’s edge will contact with the obstacle,resulting in the path planning failure. In order to solve the security problem of mobile robot path planning, we put forward a kind of inflation obstacles,refinement algorithm first determine skeleton and area of the mobile robot on the map, and then the refinement algorithm can get skeleton to improve traffic area,connected to the path of starting point and end point, define the passage area.Then by searching the first and second nodes, we can find the optimal path that accords with the safety of the robot. The new path planning algorithm can realize non-collision planning, improve the safety and stability of the robot, and verify its effectiveness and authenticity through simulation results.
会议名称:

The 10th International Conference on Computer Engineering and Networks(CENet2020)

会议时间:

2020-10-16

会议地点:

中国陕西西安

  • 专辑:

    信息科技

  • 专题:

    自动化技术

  • DOI:

    10.26914/c.cnkihy.2020.037245

  • 分类号:

    TP242

  • 手机阅读
    即刻使用手机阅读
    第一步

    扫描二维码下载

    "移动知网-全球学术快报"客户端

    第二步

    打开“全球学术快报”

    点击首页左上角的扫描图标

    第三步

    扫描二维码

    手机同步阅读本篇文献

  • CAJ下载
  • PDF下载

下载手机APP用APP扫此码同步阅读该篇文章

下载:7 页码:1201-1210 页数:10 大小:855k

引文网络
  • 参考文献
  • 引证文献
  • 共引文献
  • 同被引文献
  • 二级参考文献
  • 二级引证文献
  • 批量下载
相关推荐
  • 相似文献
  • 读者推荐
  • 相关基金文献
  • 相关法规
  • 关联作者
  • 相关视频