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