Leader Tracking of Euler-Lagrange Agents on Directed Switching Networks Using a Model-Independent Algorithm

Mengbin Ye, Brian D. O. Anderson, Changbin Yu*

*Corresponding author for this work

Research output: Contribution to journalArticleAcademicpeer-review

6 Citations (Scopus)
16 Downloads (Pure)


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 nonconstant velocity. We initially study a fixed network and show that the leader tracking objective is achieved semiglobally 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 modeling 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.

Original languageEnglish
Pages (from-to)561-571
Number of pages11
JournalIEEE Transactions on Control of Network Systems
Issue number2
Publication statusPublished - Jun-2019


  • Directed graph
  • distributed algorithm
  • Euler-Lagrange agent
  • model independent
  • switching network
  • tracking

Cite this