Results 1 - 10
of
96
On robust rendezvous for mobile autonomous agents
, 2005
"... This paper presents coordination algorithms for networks of mobile autonomous agents. The objective of the proposed algorithms is to achieve rendezvous, that is, agreement over the location of the agents in the network. We provide analysis and design results for multi-agent networks in arbitrary di ..."
Abstract
-
Cited by 203 (21 self)
- Add to MetaCart
This paper presents coordination algorithms for networks of mobile autonomous agents. The objective of the proposed algorithms is to achieve rendezvous, that is, agreement over the location of the agents in the network. We provide analysis and design results for multi-agent networks in arbitrary dimensions under weak requirements on the switching and failing communication topology. The correctness proof relies on proximity graphs and their properties and on a LaSalle Invariance Principle for nondeterministic discrete-time systems.
Finite-time convergent gradient flows with applications to network consensus
- Automatica
"... This paper introduces the normalized and signed gradient dynamical systems associated with a differentiable function. Extending recent results on nonsmooth stability analysis, we characterize their asymptotic convergence properties and identify conditions that guarantee finite-time convergence. We d ..."
Abstract
-
Cited by 66 (5 self)
- Add to MetaCart
(Show Context)
This paper introduces the normalized and signed gradient dynamical systems associated with a differentiable function. Extending recent results on nonsmooth stability analysis, we characterize their asymptotic convergence properties and identify conditions that guarantee finite-time convergence. We discuss the application of the results to the design of multi-agent coordination algorithms, paying special attention to their scalability properties. Finally, we consider network consensus problems and show how the proposed nonsmooth gradient flows achieve the desired coordination task in finite time.
Sensing and coverage for a network of heterogeneous robots
- In 47th IEEE Conf. on Decision and Control (accepted for publication), Cancun
, 2008
"... Abstract—We address the problem of covering an envi-ronment with robots equipped with sensors. The robots are heterogeneous in that the sensor footprints are different. Our work uses the location optimization framework in [1], [2], with three significant extensions. First, we consider robots with di ..."
Abstract
-
Cited by 55 (4 self)
- Add to MetaCart
Abstract—We address the problem of covering an envi-ronment with robots equipped with sensors. The robots are heterogeneous in that the sensor footprints are different. Our work uses the location optimization framework in [1], [2], with three significant extensions. First, we consider robots with different sensor footprints, allowing, for example, aerial and ground vehicles to collaborate. We allow for finite size robots which enables implementation on real robotic systems. Lastly, we extend the previous work allowing for deployment in non convex environments. I.
Distributed Coverage Control with Sensory Feedback for Networked Robots
- IN PROCEEDINGS OF ROBOTICS: SCIENCE AND SYSTEMS
, 2006
"... This paper presents a control strategy that allows a group of mobile robots to position themselves to optimize the measurement of sensory information in the environment. The robots use sensed information to estimate a function indicating the relative importance of different areas in the environment ..."
Abstract
-
Cited by 48 (5 self)
- Add to MetaCart
(Show Context)
This paper presents a control strategy that allows a group of mobile robots to position themselves to optimize the measurement of sensory information in the environment. The robots use sensed information to estimate a function indicating the relative importance of different areas in the environment. Their estimate is then used to drive the network to a desirable placement configuration using a computationally simple decentralized control law. We formulate the problem, provide a practical control solution, and present the results of numerical simulations. We then discuss experiments carried out on a swarm of mobile robots.
Decentralized, Adaptive Coverage Control for Networked Robots
, 2007
"... A decentralized, adaptive control law is presented to drive a network of mobile robots to an optimal sensing configuration. The control law is adaptive in that it uses sensor measurements to learn an approximation of the distribution of sensory information in the environment. It is decentralized in ..."
Abstract
-
Cited by 44 (7 self)
- Add to MetaCart
(Show Context)
A decentralized, adaptive control law is presented to drive a network of mobile robots to an optimal sensing configuration. The control law is adaptive in that it uses sensor measurements to learn an approximation of the distribution of sensory information in the environment. It is decentralized in that it requires only information local to each robot. The controller is then improved upon by implementing a consensus algorithm in parallel with the learning algorithm, greatly increasing parameter convergence rates. Convergence and consensus of parameters is proven. Finally, several variations on the learning algorithm are explored with a discussion of their stability in closed loop. The controller with and without parameter consensus is demonstrated in numerical simulations. These techniques are suggestive of broader applications of adaptive control methodologies to decentralized control problems in unknown dynamical environments. 1
Distributed control of robotic networks: a mathematical approach to motion coordination algorithms
, 2009
"... (i) You are allowed to freely download, share, print, or photocopy this document. (ii) You are not allowed to modify, sell, or claim authorship of any part of this document. (iii) We thank you for any feedback information, including errors, suggestions, evaluations, and teaching or research uses. 2 ..."
Abstract
-
Cited by 41 (1 self)
- Add to MetaCart
(i) You are allowed to freely download, share, print, or photocopy this document. (ii) You are not allowed to modify, sell, or claim authorship of any part of this document. (iii) We thank you for any feedback information, including errors, suggestions, evaluations, and teaching or research uses. 2 “Distributed Control of Robotic Networks ” by F. Bullo, J. Cortés and S. Martínez
On Centroidal Voronoi Tessellation -- Energy Smoothness and Fast Computation
, 2008
"... Centroidal Voronoi tessellation (CVT) is a fundamental geometric structure that finds many applications in ..."
Abstract
-
Cited by 33 (15 self)
- Add to MetaCart
Centroidal Voronoi tessellation (CVT) is a fundamental geometric structure that finds many applications in
Decentralized, adaptive control for coverage with networked robots
- In Robotics and Automation, 2007 IEEE International Conference on
, 2007
"... Abstract-A decentralized, adaptive control law is presented to drive a network of mobile robots to a near-optimal sensing configuration. The control law is adaptive in that it integrates sensor measurements to provide a converging estimate of the distribution of sensory information in the environme ..."
Abstract
-
Cited by 31 (10 self)
- Add to MetaCart
(Show Context)
Abstract-A decentralized, adaptive control law is presented to drive a network of mobile robots to a near-optimal sensing configuration. The control law is adaptive in that it integrates sensor measurements to provide a converging estimate of the distribution of sensory information in the environment. It is decentralized in that it requires only information local to each robot. A Lyapunov-type proof is used to show that the control law causes the network to converge to a near-optimal sensing configuration, and the controller is demonstrated in numerical simulations. This technique suggests a broader application of adaptive control methodologies to decentralized control problems in unknown dynamical environments.
On synchronous robotic networks – Part II: Time complexity of rendezvous and deployment algorithms
- IEEE Transactions on Automatic Control, Apr
"... This paper analyzes a number of basic coordination algorithms running on synchronous robotic networks. We provide upper and lower bounds on the time complexity of the move-toward average and circumcenter laws, both achieving rendezvous, and of the centroid law, achieving deployment over a region of ..."
Abstract
-
Cited by 29 (5 self)
- Add to MetaCart
(Show Context)
This paper analyzes a number of basic coordination algorithms running on synchronous robotic networks. We provide upper and lower bounds on the time complexity of the move-toward average and circumcenter laws, both achieving rendezvous, and of the centroid law, achieving deployment over a region of interest. The results are derived via novel analysis methods, including a set of results on the convergence rates of linear dynamical systems defined by tridiagonal Toeplitz and circulant matrices. I.
