Coordination arrival control for multi-agent systems

The coordination arrival problems of first-order multi-agent systems with the arriving structure and the time structure requirements are considered for the cases with no obstacle and obstacle. To describe the distributed coordination arrival problems, we first introduce needed definitions, such as c...

Full description

Bibliographic Details
Main Authors: Li, R., Shi, Y., Teo, Kok Lay
Format: Journal Article
Published: John Wiley and Sons Ltd 2015
Online Access:http://hdl.handle.net/20.500.11937/29057
_version_ 1848752701467262976
author Li, R.
Shi, Y.
Teo, Kok Lay
author_facet Li, R.
Shi, Y.
Teo, Kok Lay
author_sort Li, R.
building Curtin Institutional Repository
collection Online Access
description The coordination arrival problems of first-order multi-agent systems with the arriving structure and the time structure requirements are considered for the cases with no obstacle and obstacle. To describe the distributed coordination arrival problems, we first introduce needed definitions, such as coordination arrival, threat point, and arrival structure. By selecting the estimated value of the arriving time of the agent as variable, we then develop a central estimating algorithm, which is used to construct the arriving protocols. Based on the estimating algorithm, we build and analyze coordination arriving protocols for the proposed coordination arrival problems. Several simulation examples are presented to validate the proposed algorithms.
first_indexed 2025-11-14T08:12:48Z
format Journal Article
id curtin-20.500.11937-29057
institution Curtin University Malaysia
institution_category Local University
last_indexed 2025-11-14T08:12:48Z
publishDate 2015
publisher John Wiley and Sons Ltd
recordtype eprints
repository_type Digital Repository
spelling curtin-20.500.11937-290572017-09-13T15:24:47Z Coordination arrival control for multi-agent systems Li, R. Shi, Y. Teo, Kok Lay The coordination arrival problems of first-order multi-agent systems with the arriving structure and the time structure requirements are considered for the cases with no obstacle and obstacle. To describe the distributed coordination arrival problems, we first introduce needed definitions, such as coordination arrival, threat point, and arrival structure. By selecting the estimated value of the arriving time of the agent as variable, we then develop a central estimating algorithm, which is used to construct the arriving protocols. Based on the estimating algorithm, we build and analyze coordination arriving protocols for the proposed coordination arrival problems. Several simulation examples are presented to validate the proposed algorithms. 2015 Journal Article http://hdl.handle.net/20.500.11937/29057 10.1002/rnc.3359 John Wiley and Sons Ltd restricted
spellingShingle Li, R.
Shi, Y.
Teo, Kok Lay
Coordination arrival control for multi-agent systems
title Coordination arrival control for multi-agent systems
title_full Coordination arrival control for multi-agent systems
title_fullStr Coordination arrival control for multi-agent systems
title_full_unstemmed Coordination arrival control for multi-agent systems
title_short Coordination arrival control for multi-agent systems
title_sort coordination arrival control for multi-agent systems
url http://hdl.handle.net/20.500.11937/29057