On Synchronous Robotic Networks—Part I: Models, Tasks, and Complexity
From MaRDI portal
Cited in
(18)- Dual decomposition for multi-agent distributed optimization with coupling constraints
- On the robustness of a synchronized multi-robot system
- Regularized dual gradient distributed method for constrained convex optimization over unbalanced directed graphs
- Predefined-time optimization for distributed resource allocation
- Gathering synchronous robots in graphs: from general properties to dense and symmetric topologies
- Relationships between the permanents of a certain type of \(k\)-tridiagonal symmetric Toeplitz matrix and the Chebyshev polynomials
- Subgradient averaging for multi-agent optimisation with different constraint sets
- Synchronisation effects on the behavioural performance and information dynamics of a simulated minimally cognitive robotic agent
- Convergence of Distributed WSN Algorithms: The Wake-Up Scattering Problem
- Distributed Tree Rearrangements for Reachability and Robust Connectivity
- Consensus reaching in multi-agent packet-switched networks with non-linear coupling
- Problems and methods of network control
- Computing by mobile robotic sensors
- Coordination and collision avoidance for Lagrangian systems with disturbances
- Distributed motion constraints for algebraic connectivity of robotic networks
- Distributed averaging on digital erasure networks
- Periodic event-triggered control for networked T-S fuzzy systems with packet losses and delays
- Sufficient conditions for connectivity maintenance and rendezvous in leader-follower networks
This page was built for publication: On Synchronous Robotic Networks—Part I: Models, Tasks, and Complexity
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5282305)
