Lesson 1 Localization

蒙特卡洛机器人定位模型

sense 贝叶斯模型

move 全概率公式

localization练习

 # The function localize takes the following arguments:
 #
 # colors:
 #        2D list, each entry either 'R' (for red cell) or 'G' (for green cell)
 #
 # measurements:
 #        list of measurements taken by the robot, each entry either 'R' or 'G'
 #
 # motions:
 #        list of actions taken by the robot, each entry of the form [dy,dx],
 #        where dx refers to the change in the x-direction (positive meaning
 #        movement to the right) and dy refers to the change in the y-direction
 #        (positive meaning movement downward)
 #        NOTE: the *first* coordinate is change in y; the *second* coordinate is
 #              change in x
 #
 # sensor_right:
 #        float between 0 and 1, giving the probability that any given
 #        measurement is correct; the probability that the measurement is
 #        incorrect is 1-sensor_right
 #
 # p_move:
 #        float between 0 and 1, giving the probability that any given movement
 #        command takes place; the probability that the movement command fails
 #        (and the robot remains still) is 1-p_move; the robot will NOT overshoot
 #        its destination in this exercise
 #
 # The function should RETURN (not just show or print) a 2D list (of the same
 # dimensions as colors) that gives the probabilities that the robot occupies
 # each cell in the world.
 #
 # Compute the probabilities by assuming the robot initially has a uniform
 # probability of being in any cell.
 #
 # Also assume that at each step, the robot:
 # 1) first makes a movement,
 # 2) then takes a measurement.
 #
 # Motion:
 #  [0,0] - stay
 #  [0,1] - right
 #  [0,-1] - left
 #  [1,0] - down
 #  [-1,0] - up
 def sense(p,colors,measurement,sensor_right):
     q=[]
     for row in range(len(colors)):
         temp=[]
         for col in range(len(colors[0])):
             hit = (measurement == colors[row][col])
             temp.append(p[row][col] * (hit * sensor_right + (1-hit) * (1-sensor_right)))
         q.append(temp)
     s=0
     for row in range(len(q)):
         for col in range(len(q[0])):
             s += q[row][col]
     for row in range(len(p)):
         for col in range(len(q[0])):
             q[row][col] = q[row][col]/s
     return q

 def move(p, motion, p_move):
     q = []
     for row in range(len(colors)):
         temp=[]
         for col in range(len(colors[0])):
             s = p_move * p[(row - motion[0]) % len(colors)][(col - motion[1]) % len(colors[0])]
             s += (1-p_move) * p[row][col]
             temp.append(s)
         q.append(temp)
     return q

 def localize(colors,measurements,motions,sensor_right,p_move):
     # initializes p to a uniform distribution over a grid of the same dimensions as colors
     pinit = 1.0 / float(len(colors)) / float(len(colors[0]))
     p = [[pinit for row in range(len(colors[0]))] for col in range(len(colors))]

     # >>> Insert your code here <<<

     for k in range(len(motions)):
         p = move(p, motions[k],p_move)
         p = sense(p,colors,measurements[k],sensor_right)

     return p

 def show(p):
     rows = ['[' + ','.join(map(lambda x: '{0:.5f}'.format(x),r)) + ']' for r in p]
     print '[' + ',\n '.join(rows) + ']'

 #############################################################
 # For the following test case, your output should be
 # [[0.01105, 0.02464, 0.06799, 0.04472, 0.02465],
 #  [0.00715, 0.01017, 0.08696, 0.07988, 0.00935],
 #  [0.00739, 0.00894, 0.11272, 0.35350, 0.04065],
 #  [0.00910, 0.00715, 0.01434, 0.04313, 0.03642]]
 # (within a tolerance of +/- 0.001 for each entry)

 colors = [['R','G','G','R','R'],
           ['R','R','G','R','R'],
           ['R','R','G','G','R'],
           ['R','R','R','R','R']]
 measurements = ['G','G','G','G','G']
 motions = [[0,0],[0,1],[1,0],[1,0],[0,1]]
 p = localize(colors,measurements,motions,sensor_right = 0.7, p_move = 0.8)
 show(p) # displays your answer

simultaneous adj.同时的

