An Incremental Self-Deployment Algorithm for Mobile Sensor Networks
Autonomous Robots
Uncertainty-aware and coverage-oriented deployment for sensor networks
Journal of Parallel and Distributed Computing
Visibility and its dynamics in a PDE based implicit framework
Journal of Computational Physics
Sensor Networks
Protocols and Architectures for Wireless Sensor Networks
Protocols and Architectures for Wireless Sensor Networks
A variational approach to path planning in three dimensions using level set methods
Journal of Computational Physics
Node Placement for Optimal Coverage in Sensor Networks
SUTC '06 Proceedings of the IEEE International Conference on Sensor Networks, Ubiquitous, and Trustworthy Computing -Vol 1 (SUTC'06) - Volume 01
The coverage problem in a wireless sensor network
Mobile Networks and Applications
Sensor-based coverage with extended range detectors
IEEE Transactions on Robotics
IEEE Communications Magazine
Redundant coverage for noise reduction in dynamic sensor networks
WSEAS TRANSACTIONS on SYSTEMS
Hi-index | 0.00 |
The paper deals with the problem of computing reference trajectories for a network of mobile sensors in order to maximize the coverage with respect to multiple quantities within a prefixed time interval. A centralized formulation of the problem is given for the case of sensing nodes provided with a different set of sensors (hence heterogeneity). The same formulation is shown to be useful for facing the problem of nodes faults, yielding to a robust coverage problem. Constraints introduced by kinematic and dynamic actuator limits, by communication and by collision avoidance are considered in the formulation. A global solution is proposed and some simulations are reported to show its effectiveness.