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.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Allen, J.F.: Maintaining Knowledge about Temporal Intervals. Communications of the ACM. 26, 832–843 (1983)
Calisti, M., Neagu, N.: Constraint Satisfaction Techniques and Software agents. In: Agents and Constraints Workshop, AIIA 2004, Perugia, Italy (2004)
Finin, T., Labrou, Y., Mayfield, J.: KQML as an Agent Communication Language. In: Bradshaw, J.M. (ed.) Software Agents, pp. 291–316. AAA/MIT Press, Cambridge, MA (1997)
JGraph (JGraph, 2006), http://www.jgraph.com/
JXTA (JXTA, 2006), http://www.jxta.org/
Liu, J., Jing, H., Tang, Y.: Multi-agent Oriented Constraint Satisfaction. Artificial Intelligence 136(1), 101–144 (2002)
Makoto Yokoo, M., Durfee, E., Ishida, T., Kuwabara, K.: The Distributed Constraint Satisfaction Problem: Formalization and Algorithms. IEEE Transaction on Knowledge and Data Engineering 10(5), 673–685 (1998)
Shakshuki, E., Trudel, A., Xu, Y.: A Multi-Agent Temporal Constraint Satisfaction System Based on Allen’s Interval Algebra and Probabilities. In: International Journal of Information Technology and Web Engineering (in press, 2007)
van Beek, P., Manchak, D.: The Design and Experimental Analysis of Algorithms for Temporal Reasoning. Journal of Artificial Intelligence Research, 1–18 (1996)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Trudel, A., Shakshuki, E., Xu, Y. (2007). A Probabilistic Multi-agent Scheduler Implemented in JXTA. In: Enokido, T., Barolli, L., Takizawa, M. (eds) Network-Based Information Systems. NBiS 2007. Lecture Notes in Computer Science, vol 4658. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-74573-0_26
Download citation
DOI: https://doi.org/10.1007/978-3-540-74573-0_26
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-74572-3
Online ISBN: 978-3-540-74573-0
eBook Packages: Computer ScienceComputer Science (R0)