Conflict resolving negotiation for COoperative Schedule Management Agents (COSMA)

A five component negotiation model which structures the interaction of agents along different levels of increasing complexity is investigated: The lowest level introduces the possible message types. The protocol level links those messages together to create communicational contexts. The decision layer needs some criteria to rank and compare different scheduling proposals. The usage of those criteria implements the negotiation strategy of the strategic level. As an outline we sketch how a cooperation level emerges within the agent society and enforces cooperative behavior of the agents. The model is presented at the problem of appointment scheduling, because it is an inherently distributed problem which necessarily involves communication, negotiation, and cooperation mechanisms to resolve possible conflicts. COSMA agents (COoperative Schedule Management Agents) are designed to act as personal assistants to maintain their user's calendar. They are provided with competence to negotiate about the scheduling of appointments with other users. After describing the message types, the negotiation protocol is presented. The decision criteria are derived from a time model based on the association of time intervals and preferences. The negotiation strategies are guided by a local time file, the priority of a meeting and the results of earlier negotiations, which is encoded in a simple partner model maintained by the agents. An example finally shows the overall behavior of the agent society and will reveal and answer several questions about the technical details.

[1]  Jana Koehler,et al.  Planning from second principles : a logic-based approach , 1994 .

[2]  Friedemann Mattern,et al.  An automatic distributed calendar and appointment system , 1989, Microprocessing and Microprogramming.

[3]  Rainer Hoch,et al.  On virtual partitioning of large dictionaries for contextual post-processing to improve character recognition , 1993, Proceedings of 2nd International Conference on Document Analysis and Recognition (ICDAR '93).

[4]  Winfried Graf,et al.  Using graphical style and visibility constraints for a meaningful layout in visual programming interfaces , 1994 .

[5]  Gert Smolka.  A Foundation for Higher-order Concurrent Constraint Programming , 1994, CCL.

[6]  Mathias Bauer,et al.  Logic-based Plan Recognition for Intelligent Help Systems , 1994, PuK.

[7]  Harold Boley,et al.  Towards a sharable knowledge base on recyclable plastics , 1994 .

[8]  Knut Hinkelmann.  A consequence-finding approach for feature recognition in CAPP , 1994, IEA/AIE '94.

[9]  David R. Traum,et al.  CONVERSATION ACTS IN TASK‐ORIENTED SPOKEN DIALOGUE , 1992, Comput. Intell..

[10]  Klaus Schild,et al.  Terminological Cycles and the Propositional µ-Calculus , 1994, KR.

[11]  Stephen P. Spackman,et al.  Abductive speech act recognition, corporate agents and the COSMA system , 1993 .

[12]  Harold Boley,et al.  Finite Domains and Exclusions as First-Class Citizens , 1993, ELP.

[13]  Wolfgang Wahlster,et al.  Verbmobil: Translation of Face-To-Face Dialogs , 1993, MTSUMMIT.

[14]  Franz Schmalhofer,et al.  Beyond the Knowledge Level: Descriptions of Rational Behavior for Sharing and Reuse , 1994, EKAW.

[15]  Otto Kühn,et al.  Conserving corporate knowledge for crankshaft design , 1994, IEA/AIE '94.

[16]  Knut Hinkelmann,et al.  Computing Cost Estimates for Proof Strategies , 1993, ELP.

[17]  Stephan Baumann.  Document recognition of printed scores and transformation into MIDI , 1993 .

[18]  Douglas E. Appelt,et al.  Planning English Sentences , 1988, Cogn. Sci..

[19]  Michael Sintek,et al.  RELFUN guide : programming with relations and functions made easy , 1993 .

[20]  Ralf Treinen,et al.  Ordering Constraints on Trees , 1994, CAAP.

[21]  N. Kuhn,et al.  Simulating Cooperative Transportation Companies , 1994 .

[22]  Bernhard Nebel,et al.  Plan Reuse Versus Plan Generation: A Theoretical and Empirical Analysis , 1995, Artif. Intell..