Flocking for multiple ellipsoidal agents with limited communication ranges
| dc.contributor.author | Do, Khac Duc | |
| dc.date.accessioned | 2017-01-30T12:44:23Z | |
| dc.date.available | 2017-01-30T12:44:23Z | |
| dc.date.created | 2013-09-23T20:01:16Z | |
| dc.date.issued | 2013 | |
| dc.identifier.citation | Do, K.D. 2013. Flocking for multiple ellipsoidal agents with limited communication ranges. ISRN Robotics. 2013: 387465 (13 p.). | |
| dc.identifier.uri | http://hdl.handle.net/20.500.11937/24663 | |
| dc.identifier.doi | 10.5402/2013/387465 | |
| dc.description.abstract |
This paper contributes a design of distributed controllers for flocking of mobile agents with an ellipsoidal shape and a limited communication range. A separation condition for ellipsoidal agents is first derived. Smooth step functions are then introduced. These functions and the separation condition between the ellipsoidal agents are embedded in novel pairwise potential functions to design flocking control algorithms. The proposed flocking design results in (1) smooth controllers despite of the agents’ limited communication ranges, (2) no collisions between any agents, (3) asymptotic convergence of each agent’s generalized velocity to a desired velocity, and (4) boundedness of the flock size, defined as the sum of all distances between the agents, by a constant. | |
| dc.publisher | Hindawi Publishing Corporation | |
| dc.title | Flocking for multiple ellipsoidal agents with limited communication ranges | |
| dc.type | Journal Article | |
| dcterms.source.volume | 2013 | |
| dcterms.source.startPage | 1 | |
| dcterms.source.endPage | 13 | |
| dcterms.source.issn | 2090-8806 | |
| dcterms.source.title | ISRN Robotics | |
| curtin.note |
This article is published under the Open Access publishing model and distributed under the terms of the Creative Commons Attribution License | |
| curtin.department | ||
| curtin.accessStatus | Open access |