Abstract
In the growing area of multi-agent-systems (MAS) also the diversity of the types of agents within these systems grows. Agent designers can no longer hard-code all possible interaction situations into their software, because there are many types of agents to be encountered. Thus, agents have to adapt their behavior online depending on the encountered agents. This paper proposes that agent behavior can be classified by distinct and stable tactical moves, called features, on different levels of granularity. The classification is used to select appropriate counter-strategies. While the overall framework is aimed to be applicable in a wide range of domains, the feature-representation in the case-base and the counter-strategies is done in a domain-specific language. In the RoboCup domain the standard coach-language is used. The approach has been successfully evaluated in a number of experiments.
Chapter PDF
Similar content being viewed by others
Keywords
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.
References
Buttinger, S., Diedrich, M., Hennig, L., Hoenemann, A., Huegelmeyer, P., Nie, A., Pegam, A., Rogowski, C., Rollinger, C., Steffens, T., Teiken, W.: The Dirty Dozen Team and Coach Description. In: Birk, A., Coradeschi, S., Tadokoro, S. (eds.) RoboCup 2001. LNCS (LNAI), vol. 2377, p. 543. Springer, Heidelberg (2002)
Calder, R.B., Smith, J.E., Courtemarche, A.J., Mar, J.M.F., Ceranowicz, A.Z.: Modsaf behavior simulation and control. In: Proceedings of the 2nd Conference on Computer Generated Forces and Behavioral Representation, STRICOM-DMSO (1993)
Carmel, D., Markovitch, S.: Incorporating Opponent Models into Adversary Search. In: Proceedings of the Thirteenth National Conference on Artificial Intelligence, AAAI Press, Portland (1996)
Kaminka, G., Pynadath, D.V., Tambe, M.: Monitoring Deployed Agent Teams. In: Proceedings of the Fifth International Conference on Autonomous Agents (Agents 2001), Montreal, Canada (2001)
Kautz, A., Allen, F.: Generalized plan recognition. In: Proceedings of the National Conference on Artificial Intelligence, pp. 32–37. AAAI Press, Menlo Park (1986)
Chen, M., Foroughi, E., Heintz, F., Huang, Z.X., Kapetanakis, S., Kostiadis, K., Kummeneje, J., Noda, I., Obst, O., Riley, P., Steffens, T., Wang, Y., Yin, X.: Soccerserver Manual v7. RoboCup Federation (2001)
Riley, P., Veloso, M.: On Behavior Classification in Adversarial Environments. In: Parker, L.E., Bekey, G., Barhen, J. (eds.) Distributed Autonomous Robotic Systems 4, pp. 371–380. Springer, Heidelberg (2000)
Riley, P., Veloso, M.: Planning for distributed execution through use of probabilistic opponent models. In: Proceedings of the IJCAI 2001 Workshop PRO-2: Planning under Uncertainty and Incomplete Information (2001)
Steffens, T.: Feature-based Declarative Opponent-Modelling in Multi-Agent-Systems. Master thesis, University of Osnabrueck (2002)
Tambe, M., Rosenbloom, P.S.: Architectures for Agents that Track Other Agents in Multi-Agent Worlds. In: Wooldridge, M., Mueller, J.P., Tambe, M. (eds.) Proceedings on the IJCAI Workshop on Intelligent Agents II: Agent Theories, Architectures, and Languages, pp. 156–170. Springer, Heidelberg (1996)
Tversky, A.: Features of similarity. Psych. Review 84(4), 327–352 (1977)
Viola, P.: Complex feature recognition: A bayesian approach for learning to recognize objects. Technical report AIM-1591, AI Lab, MIT, 11 (1996)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Steffens, T. (2004). Feature-Based Declarative Opponent-Modelling. In: Polani, D., Browning, B., Bonarini, A., Yoshida, K. (eds) RoboCup 2003: Robot Soccer World Cup VII. RoboCup 2003. Lecture Notes in Computer Science(), vol 3020. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-25940-4_11
Download citation
DOI: https://doi.org/10.1007/978-3-540-25940-4_11
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-22443-3
Online ISBN: 978-3-540-25940-4
eBook Packages: Springer Book Archive