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

Explain public key encryption, Public Key Encryption A cryptographic sy...

Public Key Encryption A cryptographic system that uses two-keys-a public  key known to everyone and a private or secret key known only to the recipient of the message. An si

Is the data bus is bi-directional, The data bus is Bi-directional because t...

The data bus is Bi-directional because the similar bus is used for transfer of data among Micro Processor and memory or input / output devices in both the direction.

Explain the concept of generalization, Explain the concept of Generalizatio...

Explain the concept of Generalization Generalization and inheritance are powerful abstractions for sharing the structure and/or behaviour of more than one class.  Generalizati

Design a 32:1 multiplexer, Design a 32:1 multiplexer using two 16:1 multipl...

Design a 32:1 multiplexer using two 16:1 multiplexers and a 2:1 multiplexer Ans. Design a 32 X 1 MUX by using two 16 X 1 MUX and one 2 X 1. Now here total 32 input lines

Explain automated and manual systems, Q. Explain Automated and Manual syste...

Q. Explain Automated and Manual systems? Automated and Manual systems: The system that doesn't need human intervention is known as'Automated system'. In this system whole proce

Users to run programs at same time, A computer system that allows multiple ...

A computer system that allows multiple users to run programs at similar time   Multi tasking system

Explain the life cycle of a process, Explain the life cycle of a process ...

Explain the life cycle of a process Each procedure has a life cycle, which consists of execution, creation and termination phases of the procedure.  A method may create severa

What is called network, Network with point-to-point link is known as (...

Network with point-to-point link is known as (A) Fully Connected Network        (B)  Half Connected Network (C)  Duplex Connected Network    (D)  None of these Ans:

Two ways of producing a list within a transaction, What are the two ways of...

What are the two ways of producing a list within a transaction? By submitting a separate report. By using leave to list-processing.

How a typical dma controller can be interfaced to an 8086, Demonstrate how ...

Demonstrate how a typical DMA controller can be interfaced to an 8086/8085 based maximum mode system.  For 8088 in maximum mode: The RQ/GT0 and RQ/GT1 pins are used to is

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