Heuristic search through islands (Q578930): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: The heuristic search under conditions of error / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5679703 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Search Algorithms Under Different Kinds of Heuristics—A Comparative Study / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Some Recent Results in Heuristic Search Theory / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3856120 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A heuristic search algorithm with modifiable estimate / rank | |||
Normal rank |
Latest revision as of 11:01, 18 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Heuristic search through islands |
scientific article |
Statements
Heuristic search through islands (English)
0 references
1986
0 references
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^*\).
0 references
heuristic search strategy
0 references
islands
0 references