Greedy search-artificial intelligence, Basic Computer Science

Assignment Help:

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).

 


Related Discussions:- Greedy search-artificial intelligence

Artificial intelligence-representations/languages used, Many persons are ta...

Many persons are taught AI with the opening line: " The three most important things in AI are representation, representation and representation ". While selecting the method of

Optical disk storage and cd - rom, Optical disk storage and cd - ROM: ...

Optical disk storage and cd - ROM: Optical disk storage is relatively new alternative to magnetic storage. Digital data is burnt into the surface of a plastic disk coated with

Write the steps to use the network setup wizard, Question 1 Elaborate the ...

Question 1 Elaborate the various steps in performing a Mail Merge. Execute one mail merge operation for sending invitation for a conference which is being conducted in your organi

Basic syntax of python language, The Python language has a lot of similarit...

The Python language has a lot of similarities to Perl, C and Java. Though, there are some specific differences between the languages. First Python Program: relative Mode Programmin

What is heuristic evaluation, Question 1: (a) How would you describe h...

Question 1: (a) How would you describe human reasoning? (b) Describe the different types of human reasoning? Question 2: (a) What are the computational factors affec

Components of a digital computer , COMPONENTS OF A DIGITAL COMPUTER: A...

COMPONENTS OF A DIGITAL COMPUTER: A digital computer is an electronic device that receives data, performs arithmetic and logical operations and produces results according to a

Flowchart, i need help with flowcharting a procedure

i need help with flowcharting a procedure

Artificial intelligence-specifying search problems, Specifying Search Probl...

Specifying Search Problems In our agent expressions, a problem to be solved is a specific task where the agent starts with the atmosphere in a given state and acts upon the env

Architecture, explain how modern computers conform to john von nuemann''s a...

explain how modern computers conform to john von nuemann''s architeture?

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