Here - Agents Lab - University of Nottingham

Recommendations

Info

ather we have started to see a race to supply more processor elements in mainstreammulti-core CPU architectures coming from Intel and AMD. Initially, thesoftware industry has been slow in reacting to this fundamental hardware change,but today, utilising multiple cores is the only way to improve software systemperformance. With traditional programming languages (such as Java, C, C++,etc.) writing bug-free concurrent code is hard, and the complexity grows quicklywith the number of parallel tasks. As a result, alternative languages, with lesserror-prone concurrency primitives, are attracting more attention.Following this trend, the Erlang programming language [3, 10] is gaining momentum.The usage has increased, and among the users are large organisationslike Facebook, Amazon, Yahoo!, T-Mobile, Motorola, and Ericsson. The mostprominent reasons for the increased popularity of Erlang are lightweight concurrencybased on the actor model, the powerful handling of fault tolerance,the transparent distribution mechanisms, the generic OTP design patterns, andthe fact that the language has functional programming roots leading to a small,clean code base.In this paper we report on our experience translating the Jason programminglanguage to Erlang. The similarities between Jason and Erlang – both areinspired by Prolog, both support asynchronous communication among computationalindependent entities (agents/processes) – make the translation ratherstraightforward. By implementing Jason in Erlang we offer the possibility toErlang programmers of using an agent-oriented programming language like Jasonintegrated in Erlang. To Jason programmers, the approach gives them thepossibility of executing their code in the Erlang runtime system, which is particularlyappropriate for running robust multiagent systems with a large numberof concurrent and distributed agents.Moreover, as the syntax of Erlang is inspired by Prolog 1 , e.g., having atomsbeginning with a lowercase letter, and single-assignment variables beginning withan uppercase letter, etc., we hope to reduce the conceptual gap for a Jasonprogrammer interested in modifying the Jason meta-level (e.g., changing theselector functions, and implementing actions) by adopting Erlang, compared tohaving to use Java. Perhaps even more interesting is the potential for introducingErlang programmers to the world of BDI programming through this new Jasonimplementation. This is a group of programmers already used to thinking ofprogramming systems composed of independent communicating agents (or inthe terminology of Erlang, processes), and superficially familiar with the syntaxof Jason. To us it appears that the conceptual gap between programming agentsin Jason, and functions and processes in Erlang, is smaller than for many otherprogramming languages (Java).A prototype of the implementation of Jason in Erlang is available atgit : //github.com/avalor/eJason.gitThe rest of the paper is organized as follows. Before explaining the translation,the main characteristics of Erlang are briefly described in Sect. 2. Then,1 Not surprisingly, as the first implementation of Erlang was written in NU Prolog [4]8
Page 2 and 3: Proceedings of the Tenth Internatio
Page 4 and 5: OrganisationOrganising CommitteeMeh
Page 6: Table of ContentseJason: an impleme
Page 11 and 12: Node 1registryNode 2registryProc BP
Page 13 and 14: ERESYE [15] (ERlang Expert SYstem E
Page 15 and 16: execute the formulas in its body is
Page 17 and 18: The communication between agents is
Page 19 and 20: This record is updated during the e
Page 21 and 22: Number of Jason eJasonAgents Execut
Page 23 and 24: 8. Rafael H. Bordini, Michael Fishe
Page 25 and 26: Fig. 1. Motivating scenarioFrom a d
Page 27 and 28: Fig. 3. Web Publishingmodel that ac
Page 29 and 30: REST methods is not directly possib
Page 31 and 32: an interface that on the one hand m
Page 33 and 34: 01: public interface IBankingServic
Page 35 and 36: 01: public interface IGeoIPService
Page 37 and 38: Fig. 11. Chart application screensh
Page 39: References1. L. Baduel, F. Baude, D
Page 43 and 44: - When NAO wants to press a button,
Page 45 and 46: human-like intelligent behavior and
Page 47 and 48: utilized to provide solutions for d
Page 49 and 50: esearch. For example Buford et al.
Page 51 and 52: - Supporting both blocking and non-
Page 53 and 54: which different NAO’s movement ca
Page 55 and 56: 25. Orocos Real-Time Toolkit, http:
Page 57 and 58:
data or to perform some low-level t
Page 59 and 60:
localization, path planning and oth
Page 61 and 62:
- Memory, for maintaining the globa
Page 63 and 64:
top-down scheme is followed. At eac
Page 65 and 66:
The cognitive layer realized by an
Page 67 and 68:
Fig. 5. The deliberative reasoning
Page 69 and 70:
19. Baillie, J.C.: Urbi: Towards a
Page 71 and 72:
However, while having multiple opti
Page 73 and 74:
[10], distributed middleware [11],
Page 75 and 76:
include both container and life cyc
Page 77 and 78:
GoalLocalization(?Agent) : true ←
Page 79 and 80:
the LaserLocalization if the first
Page 81:
Specifically, the PEIS tuplespace i
Page 84 and 85:
Fig. 5. PEIS Connectivity Graph Vis
Page 86 and 87:
Evaluation of a Conversation Manage
Page 88 and 89:
to ensure that messages that form p
Page 90 and 91:
Without ACRE, messages are dealt wi
Page 92 and 93:
Fig. 3. The broker.buy protocolThe
Page 94 and 95:
attend the evaluation, leaving 45 s
Page 96 and 97:
- Hard-coded name checking (Name):
Page 98 and 99:
Table 3. Issues present in non-ACRE
Page 100 and 101:
present in a number of plans so tha
Page 102 and 103:
Compact and Efficient Agent Messagi
Page 104 and 105:
intranets. It is important for such
Page 106 and 107:
Nevertheless, as demonstrated by Ja
Page 108 and 109:
4.2 Boolean ValuesAt first glance,
Page 110 and 111:
4.5 Complex ObjectsComplex objects
Page 112 and 113:
steps of 10000 up to 100000 objects
Page 114 and 115:
Content Size160000140000136743Sizes
Page 116 and 117:
educing the overhead of Jadex Binar
Page 118 and 119:
Query Caching in Agent Programming
Page 120 and 121:
actions in 2APL), or external actio
Page 122 and 123:
intentions and plans that can be vi
Page 124 and 125:
epresentative of the query and upda
Page 126 and 127:
update cycle U, and the average cos
Page 128 and 129:
A second observation that follows c
Page 130 and 131:
cycle, the larger the expected effi
Page 132 and 133:
10. JIProlog. http://www.ugosweb.co
Page 134 and 135:
CArtAgO [13]. On the other side, it
Page 136 and 137:
example, the wrong goal self-assign
Page 138 and 139:
1 role Thermostat {23 task AchieveT
Page 140 and 141:
1 agent - script ACMEThermostat imp
Page 142 and 143:
would report an error message about
Page 144 and 145:
1 artifact ACMEConditioner implemen
Page 146 and 147:
1 org - model SmartHome {23 roles :
Page 148 and 149:
for eventually refining and enrichi
Page 150 and 151:
for adaptive behaviours remains the
Page 152 and 153:
chooses an action a ∈ A s that ca
Page 154 and 155:
entirely new rules from sample solu
Page 156 and 157:
section of the module indicates tha
Page 158 and 159:
5 ExperimentsHere we describe the B
Page 160 and 161:
OriginalAdaptive10410 210 1(a) Prog
Page 162 and 163:
very much tied to the problem at ha
Page 164 and 165:
14. Džeroski, S., Raedt, L.D., Dri
show all

Here - Agents Lab - University of Nottingham

You also want an ePaper? Increase the reach of your titles

Delete template?

Save as template?