Abstract— Pursuit strategies (formulated using constantspeed particle models) provide a means for achieving cohesive behavior in systems of multiple mobile agents. In the present...
Kevin S. Galloway, Eric W. Justh, P. S. Krishnapra...
Abstract— We consider a distributed multi-agent network system where the goal is to minimize an objective function that can be written as the sum of component functions, each of ...
Universal induction solves in principle the problem of choosing a prior to achieve optimal inductive inference. The AIXI theory, which combines control theory and universal induct...
We present a new formulation of distributed task assignment, called Generalized Mutual Assignment Problem (GMAP), which is derived from an NP-hard combinatorial optimization probl...
Procedural representations of control policies have two advantages when facing the scale-up problem in learning tasks. First they are implicit, with potential for inductive genera...