pith. sign in

arxiv: 1907.07668 · v1 · pith:BFJMUC7Onew · submitted 2019-07-16 · 📡 eess.SY · cs.SY· math.OC

Connectivity-Preserving Swarm Teleoperation Over A Tree Network With Time-Varying Delays

Yuan Yang , Yang Shi , Daniela Constantinescu This is my paper

Pith reviewed 2026-05-24 20:34 UTC · model grok-4.3

classification 📡 eess.SY cs.SYmath.OC
keywords swarm teleoperationconnectivity preservationtime-varying delaystree networkLyapunov set invariancegain updating lawinput-to-state stability
0
0 comments X

The pith

A potential-based gain update law preserves initial tree connectivity in a teleoperated swarm despite operator inputs and time-varying delays.

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The paper constructs a control method for swarms that must track unpredictable human commands while keeping their communication links intact. Agents adjust the strength of their connections to neighbors and add damping using a tailored potential function whose value drives an explicit law for updating control gains. Lyapunov set-invariance arguments show that this law keeps the swarm inside its original connected tree when delays are absent. Stricter gain choices extend the guarantee to cases with time-varying communication delays, and the overall system satisfies input-to-state stability with respect to the operator. Experiments confirm that connectivity and synchronization hold in practice under the proposed rules.

Core claim

The explicit gain updating law, obtained from Lyapunov-based set invariance analysis of a customized potential, limits the effect of the operator input and preserves the initial tree connectivity of a delay-free swarm. Stricter selection of the control gains further ensures connectivity under time-varying intra-swarm delays, while the teleoperated time-delay swarm remains input-to-state stable under the resulting dynamic control.

What carries the argument

Customized potential function that drives real-time modulation of intra-swarm couplings and injected damping together with an explicit gain-updating law.

If this is right

  • Operator commands can be followed without breaking the initial tree structure when delays are zero.
  • The same architecture maintains connectivity when intra-swarm delays vary with time if gains are chosen more conservatively.
  • The closed-loop swarm satisfies input-to-state stability relative to the human operator.
  • Synchronization and connectivity are observed in experiments that apply the control to physical or simulated agents.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

  • The same potential-driven update might be adapted to maintain connectivity on graphs that are not trees if an appropriate invariant set can be defined.
  • Because the gain law is explicit, the approach could be combined with existing delay-compensation techniques from other multi-agent settings.
  • Real-time evaluation of the potential implies that the method scales to moderate swarm sizes provided each agent can sense its neighbors' positions and delays.

Load-bearing premise

The swarm begins as a connected tree and the potential function can be evaluated in real time with sufficient accuracy to enforce the required set invariance under the stated gain laws.

What would settle it

A numerical simulation or hardware experiment in which at least one communication link is lost while the proposed potential modulation and gain updates are active would disprove the connectivity-preservation claim.

Figures

Figures reproduced from arXiv: 1907.07668 by Daniela Constantinescu, Yang Shi, Yuan Yang.

Figure 1
Figure 1. Figure 1: The tree network G(t) and an orientation G ∗(t) of a slave swarm with dynamics (1). Further, the paper adopts the following assumptions on the initial configuration of the system and on the user force. Assumption 1. The initial connectivity of the slave swarm is a tree G(0), and each pair of initially adjacent slaves is strictly within their communication distance, i.e., ∀(i, j) ∈ E(0) ⇒ kxij (0)k < rˆ = r… view at source ↗
Figure 2
Figure 2. Figure 2: The experimental swarm teleoperation testbed. [PITH_FULL_IMAGE:figures/full_fig_p012_2.png] view at source ↗
Figure 3
Figure 3. Figure 3: The task-space paths of the master and all slave end-effectors under [PITH_FULL_IMAGE:figures/full_fig_p012_3.png] view at source ↗
Figure 6
Figure 6. Figure 6: The distances between slave 1 and slave 2 and 3 under the dynamic control (13) with no delay. Given estimated λi2 = 0.01 and ci = 0.01, it follows that Λij1 ≤ 0.237, Λij2 ≤ 30.9, Ki ≤ 2.515 and, by (46), that Υ = 3696.1. Sufficient damping D = 10 guarantees Dei > 0 by (40) and completes the controller design. 0 0.2 0.05 0.1 Z [m] 0.1 0.15 -Y [m] 0.1 0.05 0.2 X [m] 0 -0.05 0 -0.1 Master Slave1 Slave2 Slave3… view at source ↗
Figure 5
Figure 5. Figure 5: The task-space paths of the master and all slave end-effectors under [PITH_FULL_IMAGE:figures/full_fig_p013_5.png] view at source ↗
Figure 8
Figure 8. Figure 8: The mismatched distances between slave 1 and slaves 2 and 3 under the dynamic control (30) with time-varying delays up to T = 0.01 s. presence of unpredictable operator commands and time-delay inter-slave communications. The strategy modulates the inter￾swarm couplings and the damping injected to each slave based on a customized potential. After sliding surfaces reduce the order of the swarm dynamics, this… view at source ↗
read the original abstract

