Högskolan i Skövde

his.sePublications
Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • apa-cv
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Coordination Among Agents Using Reactive Rules
University of Skövde, Department of Computer Science.ORCID iD: 0000-0001-8362-3825
University of Florida, Gainsville, USA.
University of Exeter, UK.
1996 (English)Report (Other academic)
Abstract [en]

Coordination and collaboration are naturally used by groups for carrying out activities and solving problems that require cooperation. However, getting a set of computer agents to do that same has been a problem -- primarily addressed by the AI community and recently by the database community as workflow and process management problems (e.g. in business processes, electronic commerce, logistics).

Not surprisingly, the problem has been addressed at different levels of abstraction by the two communities. Coordination protocols (both static and dynamic) as well as task and result sharing have been investigated by the AI community; system level support as well as specification and execution of relaxed notions of transaction (sometimes termed an activity) have been addressed by the database community. It is evident that combining the two will provide an effective unified solution for a class of problems that require cooperation. This paper classifies problems addressed in the AI and database literature according to degree of coordination and collaboration. It reports on work done by the authors in utilising the reactive paradigm to synthesize, from the yechniques in these areas, a common framework for the support of multi-agent problem solving, workflow, and process management. In addition to resolving the terminology used by different groups, task sharing is used to demonstrate the approach described. It is accomplished by creating either static or dynamic plans that are coordinated by ECA rules -- both pre-defined and dynamically created. The paper details the applicability of ECA rules in this domain, their adequacy, and a prototype implementation.

Place, publisher, year, edition, pages
Skövde: University of Skövde , 1996. , p. 23
Series
IDA Technical Reports ; HS-IDA-TR-96-011
National Category
Information Systems
Identifiers
URN: urn:nbn:se:his:diva-1170OAI: oai:DiVA.org:his-1170DiVA, id: diva2:2296
Note

HS-IDA-TR-96-011

Available from: 2008-06-17 Created: 2008-06-17 Last updated: 2023-06-16Bibliographically approved

Open Access in DiVA

No full text in DiVA

Other links

Fulltext

Authority records

Berndtsson, MikaelLings, Brian

Search in DiVA

By author/editor
Berndtsson, MikaelLings, Brian
By organisation
Department of Computer Science
Information Systems

Search outside of DiVA

GoogleGoogle Scholar

urn-nbn

Altmetric score

urn-nbn
Total: 1241 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • apa-cv
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf