Robot Task Assignment In Dynamic Factory Environments

Research output: Contribution to journalConference articleContributedpeer-review

Contributors

Abstract

Automated Guided Vehicles (AGVs) and Autonomous Mobile Robots (AMRs) are being applied more and more frequently in a wide range of use cases. Following the general trend of decentralisation of control structure in the Industry 4.0 paradigm, this paper analyses the application of auction algorithms to solve the robot task assignment problem. We focus on the use of mobile robots in production environments with a high level of uncertainty which places hight demand on the flexibility of the online scheduling architecture. A sequential single-item (SSI) auction algorithm is validated for a real-world use case where multiple mobile robots supply car bodies to manual rework stations in a paint shop application using simulation. The optimization objective of such an algorithm is discussed in regards to the examined use case.

Details

Original languageEnglish
Pages (from-to)338-344
Number of pages7
JournalCommunications of the ECMS
Volume38
Issue number1
Publication statusPublished - Jun 2024
Peer-reviewedYes

Conference

Title38th ECMS International Conference on Modelling and Simulation
Abbreviated titleECMS24
Conference number38
Duration4 - 7 June 2024
Website
Degree of recognitionInternational event
LocationCracow University of Technology
CityKrakau
CountryPoland

External IDs

Scopus 85195177743

Keywords

Keywords

  • mobile Roboter, Auktionstheorie, Simulation