A framework for multi-robot node coverage in sensor networks

DOI10.1007/s10472-009-9126-9zbMath1185.68733OpenAlexW2033168138MaRDI QIDQ1022471

Andrea Gasparri, Bhaskar Krishnamachari, Gaurav S. Sukhatme

Publication date: 22 June 2009

Published in: Annals of Mathematics and Artificial Intelligence (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10472-009-9126-9

zbMATH Keywords

distributed algorithmsarea coveragepath construction

Mathematics Subject Classification ID

Automated systems (robots, etc.) in control theory (93C85) Artificial intelligence for robotics (68T40)

Related Items

Robotic data mules for collecting data over sparse sensor fields ⋮ Clock synchronization protocol for wireless sensor networks with bounded communication delays ⋮ Balanced parallel exploration of orthogonal regions

Cites Work

• Optimization by Simulated Annealing
• The giving tree: Constructing trees for efficient offline and online multi-robot coverage
• Evolution algorithms in combinatorial optimization
• A branch and bound algorithm for the symmetric traveling salesman problem based on the 1-tree relaxation
• A distributed implementation of simulated annealing for the travelling salesman problem
• Approximation algorithms for lawn mowing and milling
• Spanning-tree based coverage of continuous areas by a mobile robot
• Coverage for robotics -- a survey of recent results
• Integer Programming Formulation of Traveling Salesman Problems
• Generalized Subtour Elimination Constraints and Connectivity Constraints
• An Analysis of Several Heuristics for the Traveling Salesman Problem
• Implementation of a parallel Genetic Algorithm on a cluster of workstations: Traveling Salesman Problem, a case study
• Unnamed Item
• Unnamed Item
• Unnamed Item