Dynamic task delegation for hierarchical agents

Fuente: arXiv
Enregistré dans:
Détails bibliographiques
Auteurs principaux: Libkind, Sophie, Spivak, David I.
Format: Preprint
Publié: 2024
Sujets:
Accès en ligne:
Tags: Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
_version_ 1866916495729098752
author Libkind, Sophie
Spivak, David I.
author_facet Libkind, Sophie
Spivak, David I.
contents This is the fourth installment in a series of papers offering models of hierarchical structure for dynamical systems, using the language of polynomial functors. The operad underlying the symmetric monoidal category $(\mathbf{Poly}, \otimes, \mathcal{y})$ can be viewed as defining the behavior of hierarchical delegation. In particular, a morphism $\mathbf{Poly}(p_1 \otimes \cdots \otimes p_m, q)$ turns the outputs of subordinates with interfaces $p_i$ into the output of an agent with interface $q$ and turns a task given to the agent into a task for each of the subordinates. In this article, we extend the framework so that subordinates may be invoked asynchronously depending on the outcomes of other subordinates. We prove that the free (co)monad (co)monad extends to a (co)monad on $\mathbf{Org}$. From the perspective of programs/pattern, this extension implies the existence of a $\mathbf{Cat}$-enriched operad $\mathbf{Org}_\mathfrak{m}$, and from the perspective of behavior/matter, it implies the existence of a $\mathbf{Cat}$-enriched operad $\mathbf{Org}^\mathfrak{c}$. Second, we crispen the relationship between the programmatic and behavioral perspectives via a functor $[-, t] \colon \mathbf{Org}_{\mathfrak{m}}^\textrm{op} \to \mathbf{Org}^\mathfrak{c}$ for any polynomial monad $t$.
format Preprint
id arxiv_https___arxiv_org_abs_2410_08373
institution arXiv
publishDate 2024
record_format arxiv
spellingShingle Dynamic task delegation for hierarchical agents
Libkind, Sophie
Spivak, David I.
Category Theory
This is the fourth installment in a series of papers offering models of hierarchical structure for dynamical systems, using the language of polynomial functors. The operad underlying the symmetric monoidal category $(\mathbf{Poly}, \otimes, \mathcal{y})$ can be viewed as defining the behavior of hierarchical delegation. In particular, a morphism $\mathbf{Poly}(p_1 \otimes \cdots \otimes p_m, q)$ turns the outputs of subordinates with interfaces $p_i$ into the output of an agent with interface $q$ and turns a task given to the agent into a task for each of the subordinates. In this article, we extend the framework so that subordinates may be invoked asynchronously depending on the outcomes of other subordinates. We prove that the free (co)monad (co)monad extends to a (co)monad on $\mathbf{Org}$. From the perspective of programs/pattern, this extension implies the existence of a $\mathbf{Cat}$-enriched operad $\mathbf{Org}_\mathfrak{m}$, and from the perspective of behavior/matter, it implies the existence of a $\mathbf{Cat}$-enriched operad $\mathbf{Org}^\mathfrak{c}$. Second, we crispen the relationship between the programmatic and behavioral perspectives via a functor $[-, t] \colon \mathbf{Org}_{\mathfrak{m}}^\textrm{op} \to \mathbf{Org}^\mathfrak{c}$ for any polynomial monad $t$.
title Dynamic task delegation for hierarchical agents
topic Category Theory
url https://arxiv.org/abs/2410.08373