ABSTRACT

Problem solving in Artificial Intelligence (AI) may be characterized as a systematic search

through a range of possible actions in order to reach some predefined goal or solution. In AI
problem solving by search algorithms is quite common technique. In the coming age of AI it will
have big impact on the technologies of the robotics and path finding. It is also widely used in the
travel planning. This thesis deals with the different kinds of search algorithms of Artificial
intelligence used in travel planning. It describes their structures and their use in travel planning.
Heuristic search algorithms and their uses in AI are focused. Travel planning plays major role in
human’s activities but is complex part. AI has also decreased that complexity .HTN planning
technique which is better step for the advancement of travel planning. Heracles which is
interactive data driven constraint based travel planners has played a significant role in the field of
travel planning. Eight-puzzle Problem is a one of classic difficulty problem in Artificial
Intelligence, to solve this problem in most cases are adopted the search algorithm, and Search
strategy is one of the main directions in the artificial intelligence research. Using different search
strategies in the process of solving problem also may have differences. In this paper, through the
analysis of the search solution for the Eight-puzzle Problem, the Breadth-first search algorithm,
the Depth-first search algorithm, and A*algorithm, which is one of the heuristic search, are used
to implement it. These algorithms are compared to evaluate the superiority between these three
search algorithms, and at last drew the analytic conclusion on the purpose of giving the direction
to develop and use more efficient search strategies. In general, heuristic search algorithms are
more convenient and efficient than blinding algorithms in the states space search.