An algorithm for near-optimal placement of sensor elements

DOI10.1109/18.59928MaRDI QIDQ5753815zbMATH OpenOpenAlexFDO

Authors

Publication date 1990

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/18.59928

zbMATH Keywords

array design

Mathematics Subject Classification ID

System identification (93B30)

Recommendations

• Bounds for sparse planar and volume arrays
• Pattern diversity for narrowband direction finding with sensor arrays
• Active array sensor localization
• On the number of signals resolvable by a uniform linear array
• Optimal sensor placement for target localisation and tracking in 2D and 3D

Cited in

(7)

• Optimal Sensor Placement Under Budgetary Constraints
• Optimization method for sensor planning
• Bounds for sparse planar and volume arrays
• Efficient Sensor Placement for Signal Reconstruction Based on Recursive Methods
• Pattern diversity for narrowband direction finding with sensor arrays
• Optimal design of sensors via geometric criteria
• An a priori method for estimating the informativeness of the configuration of sensor placement when solving inverse problems of remote sensing

This page was built for publication: An algorithm for near-optimal placement of sensor elements

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5753815)