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
Name and explain the classifications of computers

General Considerations for Search If we can specify the first state, the operators and the goal check for a look for difficulty, then we know where to create, how to move and w

Uninformed Search Strategies: To be able to undertake a regular search, our entire agent ought to know is the starting state, the possible operators and how to check whether th

A scaling constant indicates an expansion of length

Question 1 What is meant by typography? Describe the process in which one can choose and use type Question 2 What is investigative reporting? Write a long note Question 3

COMPONENTS OF A COMPUTER: We use a computing system basically to feed in some data that is processed by the computer and some information is generated as a result.. For this w


TELECOMMUNICATION PROTOCOLS: The two major components relating to a WAN are the Protocol and the Media. The media are the actual path ways that the protocol travels on. The ne

how to create 1000 random processes with time scales between 10 to 400 milliseconds