Trevor Santarra
Contacttrevor.santarra [at] gmail |
Personal
I am a senior research engineer at Unity Technologies, where I build AI systems and user-friendly authoring tools.
Before working at Unity, I earned a Ph.D. in Computer Science at UC Santa Cruz, where I studied communication strategies in ad hoc multiagent teams. I also hold a B.S. in Applied Mathematics from The University of Tulsa. See here for a short CV.
Publications
Thesis:-
T. Santarra
Communicating Plans in Ad Hoc Multiagent Teams
University of California Santa Cruz, 2019
→ Abstract | Paper | | BibTex
Abstract: With the rising use of autonomous agents within robotic and software settings, agents may be required to cooperate in teams while having little or no information regarding the capabilities of their teammates. In these ad hoc settings, teams must collaborate on the fly, having no prior opportunity for coordination. Prior research in this area commonly either assumes that communication between agents is impossible given their heterogeneous design or has left communication as an open problem. Typically, to accurately predict a teammate’s behavior at a future point in time, ad hoc agents leverage models learned from past experience and attempt to infer a teammate’s intended strategy through observing its current course of action. However, these approaches can fail to arrive at accurate policy predictions, leaving the coordinating agent uncertain and unable to adapt to its teammates’ plans. We introduce the problem of communicating minimal sets ofteammate policies in order to provide information for collaboration in such ad hoc environments. We demonstrate how an agent may determine what information it should solicit from its peers but further illustrate how optimal solutions to such a problem have intractable computational requirements. Nonetheless, through the characterization of this difficulty, we identify strategies that permit approximate or heuristic approaches, allowing the practical application of this capacity in ad hoc teams.
-
T. Sarratt, A. Jhala
Policy Communication for Coordination with Unknown Teammates
Proceedings of the Third Workshop on Multiagent Interaction without Prior Coordination (MIPC), 2016
→ Abstract | Paper | BibTex
Abstract: Within multiagent teams research, existing approaches commonly assume agents have perfect knowledge regarding the decision process guiding their teammates’ actions. More recently, ad hoc teamwork was introduced to address situations where an agent must coordinate with a variety of potential teammates, including teammates with unknown behavior. This paper examines the communication of intentions for enhanced coordination between such agents. The proposed decisiontheoretic approach examines the uncertainty within a model of an unfamiliar teammate, identifying policy information valuable to the collaborative effort. We characterize this capability through theoretical analysis of the computational requirements as well as empirical evaluation of a communicative agent coordinating with an unknown teammate in a variation of the multiagent pursuit domain. -
T. Sarratt, A. Jhala
Tuning Belief Revision for Coordination with Inconsistent Teammates
Proceedings of the Eleventh Artificial Intelligence and Interactive Digital Entertainment Conference, 2015
→ Abstract | Paper | BibTex
Abstract: Coordination with an unknown human teammate is a notable challenge for cooperative agents. Behavior of human players in games with cooperating AI agents is often sub-optimal and inconsistent leading to choreographed and limited cooperative scenarios in games. This paper considers the difficulty of cooperating with a teammate whose goal and corresponding behavior change periodically. Previous work uses Bayesian models for updating beliefs about cooperating agents based on observations. We describe belief models for on-line planning, discuss tuning in the presence of noisy observations, and demonstrate empirically its effectiveness in coordinating with inconsistent agents in a simple domain. Further work in this area promises to lead to techniques for more interesting cooperative AI in games. -
T. Sarratt, A. Jhala
RAPID: A Belief Convergence Strategy for Collaborating with Inconsistent Agents
Proceedings of the Second Workshop on Multiagent Interaction without Prior Coordination(MIPC), 2015
→ Abstract | Paper | BibTex
Abstract: Maintaining an accurate set of beliefs in a partially observable scenario, particularly with respect to other agents operating in the same space, is a vital aspect of multiagent planning. We analyze how the beliefs of an agent can be updated for fast adaptivity to changes in the behavior of an unknown teammate. The main contribution of this paper is the empirical evaluation of an agent cooperating with a teammate whose goals change periodically. We test our approach in a collaborative multiagent domain where identification of goals is necessary for successful completion. The belief revision technique we propose outperforms the traditional approach in a majority of test cases. Additionally, our results suggest the ability to approximate a higher level model by utilizing a belief distribution over a set of lower level behaviors, particularly when the belief update strategy identifies changes in the behavior in a responsive manner -
T. Sarratt, S.M. Morgens, A. Jhala
Domain-Specific Sentiment Classification for Games-Related Tweets
Proceedings of the Tenth Artificial Intelligence and Interactive Digital Entertainment Conference, 2014
→ Abstract | Paper | BibTex
Abstract: Sentiment classification provides information about the author’s feeling toward a topic through the use of expressive words. However, words indicative of a particular sentiment class can be domain-specific. We train a text classifier for Twitter data related to games using labels inferred from emoticons. Our classifier is able to differentiate between positive and negative sentiment tweets labeled by emoticons with 75.1% accuracy. Additionally, we test the classifier on human-labeled examples with the additional case of neutral or ambiguous sentiment. Finally, we have made the data available to the community for further use and analysis. -
T. Sarratt, D.V. Pynadath, A. Jhala
Converging to a player model in Monte-Carlo Tree Search
Proceedings of the 2014 IEEE Conference on Computational Intelligence and Games, 2014
→ Abstract | Paper | BibTex
Abstract: Player models allow search algorithms to account for differences in agent behavior according to player's preferences and goals. However, it is often not until the first actions are taken that an agent can begin assessing which models are relevant to its current opponent. This paper investigates the integration of belief distributions over player models in the Monte Carlo Tree Search (MCTS) algorithm. We describe a method of updating belief distributions through leveraging information sampled during the MCTS. We then characterize the effect of tuning parameters of the MCTS to convergence of belief distributions. Evaluation of this approach is done in comparison with value iteration for an iterated version of the prisoner's dilemma problem. We show that for a sufficient quantity of iterations, our approach converges to the correct model faster than the same model under value iteration. -
R. Mailler, J. Graves, N. Willy, T. Sarratt
A Biologically Accurate Simulation of the Locomotion of Caenorhabditis elegans
International Journal on Advances in Life Sciences, 2011
→ Abstract | Paper | BibTex
Abstract: The nematode Caenorhabditis elegans is an important model organism for many areas of biological research including genetics, development, and neurobiology. It is the first organism to have its genome sequenced, complete cell ontogeny determined, and nervous system mapped. With all of the information that is available on this simple organism, C. elegans may also become the first organism to be accurately and completely modeled in silico. This work takes a first step toward this goal by presenting a biologically accurate, 3-dimensional simulated model of C. elegans. This model takes into account many facets of the organism including size, shape, weight distribution, muscle placement, and muscle force. It also explicitly models the environment of the worm to include factors such as contact, friction, inertia, surface tension, and gravity. The model was tuned and validated using video recordings taken of the worm to show that it accurately depicts the physics of undulatory locomotion used to forward and reverse crawl on an agar surface. The main contribution of this article is a new, highly detailed 3D physics model and supporting simulator that -
A. Padhi, R.E. Young, C. Hoffart, T. Sarratt, J. Fancher, M. Steffen, P.S.M. Hill
Investigating Genetic Relationships within Gryllotalpidae: A Molecular Hypothesis
Journal of Orthoptera Research, 2010
→ Abstract | Paper | BibTex
Abstract: We present a first preliminary molecular analysis of relationships among a sample of living members of the Gryllotalpidae, based on partial nucleotide sequence data of the 16S mitochondrial gene. Our analysis defines five groups that diverged from each other approximately 196 to 284 Mya in the Mesozoic era. This study supports the monophyly of the genus Scapteriscus and its placement in the subfamily Scapteriscinae, as well as the inclusion of the genus Triamescaptor in the subfamily Gryllotalpinae. The monophyly of the large genus Gryllotalpa is not supported, suggesting a revision of the genus is needed. -
S. Tyree, R. Kuplicki, T. Sarratt, S. Fujan, J. Hale
GridSPiM: A Framework for Simple Locality and Containment in the Stochastic π-Calculus
Proceedings of the 1st International Conference on Bioinformatics and Computational Biology, 2008
→ Abstract | BibTex
Abstract: Process calculi hold great promise for modeling and analysis of cellular mechanics and behavior. While measured success has been achieved in their simulation of specific biochemical pathways and molecular mechanisms within the cell, several obstacles remain to their widespread adoption and use. Chiefly, these have to with the difficulty of modeling cell membranes and localized behavior, and limitations on the scalability of the execution model. This paper describes a multi-layered formalism --- GridSPiM --- that engages notions of concurrency, locality and encapsulation to provide a framework suitable for capturing the key aspects of cellular processes.
-
T. Santarra, A. Jhala
Communicating Intentions for Coordination with Unknown Teammates
Proceedings of the 2016 International Conference on Autonomous Agents & Multiagent Systems, 2016
→ Abstract | Paper | BibTex
Abstract: Ad hoc multiagent teamwork introduces the challenge of coordinating with a variety of potential teammates, including teammates with unknown behavior. We examine the communication of policy information for enhanced coordination between such agents. The proposed decision-theoretic approach examines the uncertainty within a model of an unfamiliar teammate, identifying and acquiring policy information valuable to the collaborative effort. -
T. Sarratt, A. Jhala
The Role of Models and Communication in the Ad Hoc Multiagent Team Decision Problem
Proceedings of the Third Annual Conference on Advances in Cognitive Systems Poster Collection, 2015
→ Abstract | Paper | BibTex
Abstract: Ad hoc teams are formed of members who have little or no information regarding one another. In order to achieve a shared goal, agents are tasked with learning the capabilities of their teammates such that they can coordinate effectively. Typically, the capabilities of the agent teammates encountered are constrained by the particular domain specifications. However, for wide application, it is desirable to develop systems that are able to coordinate with general ad hoc agents independent of the choice of domain. We propose examining ad hoc multiagent teamwork from a generalized perspective and discuss existing domains within the context of our framework. Furthermore, we consider how communication of agent intentions can provide a means of reducing teammate model uncertainty at key junctures, requiring an agent to consider its own information deficiencies in order to form communicative acts improving team coordination. -
R.E. Young, T. Sarratt, P.S.M. Hill
Investigating Genetic Relationships within Gryllotalpidae: A Molecular Hypothesis
Annual Meeting of the Animal Behavior Society, 2010
→ Abstract
Abstract: We present a first preliminary molecular analysis of relationships among a sample of living members of the Gryllotalpidae, based on partial nucleotide sequence data of the 16S mitochondrial gene. Our analysis defines five groups that diverged from each other approximately 196 to 284 Mya in the Mesozoic era. This study supports the monophyly of the genus Scapteriscus and its placement in the subfamily Scapteriscinae, as well as the inclusion of the genus Triamescaptor in the subfamily Gryllotalpinae. The monophyly of the large genus Gryllotalpa is not supported, suggesting a revision of the genus is needed. -
S. Tyree, R. Kuplicki, T. Sarratt, S. Fujan, J. Hale
Towards a Multi-Level Calculus for Cellular Modeling and Simulation
International Society for Computational Biology, Sixth Rocky Mountain Bioinformatics Conference, 2008
→ Abstract
Abstract: Process calculi hold great promise for modeling and analysis of cellular mechanics and behavior. While measured success has been achieved in their simulation of specific biochemical pathways and molecular mechanisms within the cell, several obstacles remain to their widespread adoption and use. Chiefly, these have to with the difficulty of modeling cell membranes and localized behavior, and limitations on the scalability of the execution model. This paper describes a multi-layered formalism --- GridSPiM --- that engages notions of concurrency, locality and encapsulation to provide a framework suitable for capturing the key aspects of cellular processes.
-
T. Santarra
Adapting Plans through Communication with Unknown Teammates
Proceedings of the 2016 International Conference on Autonomous Agents & Multiagent Systems, 2016
→ Abstract | Paper | BibTex
Abstract: My thesis addresses the problem of planning under teammate behavior uncertainty by introducing the concept of intentional multiagent communication within ad hoc teams. In partially observable multiagent domains, agents much share information regarding aspects of the environment such that uncertainty is reduced across the team, permitting better coordination. Similarly, we consider how communication may be utilized within ad hoc teams to resolve behavioral uncertainty. Transmitting intentional messages allows agents to adjust predictions of a teammate’s individual course of action. In short, an ad hoc agent coordinating with an unknown teammate can identify uncertainties within its own predictive model of teammate behavior then request the appropriate policy information, allowing the agent to adapt its personal plan. The main contribution of this work is the characterization of the interaction between learning, communication, and planning in ad hoc teams. -
T. Sarratt
Adapting Plans through Communication with Unknown Teammates
Proceedings of the Thirtieth AAAI Conference on Artificial Intelligence, 2016
→ Abstract | Paper | BibTex
Abstract: My thesis addresses the problem of planning under teammate behavior uncertainty by introducing the concept of intentional multiagent communication within ad hoc teams. In partially observable multiagent domains, agents much share information regarding aspects of the environment such that uncertainty is reduced across the team, permitting better coordination. Similarly, we consider how communication may be utilized within ad hoc teams to resolve behavioral uncertainty. Transmitting intentional messages allows agents to adjust predictions of a teammate’s individual course of action. In short, an ad hoc agent coordinating with an unknown teammate can identify uncertainties within its own predictive model of teammate behavior then request the appropriate policy information, allowing the agent to adapt its personal plan. The main contribution of this work is the characterization of the interaction between learning, communication, and planning in ad hoc teams. -
T. Sarratt
Leveraging Communication for Player Modeling and Cooperative Play
Proceedings of the Tenth Artificial Intelligence and Interactive Digital Entertainment Conference, 2014
→ Abstract | Paper | BibTex
Abstract: Collaboration between agents and players within games is a ripe area for exploration. As with adversarial AI, collaborative agents are challenged to accurately model players and adapt their behavior accordingly. The task of cooperation, however, allows for communication between teammates that can prove beneficial in coordinating joint actions and plans. Furthermore, we propose extending established multi-agent communication paradigms to include transfer of information pertinent to player models. By querying goal and preference information from a player, an agent can reduce uncertainty in coordination domains, allowing for more effective planning. We discuss the challenges as well as the planned development and evaluation of the system.