b*******a
发帖数: 68 | 1 请问Cleaning Robot 的标准算法是什么？
放在房间任意位置，自动清理房间，绕过障碍。
这个与深度/广度搜索不同，因为Robot只能沿着一条路线走，不能任意跳跃，当然因尽
量避免重复扫描，还有要维护一个MAP,记忆相对于出发点的的位置
请哪位大牛说说？谢谢啦 | D*******e
发帖数: 151 | 2 I don't know standard algorithms.
I would do it in a line-wise manner, from top to bottom. When hits an
obstacle, search a path greedily (BFS, using priority queue where key is the
distance to next block) for the next block. | l***i
发帖数: 1309 | 3 The book by Russell and Norvig has a chapter for that problem. | D*******e
发帖数: 151 | 4 Can you describe it briefly
【在 l***i 的大作中提到】
: The book by Russell and Norvig has a chapter for that problem.
| a**********2
发帖数: 340 | |
|
