A* search-artificial intelligence, Basic Computer Science

A* Search-Artificial intelligence:

 

A* search combines the best parts of uniform cost search that  called the fact that it's optimal and complete, and the best parts of greedy search that called its speed. This search method simply combines the path cost function g(n) and the heuristic function h(n) by summing them to form a new heuristic measure f(n):

f(n) = h(n) + g(n)

Remembering that g(n) gives the path cost from the began  state to state n and h(n) estimates the path cost from n to a goal state, we see that f(n) estimates the cost of the cheapest solution which passes through n.

The most essential aspect of A* search is that, given one limitation on h(n), it is possible to prove that the search strategy is complete and optimal. The limitation to h(n) is that it might always underestimate the cost to achieve a goal state from n. Such heuristic measures are called admissible. See Norvig and Russell for verification that A* search with an admissible heuristic is complete and optimal.

Posted Date: 10/2/2012 2:43:11 AM | Location : United States







Related Discussions:- A* search-artificial intelligence, Assignment Help, Ask Question on A* search-artificial intelligence, Get Answer, Expert's Help, A* search-artificial intelligence Discussions

Write discussion on A* search-artificial intelligence
Your posts are moderated
Related Questions
Classify computer systems according to capacity. How they are different from computers according to the classification of technology. Provide comparative study also.

Using Weka 3.6 (basketball or cloud data set). Using the EM clustering method, how many clusters did the algorithm decide to make? If we change from "Use Training Set" to "Percenta

ATM = Asynchronous Transfer Mode Fast packet switching and multiplexing technology (cell-based ) Support the universe of services voice, video and data traffic Provides quality of

Can someone help me write a code for force = mass * acceleration.

You recently returned some homework I completed but i left of the final 10 questions. Should not take long just needs some commands interpreted. How much will it cost for me to get

The basic parts of a computers are shown in Figure.   Input devices such as a keyboard, mouse or scanner are used to enter input (data and/or instructions), directly

Question 1 Explain the operations of ALU Question 2 Write down the Booth's Multiplication Algorithm with an example Question 3 Explain the characteristics of memor

Priority Scheduling • The fundamental idea is straightforward: each process is assigned a priority, and priority is permitted to run. Equal-Priority processes are scheduled in FCF

whats the out put of int main(){ int n=310; funcone(n); functwo(&n); cout return 0; } void funcone(intn) n=240; } void func two(intn*) { n=120; }

ANALOGUE COMPUTERS A computer is basically a problem-solving device. In aircraft radio systems the problem to be solved is concerned with navigation, in that given certain inf