Welcome to the InfoSci Platform
Reference Hub2
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, André Trudel, Yiqing Xu
Copyright: © 2007 |Volume: 2 |Issue: 2 |Pages: 20
ISSN: 1554-1045|EISSN: 1554-1053|ISSN: 1554-1045|EISBN13: 9781615203536|EISSN: 1554-1053|DOI: 10.4018/jitwe.2007040102
Cite Article Cite Article

MLA

Shakshuki, Elhadi, et al. "A Multi-Agent Temporal Constraint Satisfaction System Based on Allen's Interval Algebra and Probabilities." IJITWE vol.2, no.2 2007: pp.45-64. http://doi.org/10.4018/jitwe.2007040102

APA

Shakshuki, E., Trudel, A., & Xu, Y. (2007). A Multi-Agent Temporal Constraint Satisfaction System Based on Allen's Interval Algebra and Probabilities. International Journal of Information Technology and Web Engineering (IJITWE), 2(2), 45-64. http://doi.org/10.4018/jitwe.2007040102

Chicago

Shakshuki, Elhadi, André Trudel, and Yiqing Xu. "A Multi-Agent Temporal Constraint Satisfaction System Based on Allen's Interval Algebra and Probabilities," International Journal of Information Technology and Web Engineering (IJITWE) 2, no.2: 45-64. http://doi.org/10.4018/jitwe.2007040102

Export Reference

Mendeley
Favorite Full-Issue Download

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.

Request Access

You do not own this content. Please login to recommend this title to your institution's librarian or purchase it from the IGI Global bookstore.