Greedy search - artificial intelligence, Computer Engineering

Greedy Search - artificial intelligence:

If we have a heuristic function for states, defined as above, so we can simply measure each state with respect to this measure and order the agenda items in terms of the score of the state in the item. However, at each stage, the agent determines which state scores lowest and puts agenda items on the top of the agenda that contain operators acting on that state. In this way, the most promising nodes in a search space are expanded before the less capable ones. This is a nature of best first search is usually called specifically as a greedy search.

In some situations, a greedy search can lead to a solution very quickly. In fact, a greedy search can often go down blind alleys that look promising to start with, but we don't lead to a solution ultimately. Often the best states at the start of a search are in fact really quite poor in comparison to those further in the search space. One way is to counteract this blind-alley effect is to turn off the heuristic until a proportion of the search space has been covered, that the truly high scoring states can be identified. One more problem with a greedy search is, which the agent will have to keep a record of which states have been explored in order to avoid repetitions and ultimately end up in a cycle, so that's why a greedy search must keep all the agenda items it has undertaken in its memory. And also, this search strategy is not optimal, is sense cause the optimal solution may have nodes on the path that score badly for the heuristic function, and hence a non-optimal solution will be found before an optimal one.

Posted Date: 1/9/2013 7:25:51 AM | Location : United States







Related Discussions:- Greedy search - artificial intelligence, Assignment Help, Ask Question on Greedy search - artificial intelligence, Get Answer, Expert's Help, Greedy search - artificial intelligence Discussions

Write discussion on Greedy search - artificial intelligence
Your posts are moderated
Related Questions
Question: a) Consider a car having a collision detection mechanism. Write an algorithm (in simple English) to illustrate the collision detection mechanism. b) The same car

Explain LRU Page replacement algorithm. LRU policy: It expands to least recently use. This policy proposes that we remove a page that last usage is farthest from present time

Full Resolution Rule - Artificial intelligence: Now that we know about unification, we can correctly describe the complete edition of resolution: p1  ∨ ...  ∨ pj  ∨ ...  ∨ p

What are Parallel Algorithms? The central assumption of the RAM model does not hold for some newer computers that can implement operations concurrently, i.e., in parallel algor

Question: (a) Software may be categorized into System software and Application software. Differentiate between these two categories, using examples to support your answer.

Optical disk becomes an attractive alternative for backing up information from hard disk drives and employs large text, audio and video data. Advent of CD-ROM-R and DVD-ROM-R has b

The C programming language is a standardized programming language forrned in the early 1970s by Ken Thompson and Dennis Ritchie for use on the UNIX operating system. It has since s

A circuit can be designed to perform manydifferent functions e.g.a circuit has 3 inputs A, B and C and 3 outputs:Output X is logic level 1 (or 'high') if one or moreinputs are at l


Determine the benefits of developing prototype According to SOMM [96] benefits of developing prototype are as following:  1.  Communication gap between clients and software