Multirobot Control Using Time-Varying Density Functions
207
TL;DR: An approach is presented for influencing teams of robots by means of time-varying density functions, representing rough references for where the robots should be located, and distributed approximations are given whereby the robots only need to access information from adjacent robots.
read more
Abstract: An approach is presented for influencing teams of robots by means of time-varying density functions, representing rough references for where the robots should be located A continuous-time coverage algorithm is proposed and distributed approximations are given whereby the robots only need to access information from adjacent robots Robotic experiments show that the proposed algorithms work in practice, as well as in theory
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
•Posted Content
Coverage control for mobile sensing networks
TL;DR: This paper proposes gradient descent algorithms for a class of utility functions which encode optimal coverage and sensing policies which are adaptive, distributed, asynchronous, and verifiably correct.
2.2K
Coordinated Control of Multi-Robot Systems: A Survey
Jorge E. Cortes,Magnus Egerstedt +1 more
TL;DR: A class of problems related to the assembly of preferable geometric shapes in a decentralized manner through the formulation of descent-based algorithms defined with respect to team-level performance costs are discussed.
200
Prediction-Correction Interior-Point Method for Time-Varying Convex Optimization
TL;DR: In this article, a continuous-time dynamical system for tracking the (time-varying) optimal solution with an asymptotically vanishing error is proposed, which is composed of two terms: a correction term consisting of a continuous time version of Newton's method, and a prediction term able to track the drift of the optimal solution by taking into account the time-vanging nature of the objective and constraint functions.
168
Coverage Control for Multirobot Teams With Heterogeneous Sensing Capabilities
Maria Santos,Yancy Diaz-Mercado,Magnus Egerstedt +2 more
- 12 Jan 2018
TL;DR: This letter investigates how mobile agents with qualitatively different sensing capabilities should be organized in order to effectively cover an area by encoding the different capabilities as different density functions in the locational cost and shows how these additional terms can be formulated as boundary-disagreement terms that are added to the standard Lloyd's algorithm.
127
Bounded Control Law for Global Connectivity Maintenance in Cooperative Multirobot Systems
TL;DR: This paper describes the effect of the connectivity control term on the achievement of the collective control objective by resorting to an input-to-state stability-like analysis and provides numerical and experimental results to corroborate the theoretical findings and assess the effectiveness of the proposed bounded connectivity maintenance control law.
99
References
Least squares quantization in PCM
TL;DR: In this article, the authors derived necessary conditions for any finite number of quanta and associated quantization intervals of an optimum finite quantization scheme to achieve minimum average quantization noise power.
Coverage control for mobile sensing networks
Jorge E. Cortes,Sonia Martinez,Timur Karatas,Francesco Bullo +3 more
- 07 Aug 2002
TL;DR: In this paper, the authors describe decentralized control laws for the coordination of multiple vehicles performing spatially distributed tasks, which are based on a gradient descent scheme applied to a class of decentralized utility functions that encode optimal coverage and sensing policies.
Centroidal Voronoi Tessellations: Applications and Algorithms
TL;DR: Some applications of centroidal Voronoi tessellations to problems in image compression, quadrature, finite difference methods, distribution of resources, cellular biology, statistics, and the territorial behavior of animals are given.
Generalizing motion edits with Gaussian processes
TL;DR: This work shows that it can make motion editing more efficient by generalizing the edits an animator makes on short sequences of motion to other sequences, and predicts frames for the motion using Gaussian process models of kinematics and dynamics.
1.3K
Exposure in wireless Ad-Hoc sensor networks
Seapahn Meguerdichian,Farinaz Koushanfar,Gang Qu,Miodrag Potkonjak +3 more
- 16 Jul 2001
TL;DR: This work has developed an efficient and effective algorithm for exposure calculation in sensor networks, specifically for finding minimal exposure paths and provides an unbounded level of accuracy as a function of run time and storage.