LiU Electronic Press
Download:
File size:
934 kb
Format:
application/pdf
Author:
Nyblom, Per (Linköping University, Department of Computer and Information Science, KPLAB - Knowledge Processing Lab) (Linköping University, The Institute of Technology)
Title:
Dynamic Abstraction for Interleaved Task Planning and Execution
Department:
Linköping University, Department of Computer and Information Science, KPLAB - Knowledge Processing Lab
Linköping University, The Institute of Technology
Publication type:
Licentiate thesis, monograph (Other academic)
Language:
English
Publisher: Institutionen för datavetenskap
Pages:
94
Series:
Linköping Studies in Science and Technology. Thesis, ISSN 0280-7971; 1363
Year of publ.:
2008
URI:
urn:nbn:se:liu:diva-11924
Permanent link:
http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-11924
ISBN:
978-91-7393-905-8
Subject category:
Computer Science
SVEP category:
Computer science
Keywords(en) :
Artificial Intelligence, Dynamic Abstraction, Task Planning, Automatic Model Construction, Meta-modelling
Abstract(en) :

It is often beneficial for an autonomous agent that operates in a complex environment to make use of different types of mathematical models to keep track of unobservable parts of the world or to perform prediction, planning and other types of reasoning. Since a model is always a simplification of something else, there always exists a tradeoff between the model’s accuracy and feasibility when it is used within a certain application due to the limited available computational resources. Currently, this tradeoff is to a large extent balanced by humans for model construction in general and for autonomous agents in particular. This thesis investigates different solutions where such agents are more responsible for balancing the tradeoff for models themselves in the context of interleaved task planning and plan execution. The necessary components for an autonomous agent that performs its abstractions and constructs planning models dynamically during task planning and execution are investigated and a method called DARE is developed that is a template for handling the possible situations that can occur such as the rise of unsuitable abstractions and need for dynamic construction of abstraction levels. Implementations of DARE are presented in two case studies where both a fully and partially observable stochastic domain are used, motivated by research with Unmanned Aircraft Systems. The case studies also demonstrate possible ways to perform dynamic abstraction and problem model construction in practice.

Note:
Report code: LiU-Tek-Lic-2008:21.
Presentation:
2008-05-15, Alan Turin, House E, Campus Valla, Linköpings universitet, Linköping, 13:10 (English)
Supervisor:
Doherty, Patrick (Linköping University, Department of Computer and Information Science, KPLAB - Knowledge Processing Lab) (Linköping University, The Institute of Technology)
Opponent:
Karlsson, Lars, Docent (Applied Autonomous Sensor Systems Center, Örebro universitet, Örebro)
Available from:
2008-05-27
Created:
2008-05-27
Last updated:
2009-05-11
Statistics:
187 hits
FILE INFORMATION
File size:
934 kb
Mimetype:
application/pdf
Type:
fulltext
Statistics:
182 hits
File size:
110 kb
Mimetype:
application/pdf
Type:
cover
Statistics:
36 hits