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

Electronic transmission frequency, Electronic  transmission Frequency: ...

Electronic  transmission Frequency: Frequency is the rate at which a wave or cycle alternates between high and low (analog mode) or on and off (digital mode). For example, the

Reasons for recommendation free and open source software, For multi-nationa...

For multi-national business IT system, free and open source software (FOSS) is recommended over a proprietary system. The reasons for this recommendation are: 1. Security I

Development of UNIX , Development of UNIX: The original UNIX developme...

Development of UNIX: The original UNIX development was performed on a Digital PDP-7 minicomputer and later moved to a PDP-11 minicomputer, the forerunner of the VAX computer.

Represent the user interface, Question: CarRide.com is the web portal t...

Question: CarRide.com is the web portal to CarRide Ltd; a car rental company that makes full use of technological advances to make sure you enjoy the ride with your rental car.

Indexing a page on internet, Indexing a page on internet: Once, the sp...

Indexing a page on internet: Once, the spiders have completed the task of finding information about Web pages, the search engine must store the information in such way that yo

Write a note on modems, Question 1 Write a note on modems Question ...

Question 1 Write a note on modems Question 2 What are the Safe Chatting Rules Question 3 Explain three basic kinds of hypertext links Question 4 Write a no

Pipelining concept, The easiest way to approach pipelining is to regard as...

The easiest way to approach pipelining is to regard as the three stage fetch, decode and execute instruction execution cycle outlined earlier. There are times during each of these

Define Shortest-Job-First (SJF) Scheduling ?, • It is also known as Shortes...

• It is also known as Shortest-Process-Next (SPN). • Shortest-Job-First (SJF) is a non-preemptive order in which waiting job (or process) with the smallest predictable run-time-to-

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