MLFC: From 10 to 50 Planners in the Multi-Agent Programming Contest
Rafael C. Cardoso, Angelo Ferrando, Fabio Papacchini, Matt Luckcuck,, Sven Linker, Terry R. Payne

TL;DR
This paper details the strategies and tools used by team MLFC to achieve second place in the Multi-Agent Programming Contest, highlighting new approaches for scaling and coordination in multi-agent systems.
Contribution
The paper introduces new strategies for map scaling, formal verification, plan caching, task coordination, and opponent disruption, advancing multi-agent contest tactics.
Findings
Achieved 2nd place in the contest
Developed scalable planning and verification methods
Enhanced agent coordination and disruption strategies
Abstract
In this paper, we describe the strategies used by our team, MLFC, that led us to achieve the 2nd place in the 15th edition of the Multi-Agent Programming Contest. The scenario used in the contest is an extension of the previous edition (14th) "Agents Assemble" wherein two teams of agents move around a 2D grid and compete to assemble complex block structures. We discuss the languages and tools used during the development of our team. Then, we summarise the main strategies that were carried over from our previous participation in the 14th edition and list the limitations (if any) of using these strategies in the latest contest edition. We also developed new strategies that were made specifically for the extended scenario: cartography (determining the size of the map); formal verification of the map merging protocol (to provide assurances that it works when increasing the number of…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsMulti-Agent Systems and Negotiation · Logic, Reasoning, and Knowledge · Auction Theory and Applications
