首页 课程资源 专业指导     /    机器人路径规划算法

机器人路径规划算法

上传者: qq_42145674 | 上传时间:2025/3/28 2:06:58 | 文件大小:1.21MB | 文件类型:zip
机器人路径规划算法
路径规划的目的是在给定起点和目标点的空间里规划出一条从起点到目标点的无碰撞路径,基于图论的经典的路径规划算法有DFS,BFS,Dijkstra,Astra,智能路径规划算法有蚁群算法,遗传算法,模糊算法等。
本软件ID:11116630

文件下载

资源详情

[{"title":"(46个子文件1.21MB)机器人路径规划算法","children":[{"title":"路径规划算法","children":[{"title":"GA","children":[{"title":"astart.m <span style='color:#111;'>2.44KB</span>","children":null,"spread":false},{"title":"distanceCost.m <span style='color:#111;'>550B</span>","children":null,"spread":false},{"title":"plot_route.m <span style='color:#111;'>312B</span>","children":null,"spread":false},{"title":"map2.bmp <span style='color:#111;'>245.19KB</span>","children":null,"spread":false},{"title":"GA.m <span style='color:#111;'>9.47KB</span>","children":null,"spread":false},{"title":"map5.bmp <span style='color:#111;'>245.19KB</span>","children":null,"spread":false},{"title":"map4.bmp <span style='color:#111;'>245.19KB</span>","children":null,"spread":false},{"title":"feasiblePoint.m <span style='color:#111;'>751B</span>","children":null,"spread":false},{"title":"PathCostGA.m <span style='color:#111;'>946B</span>","children":null,"spread":false},{"title":"Mutation.m <span style='color:#111;'>193B</span>","children":null,"spread":false},{"title":"myLength.m <span style='color:#111;'>121B</span>","children":null,"spread":false},{"title":"bsp.m <span style='color:#111;'>746B</span>","children":null,"spread":false},{"title":"segmentCost.m <span style='color:#111;'>1.80KB</span>","children":null,"spread":false},{"title":"map3.bmp <span style='color:#111;'>245.19KB</span>","children":null,"spread":false},{"title":"map1.bmp <span style='color:#111;'>245.19KB</span>","children":null,"spread":false},{"title":"cross.m <span style='color:#111;'>366B</span>","children":null,"spread":false},{"title":"GA.pdf <span style='color:#111;'>175.89KB</span>","children":null,"spread":false},{"title":"exchange.m <span style='color:#111;'>68B</span>","children":null,"spread":false},{"title":"fit.m <span style='color:#111;'>145B</span>","children":null,"spread":false}],"spread":false},{"title":"蚁群","children":[{"title":"yiqun2.m <span style='color:#111;'>6.09KB</span>","children":null,"spread":false},{"title":"yiqun.m <span style='color:#111;'>4.81KB</span>","children":null,"spread":false},{"title":"G2D.m <span style='color:#111;'>483B</span>","children":null,"spread":false}],"spread":true},{"title":"fuzzy","children":[{"title":"astart.m <span style='color:#111;'>7.27KB</span>","children":null,"spread":false},{"title":"distanceCost.m <span style='color:#111;'>541B</span>","children":null,"spread":false},{"title":"map2.bmp <span style='color:#111;'>245.19KB</span>","children":null,"spread":false},{"title":"map5.bmp <span style='color:#111;'>245.19KB</span>","children":null,"spread":false},{"title":"fuzzyBase.fis <span style='color:#111;'>2.08KB</span>","children":null,"spread":false},{"title":"map4.bmp <span style='color:#111;'>245.19KB</span>","children":null,"spread":false},{"title":"feasiblePoint.m <span style='color:#111;'>735B</span>","children":null,"spread":false},{"title":"Thumbs.db <span style='color:#111;'>95.50KB</span>","children":null,"spread":false},{"title":"plotRobot.m <span style='color:#111;'>1.33KB</span>","children":null,"spread":false},{"title":"fuzzy.pdf <span style='color:#111;'>174.39KB</span>","children":null,"spread":false},{"title":"map3.bmp <span style='color:#111;'>245.19KB</span>","children":null,"spread":false},{"title":"map1.bmp <span style='color:#111;'>245.19KB</span>","children":null,"spread":false}],"spread":false},{"title":"经典路径规划算法","children":[{"title":"bfs.m <span style='color:#111;'>3.56KB</span>","children":null,"spread":false},{"title":"ASTAR2.m <span style='color:#111;'>17.31KB</span>","children":null,"spread":false},{"title":"getvideo.m <span style='color:#111;'>716B</span>","children":null,"spread":false},{"title":"GUI.m <span style='color:#111;'>4.01KB</span>","children":null,"spread":false},{"title":"仿真视频","children":[{"title":"Dijkstra.avi <span style='color:#111;'>1.07MB</span>","children":null,"spread":false},{"title":"ASTAR2.avi <span style='color:#111;'>722.05KB</span>","children":null,"spread":false},{"title":"BFS.avi <span style='color:#111;'>1.09MB</span>","children":null,"spread":false},{"title":"DFS.avi <span style='color:#111;'>1.36MB</span>","children":null,"spread":false}],"spread":true},{"title":"ASTAR.m <span style='color:#111;'>20.36KB</span>","children":null,"spread":false},{"title":"GUI.fig <span style='color:#111;'>19.66KB</span>","children":null,"spread":false},{"title":"dijkstra.m <span style='color:#111;'>6.27KB</span>","children":null,"spread":false},{"title":"DFS.m <span style='color:#111;'>3.39KB</span>","children":null,"spread":false}],"spread":true}],"spread":true}],"spread":true}]

评论信息

免责申明

【好快吧下载】的资源来自网友分享,仅供学习研究,请务必在下载后24小时内给予删除,不得用于其他任何用途,否则后果自负。基于互联网的特殊性,【好快吧下载】 无法对用户传输的作品、信息、内容的权属或合法性、合规性、真实性、科学性、完整权、有效性等进行实质审查;无论 【好快吧下载】 经营者是否已进行审查,用户均应自行承担因其传输的作品、信息、内容而可能或已经产生的侵权或权属纠纷等法律责任。
本站所有资源不代表本站的观点或立场,基于网友分享,根据中国法律《信息网络传播权保护条例》第二十二条之规定,若资源存在侵权或相关问题请联系本站客服人员,8686821#qq.com,请把#换成@,本站将给予最大的支持与配合,做到及时反馈和处理。关于更多版权及免责申明参见 版权及免责申明