tag:blogger.com,1999:blog-4218275538521081276.post5200323804278173820..comments2017-08-16T02:11:55.397-07:00Comments on Artificial Intelligence: Problem Reduction with AO* Algorithm.Gurram. Veera Raghavavaiahhttp://www.blogger.com/profile/14800879524724371507noreply@blogger.comBlogger15125tag:blogger.com,1999:blog-4218275538521081276.post-79078861192070646692015-12-03T01:54:52.738-08:002015-12-03T01:54:52.738-08:00thanku sirthanku sirAnurag Sainihttps://www.blogger.com/profile/12642680502823415612noreply@blogger.comtag:blogger.com,1999:blog-4218275538521081276.post-90367671830934060302015-03-29T14:03:41.810-07:002015-03-29T14:03:41.810-07:00very good article but here i am having a confusion...very good article but here i am having a confusion in AO* algorithm's 2nd step you said<br />"(b) if successor is not a terminal node, mark it solved and assign zero to its h ' value.<br /> (c) If successor is not a terminal node, compute it h' value."<br />isn't it wrong? how can you propose two different solutions for a same non terminal node? <br />Any Guidance you can give me will be greatly appreciated.<br />Thank You,Aqeel Ahmadhttps://www.blogger.com/profile/18413980681671270706noreply@blogger.comtag:blogger.com,1999:blog-4218275538521081276.post-48145917400928947552014-05-22T23:29:37.307-07:002014-05-22T23:29:37.307-07:00how to solve 8- puzzle problem using BFS, DFS, HIL...how to solve 8- puzzle problem using BFS, DFS, HILL CLIMBING, BEST FIRST SEARCH.<br /><br />please ive me the answer for that...i as waiting....Lubna Khanhttps://www.blogger.com/profile/03597625251081323428noreply@blogger.comtag:blogger.com,1999:blog-4218275538521081276.post-28249417828468964632014-03-18T00:04:04.312-07:002014-03-18T00:04:04.312-07:00A* Algorithm follows OR arcs., Bur AO* Algorithm f...A* Algorithm follows OR arcs., Bur AO* Algorithm follows both OR arcs and AND arcs., to select best node for generating new succor nodes in AO* Algorithm not only consider whether that is having less Heuristic Function value also calculate path value if that node is located in AND arc by propagating backword and add 1 unir cost to current f value i.w is shown above diagrams.,<br />then U can follow the above AO* search procedure. nothing difficult.Gurram. Veera Raghavavaiahhttps://www.blogger.com/profile/14800879524724371507noreply@blogger.comtag:blogger.com,1999:blog-4218275538521081276.post-21113742450091602012014-02-25T23:56:31.618-08:002014-02-25T23:56:31.618-08:00sir...its vry difficult to study AI, so pls suggst...sir...its vry difficult to study AI, so pls suggst some tips to study and giv one gud exmple for AO* algorthmmasna mehaboobhttps://www.blogger.com/profile/07019483550469589113noreply@blogger.comtag:blogger.com,1999:blog-4218275538521081276.post-45048492921241285262012-11-28T05:04:33.846-08:002012-11-28T05:04:33.846-08:00sir thank u so muchsir thank u so muchsims goyathttps://www.blogger.com/profile/08437336886814194830noreply@blogger.comtag:blogger.com,1999:blog-4218275538521081276.post-88526010092922456752012-09-26T21:33:52.675-07:002012-09-26T21:33:52.675-07:00A* Alg: Selects Best node on OPEN list with less H...A* Alg: Selects Best node on OPEN list with less Heuristic function. It contains only OR arcs., ie no need of dependencies in ancestors.<br />It contains both features of DFS and BFS.<br /><br />AO*: Selects the Best node for generating new succors with less Heuristic value also part of Tp, if it is in AND arc.<br />It follows both AND and OR Arcs., Dependencies are considered in AND arcs.<br />IT follows Reason Backward search by adding Unit costs to calculate the Tp values of the node if it represents AND arc. Gurram. Veera Raghavavaiahhttps://www.blogger.com/profile/14800879524724371507noreply@blogger.comtag:blogger.com,1999:blog-4218275538521081276.post-32552916291838175332012-09-26T00:36:41.166-07:002012-09-26T00:36:41.166-07:00How is A* algorithm different from AO* ? Out of th...How is A* algorithm different from AO* ? Out of the two which one is better and why?<br /><br />Please give me a reply...Anupa T Jhttps://www.blogger.com/profile/16836099034534621863noreply@blogger.comtag:blogger.com,1999:blog-4218275538521081276.post-16200276585199502432012-05-16T10:50:41.931-07:002012-05-16T10:50:41.931-07:00sir,your notes have been of great use.thanks to ur...sir,your notes have been of great use.thanks to ur simplicity..kuldeep Prajapatihttps://www.blogger.com/profile/17830219203671527411noreply@blogger.comtag:blogger.com,1999:blog-4218275538521081276.post-65208657850386379702012-05-03T14:10:33.173-07:002012-05-03T14:10:33.173-07:00awesm notes than u so muchawesm notes than u so muchronniehttps://www.blogger.com/profile/07616015831030494685noreply@blogger.comtag:blogger.com,1999:blog-4218275538521081276.post-78951606081481324952012-04-15T05:03:55.187-07:002012-04-15T05:03:55.187-07:00awewome note ......
nabnit mca bhuawewome note ...... <br /><br />nabnit mca bhu023Nabnithttps://www.blogger.com/profile/12173930885378834899noreply@blogger.comtag:blogger.com,1999:blog-4218275538521081276.post-37276927908451311912012-04-04T06:07:40.464-07:002012-04-04T06:07:40.464-07:00Sir your notes makes AI easy to understand and lea...Sir your notes makes AI easy to understand and learn .....Narayan Garghttps://www.blogger.com/profile/12198749560887548336noreply@blogger.comtag:blogger.com,1999:blog-4218275538521081276.post-20594446625158704032012-04-02T21:23:17.562-07:002012-04-02T21:23:17.562-07:00Good sir I have AI university exam tomorrow,your a...Good sir I have AI university exam tomorrow,your article helped me in a <br />good way. Thanks !!<br />-SREEKANTH-SREEhttps://www.blogger.com/profile/00912446943188887593noreply@blogger.comtag:blogger.com,1999:blog-4218275538521081276.post-79062892434339188102012-03-12T10:13:35.627-07:002012-03-12T10:13:35.627-07:00Sir you have wonderful articles on AI , would have...Sir you have wonderful articles on AI , would have enjoyed AI much under your guidance .<br /><br />Surya<br />Delhi<br />B.tech 6th semSurya Mani( SURAJ )https://www.blogger.com/profile/05380586045204467492noreply@blogger.comtag:blogger.com,1999:blog-4218275538521081276.post-47059834993709677522011-09-12T22:59:53.448-07:002011-09-12T22:59:53.448-07:00awsome notes...........awsome notes...........PRAGYA FORUMhttps://www.blogger.com/profile/04436414425845763395noreply@blogger.com