A Multi-Agent Temporal Constraint Satisfaction System Based on Allen's Interval Algebra and Probabilities

A Multi-Agent Temporal Constraint Satisfaction System Based on Allen's Interval Algebra and Probabilities

Elhadi Shakshuki (Acadia University, Canada), André Trudel (Acadia University, Canada) and Yiqing Xu (Acadia University, Canada)
Copyright: © 2007 |Pages: 20
DOI: 10.4018/jitwe.2007040102
OnDemand PDF Download:
Available
$37.50
Current Special Offers
No Current Special Offers
TOTAL SAVINGS: $37.50

Abstract

We present a multi-agent distributed temporal scheduling system based on probabilistic Interval Algebra networks (i.e., PIA networks). The overall goal is to make each agent’s network consistent and optimal. Each agent is independent and has sole control over its network. But, it must communicate and coordinate with other agents when modifying or updating shared edges. We present an algorithm which allows the agents to collaboratively solve and recommend a temporal schedule. At the agent level, this schedule is optimal under the given local constraints. Although the global solution may not be optimal, we try to generate near optimal ones. Note that our distributed system is not centrally controlled. We use our system to solve scheduling problems from a university problem domain. We also describe the implementation of our proposed system which uses Java, JXTA, and JGraph.

Complete Article List

Search this Journal:
Reset
Open Access Articles: Forthcoming
Volume 16: 4 Issues (2021): Forthcoming, Available for Pre-Order
Volume 15: 4 Issues (2020)
Volume 14: 4 Issues (2019)
Volume 13: 4 Issues (2018)
Volume 12: 4 Issues (2017)
Volume 11: 4 Issues (2016)
Volume 10: 4 Issues (2015)
Volume 9: 4 Issues (2014)
Volume 8: 4 Issues (2013)
Volume 7: 4 Issues (2012)
Volume 6: 4 Issues (2011)
Volume 5: 4 Issues (2010)
Volume 4: 4 Issues (2009)
Volume 3: 4 Issues (2008)
Volume 2: 4 Issues (2007)
Volume 1: 4 Issues (2006)
View Complete Journal Contents Listing