Optimality - heuristic search strategies, Computer Engineering

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).

Posted Date: 1/9/2013 7:24:29 AM | Location : United States







Related Discussions:- Optimality - heuristic search strategies, Assignment Help, Ask Question on Optimality - heuristic search strategies, Get Answer, Expert's Help, Optimality - heuristic search strategies Discussions

Write discussion on Optimality - heuristic search strategies
Your posts are moderated
Related Questions
What are the Rules of Timescale directive Rules -  'Timescale directive, like all compiler directives, affects all modules compiled after directive,  whether  in  same  fi

Give the format of Ethernet frame and explain the semantics of each field. An Ethernet frame starts with headers which have three fields. The 64-bit preamble, which precedes th

Which of following requires refreshing SRAM., DRAM., ROM. or EPROM. ? Ans. DRAM. requires refreshing.

Prove the equations A + A‾ .B + A.B‾ = A + B using the Boolean algebraic theorems ? Ans. The equation is A + A‾.B + A.B‾ = A + B L.H.S. = A + A‾ .B + A.B‾ = (A + A.B‾) + A‾.B

Q. Explain High performance of Instruction execution? High performance of Instruction execution: While mapping of HLL to machine instruction the compiler favours relatively sim

Q. How can you insert text in dreamweaver? In Dreamweaver, you can type content directly into a layout cell, or you can cut and paste content from another document into a layou

An expert systems is software that contains a knowledge base of facts and relationships and has the ability to make inferences based on that knowledge base. An experts sys

Learning Abilities of Perceptrons - Artificial intelligence Computational learning theory is the study of what concepts specific learning schemes (representation and method) ca

Explain the Modularity of Object oriented analysis Modularity is closely attached to encapsulation; you may think of it as a way of mapping encapsulated abstractions into phys

Explain difference between Problem-oriented and procedure-oriented language. Problem-oriented and procedure-oriented language: The programming languages which can be utilized