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

Real-time systems, This document is intended to help students get started w...

This document is intended to help students get started with the real-time systems (RTS) assignment. We will start on the assignment together in the laboratory. Students will then c

What is delayed branching, What is delayed branching? A method called d...

What is delayed branching? A method called delayed branching can minimize the penalty incurred as a result of conditional branch instructions. The idea is easy. The instruction

Define emulation, Define emulation. Given a computer with a particular ...

Define emulation. Given a computer with a particular instruction set, it is possible to explain additional machine instructions and execute them with extra micro routines. Emul

Why is segmented paging important, Why is segmented paging important (as co...

Why is segmented paging important (as compared to a paging system)? Paging can be super-imposed upon a segment oriented addressing mechanism to acquire efficient use of the mem

What is internet routing hierarchy, Q. What is Internet Routing Hierarchy? ...

Q. What is Internet Routing Hierarchy? So how do packets find their way across Internet? Does every computer connected to Internet know where other computers are? Do packets ba

What is race around condition, What is race around condition? Ans: ...

What is race around condition? Ans: Race Around Condition:- Jn Kn Q(n+1) output   0 1 0 1   0 0

Discuss program testing and debugging in detail, Discuss program testing an...

Discuss program testing and debugging in detail. In program debugging and testing significant steps are as follows: a. For the program, construction of test data b. Analy

Explain direct broadcast & limited broadcast, Explain Direct broadcast & li...

Explain Direct broadcast & limited broadcast. Broadcast is a method to send a packet to all the stat ions on an exact network at once. Broadcast systems permit the possibility

For which class address 192.5.48.3 belogs, Address 192.5.48.3 belongs to? ...

Address 192.5.48.3 belongs to? Address 192.5.48.3 belongs to class C.

Distributivity of connectives, Distributivity of Connectives : In our ...

Distributivity of Connectives : In our last analogy with arithmetic will involve a very well-technique need for playing around with algebraic properties. But assume there if w

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