Optimizing Occupancy Sensor Placement in Smart Environments

• URL: http://arxiv.org/abs/2602.21098v1
• Date: Tue, 24 Feb 2026 17:01:36 GMT
• Title: Optimizing Occupancy Sensor Placement in Smart Environments
• Authors: Hao Lu, Richard J. Radke,
• Abstract summary: We propose an automatic sensor placement method that determines optimal sensor layouts for a given number of sensors.<n>We demonstrate the effectiveness of the proposed method based on simulations of several different office environments.
• Score: 10.584415290285612
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Understanding the locations of occupants in a commercial built environment is critical for realizing energy savings by delivering lighting, heating, and cooling only where it is needed. The key to achieving this goal is being able to recognize zone occupancy in real time, without impeding occupants' activities or compromising privacy. While low-resolution, privacy-preserving time-of-flight (ToF) sensor networks have demonstrated good performance in zone counting, the performance depends on careful sensor placement. To address this issue, we propose an automatic sensor placement method that determines optimal sensor layouts for a given number of sensors, and can predict the counting accuracy of such a layout. In particular, given the geometric constraints of an office environment, we simulate a large number of occupant trajectories. We then formulate the sensor placement problem as an integer linear programming (ILP) problem and solve it with the branch and bound method. We demonstrate the effectiveness of the proposed method based on simulations of several different office environments.

Related papers

• Adaptive Sensor Placement Inspired by Bee Foraging: Towards Efficient Environment Monitoring [0.0]
  We proposed a hybrid algorithm that combines Artificial Bee Colony (ABC) with Levy flight to optimize adaptive sensor placement.<n>By enhancing exploration and exploitation, our approach significantly improves the identification of critical hotspots.
  arXiv  Detail & Related papers  (2024-11-08T22:24:06Z)
• SOAC: Spatio-Temporal Overlap-Aware Multi-Sensor Calibration using Neural Radiance Fields [10.958143040692141]
  In rapidly-evolving domains such as autonomous driving, the use of multiple sensors with different modalities is crucial to ensure operational precision and stability. To correctly exploit the provided information by each sensor in a single common frame, it is essential for these sensors to be accurately calibrated. We leverage the ability of Neural Radiance Fields to represent different modalities in a common representation.
  arXiv  Detail & Related papers  (2023-11-27T13:25:47Z)
• Efficient and robust Sensor Placement in Complex Environments [1.1421942894219899]
  This paper addresses the problem of efficient and unobstructed surveillance or communication in complex environments. We propose a greedy algorithm to achieve the objective. Deep learning techniques are used to accelerate the evaluation of the objective function.
  arXiv  Detail & Related papers  (2023-09-15T17:10:19Z)
• Grey-box Bayesian Optimization for Sensor Placement in Assisted Living Environments [1.2093182949686778]
  We propose a novel, sample-efficient approach to find a high-quality sensor placement in an arbitrary indoor space. Our key technical contribution lies in capturing domain-specific knowledge about the spatial distribution of activities.
  arXiv  Detail & Related papers  (2023-09-11T19:31:14Z)
• Constrained optimization of sensor placement for nuclear digital twins [1.7247618645684337]
  We develop a data-driven technique that incorporates constraints into an optimization framework for sensor placement. We demonstrate the efficacy of sensors optimized by exhaustively computing all feasible configurations for a low-dimensional dynamical system.
  arXiv  Detail & Related papers  (2023-06-23T17:47:06Z)
• Efficient Sensor Placement from Regression with Sparse Gaussian Processes in Continuous and Discrete Spaces [3.729242965449096]
  The sensor placement problem is a common problem that arises when monitoring correlated phenomena. We present a novel formulation to the SP problem based on variational approximation that can be optimized using gradient descent.
  arXiv  Detail & Related papers  (2023-02-28T19:10:12Z)
• Environmental Sensor Placement with Convolutional Gaussian Neural Processes [65.13973319334625]
  It is challenging to place sensors in a way that maximises the informativeness of their measurements, particularly in remote regions like Antarctica. Probabilistic machine learning models can suggest informative sensor placements by finding sites that maximally reduce prediction uncertainty. This paper proposes using a convolutional Gaussian neural process (ConvGNP) to address these issues.
  arXiv  Detail & Related papers  (2022-11-18T17:25:14Z)
• Bayesian Imitation Learning for End-to-End Mobile Manipulation [80.47771322489422]
  Augmenting policies with additional sensor inputs, such as RGB + depth cameras, is a straightforward approach to improving robot perception capabilities. We show that using the Variational Information Bottleneck to regularize convolutional neural networks improves generalization to held-out domains. We demonstrate that our method is able to help close the sim-to-real gap and successfully fuse RGB and depth modalities.
  arXiv  Detail & Related papers  (2022-02-15T17:38:30Z)
• An automatic differentiation system for the age of differential privacy [65.35244647521989]
  Tritium is an automatic differentiation-based sensitivity analysis framework for differentially private (DP) machine learning (ML) We introduce Tritium, an automatic differentiation-based sensitivity analysis framework for differentially private (DP) machine learning (ML)
  arXiv  Detail & Related papers  (2021-09-22T08:07:42Z)
• Bandit Quickest Changepoint Detection [55.855465482260165]
  Continuous monitoring of every sensor can be expensive due to resource constraints. We derive an information-theoretic lower bound on the detection delay for a general class of finitely parameterized probability distributions. We propose a computationally efficient online sensing scheme, which seamlessly balances the need for exploration of different sensing options with exploitation of querying informative actions.
  arXiv  Detail & Related papers  (2021-07-22T07:25:35Z)
• Energy Aware Deep Reinforcement Learning Scheduling for Sensors Correlated in Time and Space [62.39318039798564]
  We propose a scheduling mechanism capable of taking advantage of correlated information. The proposed mechanism is capable of determining the frequency with which sensors should transmit their updates. We show that our solution can significantly extend the sensors' lifetime.
  arXiv  Detail & Related papers  (2020-11-19T09:53:27Z)
• Deep Soft Procrustes for Markerless Volumetric Sensor Alignment [81.13055566952221]
  In this work, we improve markerless data-driven correspondence estimation to achieve more robust multi-sensor spatial alignment. We incorporate geometric constraints in an end-to-end manner into a typical segmentation based model and bridge the intermediate dense classification task with the targeted pose estimation one. Our model is experimentally shown to achieve similar results with marker-based methods and outperform the markerless ones, while also being robust to the pose variations of the calibration structure.
  arXiv  Detail & Related papers  (2020-03-23T10:51:32Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.