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
Q. Explain the odd-even transposition algorithm? The algorithm needs one 'for loop' beginning from I=1 to N it implies that N times and for every value of I, one 'for loop' of


What is the difference between latches and flip-flops based designs Latches are level sensitive whether flip-flops are edge sensitive. So, latch based design and flop based des

What are the advantages of threads over processes? Some of the useful threads offer over processes includes: i)   It does not take more time to create and finished a new thr

Can we specify file transfer in a Web page? Explain with the help of suitable example. Yes, file transfer can be given in a web page. The first field within a URL gives a proto

What is the Gray equivalent of  (25) 10 Ans. Gray equivalent of (25) 10 : The Decimal number 25 has binary equivalent as (00100101) 2 The left most bits (MSB) into gray

The next major set of tasks to tackle are delete and update. Version control systems typically version updates to a ?le and only store the differences between the ?les. Two system

What are disadvantages of the asynchronous reset and synchronous reset? Disadvantages of asynchronous reset: Make sure that the release of the reset can arise within one c

Define addressing modes. The dissimilar ways in which the location of an operand is specified in an instruction are referred to as addressing modes.

Explain Bottom up parsing. Bottom up parsing: This parse attempts to increase syntax tree for an input string by a sequence of reduction. If the input string can be decreas