Back to Search
Start Over
On Minimal Trajectories for Mobile Sampling of Bandlimited Fields
- Publication Year :
- 2013
-
Abstract
- We study the design of sampling trajectories for stable sampling and the reconstruction of bandlimited spatial fields using mobile sensors. The spectrum is assumed to be a symmetric convex set. As a performance metric we use the path density of the set of sampling trajectories that is defined as the total distance traveled by the moving sensors per unit spatial volume of the spatial region being monitored. Focussing first on parallel lines, we identify the set of parallel lines with minimal path density that contains a set of stable sampling for fields bandlimited to a known set. We then show that the problem becomes ill-posed when the optimization is performed over all trajectories by demonstrating a feasible trajectory set with arbitrarily low path density. However, the problem becomes well-posed if we explicitly specify the stability margins. We demonstrate this by obtaining a non-trivial lower bound on the path density of an arbitrary set of trajectories that contain a sampling set with explicitly specified stability bounds.<br />28 pages, 8 figures
- Subjects :
- FOS: Computer and information sciences
Mathematical optimization
94A20, 94A12
Computer Science - Information Theory
Mobile sensing
Beurling density
Convex set
010103 numerical & computational mathematics
Parallel
01 natural sciences
Stability (probability)
Upper and lower bounds
Set (abstract data type)
Path density
Classical Analysis and ODEs (math.CA)
FOS: Mathematics
Sensor trajectories
0101 mathematics
Mathematics
Applied Mathematics
Information Theory (cs.IT)
010102 general mathematics
Sampling (statistics)
Spatial field sampling
Convex spectrum
Mathematics - Classical Analysis and ODEs
Path (graph theory)
Trajectory
Bandlimited field sampling
Algorithm
Subjects
Details
- Language :
- English
- Database :
- OpenAIRE
- Accession number :
- edsair.doi.dedup.....3648acaf75f9a3657421de7079e7c0e0