论文标题
LFC：在多代理编程比赛中结合自主代理和自动计划
LFC: Combining Autonomous Agents and Automated Planning in the Multi-Agent Programming Contest
论文作者
论文摘要
2019年的多代理编程大赛推出了一个新的场景，特工组装了，两个代理团队在2D网格中移动，并竞争组装复杂的块结构。在本文中，我们描述了团队所使用的策略，这些策略使我们在比赛中取得了第一名。我们的策略应对2019年竞赛中的一些主要挑战：当代理商只能获得当地愿景而没有全球坐标时，如何探索和建造地图；即使有动态事件可以改变网格中的单元格，即使如何有效地绕地图移动。以及如何组装和提交复杂的区块结构，因为对方团队可能会试图破坏我们。为了实施我们的策略，我们使用多代理系统开发平台JACAMO对代理和快速向下的计划者进行编程，以计划电网中代理的运动。我们还简要讨论了比赛中的比赛，并分析了我们的团队在每场比赛中的表现。
The 2019 Multi-Agent Programming Contest introduced a new scenario, Agents Assemble, where two teams of agents move around a 2D grid and compete to assemble complex block structures. In this paper, we describe the strategies used by our team that led us to achieve first place in the contest. Our strategies tackle some of the major challenges in the 2019 contest: how to explore and build a map when agents only have access to local vision and no global coordinates; how to move around the map efficiently even though there are dynamic events that can change the cells in the grid; and how to assemble and submit complex block structures given that the opposing team may try to sabotage us. To implement our strategies, we use the multi-agent systems development platform JaCaMo to program our agents and the Fast Downward planner to plan the movement of the agent in the grid. We also provide a brief discussion of our matches in the contest and give our analysis of how our team performed in each match.
