Self-organized Allocation of Dependent Tasks in Industrial Applications

Research output: Contribution to book/Conference proceedings/Anthology/ReportConference contributionContributedpeer-review

Contributors

Abstract

Self-organization is a powerful method to bring forward automation in industrial applications. However, tasks in such use cases often have high complexity and strong interdependencies, limiting the applicability of state-of-the-art self-organization algorithms. This paper studies self-organization algorithms that are suitable for task allocation in industrial manufacturing processes with strong task dependencies. Two algorithms based on the Response Threshold Model are proposed in this paper to fit task dependencies. For decision-making, they rely solely on local interactions between the involved agents and the environment. To analyze their performance, an upper bound of the achievable performance is calculated using methods from Synchronous Data Flow. Simulations are performed under both homogeneous and heterogeneous agents and different task-switching costs. The results indicate that the DRTM FR-based algorithm, which evolves agents into a specialized team, has a better performance.

Details

Original languageEnglish
Title of host publication2021 IEEE International Conference on Autonomic Computing and Self-Organizing Systems (ACSOS)
PublisherIEEE
Pages170-176
Number of pages7
ISBN (electronic)9781665412612
ISBN (print)978-1-6654-2940-5
Publication statusPublished - 1 Oct 2021
Peer-reviewedYes

Conference

Title2021 IEEE International Conference on Autonomic Computing and Self-Organizing Systems (ACSOS)
Abbreviated titleACSOS 2021
Conference number2
Duration27 September - 1 October 2021
Website
Degree of recognitionInternational event
Locationonline
CityWashington
CountryUnited States of America

External IDs

Scopus 85124801027

Keywords

Keywords

  • Computational modeling, Conferences, Costs, Decision making, Limiting, Manufacturing processes, Upper bound