Using linear temporal logic to model and solve planning problems

Cerrito, Serenella; Mayer, Marta Cialdea

doi:10.1007/bfb0057441

Cited by 15 publications

(10 citation statements)

References 7 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Its use as a specification language was introduced by Pnueli [9]. Since then, temporal logic has been demonstrated to be an appropriate specification formalism for reasoning about various kinds of systems, and has been utilized to specify and verify behavioral properties in various applications [19], [20], [21], [22]. The version of temporal logic we employ in this paper is LTL.…”

Section: A Linear Temporal Logicmentioning

confidence: 99%

Distributed Synthesis of Control Protocols for Smart Camera Networks

Özay

Topcu

Murray

et al. 2011

2011 IEEE/ACM Second International Conference on Cyber-Physical Systems

View full text Add to dashboard Cite

Abstract-We considered the problem of designing control protocols for pan-tilt-zoom (PTZ) cameras within a smart camera network where the goal is to guarantee certain temporal logic specifications related to a given surveillance task. We first present a centralized control architecture for assigning PTZ cameras to targets so that the specification is met for any admissible behavior of the targets. Then, in order to alleviate the computational complexity associated with LTL synthesis and to enable implementation of local control protocols on individual PTZ cameras, we propose a distributed synthesis methodology. The main idea is to decompose the global specification into local specifications for each PTZ camera. These decompositions allow the protocols for each camera to be separately synthesized and locally implemented while guaranteeing the global specifications to hold. A thorough design example is presented to illustrate the steps of the proposed procedure.

show abstract

Section: A Linear Temporal Logicmentioning

confidence: 99%

Distributed Synthesis of Control Protocols for Smart Camera Networks

Özay

Topcu

Murray

et al. 2011

2011 IEEE/ACM Second International Conference on Cyber-Physical Systems

View full text Add to dashboard Cite

show abstract

“…The planning problem can be represented as a temporal logic satisfiability problem, see for example [1]. Initial conditions can be represented as formulae holding in the initial state, actions can be modelled by making a next step and recording that the action that has been taken, goals can be represented using eventualities (♦-formulae) and invariants can be modelled using the operator.…”

Section: Planning and Knowledge Representationmentioning

confidence: 99%

“…In the meantime we have been working on (1). In [6], it was shown that, simply by incorporating "exactly one" constraints into a propositional temporal logic, much better computational complexity could be achieved.…”

Section: Introductionmentioning

confidence: 99%

Taming the Complexity of Temporal Epistemic Reasoning

Dixon

Fisher

Konev

2009

Frontiers of Combining Systems

View full text Add to dashboard Cite

Abstract. Temporal logic of knowledge is a combination of temporal and epistemic logic that has been shown to be very useful in areas such as distributed systems, security, and multi-agent systems. However, the complexity of the logic can be prohibitive. We here develop a refined version of such a logic and associated tableau procedure with improved complexity but where important classes of specification can still be described. This new logic represents a combination of an "exactly one" temporal logic with an S5 multi-modal logic again restricted to the "exactly one" form.

show abstract

“…A planning problem can be represented by a set of LTL formulae according to different encodings, as shown in [12]. The semantics of PDDL-K consists of a simple form of progression encoding, that recalls the encoding of planning problems in the Situation Calculus [36] and the linear encoding of [24].…”

Section: Planning Problems and Their Ltl Encodingmentioning

confidence: 99%

Linear temporal logic as an executable semantics for planning languages

Mayer

Limongelli

Orlandini

et al. 2006

JoLLI

Self Cite

View full text Add to dashboard Cite

This paper presents an approach to artificial intelligence planning based on linear temporal logic (LTL). A simple and easy-to-use planning language is described, PDDL-K (Planning Domain Description Language with control Knowledge), which allows one to specify a planning problem together with heuristic information that can be of help for both pruning the search space and finding better quality plans. The semantics of the language is given in terms of a translation into a set of LTL formulae. Planning is then reduced to "executing" the LTL encoding, i.e. to model search in LTL. The feasibility of the approach has been successfully tested by means of the system Pdk, an implementation of the proposed method.

show abstract

Using linear temporal logic to model and solve planning problems

Cited by 15 publications

References 7 publications

Distributed Synthesis of Control Protocols for Smart Camera Networks

Distributed Synthesis of Control Protocols for Smart Camera Networks

Taming the Complexity of Temporal Epistemic Reasoning

Linear temporal logic as an executable semantics for planning languages

Contact Info

Product

Resources

About