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
Magnetic Memory:  In the above section we have seen various types of semiconductor RAMs. These high speed semiconductor storage devices (i.e. RAMs) are expensive. So we need s

A magazine publisher based in Nairobi has branch in Kisumu, and one in Mombasa. The company has kept in touch by telephone and courier service. Each office is networked. The networ

Input a list of positive numbers, terminated by 0, into an array numbers []. Then display the array and the largest and smallest number in it.

The operating system is the layer among the hardware and the programs you run. It provides programs a standard interface to the hardware; or else every program would need to includ

THE FIRST GENERATION (1949-1955) The computers in this generation have the following characteristics:     Physically large in size     Inflexible in operations

The CPU has four internal registers, each of 16 bits. The first four, AX, BX, CX, and DX are common use registers and can also be used as 8 bit registers, if used in such a way it

QUESTION (a) Give the representation of a queue as an abstract data type. (b) What is a priority queue? Give two types of priority queues. (c) The following program does

• A multilevel queue scheduling algorithm divides the ready queue in several separate queues, for example • In a multilevel queue scheduling processes are lastingly assigned to one

Applications Software: General aspects on applications software. Applications software is the program that allow the user to get the required work done. In other words, applic

create a simple Visual Basic project