liu.seSearch for publications in DiVA
ReferencesLink to record
Permanent link

Direct link
Deductive Planning and Composite Actions in Temporal Action Logic
2007 (English)Licentiatavhandling, sammanläggning (Other academic)
Abstract [en]

Temporal Action Logic is a well established logical formalism for reasoning about action and change that has long been used as a formal specification language. Its first-order characterization and explicit time representation makes it a suitable target for automated theorem proving and the application of temporal constraint solvers. We introduce a translation from a subset of Temporal Action Logic to constraint logic programs that takes advantage of these characteristics to make the logic applicable, not just as a formal specification language, but in solving practical reasoning problems. Extensions are introduced that enable the generation of action sequences, thus paving the road for interesting applications in deductive planning. The use of qualitative temporal constraints makes it possible to follow a least commitment strategy and construct partially ordered plans. Furthermore, the logical language and logic program translation is extended with the notion of composite actions that can be used to formulate and execute scripted plans with conditional actions, non-deterministic choices, and loops. The resulting planner and reasoner is integrated with a graphical user interface in our autonomous helicopter research system and applied to logistics problems. Solution plans are synthesized together with monitoring constraints that trigger the generation of recovery actions in cases of execution failures.

Place, publisher, year, pages
Institutionen för datavetenskap, 2007. 85 p.
Series
Linköping Studies in Science and Technology. Thesis, ISSN 0280-7971 ; 1329
Keyword [en]
Temporal Action Logic, deductive planning, composite actions, interval algebra, constraint logic programming, execution monitoring
National Category
Computer Science
Identifiers
urn:nbn:se:liu:diva-9726 (URN)978-91-85895-93-9 (ISBN)oai:DiVA.org:liu-9726 (OAI)
Presentation
2007-09-28, Alan Turing, Hus E, Campus Valla, Linköpings universitet, Linköping, 10:15 (English)
Opponent
Supervisors
Available from2007-10-12 Created:2007-10-12 Last updated:2009-06-09

Open Access in DiVA

cover(92 kB)28 downloads
File information
File name COVER01.pdfFile size 92 kBChecksum MD5
3de4217f1b596adb09f8c2d16e2d965624d885dce3df41781df91f26fe42ecbc520b1e91
Typ coverMimetype application/pdf
fulltext(468 kB)358 downloads
File information
File name FULLTEXT01.pdfFile size 468 kBChecksum MD5
7ea376357ad24046efc073581888df93304c5d6f2c71e5de8adfa90ead3eb90cacb7f919
Typ fulltextMimetype application/pdf

Search in DiVA

By author/editor
Magnusson, Martin
By organisation
KPLAB - Knowledge Processing LabThe Institute of Technology
Computer Science

Search outside of DiVA

GoogleGoogle Scholar
Totalt: 358 downloads
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available
Totalt: 328 hits
ReferencesLink to record
Permanent link

Direct link