Advertisement

Investigating strategies for cooperative planning of independent agents through prototype evaluation

  • E. -E. Doberkat
  • W. Hasselbring
  • C. Pahl
Short Papers
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1061)

Abstract

This paper discusses the application of the prototyping approach to investigating the requirements on strategies for cooperative planning and conflict resolution of independent agents by means of an example application: the strategic game “Scotland Yard”. The strategies for coordinating the agents, which are parallel algorithms, are developed with a prototyping approach using ProSet-Linda. ProSet-Linda is designed for prototyping parallel algorithms.

We concentrate on the techniques employed to elicit the requirements on the algorithms for agent interaction. The example application serves to illustrate the prototyping approach to requirements elicitation by means of a non-trivial instance for investigating algorithms for cooperative planning and conflict resolution.

Keywords

Graphical User Interface Parallel Algorithm Conflict Resolution Planning Algorithm Strategic Game 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    W. Becker and A. Zell. Cooperative planing of independent agents. Technical Report 5/91, University of Stuttgart, IPVR, Stuttgart, Germany, 1991.Google Scholar
  2. 2.
    E.-E. Doberkat, W. Hasselbring, and C. Pahl. Investigating strategies for cooperative planning of independent agents through prototype evaluation. Software-Technologie Memo Nr. 86, University of Dortmund, Dept. of Computer Science, Dortmund, Germany, December 1995.Google Scholar
  3. 3.
    D. Gelernter. Generative communication in Linda. ACM Transactions on Programming Languages and Systems, 7(1):80–112, January 1985.Google Scholar
  4. 4.
    R.H. Halstead. Multilisp: A language for concurrent symbolic computation. ACM Transactions on Programming Languages and Systems, 7(4):501–538, October 1985.Google Scholar
  5. 5.
    W. Hasselbring. Prototyping Parallel Algorithms in a Set-Oriented Language. Dissertation (University of Dortmund, Dept. Computer Science). Verlag Dr. Kovač, Hamburg, 1994.Google Scholar
  6. 6.
    J.K. Ousterhout. Tcl and the Tk Toolkit. Addison-Wesley Publishing, 1994.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1996

Authors and Affiliations

  • E. -E. Doberkat
    • 1
  • W. Hasselbring
    • 1
  • C. Pahl
    • 1
  1. 1.Informatik 10 (Software Technology)University of DortmundDortmundGermany

Personalised recommendations