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
1. (40 points) Add a course drop method to the system that you implemented in Problem Set 1. Modularize your new implementation properly. For any new methods that you introduce: 1.

Completeness in search - artificial intelligence: It's also importance trying to calculate the number of solutions to a problem, and the density of those solutions amongst the

Multi-valued Attribute DBMS Each multi valued attribute maps into a separate table. Include also an attribute for the primary key of the entity and relationship type which the attr


AsBased on Chapter Review Problems from the book. 1 #1. What is meant by data independence? Explain your answer. #2. Identify two benefits of separating application software fr

Source and Object Programs A set of instructions in a high-level language are called “Source program”. Since high-level languages are machine independent, it is required to fir

Manipulate the following Boolean expression in such a way so that it can be implemented using exclusive-OR and AND gates only. AB''CD'' + A ''BCD'' + AB''C''D + A''BC''D

Artificial Intelligence Agents In the earlier teach, we discussed what we will be talking about in Artificial Intelligence and why those tasks are important. This lecture is all

Shell Scriptiong