IDEAS home Printed from https://ideas.repec.org/a/igg/jitwe0/v2y2007i2p45-64.html
   My bibliography  Save this article

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

Author

Listed:
  • Elhadi Shakshuki

    (Acadia University, Canada)

  • André Trudel

    (Acadia University, Canada)

  • Yiqing Xu

    (Acadia University, Canada)

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.

Suggested Citation

  • Elhadi Shakshuki & André Trudel & Yiqing Xu, 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), IGI Global, vol. 2(2), pages 45-64, April.
  • Handle: RePEc:igg:jitwe0:v:2:y:2007:i:2:p:45-64
    as

    Download full text from publisher

    File URL: http://services.igi-global.com/resolvedoi/resolve.aspx?doi=10.4018/jitwe.2007040102
    Download Restriction: no
    ---><---

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Jamal Bentahar & Jihad Labban, 2011. "An Argumentation-Driven Model for Flexible and Efficient Persuasive Negotiation," Group Decision and Negotiation, Springer, vol. 20(4), pages 411-435, July.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:igg:jitwe0:v:2:y:2007:i:2:p:45-64. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Journal Editor (email available below). General contact details of provider: https://www.igi-global.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.