[{"data":1,"prerenderedAt":-1},["ShallowReactive",2],{"$fuC3XFdXgh91DHt_WTz6ph-6LZyA4qd31reW2fIpvsgI":3},{"answer":4,"createTime":5,"id":6,"options":7,"origin":12,"question":15,"related":16,"source":20,"type":21},[],"2024-10-19 09:25:57",1006829461,[8,9,10,11],"启发函数不会过高估计从当前节点到目标结点之间的实际代价","取值恒为0的启发函数必然是可容的","评价函数通常是对当前节点到目标节点距离的估计","如果启发函数满足可容性,那么在树搜索A*算法中节点的评价函数值按照扩展顺序单调非减;启发函数满足一致性时图搜索A*算法也满足该性质",{"courseImg":13,"courseName":14},"https:\u002F\u002Ftihai-oss-cloud.itihey.com\u002Fimg\u002Fd7ea7086329261ddbccb0e9e00c955b1.jpg","[智慧共享课]人工智能引论","以下关于启发函数和评价函数的说法中正确的是( )",[17,22,32,40,45],{"answer":18,"createTime":5,"id":6,"options":19,"question":15,"source":20,"type":21},[],[8,9,10,11],"v2",0,{"answer":23,"createTime":24,"id":25,"options":26,"question":31,"source":20,"type":21},[],"2024-10-19 09:25:58",1006829663,[27,28,29,30],"根据节点的代价评估","根据节点的深度","根据节点的启发式函数值","根据节点的父节点","在A*搜索算法中,如何确定一个节点是否应该被扩展?( )",{"answer":33,"createTime":5,"id":34,"options":35,"question":38,"source":20,"type":39},[],1006829664,[36,37],"对","错","A* 搜索算法总是能找到最短路径.( )",3,{"answer":41,"createTime":5,"id":42,"options":43,"question":44,"source":20,"type":39},[],1006829665,[36,37],"A* 搜索算法的时间复杂度与启发式函数的选择无关.( )",{"answer":46,"createTime":24,"id":47,"options":48,"question":49,"source":20,"type":39},[],1006829666,[36,37],"A* 搜索算法只能应用于有向图.( )"]