Distributed Constraint Optimization for Task Allocation in Self-Adaptive Manufacturing Systems

Joseph Hirsch, Martin Neumayer, Hella Ponsar, Oliver Kosak, W. Reif
{"title":"Distributed Constraint Optimization for Task Allocation in Self-Adaptive Manufacturing Systems","authors":"Joseph Hirsch, Martin Neumayer, Hella Ponsar, Oliver Kosak, W. Reif","doi":"10.1109/ACSOS-C52956.2021.00034","DOIUrl":null,"url":null,"abstract":"Adaptive manufacturing systems consist of many autonomous agents working together in an ever-changing environment. Therefore, collectively deciding which agent performs what task is a key issue and widely studied. However, many approaches towards this issue assume (partially) centralized control, require implementing proprietary algorithms, or cannot provide any guarantees regarding their runtime or communication overhead. To address these problems, we investigate the use of distributed constraint optimization (DCOP) in this context: We present a DCOP model built on freely available algorithms to distribute the problem among the agents that cooperate to solve it. Furthermore, we compare this decentralized approach to a centralized one by measuring the runtime in a set of system configurations with an increasing number of agents. While the DCOP approach works well in small system configurations, our results indicate poor scalability compared to the central approach when increasing the number of agents. We conclude that, although the DCOP approach has desirable properties, it is unsuitable for larger practical applications with dozens or hundreds of agents.","PeriodicalId":268224,"journal":{"name":"2021 IEEE International Conference on Autonomic Computing and Self-Organizing Systems Companion (ACSOS-C)","volume":"81 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2021-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2021 IEEE International Conference on Autonomic Computing and Self-Organizing Systems Companion (ACSOS-C)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ACSOS-C52956.2021.00034","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

Abstract

Adaptive manufacturing systems consist of many autonomous agents working together in an ever-changing environment. Therefore, collectively deciding which agent performs what task is a key issue and widely studied. However, many approaches towards this issue assume (partially) centralized control, require implementing proprietary algorithms, or cannot provide any guarantees regarding their runtime or communication overhead. To address these problems, we investigate the use of distributed constraint optimization (DCOP) in this context: We present a DCOP model built on freely available algorithms to distribute the problem among the agents that cooperate to solve it. Furthermore, we compare this decentralized approach to a centralized one by measuring the runtime in a set of system configurations with an increasing number of agents. While the DCOP approach works well in small system configurations, our results indicate poor scalability compared to the central approach when increasing the number of agents. We conclude that, although the DCOP approach has desirable properties, it is unsuitable for larger practical applications with dozens or hundreds of agents.
自适应制造系统任务分配的分布式约束优化
自适应制造系统由许多在不断变化的环境中协同工作的自主代理组成。因此,集体决定哪个代理执行什么任务是一个关键问题,并被广泛研究。然而,解决这个问题的许多方法都假定(部分地)集中控制,需要实现专有算法,或者不能提供有关其运行时或通信开销的任何保证。为了解决这些问题,我们研究了分布式约束优化(DCOP)在这种情况下的使用:我们提出了一个基于免费可用算法的DCOP模型,将问题分发给合作解决问题的代理。此外,我们通过测量一组具有越来越多代理的系统配置中的运行时间,将这种分散方法与集中式方法进行比较。虽然DCOP方法在小型系统配置中工作得很好,但我们的结果表明,当增加代理数量时,与中央方法相比,DCOP方法的可伸缩性较差。我们得出的结论是,尽管DCOP方法具有理想的特性,但它不适合具有数十或数百个代理的大型实际应用。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信