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

Direct link
TALplanner and other extensions to Temporal Action Logic
Linköping University, Department of Computer and Information Science. Linköping University, The Institute of Technology.ORCID iD: 0000-0002-5500-8494
2005 (English)Doctoral thesis, monograph (Other academic)
Abstract [en]

Though the exact definition of the boundary between intelligent and non-intelligent artifacts has been a subject of much debate, one aspect of intelligence that many would deem essential is deliberation: Rather than reacting "instinctively" to its environment, an intelligent system should also be capable of reasoning about it, reasoning about the effects of actions performed by itself and others, and creating and executing plans, that is, determining which actions to perform in order to achieve certain goals. True deliberation is a complex topic, requiring support from several different sub-fields of artificial intelligence. The work presented in this thesis spans two of these partially overlapping fields, beginning with reasoning about action and change and eventually moving over towards planning.

The qualification problem relates to the difficulties inherent in providing, for each action available to an agent, an exhaustive list of all qualifications to the action, that is, all the conditions that may prevent the action from being executed in the intended manner. The first contribution of this thesis is a framework for modeling qualifications in Temporal Action Logic (TAL).

As research on reasoning about action and change proceeds, increasingly complex and interconnected domains are modeled in increasingly greater detail. Unless the resulting models are structured consistently and coherently, they will be prohibitively difficult to maintain. The second contribution is a framework for structuring TAL domains using object-oriented concepts.

Finally, the second half of the thesis is dedicated to the task of planning. TLplan pioneered the idea of using domain-specific control knowledge in a temporal logic to constrain the search space of a forward-chaining planner. We develop a new planner called TALplanner, based on the same idea but with fundamental differences in the way the planner verifies that a plan satisfies control formulas. T ALplanner generates concurrent plans and can take resource constraints into account. The planner also applies several new automated domain analysis techniques to control formulas, further increasing performance by orders of magnitude for many problem domains.

Place, publisher, year, edition, pages
Linköping: Linköpings universitet , 2005. , 302 p.
Linköping Studies in Science and Technology. Dissertations, ISSN 0345-7524 ; 937
National Category
Computer Science
URN: urn:nbn:se:liu:diva-31494Local ID: 17289ISBN: 91-85297-75-5 (print)OAI: diva2:252317
Public defence
2005-04-29, Visionen, Hus B, Campus Valla, Linköping, 13:15 (Swedish)
Available from: 2009-10-09 Created: 2009-10-09 Last updated: 2013-08-29

Open Access in DiVA

No full text

Search in DiVA

By author/editor
Kvarnström, Jonas
By organisation
Department of Computer and Information ScienceThe Institute of Technology
Computer Science

Search outside of DiVA

GoogleGoogle Scholar

Total: 144 hits
ReferencesLink to record
Permanent link

Direct link