Bilişsel fabrikalarda birden fazla robot takımı için eniyilestirilmiş ayrıştırılabilir plan hesaplanması (Finding optimal decoupled plans for multiple teams of robots in cognitive factories)

Warning The system is temporarily closed to updates for reporting purpose.

Sarıbatur, Zeynep Gözen and Schüller, Peter and Patoğlu, Volkan and Erdem, Esra (2013) Bilişsel fabrikalarda birden fazla robot takımı için eniyilestirilmiş ayrıştırılabilir plan hesaplanması (Finding optimal decoupled plans for multiple teams of robots in cognitive factories). In: 21st Signal Processing and Communications Applications Conference (SIU 2013), Haspolat

Full text not available from this repository. (Request a copy)

Abstract

We introduce a novel method to find 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 introduce a novel method to solve this problem using state-of-the-art SAT solvers and ASP solvers. We show applicability and usefulness of our approach by experiments on various scenarios of cognitive factories.
Item Type: Papers in Conference Proceedings
Uncontrolled Keywords: AI Planning, Knowledge Representation and Reasoning
Divisions: Faculty of Engineering and Natural Sciences > Academic programs > Mechatronics
Faculty of Engineering and Natural Sciences > Academic programs > Computer Science & Eng.
Faculty of Engineering and Natural Sciences
Depositing User: Volkan Patoğlu
Date Deposited: 07 Jan 2014 09:50
Last Modified: 26 Apr 2022 09:14
URI: https://research.sabanciuniv.edu/id/eprint/23787

Actions (login required)

View Item
View Item