A teleoperated swarm must follow the unpredictable commands of its human operator while remaining connected. When the swarm communications are limited by distance and affected by delays, both the user input and the transmission delays endanger the connectivity of the swarm. This paper presents a constructive control strategy that overcomes both threats. The strategy modulates the intra-swarm couplings and the damping injected to each slave in the swarm based on a customized potential. Lyapunov-based set invariance analysis proves that the proposed explicit gain updating law limits the impact of the operator input and preserves the initial tree connectivity of a delay-free swarm. Further augmentation with stricter selection of control gains robustifies the design to time-varying delays in intra-swarm communications. The paper also establishes the input-to-state stability of a teleoperated time-delay swarm under the proposed dynamic control. Experiments validate connectivity maintenance and synchronization during time-delay swarm teleoperation with the proposed control.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Referee Report

2 major / 2 minor

Summary. The paper proposes a constructive control law for teleoperated swarms whose intra-swarm communications form a tree and are subject to time-varying delays. Couplings and per-agent damping are modulated by a customized potential function whose gradient yields an explicit gain-updating law. Lyapunov-based set-invariance arguments are used to show that the law preserves the initial tree connectivity when delays are absent; stricter gain bounds are then derived to retain the same invariance under bounded time-varying delays. Input-to-state stability of the closed-loop swarm with respect to the human operator input is established, and the claims are illustrated by experiments.

Significance. If the set-invariance and ISS derivations hold, the work supplies an explicit, real-time implementable method for guaranteeing connectivity maintenance under both operator commands and communication delays—an issue that is practically relevant for teleoperated multi-robot systems. The combination of a tree-topology assumption, potential-based gain adaptation, and delay-robustification is a clear technical contribution; the experimental validation adds credibility.

major comments (2)
  1. [§4] §4 (delay-free case): the set-invariance argument relies on the time derivative of the customized potential being non-positive outside a compact set; the explicit form of the potential and the precise condition under which the operator input term is dominated by the damping term are not stated, making it impossible to verify that the claimed invariance actually follows from the given gain law.
  2. [§5] §5 (time-varying delays): the stricter gain-selection rule is asserted to restore invariance, yet the proof sketch does not quantify how the delay bound enters the comparison lemma or the ultimate bound on the potential; without this step the extension from the delay-free to the delayed case remains formal.
minor comments (2)
  1. Notation for the tree Laplacian and the delay operator should be introduced once and used consistently; several symbols are redefined inline.
  2. The experimental section reports only qualitative connectivity maintenance; quantitative metrics (e.g., minimum edge length over time, number of connectivity-loss events) would strengthen the validation.

Simulated Author's Rebuttal

2 responses · 0 unresolved

We thank the referee for the constructive comments and positive evaluation of the work's significance. The points raised concern the explicitness of the set-invariance arguments; we address them directly below and revise the manuscript to supply the requested details.

read point-by-point responses

  1. Referee: [§4] §4 (delay-free case): the set-invariance argument relies on the time derivative of the customized potential being non-positive outside a compact set; the explicit form of the potential and the precise condition under which the operator input term is dominated by the damping term are not stated, making it impossible to verify that the claimed invariance actually follows from the given gain law.

    Authors: We agree that the explicit form of the potential and the domination condition were not stated with sufficient precision. In the revised manuscript we insert the closed-form expression for the customized potential, followed by the explicit inequality (involving the operator input norm, the minimum eigenvalue of the damping matrix, and the tree-edge distances) that guarantees the input term is strictly dominated by the damping term outside a compact level set of the potential. With this inequality the non-positivity of the derivative follows directly, completing the invariance proof. revision: yes

  2. Referee: [§5] §5 (time-varying delays): the stricter gain-selection rule is asserted to restore invariance, yet the proof sketch does not quantify how the delay bound enters the comparison lemma or the ultimate bound on the potential; without this step the extension from the delay-free to the delayed case remains formal.

    Authors: We accept that the quantitative dependence on the delay bound was omitted. The revision augments the comparison lemma with an explicit differential inequality whose right-hand side contains the maximum delay bound multiplied by a Lipschitz constant of the delayed coupling terms. Solving the inequality yields an ultimate bound on the potential that is linear in the delay bound; the stricter gain lower bound is then chosen to keep this ultimate bound below the connectivity threshold, thereby restoring invariance. The full derivation is now included. revision: yes

