Efficient Li

@inproceedings{Li1999EfficientL,
  title={Efficient Li},
  author={Efficient Li and Subrata Ghosh and A. Mahanti and Dana S. Nau},
  year={1999}
}
This paper describes a new admissible tree search algorithm called Iterative Threshold Search (ITS). ITS can be viewed as a much-simplified version of MA* [l], and a generalized version of MREC [12]. We also present the following results: 1. Every node generated by ITS is also generated by IDA*, even if ITS is given no more memory than IDA*. In addition… CONTINUE READING