Flocking for multiple elliptical agents with limited communication ranges

In existing flocking and coordination control systems of multiple agents, an agent is considered as a single point or a circular disk. For agents with a long and narrow shape, fitting them to circular disks results in a problem with the large conservative area. This paper presents a design of distri...

Full description

Bibliographic Details
Main Author: Do, Khac Duc
Format: Journal Article
Published: 2011
Online Access:http://hdl.handle.net/20.500.11937/30531
_version_ 1848753115236401152
author Do, Khac Duc
author_facet Do, Khac Duc
author_sort Do, Khac Duc
building Curtin Institutional Repository
collection Online Access
description In existing flocking and coordination control systems of multiple agents, an agent is considered as a single point or a circular disk. For agents with a long and narrow shape, fitting them to circular disks results in a problem with the large conservative area. This paper presents a design of distributed controllers for flocking of N mobile agents with an elliptical shape and with limited communication ranges. A separation condition for elliptical agents is first derived. Smooth or p-times differentiable step functions are then introduced. These functions and the separation condition between the elliptical agents are embedded in novel potential functions to design control algorithms for flocking. The controllers guarantee 1) no switchings in the controllers despite the agents limited communication ranges; 2) no collisions between any agents; 3) asymptotic convergence of each agents generalized velocity to a desired velocity; and 4) boundedness of the flock size, which is defined as the sum of all generalized distances between the agents, by a constant. © 2011 IEEE.
first_indexed 2025-11-14T08:19:23Z
format Journal Article
id curtin-20.500.11937-30531
institution Curtin University Malaysia
institution_category Local University
last_indexed 2025-11-14T08:19:23Z
publishDate 2011
recordtype eprints
repository_type Digital Repository
spelling curtin-20.500.11937-305312017-09-13T15:33:37Z Flocking for multiple elliptical agents with limited communication ranges Do, Khac Duc In existing flocking and coordination control systems of multiple agents, an agent is considered as a single point or a circular disk. For agents with a long and narrow shape, fitting them to circular disks results in a problem with the large conservative area. This paper presents a design of distributed controllers for flocking of N mobile agents with an elliptical shape and with limited communication ranges. A separation condition for elliptical agents is first derived. Smooth or p-times differentiable step functions are then introduced. These functions and the separation condition between the elliptical agents are embedded in novel potential functions to design control algorithms for flocking. The controllers guarantee 1) no switchings in the controllers despite the agents limited communication ranges; 2) no collisions between any agents; 3) asymptotic convergence of each agents generalized velocity to a desired velocity; and 4) boundedness of the flock size, which is defined as the sum of all generalized distances between the agents, by a constant. © 2011 IEEE. 2011 Journal Article http://hdl.handle.net/20.500.11937/30531 10.1109/TRO.2011.2159410 restricted
spellingShingle Do, Khac Duc
Flocking for multiple elliptical agents with limited communication ranges
title Flocking for multiple elliptical agents with limited communication ranges
title_full Flocking for multiple elliptical agents with limited communication ranges
title_fullStr Flocking for multiple elliptical agents with limited communication ranges
title_full_unstemmed Flocking for multiple elliptical agents with limited communication ranges
title_short Flocking for multiple elliptical agents with limited communication ranges
title_sort flocking for multiple elliptical agents with limited communication ranges
url http://hdl.handle.net/20.500.11937/30531