In the first part we deal with the problem of patrolling a perimeter. We propose a distributed algorithm that assign to each camera a portion of the perimeter and converge to an equitable partition. Physical and covering constraints are kept into account. The protocol of comunication is asymmetric. In the first part we generalize this problem to a 2D discretized environment. Two distributed euristic are proposed to reach an equitable partition using symmetric and asymmetric communication. Effort are made in order to obtain areas with a regular and 'fat' shape
Distributed partitioning strategies in camera network application
Alberton, Riccardo
2011/2012
Abstract
In the first part we deal with the problem of patrolling a perimeter. We propose a distributed algorithm that assign to each camera a portion of the perimeter and converge to an equitable partition. Physical and covering constraints are kept into account. The protocol of comunication is asymmetric. In the first part we generalize this problem to a 2D discretized environment. Two distributed euristic are proposed to reach an equitable partition using symmetric and asymmetric communication. Effort are made in order to obtain areas with a regular and 'fat' shapeFile in questo prodotto:
File | Dimensione | Formato | |
---|---|---|---|
tesi.pdf
accesso aperto
Dimensione
1.63 MB
Formato
Adobe PDF
|
1.63 MB | Adobe PDF | Visualizza/Apri |
The text of this website © Università degli studi di Padova. Full Text are published under a non-exclusive license. Metadata are under a CC0 License
Utilizza questo identificativo per citare o creare un link a questo documento:
https://hdl.handle.net/20.500.12608/15163