1,020 research outputs found
A Sufficient Statistic for Influence in Structured Multiagent Environments
© 2021 AI Access Foundation. All rights reserved. Making decisions in complex environments is a key challenge in artificial intelligence (AI). Situations involving multiple decision makers are particularly complex, leading to computational intractability of principled solution methods. A body of work in AI has tried to mitigate this problem by trying to distill interaction to its essence: how does the policy of one agent influence another agent? If we can find more compact representations of such influence, this can help us deal with the complexity, for instance by searching the space of influences rather than the space of policies. However, so far these notions of influence have been restricted in their applicability to special cases of interaction. In this paper we formalize influence-based abstraction (IBA), which facilitates the elimination of latent state factors without any loss in value, for a very general class of problems described as factored partially observable stochastic games (fPOSGs). On the one hand, this generalizes existing descriptions of influence, and thus can serve as the foundation for improvements in scalability and other insights in decision making in complex multiagent settings. On the other hand, since the presence of other agents can be seen as a generalization of single agent settings, our formulation of IBA also provides a sufficient statistic for decision making under abstraction for a single agent. We also give a detailed discussion of the relations to such previous works, identifying new insights and interpretations of these approaches. In these ways, this paper deepens our understanding of abstraction in a wide range of sequential decision making settings, providing the basis for new approaches and algorithms for a large class of problems
Influence-Based Abstraction for Multiagent Systems
This paper presents a theoretical advance by which factored POSGs can be decomposed into local models. We formalize the interface between such local models as the influence agents can exert on one another; and we prove that this interface is sufficient for decoupling them. The resulting influence-based abstraction substantially generalizes previous work on exploiting weakly-coupled agent interaction structures. Therein lie several important contributions. First, our general formulation sheds new light on the theoretical relationships among previous approaches, and promotes future empirical comparisons that could come by extending them beyond the more specific problem contexts for which they were developed. More importantly, the influence-based approaches that we generalize have shown promising improvements in the scalability of planning for more restrictive models. Thus, our theoretical result here serves as the foundation for practical algorithms that we anticipate will bring similar improvements to more general planning contexts, and also into other domains such as approximate planning, decision-making in adversarial domains, and online learning.United States. Air Force Office of Scientific Research. Multidisciplinary University Research Initiative (Project FA9550-09-1-0538
Influence-Optimistic Local Values for Multiagent Planning --- Extended Version
Recent years have seen the development of methods for multiagent planning
under uncertainty that scale to tens or even hundreds of agents. However, most
of these methods either make restrictive assumptions on the problem domain, or
provide approximate solutions without any guarantees on quality. Methods in the
former category typically build on heuristic search using upper bounds on the
value function. Unfortunately, no techniques exist to compute such upper bounds
for problems with non-factored value functions. To allow for meaningful
benchmarking through measurable quality guarantees on a very general class of
problems, this paper introduces a family of influence-optimistic upper bounds
for factored decentralized partially observable Markov decision processes
(Dec-POMDPs) that do not have factored value functions. Intuitively, we derive
bounds on very large multiagent planning problems by subdividing them in
sub-problems, and at each of these sub-problems making optimistic assumptions
with respect to the influence that will be exerted by the rest of the system.
We numerically compare the different upper bounds and demonstrate how we can
achieve a non-trivial guarantee that a heuristic solution for problems with
hundreds of agents is close to optimal. Furthermore, we provide evidence that
the upper bounds may improve the effectiveness of heuristic influence search,
and discuss further potential applications to multiagent planning.Comment: Long version of IJCAI 2015 paper (and extended abstract at AAMAS
2015
Dynamical strategies for obstacle avoidance during Dictyostelium discoideum aggregation: a Multi-agent system model
Chemotaxis, the movement of an organism in response to chemical stimuli, is a
typical feature of many microbiological systems. In particular, the social
amoeba \textit{Disctyostelium discoideum} is widely used as a model organism,
but it is not still clear how it behaves in heterogeneous environments. A few
models focusing on mechanical features have already addressed the question;
however, we suggest that phenomenological models focusing on the population
dynamics may provide new meaningful data. Consequently, by means of a specific
Multi-agent system model, we study the dynamical features emerging from complex
social interactions among individuals belonging to amoeba colonies.\\ After
defining an appropriate metric to quantitatively estimate the gathering
process, we find that: a) obstacles play the role of local topological
perturbation, as they alter the flux of chemical signals; b) physical obstacles
(blocking the cellular motion and the chemical flux) and purely chemical
obstacles (only interfering with chemical flux) elicit similar dynamical
behaviors; c) a minimal program for robustly gathering simulated cells does not
involve mechanisms for obstacle sensing and avoidance; d) fluctuations of the
dynamics concur in preventing multiple stable clusters. Comparing those
findings with previous results, we speculate about the fact that chemotactic
cells can avoid obstacles by simply following the altered chemical gradient.
Social interactions are sufficient to guarantee the aggregation of the whole
colony past numerous obstacles
- …