A* search-artificial intelligence, Basic Computer Science

Assignment Help:

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.


Related Discussions:- A* search-artificial intelligence

Database reports, The first report, Report #1, is to be an ordered list of ...

The first report, Report #1, is to be an ordered list of the contents of the database, sorted in ascending order by a major field. Report #1 is to include all of the fields and rec

C programming, input is n positive numbers and reverse it, out put gv the a...

input is n positive numbers and reverse it, out put gv the absolute difference and give the reverse(magic number),using function reverseinteger, and function generate magicnumber

Define Multilevel Queue Scheduling?, • A multilevel queue scheduling algori...

• A multilevel queue scheduling algorithm divides the ready queue in several separate queues, for example • In a multilevel queue scheduling processes are lastingly assigned to one

Describe FCFS Scheduling algorithm ?, FCFS algorithm also known as: • Firs...

FCFS algorithm also known as: • First-In-First-Out (FIFO) • Run-Until-Done • Run-to-Completion • Possibly, First-Come-First-Served algorithm is the easiest scheduling algorithm i

Computer, hitory and genration of computer

hitory and genration of computer

What is the definition of instructiion set?, For a processor to be able ...

For a processor to be able to process an instruction, it requires to be able to determine what the instruction is asking to be carried out. For this to take place, the CPU requires

What is nanp? explain, Question 1 What is NANP? Explain Question 2 ...

Question 1 What is NANP? Explain Question 2 What is E&M signaling? Discuss in brief Question 3 What are the common custom calling features? Question 4 Expl

How to avoid race conditions with critical section?, • The key to preventi...

• The key to preventing problem involving shared storage is get some way to prohibit more than one process from reading and writing the shared data concurrently. That part of the p

The microprocessor, THE MICROPROCESSOR The three fundamental units, whi...

THE MICROPROCESSOR The three fundamental units, which comprise a CPU, have now been discussed in general terms.  So too has a microprocessor, because a microprocessor can be de

How is python Using Blank Lines and Waiting for the User, A line holds onl...

A line holds only whitespace, probably with a comment, is identified as a blank line, and Python completely avoids it. In an interrelated interpreter session, you need to enter an

Write Your Message!

Captcha
Free Assignment Quote

Assured A++ Grade

Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!

All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd