A* search - artificial intelligence, Computer Engineering

Assignment Help:

A* Search - artificial intelligence:

A* search in the combines is the best parts of uniform cost search, namely the fact that it's optimal and complete, and the other best parts of greedy search, namely its speed. This kind of searching strategy 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) = g(n) + h(n) 

Remembering that g(n) gives the path cost from the start 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 that passes through n. 

The most important aspect of A* search is that, given only one restriction on h(n), it is possible to prove the search strategy there which is complete and optimal. The restriction to h(n) is that it must all the time underestimate the cost to reach a goal state from n. Such heuristic measures are called admissible. Look at Russell and Norvig for proof that A* search with an admissible heuristic is complete and optimal.


Related Discussions:- A* search - artificial intelligence

Domains of artificial intelligence, The major domains of AI research and...

The major domains of AI research and development. AI applications can be grouped under three major areas cognitive science robotics and natural interfaces though these class

CPE, WHAT IS CPE

WHAT IS CPE

Poor technology or system requirements definition, Poor Technology or Syste...

Poor Technology or System Requirements Definition - Information System Previously we looked at product design and specifically the importance of requirements capture as part o

What is dynamic random access memory, What is dynamic random access memory ...

What is dynamic random access memory Computer memory today comprises mainly of dynamic random access memory (DRAM) chips which have been built into multi-chip modules that are

Describe in brief the history of e-commerce, Describe in brief the history ...

Describe in brief the history of E-Commerce.  History of E-commerce. E-commerce started before personal computers were prevalent and has grown into a multi-billion d

Multiprogramming or multitasking, Multiprogramming or multitasking? An...

Multiprogramming or multitasking? Ans: The OS manages the concurrent execution of many application programs to make best possible use of computer resources. This pattern of si

Measuring and improving cache performance, Measuring and Improving Cache Pe...

Measuring and Improving Cache Performance: 1. Reduce the possibility that 2 different memory block will contend for the similar cache location 2. Additional cache levels

Explain the working of a binary counter, In binary counter the flip flop of...

In binary counter the flip flop of lowest order position is complemented with each pulse. This means that JK input position must be maintained with logic one

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