Ida* search - artificial intelligence, Computer Engineering

IDA* Search - artificial intelligence:

A* search is a sophisticated and successful search strategy. In fact, a problem with A* search is that it must keep all states in its memory, so memory is often a much bigger consideration than time in designing agents to undertake A* searches. As we overcame the same problem with breadth first search by using an iterative deepening search (IDS), we do similar with A*. 

Like IDS, an IDA* search is a series of depth first searches where the depth is increased after each and every iteration. In fact, the depth is not measured in terms of the path length, as it is in IDS, but rather in terms of the A* combined function  f(n) as described above. To do this, we require to defines contours as regions of the search space containing states where f is below some limit for all the states, as shown pictorially here: 

Each node in a contour scores less than a particular rate and IDA* search agents are told how much to increase the contour boundary by on each iteration. This specify the depth for successive searches. Whenever using contours, it is useful for the function  f(n)  to be monotonic, i.e.,  f  is monotonic if when an operator takes a state  s1  to a state  s2, then  f(s2) >= f(s1). Or we can say other words, if the value of f always increases along a path, so f is monotonic. As an exercise, where and why do we require monotonicity to ensure optimality in IDA* search?

Posted Date: 1/9/2013 7:27:31 AM | Location : United States







Related Discussions:- Ida* search - artificial intelligence, Assignment Help, Ask Question on Ida* search - artificial intelligence, Get Answer, Expert's Help, Ida* search - artificial intelligence Discussions

Write discussion on Ida* search - artificial intelligence
Your posts are moderated
Related Questions
Proof by Contradiction - Artificial intelligence So, both backward chaining andforward chaining have drawbacks. Another approach is to think regarding proving theorems by contr

Q. Explain the Use of functions in parallel programming? include "pvm3.h" main() {    int cc, tid, msgtag;    char buf[100];    printf("%x\n", pvm_mytid());

A computer system with 16K of memory, a Memory Management Unit with a page size of 2000, and the following page translation table :      Logical Address    Physical Start 0000

Is it true that the Logical Database reads the data from the database tables using Select Statements. Yes. We are coding that in Database part of LDB.

In Java System.out is an object of type? In Java System.out is an object of form Print Stream.

What  are  universal  gates.  Construct  a  logic  circuit  using  NAND  gates  only  for  the expression x = A . (B + C). Ans. Universal Gates: NAND and NOR Gates both are t

Illustrates about Metal Fix. A Metal Fix implies that only the upper metal interconnects layers are influenced. Connections may be made or broken, but new cells may not be adde

Specified the average case complexity of sequential search in an array of unsorted elements of size n if the following conditions hold: a)  Probability of the key to be in the a


While using FTP what is wildcard expansion in file names? To make this easy for users to identify a set of file names, FTP permits a remote computer system to perform usual fil