### Abstract

We consider the problem of distributed partitioning of an environment by a set of robots so that each robot performs its operations in the region within the corresponding cell. Voronoi partitioning is one of the most attractive techniques that has been used to solve this problem. It has been used in several distributed multi-robotic system and sensor network applications, such as sensor coverage, search and rescue, and coverage path planning. For a truly distributed implementation of such problems, each robot should be able to compute the corresponding Voronoi cell in a distributed manner. Further, in a practical application, the robots' sensors may have limited range, thus each robot may operate within a portion of its Voronoi cell constrained by the sensor range. We describe a distributed algorithm for computation of this range constrained Voronoi cell where each robot independently constructs chords corresponding to other robots that are within a distance of twice its sensor circle radius. A robot then uses a simple and fast technique to remove inessential chords to calculate the vertices of its Voronoi cell. We prove completeness and correctness of the proposed algorithm, and also provide the upper and lower bounds on the computational complexity of our algorithm. The theoretical results are validated with the help of experiments to show that for different values of sensor ranges, our proposed algorithm incurs a time complexity that is significantly lower than that of the existing full Voronoi partition computation algorithm. The maximum number of steps required by our algorithm is also shown to be within a constant times the lower bound given by the number of neighbors of each node.

Original language | English (US) |
---|---|

Title of host publication | 2012 IEEE/RSJ International Conference on Intelligent Robots and Systems, IROS 2012 |

Pages | 3546-3552 |

Number of pages | 7 |

DOIs | |

State | Published - Dec 1 2012 |

Event | 25th IEEE/RSJ International Conference on Robotics and Intelligent Systems, IROS 2012 - Vilamoura, Algarve, Portugal Duration: Oct 7 2012 → Oct 12 2012 |

### Publication series

Name | IEEE International Conference on Intelligent Robots and Systems |
---|---|

ISSN (Print) | 2153-0858 |

ISSN (Electronic) | 2153-0866 |

### Conference

Conference | 25th IEEE/RSJ International Conference on Robotics and Intelligent Systems, IROS 2012 |
---|---|

Country | Portugal |

City | Vilamoura, Algarve |

Period | 10/7/12 → 10/12/12 |

### Fingerprint

### ASJC Scopus subject areas

- Control and Systems Engineering
- Software
- Computer Vision and Pattern Recognition
- Computer Science Applications

### Cite this

*2012 IEEE/RSJ International Conference on Intelligent Robots and Systems, IROS 2012*(pp. 3546-3552). [6385850] (IEEE International Conference on Intelligent Robots and Systems). https://doi.org/10.1109/IROS.2012.6385850

**Distributed Voronoi partitioning for multi-robot systems with limited range sensors.** / Guruprasad, K. R.; Dasgupta, Prithviraj.

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

*2012 IEEE/RSJ International Conference on Intelligent Robots and Systems, IROS 2012.*, 6385850, IEEE International Conference on Intelligent Robots and Systems, pp. 3546-3552, 25th IEEE/RSJ International Conference on Robotics and Intelligent Systems, IROS 2012, Vilamoura, Algarve, Portugal, 10/7/12. https://doi.org/10.1109/IROS.2012.6385850

}

TY - GEN

T1 - Distributed Voronoi partitioning for multi-robot systems with limited range sensors

AU - Guruprasad, K. R.

AU - Dasgupta, Prithviraj

PY - 2012/12/1

Y1 - 2012/12/1

N2 - We consider the problem of distributed partitioning of an environment by a set of robots so that each robot performs its operations in the region within the corresponding cell. Voronoi partitioning is one of the most attractive techniques that has been used to solve this problem. It has been used in several distributed multi-robotic system and sensor network applications, such as sensor coverage, search and rescue, and coverage path planning. For a truly distributed implementation of such problems, each robot should be able to compute the corresponding Voronoi cell in a distributed manner. Further, in a practical application, the robots' sensors may have limited range, thus each robot may operate within a portion of its Voronoi cell constrained by the sensor range. We describe a distributed algorithm for computation of this range constrained Voronoi cell where each robot independently constructs chords corresponding to other robots that are within a distance of twice its sensor circle radius. A robot then uses a simple and fast technique to remove inessential chords to calculate the vertices of its Voronoi cell. We prove completeness and correctness of the proposed algorithm, and also provide the upper and lower bounds on the computational complexity of our algorithm. The theoretical results are validated with the help of experiments to show that for different values of sensor ranges, our proposed algorithm incurs a time complexity that is significantly lower than that of the existing full Voronoi partition computation algorithm. The maximum number of steps required by our algorithm is also shown to be within a constant times the lower bound given by the number of neighbors of each node.

AB - We consider the problem of distributed partitioning of an environment by a set of robots so that each robot performs its operations in the region within the corresponding cell. Voronoi partitioning is one of the most attractive techniques that has been used to solve this problem. It has been used in several distributed multi-robotic system and sensor network applications, such as sensor coverage, search and rescue, and coverage path planning. For a truly distributed implementation of such problems, each robot should be able to compute the corresponding Voronoi cell in a distributed manner. Further, in a practical application, the robots' sensors may have limited range, thus each robot may operate within a portion of its Voronoi cell constrained by the sensor range. We describe a distributed algorithm for computation of this range constrained Voronoi cell where each robot independently constructs chords corresponding to other robots that are within a distance of twice its sensor circle radius. A robot then uses a simple and fast technique to remove inessential chords to calculate the vertices of its Voronoi cell. We prove completeness and correctness of the proposed algorithm, and also provide the upper and lower bounds on the computational complexity of our algorithm. The theoretical results are validated with the help of experiments to show that for different values of sensor ranges, our proposed algorithm incurs a time complexity that is significantly lower than that of the existing full Voronoi partition computation algorithm. The maximum number of steps required by our algorithm is also shown to be within a constant times the lower bound given by the number of neighbors of each node.

UR - http://www.scopus.com/inward/record.url?scp=84872348932&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84872348932&partnerID=8YFLogxK

U2 - 10.1109/IROS.2012.6385850

DO - 10.1109/IROS.2012.6385850

M3 - Conference contribution

AN - SCOPUS:84872348932

SN - 9781467317375

T3 - IEEE International Conference on Intelligent Robots and Systems

SP - 3546

EP - 3552

BT - 2012 IEEE/RSJ International Conference on Intelligent Robots and Systems, IROS 2012

ER -