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
8086 microprocessor comprises two independent units:  1.  Bus Interface unit 2.  Execution unit Please refer to Figure below. Figure: The CPU of INTEL 8086 Microp

Explanation:- In functional testing, you require to confirm that the objects in the application-under-test look and work as designed from build to build. To accomplish this, yo

Yet another type of input is HIDDEN input. A HIDDEN input is a value/name pair which is returned to you but doesn

Q. Define Message Passing? The PVM communication model offers asynchronous blocking receive and asynchronous blocking send and nonblocking receive functions. In our terminology

Your shell should accept and execute the pipe "|"  operator. This will look like the following: | The functionality of this operator is to execute command1 and send i

Explain Direct or Indirect Communication in Inter-process communication. Several types of message passing system in Direct or Indirect Communication are given below:

Event-based Simulator Digital  Logic  Simulation  method  sacrifices  performance  for  rich  functionality:  each active signal  is  calculated  for  every  device  it  propa

Unlink() is a function for file system handling. It will easily delete the file in context.   Unset() is a function for variable management. It will create a variable undefin

Q. Describe Big Notation? Big O Notation : The set O (g(n)) comprises all functions f(n) for that there exists   positive constants c such that for satisfactorily large values

Explain Circular Dependencies. Circular Dependencies: To know the problem of circular dependencies consider a file server which uses a timeserver to acquire the current