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
Book ChapterDOI

Design Theory of Distributed Controllers via Gradient-Flow Approach

TL;DR: The introduced approach provides a systematic design methodology applicable to general tasks by using cliques, and it is shown that the connection structure between the cliques plays an important role in achieving the task.
Journal ArticleDOI

Robotic Motion Coordination Based on a Geometric Deformation Measure

- 01 Sep 2022 - 
TL;DR: In this paper , a linear shape controller is proposed to achieve motion coordination in a multi-robot system based on the concept of deformation, which minimizes a global measure of the deformation of their positions relative to a prescribed shape.
Proceedings ArticleDOI

Control of coleader formations in the plane

TL;DR: In this article, the authors consider a class of directed information architectures associated with minimally persistent co-leader formations and propose a control law where each agent executes its control using only the relative position measurements of agents it must maintain its distance to.
Proceedings Article

Adaptive perturbation method for global stabilization of minimally rigid formations in the plane

TL;DR: In this article, a constructive adaptive perturbation method is proposed for globally stabilizing minimal rigid formations, which can not only guarantee the global asymptotical stability of the desired formation, but also ensure that no collision happens between any two adjacent agents during the motion.
Proceedings ArticleDOI

Controlling a rigid formation from a triangle

TL;DR: Given that there is a selected subset of agents that can control the mismatches in interactions among them, it is shown that if these agents are fully connected and form a nondegenerate triangle (or more generally, a nondEGenerate k-simplex in the k-dimensional case), then it is possible to control an arbitrary rigid motion of the entire formation.
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)