Adaptive Sensor Placement Inspired by Bee Foraging: Towards Efficient Environment Monitoring

• URL: http://arxiv.org/abs/2411.15159v1
• Date: Fri, 08 Nov 2024 22:24:06 GMT
• Title: Adaptive Sensor Placement Inspired by Bee Foraging: Towards Efficient Environment Monitoring
• Authors: Sai Krishna Reddy Sathi,
• Abstract summary: We proposed a hybrid algorithm that combines Artificial Bee Colony (ABC) with Levy flight to optimize adaptive sensor placement. By enhancing exploration and exploitation, our approach significantly improves the identification of critical hotspots.
• Score: 0.0
• License:
• Abstract: This paper aims to make a mark in the future of sustainable robotics, where efficient algorithms are required to carry out tasks like environmental monitoring and precision agriculture efficiently. We proposed a hybrid algorithm that combines Artificial Bee Colony (ABC) with Levy flight to optimize adaptive sensor placement alongside an important notion of hotspots from domain knowledge experts. By enhancing exploration and exploitation, our approach significantly improves the identification of critical hotspots. This algorithm also finds its usecases for broader search and rescue operations applications, demonstrating its potential in optimization problems across various domains.

Related papers

• Task Delay and Energy Consumption Minimization for Low-altitude MEC via Evolutionary Multi-objective Deep Reinforcement Learning [52.64813150003228]
  The low-altitude economy (LAE), driven by unmanned aerial vehicles (UAVs) and other aircraft, has revolutionized fields such as transportation, agriculture, and environmental monitoring. In the upcoming six-generation (6G) era, UAV-assisted mobile edge computing (MEC) is particularly crucial in challenging environments such as mountainous or disaster-stricken areas. The task offloading problem is one of the key issues in UAV-assisted MEC, primarily addressing the trade-off between minimizing the task delay and the energy consumption of the UAV.
  arXiv  Detail & Related papers  (2025-01-11T02:32:42Z)
• Synergistic Development of Perovskite Memristors and Algorithms for Robust Analog Computing [53.77822620185878]
  We propose a synergistic methodology to concurrently optimize perovskite memristor fabrication and develop robust analog DNNs. We develop "BayesMulti", a training strategy utilizing BO-guided noise injection to improve the resistance of analog DNNs to memristor imperfections. Our integrated approach enables use of analog computing in much deeper and wider networks, achieving up to 100-fold improvements.
  arXiv  Detail & Related papers  (2024-12-03T19:20:08Z)
• Evolutionary Greedy Algorithm for Optimal Sensor Placement Problem in Urban Sewage Surveillance [6.133464220178637]
  We propose a novel evolutionary greedy algorithm (EG) to enable efficient and effective optimization for large-scale directed networks. The proposed model is evaluated on both small-scale synthetic networks and a large-scale, real-world sewage network in Hong Kong.
  arXiv  Detail & Related papers  (2024-09-25T09:27:51Z)
• Evolutionary Algorithms for Optimizing Emergency Exit Placement in Indoor Environments [0.0]
  A cellular-automaton model is used to simulate the behavior of pedestrians in such scenarios. A metric is proposed to determine how successful or satisfactory an evacuation was. Two metaheuristic algorithms, namely an iterated greedy and an evolutionary algorithm (EA) are proposed to solve the problem.
  arXiv  Detail & Related papers  (2024-05-28T16:50:42Z)
• Improving Point-based Crowd Counting and Localization Based on Auxiliary Point Guidance [59.71186244597394]
  We introduce an effective approach to stabilize the proposal-target matching in point-based methods. We propose Auxiliary Point Guidance (APG) to provide clear and effective guidance for proposal selection and optimization. We also develop Implicit Feature Interpolation (IFI) to enable adaptive feature extraction in diverse crowd scenarios.
  arXiv  Detail & Related papers  (2024-05-17T07:23:27Z)
• 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)
• Learning Regions of Interest for Bayesian Optimization with Adaptive Level-Set Estimation [84.0621253654014]
  We propose a framework, called BALLET, which adaptively filters for a high-confidence region of interest. We show theoretically that BALLET can efficiently shrink the search space, and can exhibit a tighter regret bound than standard BO.
  arXiv  Detail & Related papers  (2023-07-25T09:45:47Z)
• A Real-time Human Pose Estimation Approach for Optimal Sensor Placement in Sensor-based Human Activity Recognition [63.26015736148707]
  This paper introduces a novel methodology to resolve the issue of optimal sensor placement for Human Activity Recognition. The derived skeleton data provides a unique strategy for identifying the optimal sensor location. Our findings indicate that the vision-based method for sensor placement offers comparable results to the conventional deep learning approach.
  arXiv  Detail & Related papers  (2023-07-06T10:38:14Z)
• Adaptive Real Time Exploration and Optimization for Safety-Critical Systems [0.0]
  We propose the ARTEO algorithm, where we cast multi-armed bandits as a programming problem subject to safety constraints. We learn the environmental characteristics through changes in optimization inputs and through exploration. Compared to existing safe-learning approaches, our algorithm does not require an exclusive exploration phase and follows the optimization goals even in the explored points.
  arXiv  Detail & Related papers  (2022-11-10T11:37:22Z)
• Adaptive Subsampling for ROI-based Visual Tracking: Algorithms and FPGA Implementation [16.114903235867136]
  We study how ROI programmability can be leveraged for tracking applications by anticipating where the ROI will be located in future frames. Our adaptive subsampling algorithms comprise an object detector and an ROI predictor (Kalman filter) which operate in conjunction to optimize the energy efficiency of the vision pipeline. In terms of accuracy-latency tradeoff, the ECO-based algorithm provides near-real-time performance (19.23 FPS) while managing to attain competitive tracking precision.
  arXiv  Detail & Related papers  (2021-12-17T21:38:30Z)
• 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)

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.