Greedy search - artificial intelligence, Computer Engineering

Greedy Search - artificial intelligence:

If we have a heuristic function for states, defined as above, so we can simply measure each state with respect to this measure and order the agenda items in terms of the score of the state in the item. However, at each stage, the agent determines which state scores lowest and puts agenda items on the top of the agenda that contain operators acting on that state. In this way, the most promising nodes in a search space are expanded before the less capable ones. This is a nature of best first search is usually called specifically as a greedy search.

In some situations, a greedy search can lead to a solution very quickly. In fact, a greedy search can often go down blind alleys that look promising to start with, but we don't lead to a solution ultimately. Often the best states at the start of a search are in fact really quite poor in comparison to those further in the search space. One way is to counteract this blind-alley effect is to turn off the heuristic until a proportion of the search space has been covered, that the truly high scoring states can be identified. One more problem with a greedy search is, which 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 that's why a greedy search must keep all the agenda items it has undertaken in its memory. And also, this search strategy is not optimal, is sense cause the optimal solution may have nodes on the path that score badly for the heuristic function, and hence a non-optimal solution will be found before an optimal one.

Posted Date: 1/9/2013 7:25:51 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
Discuss the main tags of WML. Tag Definition of Wireless Markup Language: This defines the starting and the ending of the page, as .   this explains

If  the input to T-flipflop is 100 Hz signal, the final output of the three T-flipflops in cascade is ? Ans. The  final  output  of  the  three  T-flip-flops in cascade is 12

Q. How to insert script in dreamweaver? Step 1: Click on Insert Step 2: Click on Script Step 3: Choose the type of Script Step 4: Write the code in "Content" Step 5: T

Explain about Annotational Notations These notations may be applied to describe remark and illuminate about any element in the model. They are considered as explanatory of U

Explain the significance IPV6 over IPV4. The maximum size of an Ipv6 datagram is 65575 bytes, with the 0 bytes Ipv6 header. Ipv6 also describe a minimum reassembly buffer size:

Classic form of OLAP is called as MOLAP and it is often known as OLAP. Simple database structures like time period, product, location, etc are used. Functioning of each and every d

assignment on transaction flow, transform flow, transform mapping: refining the architectural design

How can I read .doc document in ASP.Net? You can read from a text file like this.   Private void Button12_Click(object sender, System.EventArgs e) { string path="C:

What is Circular shift The circular shift is also called as rotate operation. It circulates bits of the register around two ends and there is no loss of information. This is do

Explain why pervasive computing can be termed as a “technology that disappears”