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
OTHER
📊 26,957 cites
Statistical Learning Theory
Yuhai Wu, Vladimir Vapnik
1999
PERCEPTION
📊 22,245 cites
Artificial intelligence: a modern approach
1995
OTHER
📊 18,993 cites
Applied Nonlinear Control
Jean-Jacques Slotine, Weiping Li
1991
SWARM
📊 14,853 cites
A new optimizer using particle swarm theory
R.C. Eberhart, James Kennedy
2002