Iterative shepherding control for agents with heterogeneous responsivity
In the context of the theory of multi-agent systems, the shepherding problem refers to designing the dynamics of a herding agent, called a sheepdog, so that a given flock of agents, called sheep, is guided into a goal region. Although several effective methodologies and algorithms have been proposed...
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
AIMS Press
2022-02-01
|
| Series: | Mathematical Biosciences and Engineering |
| Subjects: | |
| Online Access: | http://www.aimspress.com/article/doi/10.3934/mbe.2022162?viewType=HTML |
| _version_ | 1818490857360195584 |
|---|---|
| author | Ryoto Himo Masaki Ogura Naoki Wakamiya |
| author_facet | Ryoto Himo Masaki Ogura Naoki Wakamiya |
| author_sort | Ryoto Himo |
| collection | DOAJ |
| description | In the context of the theory of multi-agent systems, the shepherding problem refers to designing the dynamics of a herding agent, called a sheepdog, so that a given flock of agents, called sheep, is guided into a goal region. Although several effective methodologies and algorithms have been proposed in the last decade for the shepherding problem under various formulations, little research has been directed to the practically important case in which the flock contains sheep agents unresponsive to the sheepdog agent. To fill in this gap, we propose a sheepdog algorithm for guiding unresponsive sheep in this paper. In the algorithm, the sheepdog iteratively applies an existing shepherding algorithm, the farthest-agent targeting algorithm, while dynamically switching its destination. This procedure achieves the incremental growth of a controllable flock, which finally enables the sheepdog to guide the entire flock into the goal region. Furthermore, we illustrate by numerical simulations that the proposed algorithm can outperform the farthest-agent targeting algorithm. |
| first_indexed | 2024-12-10T17:23:00Z |
| format | Article |
| id | doaj.art-e1fcb4e75b254aeba4ca96137006db49 |
| institution | Directory Open Access Journal |
| issn | 1551-0018 |
| language | English |
| last_indexed | 2024-12-10T17:23:00Z |
| publishDate | 2022-02-01 |
| publisher | AIMS Press |
| record_format | Article |
| series | Mathematical Biosciences and Engineering |
| spelling | doaj.art-e1fcb4e75b254aeba4ca96137006db492022-12-22T01:39:55ZengAIMS PressMathematical Biosciences and Engineering1551-00182022-02-011943509352510.3934/mbe.2022162Iterative shepherding control for agents with heterogeneous responsivityRyoto Himo0Masaki Ogura1Naoki Wakamiya2Graduate School of Information Science and Technology, Osaka University, 1–5 Yamadaoka, Suita, Osaka 565–0871, JapanGraduate School of Information Science and Technology, Osaka University, 1–5 Yamadaoka, Suita, Osaka 565–0871, JapanGraduate School of Information Science and Technology, Osaka University, 1–5 Yamadaoka, Suita, Osaka 565–0871, JapanIn the context of the theory of multi-agent systems, the shepherding problem refers to designing the dynamics of a herding agent, called a sheepdog, so that a given flock of agents, called sheep, is guided into a goal region. Although several effective methodologies and algorithms have been proposed in the last decade for the shepherding problem under various formulations, little research has been directed to the practically important case in which the flock contains sheep agents unresponsive to the sheepdog agent. To fill in this gap, we propose a sheepdog algorithm for guiding unresponsive sheep in this paper. In the algorithm, the sheepdog iteratively applies an existing shepherding algorithm, the farthest-agent targeting algorithm, while dynamically switching its destination. This procedure achieves the incremental growth of a controllable flock, which finally enables the sheepdog to guide the entire flock into the goal region. Furthermore, we illustrate by numerical simulations that the proposed algorithm can outperform the farthest-agent targeting algorithm.http://www.aimspress.com/article/doi/10.3934/mbe.2022162?viewType=HTMLshepherdingheterogeneityfarthest-agent targetingmulti-agent systems |
| spellingShingle | Ryoto Himo Masaki Ogura Naoki Wakamiya Iterative shepherding control for agents with heterogeneous responsivity Mathematical Biosciences and Engineering shepherding heterogeneity farthest-agent targeting multi-agent systems |
| title | Iterative shepherding control for agents with heterogeneous responsivity |
| title_full | Iterative shepherding control for agents with heterogeneous responsivity |
| title_fullStr | Iterative shepherding control for agents with heterogeneous responsivity |
| title_full_unstemmed | Iterative shepherding control for agents with heterogeneous responsivity |
| title_short | Iterative shepherding control for agents with heterogeneous responsivity |
| title_sort | iterative shepherding control for agents with heterogeneous responsivity |
| topic | shepherding heterogeneity farthest-agent targeting multi-agent systems |
| url | http://www.aimspress.com/article/doi/10.3934/mbe.2022162?viewType=HTML |
| work_keys_str_mv | AT ryotohimo iterativeshepherdingcontrolforagentswithheterogeneousresponsivity AT masakiogura iterativeshepherdingcontrolforagentswithheterogeneousresponsivity AT naokiwakamiya iterativeshepherdingcontrolforagentswithheterogeneousresponsivity |