A probabilistic multi-agent scheduler implemented in JXTA

Authors:
André Trudel;Elhadi Shakshuki;Yiqing Xu
Affiliations:
Jodrey School of Computer Science, Acadia University, Wolfville, NS, Canada;Jodrey School of Computer Science, Acadia University, Wolfville, NS, Canada;Jodrey School of Computer Science, Acadia University, Wolfville, NS, Canada
Venue:
NBiS'07 Proceedings of the 1st international conference on Network-based information systems
Year:
2007

Citing 5
Cited 0

KQML as an agent communication language

Software agents
Maintaining knowledge about temporal intervals

Communications of the ACM
Multi-agent oriented constraint satisfaction

Artificial Intelligence
The Distributed Constraint Satisfaction Problem: Formalization and Algorithms

IEEE Transactions on Knowledge and Data Engineering
The design and experimental analysis of algorithms for temporal reasoning

Journal of Artificial Intelligence Research

Quantified Score

Hi-index	0.00

Visualization

Abstract

Multi-agent technology and constraint satisfaction techniques can be effectively combined and utilized to solve many real-world problems. This paper presents a multi-agent system based on Probabilistic Interval Algebra (PIA) networks to solve distributed scheduling problems. An IA network is a graph where nodes represent intervals and directed edges are labelled with temporal interval relations. A PIA network has probabilities associated with the relations on the edges that are used to capture preferences. The proposed multi-agent system consists of PIA-Agents that are connected via edges to form a network. Each PIA-Agent has ownership and control over a PIA network. A prototype is implemented using JXTA and demonstrated on a university domain to show how the PIA-Agents work together and coordinate their activities to recommend a temporal schedule which is a globally consistent solution which attempts to maximize the desires of each individual PIA-Agent.