Related papers: Dynamic task delegation for hierarchical agents
The present paper is a continuation of our work [11], where we introduced a fractional operator calculus related to a fractional ${\psi}-$Fueter operator in the one-dimensional Riemann-Liouville derivative sense in each direction of the…
Learning long-range behaviors on complex high-dimensional agents is a fundamental problem in robot learning. For such tasks, we argue that transferring learned information from a morphologically simpler agent can massively improve the…
This paper addresses the limitations of a single agent in task decomposition and collaboration during complex task execution, and proposes a multi-agent architecture for modular task decomposition and dynamic collaboration based on large…
The purpose of this paper is two-fold. In Part 1 we introduce a new theory of operadic categories and their operads. This theory is, in our opinion, of an independent value. In Part 2 we use this new theory together with our previous…
The aim of this paper is to further explore an idea from J.-L. Loday briefly exposed in [5]. We impose a natural and simple symmetry on a unit action over the most general quadratic relation which can be written. This leads us to two…
The prisoner's dilemma (PD) is a game-theoretic model studied in a wide array of fields to understand the emergence of cooperation between rational self-interested agents. In this work, we formulate a spatial iterated PD as a discrete-event…
Hybrid computation combines discrete and continuous dynamics in the form of an entangled mixture inherently present both in various natural phenomena, and in applications ranging from control theory to microbiology. The emergent behaviours…
We investigate the relationship between symmetric functions and the representation theory of operads, relative operads, and props. We extend the classical character map for symmetric sequences to relative bisymmetric sequences and symmetric…
In the theory of operads we consider functors of generalized symmetric powers defined by sums of coinvariant modules under actions of symmetric groups. One observes classically that the construction of symmetric functors provides an…
We construct a map of operads from an $E_2$-operad to the condensation of the operad for multiplicative hyperoperads. We deduce from it the existence of an $E_2$-action on the homotopy limit of the underlying functor of a multiplicative…
In this article, we show that the now classical protocol complex approach to distributed task solvability of Herlihy et al. can be understood in standard categorical terms. First, protocol complexes are functors, from chromatic (semi-)…
Monads are extensively used nowadays to abstractly model a wide range of computational effects such as nondeterminism, statefulness, and exceptions. It turns out that equipping a monad with a (uniform) iteration operator satisfying a set of…
We develop a new framework for the study of complex continuous time dynamical systems based on viewing them as collections of interacting control modules. This framework is inspired by and builds upon the groupoid formalism of Golubitsky,…
In 2008, Loday shed light on the existence of Hopf-Boreltheorems for operads. Using the vocabulary of category theory, Livernet,Mesablishvili and Wisbauer extended such theorems to monads. In bothcases, the reasoning was to start from a…
The collective motion of self-driven agents is a phenomenon of great interest in interacting particle systems. In this paper, we develop and analyze a model of agent motion in one dimension with periodic boundaries using a stochastic…
Functors from (co)operads to bialgebras relate Hopf algebras that occur in renormalisation to operads, which simplifies the proof of the Hopf algebra axioms, and induces a characterisation of the corresponding group of characters and Lie…
This paper presents an abstraction of Hoare logic to traced symmetric monoidal categories, a very general framework for the theory of systems. Our abstraction is based on a traced monoidal functor from an arbitrary traced monoidal category…
Learning to solve long horizon temporally extended tasks with reinforcement learning has been a challenge for several years now. We believe that it is important to leverage both the hierarchical structure of complex tasks and to use expert…
Turi and Plotkin's bialgebraic semantics is an abstract approach to specifying the operational semantics of a system, by means of a distributive law between its syntax (encoded as a monad) and its dynamics (an endofunctor). This setup is…
Hierarchical multi-agent systems (HMAS) organize collections of agents into layered structures that help manage complexity and scale. These hierarchies can simplify coordination, but they also can introduce trade-offs that are not always…