liu.seSearch for publications in DiVA
Endre søk
RefereraExporteraLink to record
Permanent link

Direct link
Referera
Referensformat
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • oxford
  • Annet format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annet språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf
Dynamic Abstraction for Interleaved Task Planning and Execution
Linköpings universitet, Institutionen för datavetenskap, KPLAB - Laboratoriet för kunskapsbearbetning. Linköpings universitet, Tekniska högskolan.
2008 (engelsk)Licentiatavhandling, monografi (Annet vitenskapelig)
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.

sted, utgiver, år, opplag, sider
Institutionen för datavetenskap , 2008. , s. 94
Serie
Linköping Studies in Science and Technology. Thesis, ISSN 0280-7971 ; 1363
Emneord [en]
Artificial Intelligence, Dynamic Abstraction, Task Planning, Automatic Model Construction, Meta-modelling
HSV kategori
Identifikatorer
URN: urn:nbn:se:liu:diva-11924Lokal ID: LiU-TEK-LIC-2008:21ISBN: 9789173939058 (tryckt)OAI: oai:DiVA.org:liu-11924DiVA, id: diva2:18308
Presentation
2008-05-15, Alan Turin, House E, Campus Valla, Linköpings universitet, Linköping, 13:10 (engelsk)
Opponent
Veileder
Merknad

Report code: LiU-Tek-Lic-2008:21.

Tilgjengelig fra: 2008-05-27 Laget: 2008-05-27 Sist oppdatert: 2020-08-14bibliografisk kontrollert

Open Access i DiVA

omslag(110 kB)245 nedlastinger
Filinformasjon
Fil COVER01.pdfFilstørrelse 110 kBChecksum SHA-1
eff65ce390f0a275dc2c13a115092a114102d83f75237f1a98bdfda4964317626d7fdac2
Type coverMimetype application/pdf
fulltekst(934 kB)495 nedlastinger
Filinformasjon
Fil FULLTEXT01.pdfFilstørrelse 934 kBChecksum SHA-1
d2e8c8d8c9e7723bd3c0c99a697f5c67c4a2074525de73ee6c0fc39484527e94e59d8eb8
Type fulltextMimetype application/pdf
Bestill online >>

Person

Nyblom, Per

Søk i DiVA

Av forfatter/redaktør
Nyblom, Per
Av organisasjonen

Søk utenfor DiVA

GoogleGoogle Scholar
Totalt: 495 nedlastinger
Antall nedlastinger er summen av alle nedlastinger av alle fulltekster. Det kan for eksempel være tidligere versjoner som er ikke lenger tilgjengelige

isbn
urn-nbn

Altmetric

isbn
urn-nbn
Totalt: 532 treff
RefereraExporteraLink to record
Permanent link

Direct link
Referera
Referensformat
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • oxford
  • Annet format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annet språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf