Related papers: Dynamic task delegation for hierarchical agents
Any homogeneous polynomial $P(x, y, z)$ of degree $d$, being restricted to a unit sphere $S^2$, admits essentially a unique representation of the form $\lambda_0 + \sum_{k = 1}^d \lambda_k [\prod_{j = 1}^k L_{kj}]$, where $L_{kj}$'s are…
We develop a discrete-time version of the blended dynamics theorem for the use of designing distributed computation algorithms. The blended dynamics theorem enables to predict the behavior of heterogeneous multi-agent systems. Therefore,…
We study polynomial comonads and polynomial bicomodules. Polynomial comonads amount to categories. Polynomial bicomodules between categories amount to parametric right adjoint functors between corresponding copresheaf categories. These may…
The selection monad on a set consists of selection functions. These select an element from the set, based on a loss (dually, reward) function giving the loss resulting from a choice of an element. Abadi and Plotkin used the monad to model a…
Modeling multimodal human behavior has been a key barrier to increasing the level of interaction between human and robot, particularly for collaborative tasks. Our key insight is that an effective, learned robot policy used for human-robot…
We study two combinatorial contract design models -- multi-agent and multi-action -- where a principal delegates the execution of a costly project to others. In both settings, the principal cannot observe the choices of the agent(s), only…
We investigate operators between spaces of holomorphic functions in several complex variables. Let $G_1, G_2 \subset \mathbb{C}^n$ be cylindrical domains. We construct a canonical map from the space of bounded linear operators…
We present an algebraic semantics for governed execution in which governance is axiomatized, compositional, and coterminous with expressibility. The framework, mechanized in 32 Rocq modules (~12,000 lines, 454 theorems, 0 admitted), is…
The problem is considered as to whether a monotone function defined on a subset P of a Euclidean space can be strictly monotonically extended to the whole space. It is proved that this is the case if and only if the function is {\em…
Distributed Constraint Optimization Problems (DCOPs) have been widely used to coordinate interactions (i.e. constraints) in cooperative multi-agent systems. The traditional DCOP model assumes that variables owned by the agents can take only…
The functor between operadic algebras given by restriction along an operad map generally has a left adjoint. We give a necessary and sufficient condition for the restriction functor to admit a right adjoint. The condition is a factorization…
The purpose of this paper is twofold. First, we review applications of the bar duality of operads to the construction of explicit cofibrant replacements in categories of algebras over an operad. In view toward applications, we check that…
We consider the general problem of geometric task allocation, wherein a large, decentralised swarm of simple mobile agents must detect the locations of tasks in the plane and position themselves nearby. The tasks are represented by an a…
In this paper, we introduce a cofibrant simplicial category that we call the free homotopy coherent adjunction and characterize its n-arrows using a graphical calculus that we develop here. The hom-spaces are appropriately fibrant, indeed…
In this paper we continue the discussion about relations between exponential polynomials and generalized moment generating functions on a commutative hypergroup. We are interested in the following problem: is it true that every finite…
We propose a hierarchical design framework to automatically synthesize coordination schemes and control policies for cooperative multi-agent systems to fulfill formal performance requirements, by associating a bottom-up reactive motion…
Tool-using LLM agents produce trajectories whose calls form a directed dependency graph: earlier tool outputs supply arguments to later calls. Whether this execution structure is represented inside the model is unknown; prior structural…
We construct a symmetric monoidal closed category of polynomial endofunctors (as objects) and simulation cells (as morphisms). This structure is defined using universal properties without reference to representing polynomial diagrams and is…
Network modeling characterizes the underlying principles of structural properties and is of vital significance for simulating dynamical processes in real world. However, bridging structure and dynamics is always challenging due to the…
Generalizing the approach to pseudo monoidal DG-categories as certain colored non-symmetric DG-operads, we introduce a certain relaxed notion of a category enriched in DG-categories. We construct model structures on the category of colored…