Reaching New Heights in Multi-Agent Collective Construction

Martin Rameš, Pavel Surynek
{"title":"Reaching New Heights in Multi-Agent Collective Construction","authors":"Martin Rameš, Pavel Surynek","doi":"arxiv-2408.13615","DOIUrl":null,"url":null,"abstract":"We propose a new approach for multi-agent collective construction, based on\nthe idea of reversible ramps. Our ReRamp algorithm utilizes reversible\nside-ramps to generate construction plans for ramped block structures higher\nand larger than was previously possible using state-of-the-art planning\nalgorithms, given the same building area. We compare the ReRamp algorithm to\nsimilar state-of-the-art algorithms on a set of benchmark instances, where we\ndemonstrate its superior computational speed. We also establish in our\nexperiments that the ReRamp algorithm is capable of generating plans for a\nsingle-story house, an important milestone on the road to real-world\nmulti-agent construction applications.","PeriodicalId":501315,"journal":{"name":"arXiv - CS - Multiagent Systems","volume":"34 1","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2024-08-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"arXiv - CS - Multiagent Systems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/arxiv-2408.13615","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

We propose a new approach for multi-agent collective construction, based on the idea of reversible ramps. Our ReRamp algorithm utilizes reversible side-ramps to generate construction plans for ramped block structures higher and larger than was previously possible using state-of-the-art planning algorithms, given the same building area. We compare the ReRamp algorithm to similar state-of-the-art algorithms on a set of benchmark instances, where we demonstrate its superior computational speed. We also establish in our experiments that the ReRamp algorithm is capable of generating plans for a single-story house, an important milestone on the road to real-world multi-agent construction applications.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
达到多代理集体建设的新高度
我们基于可逆坡道的理念,提出了一种新的多机器人集体施工方法。在建筑面积相同的情况下,我们的 ReRamp 算法利用可逆侧斜坡生成斜坡块结构的施工计划,比以前使用最先进的规划算法生成的计划更高、更大。我们在一组基准实例上将 ReRamp 算法与最先进的同类算法进行了比较,结果表明 ReRamp 算法的计算速度更胜一筹。我们还在实验中证实,ReRamp 算法能够生成单层房屋的规划,这是通往真实世界多智能体建筑应用道路上的一个重要里程碑。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Putting Data at the Centre of Offline Multi-Agent Reinforcement Learning HARP: Human-Assisted Regrouping with Permutation Invariant Critic for Multi-Agent Reinforcement Learning On-policy Actor-Critic Reinforcement Learning for Multi-UAV Exploration CORE-Bench: Fostering the Credibility of Published Research Through a Computational Reproducibility Agent Benchmark Multi-agent Path Finding in Continuous Environment
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1