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
Writing Assignment 1: Your boss wants to know about the risks of corporate blogging and recommended policies to prevent companies from liability. Write a properly informal for

QUESTION (a) What is an abstract data type? (b) Give two limitations of the array implementation of lists. (c) Give the major disadvantage of the dynamic implementation o

Ask question describes deadlock avoidance#Minimum 100 words accepted#

Configuration of a PC: Generally, when you think of purchasing a Computer, you first try to exactly know what will be the hardware components such as processor, memory etc. of

Online Searching: The real difference between manual searching and online searching lies, according to William A. Katz, in the mechanics and the jargon of the latter. However,

They are used to reduce or enlarge the content of the counters. DEC INC DEC INSTRUCTION Idea: To diminish the operator. Syntax: DEC destiny This action subtracts 1 from the destiny

Question 1 What are the five subscriber-related signaling functions performed by the operator? Question 2 Compare Microprogrammed control and Hard-wired control Que

classify computer system according to capacity. how they are different from computer according to the classification of technology.provide the comparative study also.

what is the difference between internet and world wide web?

Because it is enormously low level, assembly language can be optimized enormously well. Therefore assembly language is used where the extreme performance is needed for applications