猴子摘香蕉实验报告(含代码)

华中科技大学《人工智能与模式识别》实验报告院系：电子与信息工程系班级：姓名：同组人：指导老师：电话：邮箱：日期：2013年12月24日一、实验内容利用一阶谓词逻辑求解猴子摘香蕉问题：房内有一个猴子，一个箱子，天花板上挂了一串香蕉，其位置如图所示，猴子为了拿到香蕉，它必须把箱子搬到香蕉下面，然后再爬到箱子上。请定义必要的谓词，列出问题的初始化状态（即下图所示状态），目标状态（猴子拿到了香蕉，站在箱子上，箱子位于位置b）。（附加：从初始状态到目标状态的谓词演算过程。）二、实验平台VC6.0三、实验分析1.定义描述环境状态的谓词。AT(x,w)：x在t处，个体域：xϵ{monkey}，wϵ{a,b,c,box}；HOLD(x,t)：x手中拿着t，个体域：tϵ{box,banana}；EMPTY(x)：x手中是空的；ON(t,y)：t在y处，个体域：yϵ{b,c,ceiling}；CLEAR(y)：y上是空的；BOX(u)：u是箱子，个体域：uϵ{box}；BANANA(v)：v是香蕉，个体域：vϵ{banana}；2.使用谓词、连结词、量词来表示环境状态。问题的初始状态可表示为：So：AT(monkey,a)˄EMPTY(monkey)˄ON(box,c)˄ON(banana,ceiling)˄CLEAR(b)˄BOX(box)˄BANANA(banana)要达到的目标状态为：Sg：AT(monkey,box)˄HOLD(monkey,banana)˄ON(box,b)˄CLEAR(ceiling)˄CLEAR(c)˄BOX(box)˄BANANA(banana)3.从初始状态到目标状态的转化,猴子需要完成一系列操作,定义操作类谓词表示其动作。WALK(m,n)：猴子从m走到n处，个体域：m,nϵ{a,b,c}；CARRY(s,r)：猴子在r处拿到s，个体域：rϵ{c,ceiling}，sϵ{box,banana}；CLIMB(u,b)：猴子在b处爬上u；这3个操作也可分别用条件和动作来表示。条件直接用谓词公式表示，是为完成相应操作所必须具备的条件；当条件中的事实使其均为真时，则可激活操作规则，于是可执行该规则中的动作部分。动作通过前后状态的变化表示，即通过从动作前删除或增加谓词公式来描述动作后的状态。WALK(m,n)：猴子从m走到n处条件：AT(monkey,m)动作：),(),(nmonkeyATmmonkeyAT增加：删除：CARRY(s,r)：猴子在r处拿到s条件：AT(monkey,r)˄EMPTY(monkey)˄ON(s,r)˄BOX(box)˄BANANA(banana)动作：)(),(),()(rCLEARsmonkeyHOLDrsONmonkeyEMPTY增加：删除：CLIMB(u,b)：猴子在b处爬上u条件：AT(monkey,b)˄HOLD(monkey,u)˄CLEAR(b)˄BOX(box)˄BANANA(banana)动作：),()(),()(),(),(cuONmonkeyEMPTYumonkeyATcCLEARumonkeyHOLDbmonkeyAT增加：删除：4.按照行动计划,一步步进行状态替换,直至目标状态。AT(monkey,a)˄EMPTY(monkey)˄ON(box,c)˄ON(banana,ceiling)˄CLEAR(b)˄BOX(box)˄BANANA(banana)ncmacaWALK代换用代换用,),(AT(monkey,c)˄EMPTY(monkey)˄ON(box,c)˄ON(banana,ceiling)˄CLEAR(b)˄BOX(box)˄BANANA(banana)rboxscboxcCARRY代换用代换用,),(AT(monkey,c)˄HOLD(monkey,box)˄ON(banana,ceiling)˄CLEAR(b)˄CLEAR(c)˄BOX(box)˄BANANA(banana)nbmcbcWALK代换用代换用,),(AT(monkey,b)˄HOLD(monkey,box)˄ON(banana,ceiling)˄CLEAR(b)˄CLEAR(c)˄BOX(box)˄BANANA(banana)uboxbboxCLIMB代换用),(AT(monkey,box)˄EMPTY(monkey)˄ON(box,b)˄ON(banana,ceiling)˄CLEAR(c)˄BOX(box)˄BANANA(banana)rceilingsbananaceilingbananaCARRY代换用代换用,),(AT(monkey,box)˄HOLD(monkey,banana)˄ON(box,b)˄CLEAR(ceiling)˄CLEAR(c)˄BOX(box)˄BANANA(banana)（目标得解）猴子行动的规则序列是：WALK(a,c)→CARRY(c,box)→WALK(c,b)→CLIMB(box,b)→CARRY(banana,ceiling)在上述过程中，我们应该注意，当猴子执行某一个操作之前，需要检查当前状态是否可使所要求的条件得到满足，即证明当前状态是否蕴涵操作所要求的状态的过程。在行动过程中，检查条件的满足性后才进行变量的代换。代入新条件后的新状态如果是目标状态，则问题解决；否则看是否满足下面的操作，如果不满足或即使满足却又回到了原来的状态，那么代入无效。四、源代码#includestdio.hstructState{intmonkey;/*-1:MonkeyatA;0:MonkeyatB;1:MonkeyatC;*/intbox;/*-1:boxatA;0:boxatB;1:boxatC;*/intbanana;/*BananaatB,Banana=0*/intmonbox;/*-1:monkeyonthebox;1:monkeythebox;*/};structStateStates[150];char*routesave[150];/*functionmonkeygoto,itmakesthemonkeygototheotherplace*/voidmonkeygoto(intb,inti){inta;a=b;if(a==-1){routesave[i]=MonkeygotoA;States[i+1]=States[i];States[i+1].monkey=-1;}elseif(a==0){routesave[i]=MonkeygotoB;States[i+1]=States[i];States[i+1].monkey=0;}elseif(a==1){routesave[i]=MonkeygotoC;States[i+1]=States[i];States[i+1].monkey=1;}else{printf(parameteriswrong);}}/*endfunctionmonkeyygoto*//*functionmovebox,themonkeymovetheboxtotheotherplace*/voidmovebox(inta,inti){intB;B=a;if(B==-1){routesave[i]=monkeymoveboxtoA;States[i+1]=States[i];States[i+1].monkey=-1;States[i+1].box=-1;}elseif(B==0){routesave[i]=monkeymoveboxtoB;States[i+1]=States[i];States[i+1].monkey=0;States[i+1].box=0;}elseif(B==1){routesave[i]=monkeymoveboxtoC;States[i+1]=States[i];States[i+1].monkey=1;States[i+1].box=1;}else{printf(parameteriswrong);}}/*endfunctionmovebox*//*functionclimbonto,themonkeyclimbontothebox*/voidclimbonto(inti){routesave[i]=Monkeyclimbontothebox;States[i+1]=States[i];States[i+1].monbox=1;}/*functionclimbdown,monkeyclimbdownfromthebox*/voidclimbdown(inti){routesave[i]=Monkeyclimbdownfromthebox;States[i+1]=States[i];States[i+1].monbox=-1;}/*functionreach,ifthemonkey,box,andbananaareatthesameplace,themonkeyreachbanana*/voidreach(inti){routesave[i]=Monkeyreachthebanana;}/*outputthesolutiontotheproblem*/voidshowSolution(inti){intc;printf(%s\n,Resulttoproblem:);for(c=0;ci+1;c++){printf(Step%d:%s\n,c+1,routesave[c]);}printf(\n);}/*performnextstep*/voidnextStep(inti){intc;intj;if(i=150){printf(%s\n,steplengthreached150,haveproblem);return;}for(c=0;ci;c++)/*ifthecurrentstateissametoprevious,retrospect*/{if(States[c].monkey==States[i].monkey&&States[c].box==States[i].box&&States[c].banana==States[i].banana&&States[c].monbox==States[i].monbox){return;}}if(States[i].monbox==1&&States[i].monkey==0&&States[i].banana==0&&States[i].box==0){showSolution(i);printf(Pressanykeytocontinue\n);getchar();/*tosavescreenforuser,pressanykeytocontinue*/return;}j=i+1;if(States[i].monkey==0){if(States[i].box==0){if(States[i].monbox==-1){climbonto(i);reach(i+1);nextStep(j);/*monkeygoto(-1,i);nextStep(j);monkeygoto(0,i);nextStep(j);movebox(-1,i);nextStep(j);movebox(0,i);nextStep(j);*/}else{reach(i+1);nextStep(j);/*climbdown(i);nextStep(j);*/}}elseif(States[i].box==1){/*monkeygoto(-1,i);nextStep(j);*/monkeygoto(1,i);nextStep(j);movebox(0,i);nextStep(j);climbonto(i);reach(i+1);nextStep(j);}else/*box==-1*/{monkeygoto(-1,i);nextStep(j);movebox(0,i);nextStep(j);climbonto(i);rea