Home /Research /Distributed-infrastructure multi-robot routing using a Helmholtz-Hodge decomposition
SWARM

Distributed-infrastructure multi-robot routing using a Helmholtz-Hodge decomposition

Peter Kingston, Magnus Egerstedt

Year
2011
Citations
8

Abstract

Using graphs and simplicial complexes as models for an environment containing a large number of agents, we provide distributed algorithms based on the Helmholtz-Hodge decomposition that, given desired flow rates on edges or across faces, produce incompressible approximations to the specified flows. These flows are then “lifted” to produce hybrid controllers for the agents, and a related algorithm is described that computes continuous streamfunctions over the environment, also in a distributed way.

Keywords

DecompositionHelmholtz free energyComputer scienceRouting (electronic design automation)RobotDistributed computingFlow (mathematics)CompressibilityMathematical optimizationTopology (electrical circuits)

Related papers

Browse all SWARM papers