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

Login, Login Because the information on a network is sharable, network...

Login Because the information on a network is sharable, networks are very susceptible to unauthorized intruders. In order to prevent unauthorized access to use the services o

Cryptography, Question 1 Consider the one-time pad encryption scheme to en...

Question 1 Consider the one-time pad encryption scheme to encrypt a 1-bit message m, and assume m is chosen with uniform distribution from message space M={0,1}. Let E1 be the eve

Soft computing, Defination of Propositionl logic Predicate logic genertic a...

Defination of Propositionl logic Predicate logic genertic algorithm Hybrid system Optimization Fuzzy system rules Fuzzy system application

Definition of algorithm , Definition of  Algorithm  An algorithm is a ...

Definition of  Algorithm  An algorithm is a design or plan of obtaining a solution to a problem. The solution is presented by listing all steps in which they are carried out.

Data transmission, Data transmission: Most digital communication data i...

Data transmission: Most digital communication data is transmitted in a serial form, that is, only one bit at a time. Transmission of data in serial form means each bit is tran

Define grid computing, Question 1 Define Grid computing Question 2 ...

Question 1 Define Grid computing Question 2 Explain Attribute-Based Programming Model for Grid Services Question 3 What are the characteristics that users/applicat

Pyhon''s Multi-Line Statements , Statements in Python classically end with ...

Statements in Python classically end with a new line. Python does, though, permit the use of the line continuation character (\) to denote that the line should continue. Illustrati

Program and programming language, Program and Programming Language : ...

Program and Programming Language : A Program is defined as a collection of statements/ instructions that enable the computer to solve a problem. The process of writing a prog

Define Multilevel Queue Scheduling?, • A multilevel queue scheduling algori...

• A multilevel queue scheduling algorithm divides the ready queue in several separate queues, for example • In a multilevel queue scheduling processes are lastingly assigned to one

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