Udacity-Artificial Intelligence for Robotics 课程笔记的更多相关文章

  1. (转)A curated list of Artificial Intelligence (AI) courses, books, video lectures and papers

    A curated list of Artificial Intelligence (AI) courses, books, video lectures and papers. Updated 20 ...

  2. 学习笔记之人工智能(Artificial Intelligence)

    人工智能 - 维基百科,自由的百科全书 https://zh.wikipedia.org/wiki/%E4%BA%BA%E5%B7%A5%E6%99%BA%E8%83%BD 人工智能(英语:Artif ...

  3. (转) Artificial intelligence, revealed

    Artificial intelligence, revealed Yann LeCunJoaquin Quiñonero Candela It's 8:00 am on a Tuesday morn ...

  4. Andrew 机器学习课程笔记

    Andrew 机器学习课程笔记 完成 Andrew 的课程结束至今已有一段时间,课程介绍深入浅出,很好的解释了模型的基本原理以及应用.在我看来这是个很好的入门视频,他老人家现在又出了一门 deep l ...

  5. EECS 649 Introduction to Artificial Intelligence

    EECS 649 Introduction to Artificial IntelligenceExamElectronic Blackboard Submission Due: April 24, ...

  6. CS231n课程笔记翻译6:神经网络笔记 part1

    译者注:本文智能单元首发,译自斯坦福CS231n课程笔记Neural Nets notes 1,课程教师Andrej Karpathy授权翻译.本篇教程由杜客翻译完成,巩子嘉和堃堃进行校对修改.译文含 ...

  7. 【读书笔记与思考】Andrew 机器学习课程笔记

    Andrew 机器学习课程笔记 完成 Andrew 的课程结束至今已有一段时间,课程介绍深入浅出,很好的解释了模型的基本原理以及应用.在我看来这是个很好的入门视频,他老人家现在又出了一门 deep l ...

  8. Artificial Intelligence in Finance

    https://sigmoidal.io/real-applications-of-ai-in-finance/ Artificial Intelligence is taking the finan ...

  9. Artificial intelligence(AI)

    ORM: https://github.com/sunkaixuan/SqlSugar 微软DEMO: https://github.com/Microsoft/BotBuilder 注册KEY:ht ...

随机推荐

  1. python操作csv-xls完善后的代码

    #coding:utf-8 #导入相应模块 import csv,xlwt,sys,os,fnmatch,xlrd from xlutils.copy import copy #对xls文件中的绝对值 ...

  2. SQL Server 主动防止阻塞的 1 方法

    方法 1. set lock_timeout 5000;  这里设置超时为5秒; 例子: 连接A begin tran             update dbo.TestTable        ...

  3. svn unable to connect to a repository at url 执行上下文错误 不能访问SVN服务器问题

    1.检查visual SVN server 本地仓库服务是否正常启动 如果是SVN server service的的问题情形: (1).使用browser打开仓库位置,结果连接打不开. (2).查看s ...

  4. 顶尖数据挖掘开发平台(TipDM-D2)产品白皮书

          顶尖数据挖掘开发平台 (TipDM-D2)           产  品  白  皮  书 广州泰迪智能科技有限公司 版权所有 地址: 广州市经济技术开发区科学城232号 网址: http ...

  5. C#泛型类之List<T>

    1.        定义 System.Collections.Generic.List<T>类表示可通过索引访问的对象的强类型列表.提供用于对列表进行搜索.排序和操作的方法.T为类型参数 ...

  6. 依赖注入及AOP简述(三)——依赖注入的原理

    3.     “依赖注入”登场 于是诸多优秀的IT工程师开始想出了更加轻量便利.更加具有可测试性和可维护性的设计模式——IoC模式.IoC,即Inversion of Control的缩写,中文里被称 ...

  7. 关于SQL 系统自带存储过程的使用 (一)

    关于SQL,一边恐惧一边前行,战战兢兢,如履薄冰. 1.那些Maggie教我的事 因为脚本老是倒不齐全,QA某次跟我要了三次脚本,于是乎求助公司DBA. 利用SQL server本身的查询,找出最近修 ...

  8. JS中的逻辑哲学

    1.幻灯片播放. 有重用功能的代码要封入一个函数内,尽量减少调用出口(一般传入的参数为索引值),以便调用: 计数器放在最终调用的函数那里,index++: 明确那部分函数执行什么功能,将代码块只放在相 ...

  9. 在一个apk中调用另外一个apk中的activity

    今天忽然想到如果要在一个activity中调用另外一个activity该怎么办呢? 感觉这个应该比较简单,应为activity的启动方式就两种:显式启动.隐式启动: 显式启动的话肯定不行,那就只能使用 ...

  10. 二、fragment使用

    转载请注明出处:http://blog.csdn.net/guolin_blog/article/details/8881711 我们都知道,Android上的界面展示都是通过Activity实现的, ...