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
Explain Disadvantage of Optimal Page Replacement Algorithm Optimal page replacement algorithm cannot be implemented in the general purpose operating system as it is impossible

What is .NET / .NET Framework?  It is a Framework in which Windows applications might be developed and run. The Microsoft .NET Framework is a platform for building, deploying,

Design a 8 to 1 multiplexer by using the fourvariable function given by F(A, B, C, D) = ∑ m(0,1,3,4,8,9,15). Ans. Design of 8 to 1 Multiplexer: It is a four-variable function a

What is an interface and what is an abstract class? Please, expand by examples of using both. Explain why?   Abstract classes are closely related to interfaces. They are classe

Q. Using Library methods returns number of threads? #include void subdomain(float x[ ], int istart, int ipoints) { int i; for (i = 0; i x[istart+i] = 123.456;

Handling Interrupts: Precise interrupts (sequential semantics) Complete instructions before the offending instructions o   Force trap instruction into IF o

Advntages of parallel processing oversequential computation Parallel computing has the following benefits over sequential computing: i)    Accumulate time ii)   Solves b

What are the main characteristics of Horizontal Organizational Structure? Horizontal Organization’s main characteristics are given below: The work is structured all aroun

Write down the drawback of top down parsing of backtracking. Following are disadvantages of top down parsing of backtracking: (i) Semantic actions can't be performed whereas

Vector reduction Instructions When operations on vector are being decreased to scalar items as a result then these are vector reduction instructions. These instructions are ref