Y. Litus

We consider the problem of finding an energy-efficient route for a service robot to rendezvous with every member of a heterogeneous team of mobile worker robots, finding it to be at least as hard as the travelling salesman problem. Expand

We examine the problem of finding a single meeting location for a group of heterogeneous autonomous mobile robots, such that the total system cost of traveling to the rendezvous is minimized. Expand

We consider the problem of finding a set of trajectories for a heterogeneous group of mobile robots, such that a single service robot can rendezvous with every other member of the team in a prescribed order. Expand

This paper describes the first robotic system that solves a combinatorial computational problem by means of its own continuous dynamics. Expand

We present an informal description of a general approach for developing decentralized distributed gradient descent optimization algorithms for teams of embodied agents that need to rearrange their configuration over space and/or time, into some optimal and initially unknown configuration. Expand

We present a distributed multi-robot controller for forming spatially efficient queues of arbitrary numbers of robots. Expand

We show that a multi-robot system can use physical embodiment and spatial embeddedness as computational resources for two types of problems: a continuous optimization problem of achieving optimal joint robot team configuration, and a combinatorial problem of sorting robots. Expand