Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Preprint |
| Published: |
2018
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/1802.00906 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866929556854669312 |
|---|---|
| author | Ye, Mengbin Anderson, Brian D. O. Yu, Changbin |
| author_facet | Ye, Mengbin Anderson, Brian D. O. Yu, Changbin |
| contents | In this paper, we propose a discontinuous distributed model-independent algorithm for a directed network of Euler-Lagrange agents to track the trajectory of a leader with non-constant velocity. We initially study a fixed network and show that the leader tracking objective is achieved semi-globally exponentially fast if the graph contains a directed spanning tree. By model-independent, we mean that each agent executes its algorithm with no knowledge of the parameter values of any agent's dynamics. Certain bounds on the agent dynamics (including any disturbances) and network topology information are used to design the control gain. This fact, combined with the algorithm's model-independence, results in robustness to disturbances and modelling uncertainties. Next, a continuous approximation of the algorithm is proposed, which achieves practical tracking with an adjustable tracking error. Last, we show that the algorithm is stable for networks that switch with an explicitly computable dwell time. Numerical simulations are given to show the algorithm's effectiveness. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_1802_00906 |
| institution | arXiv |
| publishDate | 2018 |
| record_format | arxiv |
| spellingShingle | Leader Tracking of Euler-Lagrange Agents on Directed Switching Networks Using A Model-Independent Algorithm Ye, Mengbin Anderson, Brian D. O. Yu, Changbin Systems and Control In this paper, we propose a discontinuous distributed model-independent algorithm for a directed network of Euler-Lagrange agents to track the trajectory of a leader with non-constant velocity. We initially study a fixed network and show that the leader tracking objective is achieved semi-globally exponentially fast if the graph contains a directed spanning tree. By model-independent, we mean that each agent executes its algorithm with no knowledge of the parameter values of any agent's dynamics. Certain bounds on the agent dynamics (including any disturbances) and network topology information are used to design the control gain. This fact, combined with the algorithm's model-independence, results in robustness to disturbances and modelling uncertainties. Next, a continuous approximation of the algorithm is proposed, which achieves practical tracking with an adjustable tracking error. Last, we show that the algorithm is stable for networks that switch with an explicitly computable dwell time. Numerical simulations are given to show the algorithm's effectiveness. |
| title | Leader Tracking of Euler-Lagrange Agents on Directed Switching Networks Using A Model-Independent Algorithm |
| topic | Systems and Control |
| url | https://arxiv.org/abs/1802.00906 |