Building multi-agent systems using Jason

We provide a detailed description of the Jason -DTU system, including the used methodology, tools as well as team strategy. We also discuss the experience gathered in the contest. In spring 2009 the course “Artificial Intelligence and Multi-Agent Systems” was held for the first time on the Technical...

Full description

Saved in:
Bibliographic Details
Published in:Annals of mathematics and artificial intelligence Vol. 59; no. 3-4; pp. 373 - 388
Main Authors: Boss, Niklas Skamriis, Jensen, Andreas Schmidt, Villadsen, Jørgen
Format: Journal Article
Language:English
Published: Dordrecht Springer Netherlands 01.08.2010
Springer Nature B.V
Subjects:
Agents (artificial intelligence)
Artificial Intelligence
Complex Systems
Computer programming
Computer Science
Expert systems
Mathematical analysis
Mathematics
Miners
Multiagent systems
Programming languages
Software agents
Springs
Strategy
68T42
68T20
68T27
AgentSpeak
Jason
68T30
Multi-agent programming contest
Multi-agent systems
ISSN:1012-2443, 1573-7470
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:We provide a detailed description of the Jason -DTU system, including the used methodology, tools as well as team strategy. We also discuss the experience gathered in the contest. In spring 2009 the course “Artificial Intelligence and Multi-Agent Systems” was held for the first time on the Technical University of Denmark (DTU). A part of this course was a short introduction to the multi-agent framework Jason , which is an interpreter for AgentSpeak, an agent-oriented programming language. As the final project in this course a solution to the Multi-Agent Programming Contest from 2007, the Gold Miners scenario, was implemented. Finally we decided to participate in this year’s contest with an implementation made in Jason as well.
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ObjectType-Article-2
ObjectType-Feature-1
content type line 23
ISSN:1012-2443
1573-7470
DOI:10.1007/s10472-010-9181-2