scispace - formally typeset
Journal ArticleDOI

Stabilisation of infinitesimally rigid formations of multi-robot networks

Reads0
Chats0
TLDR
It is shown that infinitesimal rigidity is a sufficient condition for local asymptotical stability of the equilibrium manifold of the multivehicle system.
Abstract
This article considers the design of a formation control for multivehicle systems that uses only local information. The control is derived from a potential function based on an undirected infinitesimally rigid graph that specifies the target formation. A potential function is obtained from the graph, from which a gradient control is derived. Under this controller the target formation becomes a manifold of equilibria for the multivehicle system. It is shown that infinitesimal rigidity is a sufficient condition for local asymptotical stability of the equilibrium manifold. A complete study of the stability of the regular polygon formation is presented and results for directed graphs are presented as well. Finally, the controller is validated experimentally.

read more

Citations
More filters
Proceedings ArticleDOI

Multi-robot motion-formation distributed control with sensor self-calibration: experimental validation

TL;DR: Since the robots do not need any off-board localization system, but require only relative positions with respect to their neighbors, it can be aimed to have a full autonomous team that operates in environments where such localization systems are not available.
Proceedings ArticleDOI

Disturbance Observer Based Formation Control Of Multi Agent System

TL;DR: The objective of this work is to design an observer to estimate the disturbances and to manipulate the control effort appropriately so as to maintain the formation even in the presence of disturbances.
Dissertation

Distributed Coordination Theory for Ground and Aerial Robot Teams

Ashton Roza
TL;DR: In this paper, Roza et al. studied rendezvous, formation control, linear and circular formation flocking and formation path following for two important classes of robots, i.e., ground-based mobile robots and flying robots.
Posted Content

Dimensional-invariance principles in coupled dynamical systems.

TL;DR: In this paper, the dimensions of the subspace spanned by solutions of a coupled dynamical system with scalar couplings and with matrix couplings were investigated and several invariance principles relating to the dimensions were established.
Journal ArticleDOI

rigidPy: Rigidity analysis in Python

TL;DR: rigidPy as discussed by the authors is a Python package that provides a set of tools necessary for studying rigidity and mechanical response in spring networks, including suitable modules for generating new realizations of networks with applications in glassy systems and protein structures.
References
More filters
Book

Introduction to Applied Nonlinear Dynamical Systems and Chaos

TL;DR: The Poincare-Bendixson Theorem as mentioned in this paper describes the existence, uniqueness, differentiability, and flow properties of vector fields, and is used to prove that a dynamical system is Chaotic.
Journal ArticleDOI

Flocking for multi-agent dynamic systems: algorithms and theory

TL;DR: A theoretical framework for design and analysis of distributed flocking algorithms, and shows that migration of flocks can be performed using a peer-to-peer network of agents, i.e., "flocks need no leaders."
MonographDOI

Algebraic graph theory

TL;DR: In this article, the authors introduce algebraic graph theory and show that the spectrum of a graph can be modelled as a graph graph, and the spectrum can be represented as a set of connected spanning trees.
Journal ArticleDOI

Coverage control for mobile sensing networks

TL;DR: In this paper, the authors describe decentralized control laws for the coordination of multiple vehicles performing spatially distributed tasks, which are based on a gradient descent scheme applied to a class of decentralized utility functions that encode optimal coverage and sensing policies.
Posted Content

Coverage control for mobile sensing networks

TL;DR: This paper proposes gradient descent algorithms for a class of utility functions which encode optimal coverage and sensing policies which are adaptive, distributed, asynchronous, and verifiably correct.
Related Papers (5)