Finding optimal plans for multiple teams of robots through a mediator: a logic-based approach
Erdem, Esra and Patoğlu, Volkan and Sarıbatur, Zeynep Gözen and Schüller, Peter and Uras, Tansel (2013) Finding optimal plans for multiple teams of robots through a mediator: a logic-based approach. Theory and Practice of Logic Programming (Sl), 13 (4-5). pp. 831-846. ISSN 1471-0684 (Print) 1475-3081 (Online)
Full text not available from this repository.
Official URL: http://dx.doi.org/10.1017/S1471068413000525
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.
Repository Staff Only: item control page