Finding and executing parallel plans for variants of the 8-puzzle problem

Jernej Janež (2017) Finding and executing parallel plans for variants of the 8-puzzle problem. EngD thesis.

Preview

Abstract

In this thesis we deal with the problem of finding parallel plans for variants of the 8-puzzle problem. We used the A* algorithm and experimented with different heuristic functions trying to guide the search. We compared four different heuristic functions and depending on the environment proposed the most suitable one. Some of them need more time to find a better solution and some are faster but may miss good quality solutions.

Item Type:

Thesis (EngD thesis)

Keywords:

search, parallel execution, A* algorithm, heuristic functions

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=51012&select=(ID=1537507267)

Institution:

University of Ljubljana

Department:

Faculty of Computer and Information Science

Item ID:

3896

Date Deposited:

04 Sep 2017 14:29

Last Modified:

12 Sep 2017 10:45

URI:

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

Actions (login required)

View Item