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

Fully describe the assessment centre method of selection, Problem: One ...

Problem: One large employer requests CVs from applicants, and, on the basis of these, invites a selected number to take part in a telephone interview. A date and time are provi

Write down dijkstra''s algorithm, QUESTION (a) Write down the Update ...

QUESTION (a) Write down the Update Step in the Dijkstra's algorithm explaining its complexity. (b) Propose a Generic Algorithm for Depth-First Search Algorithm, assuming

Vector processing, what are the chrateristics of vector processing

what are the chrateristics of vector processing

Bus structure, which computer architecture use single bus structure??????? ...

which computer architecture use single bus structure??????? tells the name and little bit working

Wireless networks, Stable wireless networks and mobile devices online tutor...

Stable wireless networks and mobile devices online tutoring In Bluetooth it is a basically a proprietary open super wireless technology standard for exchanging data over the sh

Software Exploration, I need to review 2 different softwares one is windows...

I need to review 2 different softwares one is windows based and the other is Linux Based. Please Ask for further details

Opcode and operands, Opcode and operands: Let us further assume that o...

Opcode and operands: Let us further assume that our computer can process only two-digit decimal numbers, i.e. there can be a maximum of two operands each of a maximum of two d

Excel, Your next step is to analyze "proposed" technical requirements/specs...

Your next step is to analyze "proposed" technical requirements/specs based on the business requirements (new performance needs) for Big Bucks. 1.Create a "CRUD" Matrix in an Exce

Statistics, Scores from a statistics exam are reported as deviation scores....

Scores from a statistics exam are reported as deviation scores. Which of the following deviation scores indicates a higher position in the class distribution?

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