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

Direct link
Deductive Planning with Inductive Loops
2008 (English)In: Proceedings of the 11th International Conference on Principles of Knowledge Representation and Reasoning (KR), Menlo Park, CA, USA: AAAI Press, 2008, 528-534Conference paper (Refereed)
Abstract [en]

Agents plan to achieve and maintain goals. Maintenance that requires continuous action excludes the representation of plans as finite sequences of actions. If there is no upper bound on the number of actions, a simple list of actions would be infinitely long. Instead, a compact representation requires some form of looping construct. We look at a specific temporally extended maintenance goal, multiple target video surveillance, and formalize it in Temporal Action Logic. The logic's representation of time as the natural numbers suggests using mathematical induction to deductively plan to satisfy temporally extended goals. Such planning makes use of a sound and useful, but incomplete, induction rule that compactly represents the solution as a recursive fixpoint formula. Two heuristic rules overcome the problem of identifying a sufficiently strong induction hypothesis and enable an automated solution to the surveillance problem that satisfies the goal indefinitely.

National Category
Computer Science
URN: urn:nbn:se:liu:diva-44571Local ID: 77114ISBN: 978-1-57735-384-3OAI: diva2:265433
KR 2008
Available from2009-10-10 Created:2009-10-10 Last updated:2011-04-14

Open Access in DiVA

No full text

Search in DiVA

By author/editor
Magnusson, MartinDoherty, Patrick
By organisation
The Institute of TechnologyKPLAB - Knowledge Processing Lab
Computer Science

Search outside of DiVA

GoogleGoogle Scholar
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

Total: 23 hits
ReferencesLink to record
Permanent link

Direct link