Linear logic as a tool for planning under temporal uncertainty

Authors:
Max Kanovich;Jacqueline Vauzeilles
Affiliations:
Queen Mary University of London, School of Electronic Engineering and Computer Science, Mile End Road, London E1 4NS, UK;LIPN, UMR CNRS 7030, Institut Galilée, Université Paris 13, 99 Av. J.-B. Clément, 93430 Villetaneuse, France
Venue:
Theoretical Computer Science
Year:
2011

Citing 17
Cited 0

Linear logic

Theoretical Computer Science
Generating plans in linear logic I: actions as proofs

Theoretical Computer Science
Generating plans in linear logic: II. A geometry of conjunctive actions

Theoretical Computer Science
A theory of timed automata

Theoretical Computer Science
Linear logic: its syntax and semantics

Proceedings of the workshop on Advances in linear logic
Planning: what it is, what it could be, an introduction to the special issue on planning and scheduling

Artificial Intelligence - Special volume on planning and scheduling
Artificial intelligence: a new synthesis

Artificial intelligence: a new synthesis
Functional strips: a more flexible language for planning and problem solving

Logic-based artificial intelligence
Editorial

Artificial Intelligence - special issue on planning with uncertainty and incomplete information
Weak, strong, and strong cyclic planning via symbolic model checking

Artificial Intelligence - special issue on planning with uncertainty and incomplete information
The classical AI planning problems in the mirror of Horn linear logic: semantics, expressibility, complexity

Mathematical Structures in Computer Science
Automated Planning: Theory & Practice

Automated Planning: Theory & Practice
Strong planning under uncertainty in domains with numerous but identical elements (a generic approach)

Theoretical Computer Science
Managing concurrency in temporal planning using planner-scheduler interaction

Artificial Intelligence
When is temporal planning really temporal?

IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
A critical look at critics in HTN planning

IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 2
Pushing the envelope: planning, propositional logic, and stochastic search

AAAI'96 Proceedings of the thirteenth national conference on Artificial intelligence - Volume 2

Quantified Score

Hi-index	5.23

Visualization

Abstract

The typical AI problem is that of making a plan of the actions to be performed by a controller so that it could get into a set of final situations, if it started with a certain initial situation. The plans, and related winning strategies, happen to be finite in the case of a finite number of states and a finite number of instant actions. The situation becomes much more complex when we deal with planning under temporal uncertainty caused by actions with delayed effects. Here we introduce a tree-based formalism to express plans, or winning strategies, in finite state systems in which actions may have quantitatively delayed effects. Since the delays are non-deterministic and continuous, we need an infinite branching to display all possible delays. Nevertheless, under reasonable assumptions, we show that infinite winning strategies which may arise in this context can be captured by finite plans. The above planning problem is specified in logical terms within a Horn fragment of affine logic. Among other things, the advantage of linear logic approach is that we can easily capture 'preemptive/anticipative' plans (in which a new action @b may be taken at some moment within the running time of an action @a being carried out, in order to be prepared before completion of action @a). In this paper we propose a comprehensive and adequate logical model of strong planning under temporal uncertainty which addresses infinity concerns. In particular, we establish a direct correspondence between linear logic proofs and plans, or winning strategies, for the actions with quantitative delayed effects.