CS 520 : Project 1 - Voyage Into the Unknown

该项目探讨了A*搜索算法的一个变种在机器人路径规划中的应用,特别是在环境未知的情况下。在一个网格世界中,机器人需要从起点到目标点移动,通过探索和感知来构建世界地图。随着观察到的障碍物和空地,机器人不断更新其对环境的知识,并据此重新规划最短路径。项目包括环境生成、执行分析和报告部分。
摘要由CSDN通过智能技术生成

CS 520 : Project 1 - Voyage Into the Unknown

This project is intended as an exploration of a variant of the A* search algorithm covered in class, in the traditional
application of Robotic Path Planning. In particular, we are going to look at a situation where the environment is
not fully known in advance, and must be learned by the agent as it moves through it.
A gridworld is a discretization of terrain into square cells that are either unblocked (traversable) or blocked. Consider the following problem: an agent in a gridworld has to move from its current cell (S) to a goal cell, the location of
a stationary target. The layout of the gridworld (what cells are blocked or unblocked) is unknown. These kinds of
challenges arise frequently in robotics, where a mobile platform equipped with sensors builds a map of the world as it traverses an unknown environment

评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值