Finding optimal plans for multiple teams of robots through a mediator: A logic-based approach

We study the problem of finding optimal plans for multiple teams of robots through a mediator, where each team is given a task to complete in its workspace on its own and where teams are allowed to transfer robots between each other, subject to the following constraints: 1) teams (and the mediator)...

Full description

Saved in:
Bibliographic Details
Published in:Theory and practice of logic programming 2013-07, Vol.13 (4-5), p.831-846
Main Authors: ERDEM, ESRA, PATOGLU, VOLKAN, SARIBATUR, ZEYNEP G., SCHÜLLER, PETER, URAS, TANSEL
Format: Article
Language:English
Subjects:
Manufacturing engineering
Regular Papers
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:We study the problem of finding optimal plans for multiple teams of robots through a mediator, where each team is given a task to complete in its workspace on its own and where teams are allowed to transfer robots between each other, subject to the following constraints: 1) teams (and the mediator) do not know about each other's workspace or tasks (e.g., for privacy purposes); 2) every team can lend or borrow robots, but not both (e.g., transportation/calibration of robots between/for different workspaces is usually costly). We present a mathematical definition of this problem and analyze its computational complexity. We introduce a novel, logic-based method to solve this problem, utilizing action languages and answer set programming for representation, and the state-of-the-art ASP solvers for reasoning. We show the applicability and usefulness of our approach by experiments on various scenarios of responsive and energy-efficient cognitive factories.
ISSN:1471-0684
1475-3081
DOI:10.1017/S1471068413000525