Optimal Movement of Mobile Sensors for Barrier Coverage of a Planar Region
From MaRDI portal
(Redirected from Publication:5505648)
Recommendations
Cites work
- An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
- Applying Parallel Computation Algorithms in the Design of Serial Algorithms
- Disjoint circuits of prescribed homotopies in a graph on a compact surface
- scientific article; zbMATH DE number 4065813 (Why is no real title available?)
- scientific article; zbMATH DE number 1869468 (Why is no real title available?)
- scientific article; zbMATH DE number 3231692 (Why is no real title available?)
- Slowing down sorting networks to obtain faster sorting algorithms
Cited in
(14)- Network flow formulation of optimal perimeter sensory coverage problem
- Optimal movement of mobile sensors for barrier coverage of a planar region
- Optimal 2-coverage of a polygonal region in a sensor network
- Optimising the barrier coverage of a wireless sensor network with hub-and-spoke topology using mathematical and simulation models
- Optimal sensor deployment to increase the security of the maximal breach path in border surveillance
- Patrolling a barrier with a network of mobile sensors
- Complexity of barrier coverage with relocatable sensors in the plane
- Mobile sensor intrusion detection under any shape of curve
- Models of sensor operations for border surveillance
- Studying the stochastic capturing of moving intruders by mobile sensors
- New Algorithms for Barrier Coverage with Mobile Sensors
- Optimal sensor networks for area monitoring using rotating and beam sensors
- A geometric optimization approach to detecting and intercepting dynamic targets using a mobile sensor network
- Path optimization with limited sensing ability
This page was built for publication: Optimal Movement of Mobile Sensors for Barrier Coverage of a Planar Region
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5505648)