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
what are the types of isoquants

When the user is inputting commands into your shell, it should identify the left, right , up and down arrow keys. To implement this, you will need to use the termios.h library to

Decision Tree Learning: Furthermore there is specified in the last lecture such as the representation scheme we choose to represent our learned solutions and the way that we l

In 1993 High Performance FORTRAN Forum which is a group of academicians and many leading software and hardware vendors in field of parallel processing established an informal langu

Q. What is task identifier? Each and every PVM task is uniquely recognized by an integer known as task identifier (TID) assigned by local pvmd. Messages are received from and s

What is a client in SAP terminology? A S/W component that uses the service (offered by a s/w component) is known as a Client.  At the similar time these clients may also be ser

What do you understand by stepwise refinement of the program? The method of "Stepwise refinement" means to take an object and move it from a general perspective to a exact leve

Explain the features and utilities available in java, which makes it suitable for developing e-commerce applications.     1.  In a network, the transmission of passive informati

How can you display frames (horizontal and vertical lines) in lists? You can show tabular lists with horizontal and vertical lines (FRAMES) using the ULINE command and the syst

Q. How to Information transfer from one register to another? Information transfer from one register to another is designated in symbolic notation by a replacement operator. For