[{"data":1,"prerenderedAt":-1},["ShallowReactive",2],{"$f6DDTTm9v6zEEugKVw0jdfM4BSOE-mjDgQOnPkvEYYfI":3},{"answer":4,"createTime":5,"id":6,"options":7,"origin":12,"question":18,"related":19,"source":29,"type":74},[],"2023-05-08 07:40:14",33262383,[8,9,10,11],"状态和行为维度高","状态信息误差大","样本量过多","模型限制",{"courseId":13,"courseImg":14,"courseName":15,"workId":16,"workName":17},"1000008418","https:\u002F\u002Ftihai-oss-cloud.itihey.com\u002Fimg\u002F8e391dadee7a948b8ae0df014f53e38f.jpg","人工智能原理与方法","22067979","人工智能原理与方法教程考试","下列不属于强化学习难点的是:( )",[20,31,38,48,57,66,75,84,93,96],{"answer":21,"createTime":5,"id":22,"options":23,"question":28,"source":29,"type":30},[],33262197,[24,25,26,27],"SLAM指的是同时定位与地图构建","视觉SLAM主要是以相机作为传感器的SLAM技术","激光SLAM主要是以激光雷达作为传感器的SLASM技术","建图是解决机器人周围有什么环境信息的问题","下列关于SLAM的说法中正确的有( )","v2",1,{"answer":32,"createTime":5,"id":33,"options":34,"question":37,"source":29,"type":30},[],33262211,[8,9,35,36],"现有模型限制","样本量过大,计算复杂","强化学习的难点有( )",{"answer":39,"createTime":5,"id":40,"options":41,"question":47,"source":29,"type":30},[],33262220,[42,43,44,45,46],"研发基于生物神经元原理的神经形态模型","利用新型电子元件忆阻器模拟生物神经元","基于脑科学大数据开发虚拟人工大脑","基于已知脑功能模型设计仿脑模型","基于深度学习技术模拟人脑智能","类脑计算的主要方法有( )",{"answer":49,"createTime":5,"id":50,"options":51,"question":56,"source":29,"type":30},[],33262288,[52,53,54,55],"鲁棒性","可拓展性","灵活性","交互性","群体机器人系统的三种特性是:( )",{"answer":58,"createTime":5,"id":59,"options":60,"question":65,"source":29,"type":30},[],33262291,[61,62,63,64],"决策树分类法","支持向量机","k-最近邻法","人工神经网络","以下机器学习算法中属于分类算法的是( )",{"answer":67,"createTime":5,"id":68,"options":69,"question":73,"source":29,"type":74},[],33262297,[70,71,72],"非线性标定","鲁棒性不高","灵活性弱","下列不属于摄像机自标定的缺点的为( )",0,{"answer":76,"createTime":5,"id":77,"options":78,"question":83,"source":29,"type":74},[],33262298,[79,80,81,82],"指定领域自动问答","开放领域自动问答","特定领域自动问答","常用问题集自动问答","不属于智能问答的分类的是( )",{"answer":85,"createTime":5,"id":86,"options":87,"question":92,"source":29,"type":74},[],33262369,[88,89,90,91],"K值的选择","距离度量","形式化描述","分类决策规则","K-NN算法即K-近邻算法,是一种常用的分类算法.请问,下列选项中,哪一个不是K-NN算法的要素( )",{"answer":94,"createTime":5,"id":6,"options":95,"question":18,"source":29,"type":74},[],[8,9,10,11],{"answer":97,"createTime":5,"id":98,"options":99,"question":104,"source":29,"type":30},[],33262438,[100,101,102,103],"目标节点如果存在,用宽度优先搜索算法总可以找到该目标节点","目标节点如果存在,会是最小(即最短路径(当单位耗散值时))的节点","时间和空间复杂度都比较高,搜索效率低","时间需求是一个很大的问题,特别是当搜索的深度比较大时,尤为严重","对于宽度优先搜索方法优缺点说法正确的是:( )"]