A projected Lloyd’s algorithm for coverage control problems

Yoav Palti, Daniel Zelazo

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

This work presents a new approach for a coverage problem for large areas and a limited number of sensors. We consider the problem where there are not enough sensors to provide complete coverage of the designated area at once, and therefore the sensors should coordinate their coverage in a sequential manner. Furthermore, we require that at each stage of coverage, a sub-region in the area is constantly monitored. Our solution approach is a combination of two algorithms: the first is Lloyd’s algorithm, which is well known and used in this field, and the second one is a modified Lloyd’s algorithm that we term the projected Lloyd’s Algorithm. Lastly, we combine Lloyd’s algorithm (and its projected version) with a distance based formation controller. We demonstrate our results with numerical simulations.

Original languageEnglish
Title of host publication59th Israel Annual Conference on Aerospace Sciences, IACAS 2019
Pages1008-1022
Number of pages15
ISBN (Electronic)9781510882782
StatePublished - 2019
Event59th Israel Annual Conference on Aerospace Sciences, IACAS 2019 - Tel-Aviv and Haifa, Israel
Duration: 6 Mar 20197 Mar 2019

Publication series

Name59th Israel Annual Conference on Aerospace Sciences, IACAS 2019

Conference

Conference59th Israel Annual Conference on Aerospace Sciences, IACAS 2019
Country/TerritoryIsrael
CityTel-Aviv and Haifa
Period6/03/197/03/19

All Science Journal Classification (ASJC) codes

  • Aerospace Engineering

Fingerprint

Dive into the research topics of 'A projected Lloyd’s algorithm for coverage control problems'. Together they form a unique fingerprint.

Cite this