I have spent hours on internet to find an example of iterative lengthening search algorithm but found nothing. I need it ASAP. Can anyone help me? Please.

It is its definition: Iterative lengthening search is an iterative analogue of uniform-cost search. The basic idea is to use increasing limits on path cost. If a node is generated whose path cost exceeds the current limit, it is immediately discarded. For each new iteration, the limit is set to the lowest path cost of any node discarded in the previous iteration.

I dont understand many things in this definition. 1-What is the first limit before we start? 2-Do we delete the discarded node from the graph or what? 3-What is the generated node? Is it expanded or is it just found as neigbor? 4-What is "lowest path cost of any node discarded"?? Path from where to where?? From start to that node or what? 5-What does path cost mean in this problem? Is it from source to the new node or between current node and next chosen node?

I am literally getting crazy. Please help.



Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy