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

Determine the computer arithmetic operations, Computer Arithmetic Data ...

Computer Arithmetic Data is manipulated with the help of arithmetic instructions in digital computers. Data is manipulated to  produce the results  necessary  to  provide solut

E-r diagrams, for ticket reservation in trains for payroll processing for i...

for ticket reservation in trains for payroll processing for insurance database

Explain dma and interrupt breakpoints, Q. Explain about DMA and Interrupt B...

Q. Explain about DMA and Interrupt Breakpoints? DMA interface transfers complete block of data one word at a time directly to or from memory without going through processor. Wh

Address phase timing - computer architecture, Address phase timing: On...

Address phase timing: On the rising edge of clock 0, the initiator notes IRDY # and FRAME# both high, and GNT# low, so it drives the command, address and asserts FRAME# in tim

Common tasks to accomplish - artificial intelligence, Common Tasks to Accom...

Common Tasks to Accomplish: Once you've worried about what and why you're doing "AI", what has inspired you and how you're going to approach the job, then you just start to th

Explain bitwise-and operator, Bitwise-AND Operator: & AND-expression : ...

Bitwise-AND Operator: & AND-expression : relational-expression AND-expression & equality-expression The bitwise-AND operator (&) compares each bit of its first operand t

Memory cache hierarchy and virtual memory system, 1. Detail for each of the...

1. Detail for each of the four following MIPS instructions, which actions are being taken at each of their five steps. Do not forget to mention how and during which steps each inst

Explain about operand address calculation, Q. Explain about Operand Address...

Q. Explain about Operand Address Calculation? In actual machines effective address can be a register address, memory or I/O port address. Register reference instructions for ex

Determine capacity in bytes of a certain memory, A certain memory has a cap...

A certain memory has a capacity of 4K × 8 (i)  How many data input and data output lines does it have? (ii) How many address lines does it have? (iii) What is its capacity in bytes

Explain essential properties of distributed operating system, Describe the ...

Describe the essential properties of the Distributed Operating System Essential properties of Distributed operating systems: Sharing resources Calculation speed-up

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