AUTHORS: 

Federico Cerruti 607374
Mirko Fabbro 586668
Chiara Masiero 600608

TITLE: 

Task Assignment Problem in Camera Networks

ABSTRACT:

This paper takes the move from a real case study and deals with the problem of task assignment in camera networks. A mathematical model is proposed and different approaches are compared. The attention is mainly focused on algorithms that derive from Constraint Linear Programming and Stable Marriage Problem (SMP).
An optimality criterion over static scenarios is defined. Subsequently it is given prominence to problem dynamics, that is a crucial issue. As a matter of fact, we would like to attain a good trade-off between continuity and optimality in matching tasks and agents. The former means that it is advisable to restrain discontinuities in task execution. The latter aims to give preference to high priority tasks.
The proposed generalization of the SMP algorithm highlights good performances. It assures a sufficient degree of continuity, it prevents deadlocks and it is tunable. Moreover, it can be recast quite easily as a  distributed algorithm.