The preservation of connectivity in mobile robot networks is critical to the success of existing algorithms designed to achieve various goals. The available connectivity control algorithms mainly work through preservation of existing edges in the network. A link may be deleted if distributed decision making determines that the edge is not a cut-bridge. A controller is presented which allows edges to be broken in a continuous manner without higher-level decision making. The controller is based on maximization of the second smallest eigenvalue of the graph Laplacian. The controllers are designed for holonomic robots, and are extended for implementation on non-holonomic wheeled mobile robots. Finally, the performance of the extended controllers are demonstrated experimentally.
展开▼
