title   
  

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)

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.

Official URL: http://dx.doi.org/10.1109/SIU.2013.6531540

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
Subjects:UNSPECIFIED
ID Code:23787
Deposited By:Volkan Patoğlu
Deposited On:07 Jan 2014 09:50
Last Modified:28 Feb 2014 10:39

Repository Staff Only: item control page