Visualization of the execution of search algorithms in Artificial Intelligence

Matjaž Hegedič (2013) Visualization of the execution of search algorithms in Artificial Intelligence. EngD thesis.

Preview

Abstract

Search algorithms are one of the key tools for solving problems in Artificial Intelligence as well as other fields in Computer Science. Learning and intuitively understanding these algorithms can be hard, especially for beginners. As a part of this BSc thesis, a web application which visualizes some of the most important search algorithms, was developed. The text begins with a description of the concept of solving problems using state-space search, followed by an introduction to the application and instructions for its use. Subsequent two chapters explain the workings of each of included algorithms as well as properties of both implemented state-spaces - grid and 8-puzzle. The seventh chapter describes technologies used, the application architecture and the development process itself. The final chapter addresses some of the problems encountered during the making of the thesis and suggests some ideas for extensions and upgrades for the application. Two appendices are included, the first covering code documentation and the second instructions for writing new application modules.

Item Type:

Thesis (EngD thesis)

Keywords:

state-space, search algorithm, visualization, application, Artificial Intelligence, A*, RBFS, IDA*, RTA*

Number of Pages:

Language of Content:

Slovenian

Mentor / Comentors:

Name and Surname	ID	Function
akad. prof. dr. Ivan Bratko	77	Mentor

Link to COBISS:

http://www.cobiss.si/scripts/cobiss?command=search&base=50070&select=(ID=10144084)

Institution:

University of Ljubljana

Department:

Faculty of Computer and Information Science

Item ID:

2169

Date Deposited:

18 Sep 2013 17:54

Last Modified:

30 Sep 2013 09:54

URI:

http://eprints.fri.uni-lj.si/id/eprint/2169

Actions (login required)

View Item