Automated planning of motion tasks for multi-robot systems

Savvas G. Loizou, Kostas J. Kyriakopoulos

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

In this paper we present an automated task planning methodology to automatically compose multi-robot motion tasks. A motion task is defined as an input-output module. Primitive motion tasks represented as modules (called primitive modules) are defined based on Linear Temporal Logic specifications. The task planning is then considered as a composition over compatible primitive modules in such a way that the inverted motion task module and the primitive modules form a closed chain. The problem is posed as an integer programming problem and is reduced to the combinatorial optimization problem of shortest dipath which can be solved in polynomial time. The basic safety and liveness specifications of the primitive task controllers are inherited by the resulting composed system and the requested task specifications are satisfied by construction, ensuring a correct design. The effectiveness of the proposed methodology is shown through computer simulation.

Original languageEnglish (US)
Title of host publicationProceedings of the 44th IEEE Conference on Decision and Control, and the European Control Conference, CDC-ECC '05
Pages78-83
Number of pages6
DOIs
StatePublished - 2005
Event44th IEEE Conference on Decision and Control, and the European Control Conference, CDC-ECC '05 - Seville, Spain
Duration: Dec 12 2005Dec 15 2005

Publication series

NameProceedings of the 44th IEEE Conference on Decision and Control, and the European Control Conference, CDC-ECC '05
Volume2005

Other

Other44th IEEE Conference on Decision and Control, and the European Control Conference, CDC-ECC '05
Country/TerritorySpain
CitySeville
Period12/12/0512/15/05

ASJC Scopus subject areas

  • General Engineering

Fingerprint

Dive into the research topics of 'Automated planning of motion tasks for multi-robot systems'. Together they form a unique fingerprint.

Cite this