人工智能练习题.doc

人工智能练习题.doc

ID:57646646

大小:451.50 KB

页数:27页

时间:2020-08-30

人工智能练习题.doc_第1页
人工智能练习题.doc_第2页
人工智能练习题.doc_第3页
人工智能练习题.doc_第4页
人工智能练习题.doc_第5页
资源描述:

《人工智能练习题.doc》由会员上传分享,免费在线阅读,更多相关内容在教育资源-天天文库

1、PartISEARCH1SearchYou’reataxidriver.Yourtaxicanhold4passengers.Passengerspayaflatfeeforaridetotheairport,sogoalistopickup4passengersandtakethemtotheairportinthesmallestnumberofmiles.Yourworldcanbemodeledasagraphoflocationswithdistancesbetweenthem.Some,butnotall,of

2、thelocationshavepassengersthatyoucanpickup.a.Describethestatespaceofthissearchproblem.b.Whatwouldbeagoodcostfunctionforthissearchproblem?c.Now,consideracasewherepassengershavetopayaccordingtohowfarawaytheyarefromtheairportwhenthey’repickedup(note:theydon’tpayaccor

3、dingtohowlongaridetheytakeinyourtaxi,butaccordingtothelengthoftheshortestpathfromtheirpickup-pointtotheairport).Describethestatespaceofthissearchproblem.d.Whatwouldbeagoodcostfunctionforthisversionoftheproblem?Youstillhaveadesiretosavegas.e.Isuniformcostsearchguar

4、anteedtofindtheoptimalsolutionineitherorbothversionsoftheproblem?Whyorwhynot?a.Yourcurrentlocationandnumberofpassengersinthecar.b.Distancetraveledsofar.c.Currentlocation,thenumberofpassengersinthecar,andthefaresofthepassengersyouhaveinthecar.d.Someconstantc1timest

5、hedistancetraveledsofarminussomeotherconstantc2timesthefaresofthepassengerswe’vepickedupsofar.e.UCSwillworkinthefirstcase,becausetherearenonegativecosts,butit’snotguaranteedtofindtheshortestpathinthesecondversionoftheproblem.2SearchConsiderthefollowinggraph,inwhic

6、hAisthestartnodeandFisthegoalnode.Assumethatnodesarevisitedatmostonce.1.Inwhatorderdoesuniform-costsearchvisitthenodes?2.Lettheheuristicfunctionh(n)betheminimumnumberofarcsbetweennodenandthegoalnode.Isthisanadmissibleheuristic?WhyorWhynot?3.InwhatorderdoesA*search

7、visitthenodes?Whataretheirestimatedvalueswhentheyarevisited?1.ABECF2.Yes,itisadmissiblebecauseitisaconservativeestimateofthedistance.3.A(2)B(4)E(4)F(5)3SearchBelowisagraphtobesearched(startingatSandendingatG).Link/edgecostsareshownaswellasheuristicestimatesatthest

8、ates.Youmaynotneedalltheinformationforeverysearch.1.Drawthecompletesearchtreeforthisgraph.Labeleachnodeinthetreewiththecostofthepathtothatnodeandtheheur

当前文档最多预览五页,下载文档查看全文

此文档下载收益归作者所有

当前文档最多预览五页,下载文档查看全文
温馨提示:
1. 部分包含数学公式或PPT动画的文件,查看预览时可能会显示错乱或异常,文件下载后无此问题,请放心下载。
2. 本文档由用户上传,版权归属用户,天天文库负责整理代发布。如果您对本文档版权有争议请及时联系客服。
3. 下载前请仔细阅读文档内容,确认文档内容符合您的需求后进行下载,若出现内容与标题不符可向本站投诉处理。
4. 下载文档时可能由于网络波动等原因无法下载或下载错误,付费完成后未能成功下载的用户请联系客服处理。