• français
    • English
  • English 
    • français
    • English
  • Login
JavaScript is disabled for your browser. Some features of this site may not work without it.
BIRD Home

Browse

This CollectionBy Issue DateAuthorsTitlesSubjectsJournals BIRDResearch centres & CollectionsBy Issue DateAuthorsTitlesSubjectsJournals

My Account

Login

Statistics

View Usage Statistics

A Coordination Algorithm for Multi-Agent Planning

Thumbnail
View/Open
coordination_haddad.PDF (178.1Kb)
Date
1996
Collection title
Lecture Notes in Computer Science
Collection Id
1038
Dewey
Intelligence artificielle
Sujet
Plan Interactions; Coordination; Distributed Planning; Multi-Agent Systems
DOI
http://dx.doi.org/10.1007/BFb0031848
Conference name
Modelling Autonomous Agents in a Multi-Agent World (MAAMAW 1996)
Conference date
01-1996
Conference city
Eindhoven
Conference country
Pays-Bas
Book title
Agents Breaking Away 7th European Workshop on Modelling Autonomous Agents in a Multi-Agent World, MAAMAW '96, Eindhoven, The Netherlands, January 22 - 25, 1996. Proceedings
Author
Perram, John; Velde, Walter van de
Publisher
Springer
Publisher city
Berlin
Year
1996
Pages number
232
ISBN
978-3-540-60852-3
Book URL
http://dx.doi.org/10.1007/BFb0031841
URI
https://basepub.dauphine.fr/handle/123456789/5752
Collections
  • LAMSADE : Publications
Metadata
Show full item record
Author
El Fallah Seghrouchni, Amal
Haddad, Serge
Type
Communication / Conférence
Item number of pages
86-99
Abstract (EN)
One of the major interests of Multi-Agent Systems (MAS), which are able to handle distributed planning, is coordination. This coordination requires both an adequate plan representation and efficient interacting methods between agents. Interactions are based on information exchange (e.g. data, partial or global plan) and allow agents to update their own plans by including the exchanged information. Coordination generally produces two effects: it cancels negative interactions (e.g. resource sharing) and it takes advantage of helpful ones (e.g. handling redundant actions). A coordination model should satisfy the following requirements: domain independence, broad covering of interacting situations, operational coordination semantics and natural expression for the designer. This paper presents an adequate framework for the representation and handling of plans in MAS. It then shows how an approach based on a plan representation by means of a partial order model enables the definition of a coordination algorithm for the possible enrichment of plans.

  • Accueil Bibliothèque
  • Site de l'Université Paris-Dauphine
  • Contact
SCD Paris Dauphine - Place du Maréchal de Lattre de Tassigny 75775 Paris Cedex 16

 Content on this site is licensed under a Creative Commons 2.0 France (CC BY-NC-ND 2.0) license.