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 event key words in interactive reporting? Event Keyword                                                 Event AT LINE-SELECTION         Moment at which the u

Q. What is Read-only-Memory? Read only memory is an illustration of a Programmable Logic Device (PLD) it implies that binary information which is stored within a PLD is specifi

Firewalls operate by Creening packets to/from the Network and give controllable filtering of network traffic.

Describe the three mapping techniques used in cache memories with suitable Example. The cache memory is a fast memory that is inserted among the larger slower main memory and t

What are interrupts?  Interrupt: An interrupt is a hardware mechanism which enables an external device, classically input/output devices, to send a signal to the CPU. An int

Security Analysis: Suppose you are a young securities analyst, working in a small brokerage firm. You have access to publicly available information relevant to valuation of th

Bus arbitration: In single bus architecture when more than 1 device requests the bus, a controller known as bus arbiter decides who gets the bus; this is known as the bus arbi

Decision Tree Learning: Furthermore there is specified in the last lecture such as the representation scheme we choose to represent our learned solutions and the way that we l

Q. Explain about CD-ROM and DVD-ROM? Optical disks employ Laser Disk Technology that is the latest and most promising technology for high capacity secondary storage. Advent of

With LDB one can change the pre-generated selection screen to their needs Yes with LDB one can alter the pre-generated selection screen.