Multirobot coordination in pick-and-place tasks on a moving conveyor

Authors:
H. Işıl Bozma;M. E. Kalalıoğlu
Affiliations:
Intelligent Systems Laboratory, Electric Electronic Engineering Department, Bogaziçi University, Istanbul, Turkey;Intelligent Systems Laboratory, Electric Electronic Engineering Department, Bogaziçi University, Istanbul, Turkey
Venue:
Robotics and Computer-Integrated Manufacturing
Year:
2012

Citing 9
Cited 1

Cooperative Mobile Robotics: Antecedents and Directions

Autonomous Robots
The Distributed Constraint Satisfaction Problem: Formalization and Algorithms

IEEE Transactions on Knowledge and Data Engineering
A Game-Theoretic Approach to Integration of Modules

IEEE Transactions on Pattern Analysis and Machine Intelligence
Analysis of Dynamic Task Allocation in Multi-Robot Systems

International Journal of Robotics Research
A Plan Manager for Multi-robot Systems

International Journal of Robotics Research
A scalable method for multiagent constraint optimization

IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
Review: a unifying framework for iterative approximate best-response algorithms for distributed constraint optimization problems1

The Knowledge Engineering Review
Feedback-based event-driven parts moving

IEEE Transactions on Robotics
Multirobot systems: a classification focused on coordination

IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics

Robot coordination using task-priority and sliding-mode techniques

Robotics and Computer-Integrated Manufacturing

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper considers the problem of multirobot coordination in pick-and-place tasks on a conveyor band. The robot team is composed of identical robots with mutually exclusive, but neighboring workspaces. The products are fed in at one end of the band, move through each workspace sequentially until being picked up and are collected at the other end-if not picked up interim. Each robot has the same task-that is picking up and packaging as many products as possible. We propose an approach based on noncooperative game theory where each robot uses local observations of the conveyor band and their neighbors' actions in order to decide on its actions. The developed algorithm has been implemented and tested in a simulated manufacturing environment using Webots. Results obtained from the simulations are analyzed using a variety of statistical performance measures.