Circularity Check

0 steps flagged

No significant circularity in derivation chain

full rationale

The paper's claims rest on standard Lyapunov-based set invariance analysis applied to a customized potential function and explicit gain-updating law for a tree network. The abstract and reader's assessment describe a constructive control strategy whose stability and connectivity preservation results are derived from first-principles set-invariance arguments under stated assumptions on topology and bounded delays. No self-definitional reductions, fitted parameters renamed as predictions, or load-bearing self-citations appear; the central proofs remain independent of the target results by construction.

Axiom & Free-Parameter Ledger

0 free parameters · 0 axioms · 0 invented entities

Abstract provides no explicit free parameters, axioms, or invented entities; the potential function and gain laws are described at a level too high to audit.

pith-pipeline@v0.9.0 · 5689 in / 1144 out tokens · 19870 ms · 2026-05-24T20:34:28.328854+00:00 · methodology

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Lean theorems connected to this paper

Citations machine-checked in the Pith Canon. Every link opens the source theorem in the public Lean library.

What do these tags mean?
matches
The paper's claim is directly supported by a theorem in the formal canon.
supports
The theorem supports part of the paper's argument, but the paper may add assumptions or extra steps.
extends
The paper goes beyond the formal theorem; the theorem is a base layer rather than the whole result.
uses
The paper appears to rely on the theorem as machinery.
contradicts
The paper's claim conflicts with a theorem or certificate in the canon.
unclear
Pith found a possible connection, but the passage is too broad, indirect, or ambiguous to say the theorem truly supports the claim.

Reference graph

Works this paper leans on

