Improving observation-based modeling of other agents using tentative stereotyping and compactification through kd-tree structuring

In this paper, we propose two improvements to modeling other agents based on Observed Situation-Action Pairs and the Nearest Neighbor Rule --reevaluative stereotyping with switching and compactification of observations through kd-tree structuring and the Pseudo-Approximate Nearest Neighbor search. On the one hand, tentative stereotype models allow for good predictions of a modeled agent's behavior even after few observations. Periodic reevaluations of the chosen stereotype and of the stereotyping process itself, in addition to the potential for switching between different stereotypes or to the observation based model aids in dealing with very similar but not identical stereotypes and agents that do not conform to any stereotype. On the other hand, reducing comparisons for the Nearest Neighbor Rule by observation compactification keeps the application of the model efficient even after many observations have been made. Our experiments show that tentative stereotyping significantly improves cases in which the original method performs badly and that reevaluations and switching fortify stereotyping against the potential risk of using an incorrect stereotype. For compactification, our experiments show that using the kd-tree for compactifying observations and the Pseudo-Approximate Nearest Neighbor search for retrieving a Nearest Neighbor improves modeling efficiency when observations are abundant, but is sometimes coupled with a loss of accuracy.

[1]  Jörg Denzinger,et al.  On Customizing Evolutionary Learning of Agent Behavior , 2004, Canadian Conference on AI.

[2]  Sandra Carberry,et al.  Techniques for Plan Recognition , 2001, User Modeling and User-Adapted Interaction.

[3]  Jon Louis Bentley,et al.  An Algorithm for Finding Best Matches in Logarithmic Expected Time , 1977, TOMS.

[4]  Manuela M. Veloso,et al.  On Behavior Classification in Adversarial Environments , 2000, DARS.

[5]  Tony R. Martinez,et al.  Reduction Techniques for Instance-Based Learning Algorithms , 2000, Machine Learning.

[6]  Victor R. Lesser,et al.  Learning Situation-Specific Coordination in Cooperative Multi-agent Systems , 1999, Autonomous Agents and Multi-Agent Systems.

[7]  Piotr J. Gmytrasiewicz,et al.  Learning models of other agents using influence diagrams , 1999 .

[8]  Boris Kerkez,et al.  Incremental Case-Based Plan Recognition Using State Indices , 2001, ICCBR.

[9]  M. Benda,et al.  On Optimal Cooperation of Knowledge Sources , 1985 .

[10]  David J. Schneider,et al.  The Psychology of Stereotyping , 2003 .

[11]  Jasmine Hamdan,et al.  Improving modeling of other agents using tentative stereotypes and compactification of observations , 2004 .

[12]  David Carmel,et al.  Opponent Modeling in Multi-Agent Systems , 1995, Adaption and Learning in Multi-Agent Systems.

[13]  Edmund H. Durfee,et al.  Deciding When to Commit to Action During Observation-Based Coordination , 1995, ICMAS.

[14]  Jörg Denzinger,et al.  Evolutionary online learning of cooperative behavior with situation-action pairs , 2000, Proceedings Fourth International Conference on MultiAgent Systems.

[15]  C. Neil Macrae,et al.  Stereotypes as energy-saving devices: A peek inside the cognitive toolbox. , 1994 .

[16]  Jörg Denzinger,et al.  On the influence of learning time on evolutionary online learning of cooperative behavior , 2001 .

[17]  Jon Louis Bentley,et al.  Multidimensional binary search trees used for associative searching , 1975, CACM.