28,371 research outputs found
Multi-Agent Programming Contest 2011 - The Python-DTU Team
We provide a brief description of the Python-DTU system, including the
overall design, the tools and the algorithms that we plan to use in the agent
contest.Comment: 4 page
Multi-Agent Programming Contest 2010 - The Jason-DTU Team
We provide a brief description of the Jason-DTU system, including the
methodology, the tools and the team strategy that we plan to use in the agent
contest.Comment: 4 page
The Multi-Agent Programming Contest: A r\'esum\'e
The Multi-Agent Programming Contest, MAPC, is an annual event organized since
2005 out of Clausthal University of Technology. Its aim is to investigate the
potential of using decentralized, autonomously acting intelligent agents, by
providing a complex scenario to be solved in a competitive environment. For
this we need suitable benchmarks where agent-based systems can shine. We
present previous editions of the contest and also its current scenario and
results from its use in the 2019 MAPC with a special focus on its suitability.
We conclude with lessons learned over the years.Comment: Submitted to the proceedings of the Multi-Agent Programming Contest
2019, to appear in Springer Lect. Notes Computer Challenges Series
https://www.springer.com/series/1652
Multi-Agent Programming Contest 2012 - The Python-DTU Team
We provide a brief description of the Python-DTU system, including the
overall design, the tools and the algorithms that we plan to use in the agent
contest.Comment: 4 pages. arXiv admin note: text overlap with arXiv:1110.010
GOAL-DTU: Development of Distributed Intelligence for the Multi-Agent Programming Contest
We provide a brief description of the GOAL-DTU system for the agent contest,
including the overall strategy and how the system is designed to apply this
strategy. Our agents are implemented using the GOAL programming language. We
evaluate the performance of our agents for the contest, and finally also
discuss how to improve the system based on analysis of its strengths and
weaknesses.Comment: 28 pages, 45 figure
Formal Verification of a Map Merging Protocol in the Multi-Agent Programming Contest
Communication is a critical part of enabling multi-agent systems to cooperate. This means that applying formal methods to protocols governing communication within multi-agent systems provides useful confidence in its reliability. In this paper, we describe the formal verification of a complex communication protocol that coordinates agents merging maps of their environment. The protocol was used by the LFC team in the 2019 edition of the Multi-Agent Programming Contest (MAPC). Our specification of the protocol is written in Communicating Sequential Processes (CSP), which is a well-suited approach to specifying agent communication protocols due to its focus on concurrent communicating systems. We validate the specification's behaviour using scenarios where the correct behaviour is known, and verify that eventually all the maps have merged
- …