57 extracted references · 57 canonical work pages

  1. [1]

    Eyes in the sky: Decentralized control for the deployment of robotic camera networks,

    M. Schwager, B. J. Julian, M. Angermann, and D. Rus, “Eyes in the sky: Decentralized control for the deployment of robotic camera networks,” Proceedings of the IEEE , vol. 99, no. 9, pp. 1541–1561, Sept 2011

    work page 2011

  2. [2]

    Planning and control for cooperative manipulation and transportation with aerial robots,

    J. Fink, N. Michael, S. Kim, and V . Kumar, “Planning and control for cooperative manipulation and transportation with aerial robots,” The International Journal of Robotics Research, vol. 30, no. 3, pp. 324–334, 2011

    work page 2011

  3. [3]

    Shared control : Balancing autonomy and human assistance with a group of quadrotor uavs,

    A. Franchi, C. Secchi, M. Ryll, H. H. B ¨ulthoff, and P. R. Giordano, “Shared control : Balancing autonomy and human assistance with a group of quadrotor uavs,” IEEE Robotics Automation Magazine, vol. 19, no. 3, pp. 57–68, Sept 2012

    work page 2012

  4. [4]

    Bilateral teleoperation of groups of uavs with decentralized connectivity mainte- nance

    P. R. Giordano, A. Franchi, C. Secchi, and H. H. B ¨ulthoff, “Bilateral teleoperation of groups of uavs with decentralized connectivity mainte- nance.” in Robotics: Science and Systems . Citeseer, 2011

    work page 2011

  5. [5]

    Bilateral teleoperation of groups of mobile robots with time-varying topology,

    A. Franchi, C. Secchi, H. I. Son, H. H. B ¨ulthoff, and P. R. Giordano, “Bilateral teleoperation of groups of mobile robots with time-varying topology,” IEEE Transactions on Robotics , vol. 28, no. 5, pp. 1019– 1033, Oct 2012

    work page 2012

  6. [6]

    Semiautonomous haptic teleoperation control architecture of multiple unmanned aerial vehicles,

    D. Lee, A. Franchi, H. I. Son, C. Ha, H. H. B ¨ulthoff, and P. R. Giordano, “Semiautonomous haptic teleoperation control architecture of multiple unmanned aerial vehicles,” IEEE/ASME Transactions on Mechatronics , vol. 18, no. 4, pp. 1334–1345, Aug 2013

    work page 2013

  7. [7]

    Assistive collision avoidance for quadro- tor swarm teleoperation,

    D. Zhou and M. Schwager, “Assistive collision avoidance for quadro- tor swarm teleoperation,” in 2016 IEEE International Conference on Robotics and Automation (ICRA) , May 2016, pp. 1249–1254

    work page 2016

  8. [8]

    Modeling and control of uav bearing formations with bilat- eral high-level steering,

    A. Franchi, C. Masone, V . Grabe, M. Ryll, H. H. B ¨ulthoff, and P. R. Giordano, “Modeling and control of uav bearing formations with bilat- eral high-level steering,”The International Journal of Robotics Research, vol. 31, no. 12, pp. 1504–1525, 2012

    work page 2012

  9. [9]

    Design and implementation of a novel architecture for physical human-uav interaction,

    S. Rajappa, H. B ¨ulthoff, and P. Stegagno, “Design and implementation of a novel architecture for physical human-uav interaction,” The Inter- national Journal of Robotics Research , vol. 36, no. 5-7, pp. 800–819, 2017

    work page 2017

  10. [10]

    Human-centered design and evaluation of haptic cueing for teleoperation of multiple mobile robots,

    H. I. Son, A. Franchi, L. L. Chuang, J. Kim, H. H. B ¨ulthoff, and P. R. Giordano, “Human-centered design and evaluation of haptic cueing for teleoperation of multiple mobile robots,” IEEE Transactions on Cybernetics, vol. 43, no. 2, pp. 597–609, April 2013

    work page 2013

  11. [11]

    Multirobot control using time-varying density functions,

    S. G. Lee, Y . Diaz-Mercado, and M. Egerstedt, “Multirobot control using time-varying density functions,” IEEE Transactions on Robotics, vol. 31, no. 2, pp. 489–493, April 2015

    work page 2015

  12. [12]

    Decentralized connectivity maintenance for cooperative control of mobile robotic systems,

    L. Sabattini, N. Chopra, and C. Secchi, “Decentralized connectivity maintenance for cooperative control of mobile robotic systems,” The International Journal of Robotics Research , vol. 32, no. 12, pp. 1411– 1423, 2013

    work page 2013

  13. [13]

    A passivity- based decentralized strategy for generalized connectivity maintenance,

    P. R. Giordano, A. Franchi, C. Secchi, and H. H. B ¨ulthoff, “A passivity- based decentralized strategy for generalized connectivity maintenance,” The International Journal of Robotics Research, vol. 32, no. 3, pp. 299– 323, 2013

    work page 2013

  14. [14]

    Distributed control of multirobot systems with global connectivity maintenance,

    L. Sabattini, C. Secchi, N. Chopra, and A. Gasparri, “Distributed control of multirobot systems with global connectivity maintenance,” IEEE Transactions on Robotics , vol. 29, no. 5, pp. 1326–1332, Oct 2013

    work page 2013

  15. [15]

    Distributed coordination control of multia- gent systems while preserving connectedness,

    M. Ji and M. Egerstedt, “Distributed coordination control of multia- gent systems while preserving connectedness,” IEEE Transactions on Robotics, vol. 23, no. 4, pp. 693–703, Aug 2007

    work page 2007

  16. [16]

    On the rendezvous problem for multiple nonholonomic agents,

    D. V . Dimarogonas and K. J. Kyriakopoulos, “On the rendezvous problem for multiple nonholonomic agents,” IEEE Transactions on Automatic Control, vol. 52, no. 5, pp. 916–922, May 2007

    work page 2007

  17. [17]

    Connectedness preserving distributed swarm aggregation for multiple kinematic robots,

    ——, “Connectedness preserving distributed swarm aggregation for multiple kinematic robots,” IEEE Transactions on Robotics , vol. 24, no. 5, pp. 1213–1223, Oct 2008

    work page 2008

  18. [18]

    Distributed connectivity control of mobile networks,

    M. M. Zavlanos and G. J. Pappas, “Distributed connectivity control of mobile networks,” IEEE Transactions on Robotics , vol. 24, no. 6, pp. 1416–1428, Dec 2008

    work page 2008

  19. [19]

    A class of bounded distributed control strategies for connectivity preservation in multi-agent systems,

    A. Ajorlou, A. Momeni, and A. G. Aghdam, “A class of bounded distributed control strategies for connectivity preservation in multi-agent systems,” IEEE Transactions on Automatic Control , vol. 55, no. 12, pp. 2828–2833, Dec 2010

    work page 2010

  20. [20]

    Connectivity preservation in nonholo- nomic multi-agent systems: A bounded distributed control strategy,

    A. Ajorlou and A. G. Aghdam, “Connectivity preservation in nonholo- nomic multi-agent systems: A bounded distributed control strategy,” IEEE Transactions on Automatic Control, vol. 58, no. 9, pp. 2366–2371, Sept 2013

    work page 2013

  21. [21]

    Graph matching-based formation reconfiguration of networked agents with connectivity maintenance,

    Z. Kan, L. Navaravong, J. M. Shea, E. L. Pasiliao, and W. E. Dixon, “Graph matching-based formation reconfiguration of networked agents with connectivity maintenance,” IEEE Transactions on Control of Net- work Systems, vol. 2, no. 1, pp. 24–35, March 2015

    work page 2015

  22. [22]

    Finite-time connectivity preservation rendezvous with disturbance rejection,

    J.-G. Dong, “Finite-time connectivity preservation rendezvous with disturbance rejection,” Automatica, vol. 71, pp. 57 – 61, 2016

    work page 2016

  23. [23]

    Finite-time connectivity-preserving consensus of networked nonlinear agents with unknown lipschitz terms,

    Y . Cao, W. Ren, D. W. Casbeer, and C. Schumacher, “Finite-time connectivity-preserving consensus of networked nonlinear agents with unknown lipschitz terms,” IEEE Transactions on Automatic Control , vol. 61, no. 6, pp. 1700–1705, June 2016

    work page 2016

  24. [24]

    Network connectivity preserving formation stabilization and obstacle avoidance via a decen- tralized controller,

    Z. Kan, A. P. Dani, J. M. Shea, and W. E. Dixon, “Network connectivity preserving formation stabilization and obstacle avoidance via a decen- tralized controller,” IEEE Transactions on Automatic Control , vol. 57, no. 7, pp. 1827–1832, July 2012

    work page 2012

  25. [25]

    A general approach to coordination control of mobile agents with motion constraints,

    S. Zhao, D. Dimarogonas, Z. Sun, and D. Bauso, “A general approach to coordination control of mobile agents with motion constraints,” IEEE Transactions on Automatic Control, vol. PP, no. 99, pp. 1–1, September 2017

    work page 2017

  26. [26]

    Multirobot coordination with periodic connectivity: Theory and experiments,

    G. A. Hollinger and S. Singh, “Multirobot coordination with periodic connectivity: Theory and experiments,” IEEE Transactions on Robotics, vol. 28, no. 4, pp. 967–973, Aug 2012

    work page 2012

  27. [27]

    Distributed intermittent connectivity control of mobile robot networks,

    Y . Kantaros and M. M. Zavlanos, “Distributed intermittent connectivity control of mobile robot networks,” IEEE Transactions on Automatic Control, vol. 62, no. 7, pp. 3109–3121, July 2017

    work page 2017

  28. [28]

    Preserving strong connectivity in directed proximity graphs,

    H. A. Poonawala and M. W. Spong, “Preserving strong connectivity in directed proximity graphs,” IEEE Transactions on Automatic Control , vol. 62, no. 9, pp. 4392–4404, Sept 2017

    work page 2017

  29. [29]

    Robustness and invariance of connectivity maintenance control for multiagent systems,

    D. Boskos and D. V . Dimarogonas, “Robustness and invariance of connectivity maintenance control for multiagent systems,” SIAM Journal on Control and Optimization , vol. 55, no. 3, pp. 1887–1914, 2017. 15

    work page 1914

  30. [30]

    Bounded control law for global connectivity maintenance in cooperative multirobot systems,

    A. Gasparri, L. Sabattini, and G. Ulivi, “Bounded control law for global connectivity maintenance in cooperative multirobot systems,” IEEE Transactions on Robotics, vol. 33, no. 3, pp. 700–717, June 2017

    work page 2017

  31. [31]

    Rendezvous of multiple mobile agents with preserved network connectivity,

    H. Su, X. Wang, and G. Chen, “Rendezvous of multiple mobile agents with preserved network connectivity,” Systems & Control Letters, vol. 59, no. 5, pp. 313 – 322, 2010

    work page 2010

  32. [32]

    Adaptive second-order consensus of networked mobile agents with nonlinear dynamics,

    H. Su, G. Chen, X. Wang, and Z. Lin, “Adaptive second-order consensus of networked mobile agents with nonlinear dynamics,” Automatica, vol. 47, no. 2, pp. 368 – 375, 2011

    work page 2011

  33. [33]

    A leader-following rendezvous problem of double integrator multi-agent systems,

    Y . Dong and J. Huang, “A leader-following rendezvous problem of double integrator multi-agent systems,” Automatica, vol. 49, no. 5, pp. 1386 – 1391, 2013

    work page 2013

  34. [34]

    Leader-following connectivity preservation rendezvous of mul- tiple double integrator systems based on position measurement only,

    ——, “Leader-following connectivity preservation rendezvous of mul- tiple double integrator systems based on position measurement only,” IEEE Transactions on Automatic Control, vol. 59, no. 9, pp. 2598–2603, Sept 2014

    work page 2014

  35. [35]

    Leader-following rendezvous with connectivity preservation and disturbance rejection via internal model approach,

    Y . Su, “Leader-following rendezvous with connectivity preservation and disturbance rejection via internal model approach,” Automatica, vol. 57, pp. 203 – 212, 2015

    work page 2015

  36. [36]

    Second-order consensus of multi-agent systems under limited interaction ranges,

    X. Ai, S. Song, and K. You, “Second-order consensus of multi-agent systems under limited interaction ranges,” Automatica, vol. 68, pp. 329 – 333, 2016

    work page 2016

  37. [37]

    Leader-follower swarm tracking for networked Lagrange systems,

    Z. Meng, Z. Lin, and W. Ren, “Leader-follower swarm tracking for networked Lagrange systems,” Systems & Control Letters, vol. 61, no. 1, pp. 117 – 126, 2012

    work page 2012

  38. [38]

    Leader-following consensus with connectivity preservation of uncertain Euler–Lagrange multi-agent systems,

    Y . Dong and J. Huang, “Leader-following consensus with connectivity preservation of uncertain Euler–Lagrange multi-agent systems,” Inter- national Journal of Robust and Nonlinear Control , 2017

    work page 2017

  39. [39]

    Robust connectivity preserving rendezvous of multirobot systems under unknown dynamics and disturbances,

    Z. Feng, C. Sun, and G. Hu, “Robust connectivity preserving rendezvous of multirobot systems under unknown dynamics and disturbances,”IEEE Transactions on Control of Network Systems, vol. 4, no. 4, pp. 725–735, Dec 2017

    work page 2017

  40. [40]

    Flocking with connectivity preservation of multiple double integrator systems subject to external disturbances by a distributed control law,

    Y . Dong and J. Huang, “Flocking with connectivity preservation of multiple double integrator systems subject to external disturbances by a distributed control law,” Automatica, vol. 55, pp. 197 – 203, 2015

    work page 2015

  41. [41]

    Robust finite-time connectivity preserving coordination of second-order multi-agent systems,

    C. Sun, G. Hu, L. Xie, and M. Egerstedt, “Robust finite-time connectivity preserving coordination of second-order multi-agent systems,” Automat- ica, vol. 89, pp. 21 – 27, 2018

    work page 2018

  42. [42]

    Bilateral con- trol of the degree of connectivity in multiple mobile-robot teleoperation,

    C. Secchi, A. Franchi, H. H. Blthoff, and P. R. Giordano, “Bilateral con- trol of the degree of connectivity in multiple mobile-robot teleoperation,” in 2013 IEEE International Conference on Robotics and Automation , May 2013, pp. 3645–3652

    work page 2013

  43. [43]

    Decentralized estimation and control of graph connectivity for mobile sensor networks,

    P. Yang, R. Freeman, G. Gordon, K. Lynch, S. Srinivasa, and R. Suk- thankar, “Decentralized estimation and control of graph connectivity for mobile sensor networks,” Automatica, vol. 46, no. 2, pp. 390 – 396, 2010

    work page 2010

  44. [44]

    Distributed algebraic connectivity estimation for undirected graphs with upper and lower bounds,

    R. Aragues, G. Shi, D. V . Dimarogonas, C. Sag ¨u´es, K. H. Johansson, and Y . Mezouar, “Distributed algebraic connectivity estimation for undirected graphs with upper and lower bounds,” Automatica, vol. 50, no. 12, pp. 3253 – 3259, 2014

    work page 2014

  45. [45]

    Decentralized estimation and control for preserving the strong connectivity of directed graphs,

    L. Sabattini, C. Secchi, and N. Chopra, “Decentralized estimation and control for preserving the strong connectivity of directed graphs,” IEEE Transactions on Cybernetics, vol. 45, no. 10, pp. 2273–2286, Oct 2015

    work page 2015

  46. [46]

    A control lyapunov function approach to human-swarm interactions,

    J. P. de la Croix and M. Egerstedt, “A control lyapunov function approach to human-swarm interactions,” in 2015 American Control Conference (ACC), July 2015, pp. 4368–4373

    work page 2015

  47. [47]

    Connectivity-preservinf swarm teleoperation with a tree network,

    Y . Yang, Y . Shi, and D. Constantinescu, “Connectivity-preservinf swarm teleoperation with a tree network,” in Submitted to the 2019 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS 2019). Macau, China, 2019

    work page 2019

  48. [48]

    Mesbahi and M

    M. Mesbahi and M. Egerstedt, Graph theoretic methods in multiagent networks. Princeton University Press, 2010

    work page 2010

  49. [49]

    Passive-set-position-modulation framework for interactive robotic systems,

    D. Lee and K. Huang, “Passive-set-position-modulation framework for interactive robotic systems,” IEEE Transactions on Robotics , vol. 26, no. 2, pp. 354–369, April 2010

    work page 2010

  50. [50]

    A lyapunov–krasovskii methodology for iss and iiss of time-delay systems,

    P. Pepe and Z.-P. Jiang, “A lyapunov–krasovskii methodology for iss and iiss of time-delay systems,” Systems & Control Letters , vol. 55, no. 12, pp. 1006–1014, 2006

    work page 2006

  51. [51]

    Cooperative robot control and concurrent synchronization of lagrangian systems,

    S. Chung and J. E. Slotine, “Cooperative robot control and concurrent synchronization of lagrangian systems,” IEEE Transactions on Robotics, vol. 25, no. 3, pp. 686–700, June 2009

    work page 2009

  52. [52]

    Synchronization of net- works of nonidentical Euler-Lagrange systems with uncertain parameters and communication delays,

    E. Nu ˜no, R. Ortega, L. Basa ˜nez, and D. Hill, “Synchronization of net- works of nonidentical Euler-Lagrange systems with uncertain parameters and communication delays,” IEEE Transactions on Automatic Control , vol. 56, no. 4, pp. 935–941, April 2011

    work page 2011

  53. [53]

    Feedback r-passivity of lagrangian systems for mobile robot teleoperation,

    D. Lee and D. Xu, “Feedback r-passivity of lagrangian systems for mobile robot teleoperation,” in 2011 IEEE International Conference on Robotics and Automation , May 2011, pp. 2118–2123

    work page 2011

  54. [54]

    Set invariance in control,

    F. Blanchini, “Set invariance in control,” Automatica, vol. 35, no. 11, pp. 1747–1767, 1999

    work page 1999

  55. [55]

    Control barrier function based quadratic programs for safety critical systems,

    A. D. Ames, X. Xu, J. W. Grizzle, and P. Tabuada, “Control barrier function based quadratic programs for safety critical systems,” IEEE Transactions on Automatic Control, vol. 62, no. 8, pp. 3861–3876, 2017

    work page 2017

  56. [56]

    Sepulchre, M

    R. Sepulchre, M. Jankovic, and P. V . Kokotovic, Constructive nonlinear control. Springer Science & Business Media, 2012

    work page 2012

  57. [57]

    Artificial and virtual impedance interaction force reflection-based bilateral shared control for miniature unmanned aerial vehicle,

    S. Islam, P. X. Liu, A. E. Saddik, R. Ashour, J. Dias, and L. D. Senevi- ratne, “Artificial and virtual impedance interaction force reflection-based bilateral shared control for miniature unmanned aerial vehicle,” IEEE Transactions on Industrial Electronics, vol. 66, no. 1, pp. 329–337, Jan 2019

    work page 2019