周报.ppt

上传人:本田雅阁 文档编号:2723850 上传时间:2019-05-08 格式:PPT 页数:9 大小:777.51KB
返回 下载 相关 举报
周报.ppt_第1页
第1页 / 共9页
周报.ppt_第2页
第2页 / 共9页
周报.ppt_第3页
第3页 / 共9页
周报.ppt_第4页
第4页 / 共9页
周报.ppt_第5页
第5页 / 共9页
点击查看更多>>
资源描述

《周报.ppt》由会员分享,可在线阅读,更多相关《周报.ppt(9页珍藏版)》请在三一文库上搜索。

1、1,weekly report,2012.4.15,Page 2,Page 2,papers,Introduction to Autonomous Mobile Robots,The Focused D* Algorithm for Real-time Replanning,A* Pathfinding,Page 3,Page 3,content,Path-planning,Static,Dynamic,Environment modeling,Methods of path search,Grid method,D* algorithm,GA,Visibility Graph,Free sp

2、ace,A* algorithm,Page 4,Page 4,Grid Method,Easy to modeling, updating and processing,eight kinds of moving direction,Grid,Obstacles,Position of robot,WN,WS,N,EN,E,S,W,ES,Free,part of obstacles,Page 5,Page 5,content,Path-planning,Static,Dynamic,Environment modeling,Methods of path search,Grid method,

3、D* algorithm,GA,Visibility Graph,Free space,A* algorithm,Dynamic A* algorithm,Page 6,Page 6,Key points of A* Algorithm,1.Evaluation Function (cost optimal) F = G + H G=the movement cost from start to the given grid H=the estimated movement cost from current grid to final destination, it is called He

4、uristic Function because it is a guess. 2.Open list Record the squares that have not been visited. 3.Closed list Record the nodes that have been visited.,Page 7,Page 7,Steps,此处添加内容,此处添加内容,此处添加内容,Repeat,Smallest F,Smallest F,Page 8,Page 8,schedules,1.Read the paper about D* Algorithm and to know how it works. 2.Try to learn some programs about A*.,9,Thats all, thank you!,

展开阅读全文
相关资源
猜你喜欢
相关搜索

当前位置:首页 > 其他


经营许可证编号:宁ICP备18001539号-1