Heuristic search through islands

Chakrabarti, P. P. ; Ghose, S. ; DeSarkar, S. C. (1986) Heuristic search through islands Artificial Intelligence, 29 (3). pp. 339-347. ISSN 0004-3702

Full text not available from this repository.

Official URL: http://linkinghub.elsevier.com/retrieve/pii/000437...

Related URL: http://dx.doi.org/10.1016/0004-3702(86)90074-3


A heuristic search strategy via islands is suggested to significantly decrease the number of nodes expanded. Algorithm I, which searches through a set of island nodes ("island set"), is presented assuming that the island set contains at least one node on an optimal cost path. This algorithm is shown to be admissible and expands no more nodes than A*. For cases where the island set does not contain an optimal cost path (or any path). Algorithm I', a modification of Algorithm I, is suggested. This algorithm ensures a suboptimal cost path (which may be optimal) and in extreme cases falls back to A*.

Item Type:Article
Source:Copyright of this article belongs to Elsevier Science.
ID Code:5912
Deposited On:19 Oct 2010 10:13
Last Modified:20 May 2011 09:54

Repository Staff Only: item control page