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
Using Web resource monitors we can search the performance of web servers. Using these monitors we can examine throughput on the web server, number of hits per second that happened

Summary of Tasks The Task Summary tries to shows the amount of duration each task has spent starting from initialization of the task till its completion on any processor as d

Differentiate between protection and security. Operating system contains a collection of objects, software or hardware. All objects have a unique name and can be accessed by

What are superscalar processors? Several instructions start implementation in the same clock cycle, and the processor is said to use multiple issue. Such processors are capable

File Menu: Under it there are New, Save, Save as, Save as template, Import, Export, Preview in browser etc. options. Edit Menu: In this menu there are Cut, Copy, Paste, Undo,

Convenience of Environments -artificial intelligence: In some cases, some aspects of an environment which should be taken into account in decisions about actions may be unavai

Predicates - first-order logic: First and foremost in first-order logic sentences, because predicates. Hence the indications of that some things are related in some way. So af

Q. Fundamental issues of concerns for instruction set design? A number of fundamental issues of concerns for instruction set design are: Completeness: For an early design

Q. Total number of registers in a CPU? Factors to consider when choosing total number of registers in a CPU are:  CPU can access registers faster than it can access m

Elements are given 3,14,7,1,8,5,11,17,,6,23,12,20,26,4,16,18,24,25,19 We will construct b tree and avl tree And after that delete some integers