Evaluation of Iterative Lengthening Algorithm and Implementation on Solving Search Problem
Name
Taivo Teder
Abstract
The purpose of this Bachelor thesis was to introduce a search algorithm, iterative lengthening algorithm, which has not been published widely, to solve the shortest-path problem within the space-graph. In this paper some initial evaluation results and complexity has been given. An example computer were implemented, which demonstrates the performance of iterative lengthening algorithm and its performance is compared with uniform-cost search performance on solving shortest-path problem.
Graduation Thesis language
Estonian
Graduation Thesis type
Bachelor - Computer Science
Supervisor(s)
prof. Mare Koit
Defence year
2012