ERA

Download the full-sized PDF of Multimapping Abstraction and State-set Search TheoryDownload the full-sized PDF

Analytics

Share

Permanent link (DOI): https://doi.org/10.7939/R3DW6T

Download

Export to: EndNote  |  Zotero  |  Mendeley

Communities

This file is in the following communities:

Graduate Studies and Research, Faculty of

Collections

This file is in the following collections:

Theses and Dissertations

Multimapping Abstraction and State-set Search Theory Open Access

Descriptions

Other title
Subject/Keyword
state-set
abstraction
heuristic search
Type of item
Thesis
Degree grantor
University of Alberta
Author or creator
Pang, Bo
Supervisor and department
Holte, Robert (Computing Science)
Examining committee member and department
Bulitko, Vadim (Computing Science)
Holte, Robert (Computing Science)
Patterson, Raymond (Alberta School of Business)
Department
Department of Computing Science
Specialization

Date accepted
2012-09-11T12:31:06Z
Graduation date
2012-09
Degree
Master of Science
Degree level
Master's
Abstract
This thesis consists of two parts. First, we invented an abstraction framework called multimapping which allows multiple admissible heuristic values to be extracted from one abstract space. The key idea of this technique is to design a multimapping function which maps one state in the original space to multiple states in the abstract space. The fundamental differences between this new technique and other existing ones is that this technique is completely domain independent and can be implemented without increasing the size of the abstract space. Based on this multimapping framework, we have implemented multimapping domain abstraction for the HIDA* algorithm. To benchmark its performance, extensive experiments have been run on the Sliding Tile Puzzle, Pancake, Topspin and Blocks World domains. The results show that the new technique outperforms existing domain abstraction with a single or multiple abstract spaces in terms of CPU time and memory usage. The second part of this thesis is focused on the theory of state-set search. This theory investigates the scenario that a set of states are manipulated as a single state-set by a search algorithm. This scenario occurs frequently in abstraction and planning system and we are the first to formally define and analyze it. Based on this theory, we have found a path-based distance, dww, which is the maximum admissible distance between two state-sets.
Language
English
DOI
doi:10.7939/R3DW6T
Rights
Permission is hereby granted to the University of Alberta Libraries to reproduce single copies of this thesis and to lend or sell such copies for private, scholarly or scientific research purposes only. Where the thesis is converted to, or otherwise made available in digital form, the University of Alberta will advise potential users of the thesis of these terms. The author reserves all other publication and other rights in association with the copyright in the thesis and, except as herein before provided, neither the thesis nor any substantial portion thereof may be printed or otherwise reproduced in any material form whatsoever without the author's prior written permission.
Citation for previous publication
Multimapping Abstractions and Hierarchical Heuristic Search, Bo Pang and Robert C. Holte (2012), Symposium on Combinatorial Search (SoCS).State-Set Search, Bo Pang and Robert C. Holte (2011), Proc. 4th Symposium on Combinatorial Search (SoCS).

File Details

Date Uploaded
Date Modified
2014-04-25T00:09:16.415+00:00
Audit Status
Audits have not yet been run on this file.
Characterization
File format: pdf (Portable Document Format)
Mime type: application/pdf
File size: 3324608
Last modified: 2015:10:12 18:42:51-06:00
Filename: Pang_Bo_Fall 2012.pdf
Original checksum: bda36039c64e666d0b738e01094403a5
Well formed: false
Valid: false
Status message: Lexical error offset=3234027
Page count: 90
Activity of users you follow
User Activity Date