Greedy search-artificial intelligence, Basic Computer Science

Greedy Search-artificial intelligence:

If we have a heuristic function for states, as defined above, then we may simply measure each state with respect to this measure and order the plan items in terms of the score of the state in the item. So, at every stage, the agent determines which state scores lowest and puts agenda items on the top of the plan which contain operators acting on that state. Like this, the most promising nodes in a search space are expanded before the less promising ones. This is a type of best first search known particularly as a greedy search.

In some situations, a greedy search may lead to a solution very rapidly However, a greedy search can frequently go down blind alleys that look promising to start with, but ultimately don't lead to a solution. Often the best states at the beginning of a search are actually really quite poor in comparison to those further in the search space. One way to counteract this blind-alley effect is to turn off the heuristic until a amount of the search space has been enclosed, so that the truly high scoring states can be identified. Another problem with a greedy search is that 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 greedy search might keep all the agenda items it has undertaken in its memory. Also, this search method is not optimal, because the optimal solution can have nodes on the path which score faultily for the heuristic function, and thus a non-optimal solution will be found before an optimal one. (Remember that the heuristic function only estimates the path cost from a node to a solution).

 

Posted Date: 10/2/2012 2:41:15 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
write algorithm and draw flowchart to check whether the given number is palindrome or not



#to determine whether given year is leap year or not

write and run the following programs using 8086 assembly language that interchange the upper and lower four bits of AL register.


Estimate the mean deflection of the QRS complex in each of the six standard leads (I, II, III, aVR, aVL, aVF) in Figure 1 and then estimate the mean heart vector for the normal hea

QUESTION Developers spend much more time extending and changing code than they did originally while developing it. (a) As a team leader, illustrate how you will introduce to

ATM = Asynchronous Transfer Mode Fast packet switching and multiplexing technology (cell-based ) Support the universe of services voice, video and data traffic Provides quality of

#formular for calculating speed up factor fo super scalar architecture, super pipeline architecture and VLIW with m different functional units.