Greedy search - artificial intelligence, Computer Engineering

Assignment Help:

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.


Related Discussions:- Greedy search - artificial intelligence

What is middleware net dynamics, NetDynamics Application Server was the pri...

NetDynamics Application Server was the primary Java-based integrated software platform. The product was developed by NetDynamics Inc. As Java became the dominant development langua

Explain time switching, Explain Time Switching. Time Switches: The ...

Explain Time Switching. Time Switches: The principle of a time switch is demonstrated in figure. This connects an incoming n channel PCM highway to an outgoing n channel PC

Which method uses the greatest number of layers in OSI model, Which method ...

Which method uses the greatest number of layers in the OSI model? Gateway utilizes the greatest number of layers into the OSI model.

What is a linked list, What is a linked list? Linked list: A linked l...

What is a linked list? Linked list: A linked list is a self referential structure which having a member field that point to the similar structure type. In simple term, a link

Propositional inference rules, Propositional Inference Rules: Proposit...

Propositional Inference Rules: Propositional Inference Rules Equivalence rules are mostly useful because of the vice-versa aspect, that means like we can search backwards and

Binary tree can be converted in to its mirror image, A binary tree can be c...

A binary tree can be converted in to its mirror image By traversing it in Preorder

List out the features of computer memory, List Out the Features of Computer...

List Out the Features of Computer Memory? Features of each type of memory   Type Volatile? Write able? Erase Size

Computer graphics, what is boundary filling explain with example

what is boundary filling explain with example

Difference between finite automata and turing machine, What are the differe...

What are the difference between finite automata and Turing Machines?  Turing machine can alter symbols on its tape, while the FA cannot change symbols on tape.  Also  TM  has  a

Write Your Message!

Captcha
Free Assignment Quote

Assured A++ Grade

Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!

All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd