Optimality - heuristic search strategies, Computer Engineering

Assignment Help:

Optimality - Heuristic search strategies:

The path cost of a solution is considered as the sum of the costs of the actions that led to which solution is given. This is only one example of a measure of value on the solution of a search problem, and there are so many others. These measures may or may not be just related to the heuristic functions that estimate the likelihood of a particular state being in the path to a solution. We can say that - given a measure of value on the possible solutions to a search problem - one particular solution is optimal if it scores higher other than the all with respect to this measure (or costs less, in the case of path cost). Like if we look at example, in the maze example given in section 3.2, there are many paths from the start to the finish of the maze, but there is only one which crosses the fewest squares. This is the only optimal solution in terms of the distance travelled. 

Optimality can be guaranteed through a particular choice of search strategy just like instance the uniform path cost search described below. Otherwise an agent can be chosen to prove that a solution is optimal by appealing to some mathematical argument. As in a last resort w got that, if optimality is necessary, then an agent must exhaust a complete search strategy to find all solutions, then it would be possible to choose the one  scoring the highest (alternatively costing the lowest).


Related Discussions:- Optimality - heuristic search strategies

Stack overflow causes, Stack overflow causes   (A) Hardware interrupt. ...

Stack overflow causes   (A) Hardware interrupt.  (B) External interrupt.  (C) Internal interrupt.   (D) Software interrupt. Stack overflow occurs whereas execution

What is the accessibility testing, Accessibility testing for web sites is a...

Accessibility testing for web sites is a service that can give much more than the standard point-by-point testing methods of most automated services.

Digital electronics, design a ciruit which can work as a 4-bit binary adder...

design a ciruit which can work as a 4-bit binary adder as well as subtractor

Example of blocking probability for the three stage network, A three stage ...

A three stage network is realized by using switching matrices of size p x s in stage 1, r x r matrices in stage 2 and s x p matrices in stage 3. Using the Lee's probability graph s

Implement the concept of true and radix minus one complement, Q. Develop a...

Q. Develop a program to implement the concept of true and radix minus one complement. Program should ask for radix and two numbers from that radix. For that two numbers program

What is deadlock in operating system, Explain Deadlock in operating system ...

Explain Deadlock in operating system ? Deadlock: all process in a set of processes is waiting for an event which only a process in the set can cause.

Define memory access time, Define memory access time? The time needed t...

Define memory access time? The time needed to access one word is known as the memory access time. Or It is the time that elapses among the initiation of an operation and the co

With what symbolic names can be associated, Symbolic names can be associate...

Symbolic names can be associated with? Ans. With data or instruction symbolic names associated.

Use verilog function to define the width of a multi-bit port, Can I use a V...

Can I use a Verilog function to define the width of a multi-bit port, wire, or reg type? Width  elements  of  ports,  wire  or  reg  declarations  require  a  constant  in  bot

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