arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2309.08545cs.LGcs.ROmath.OC
收藏

复杂环境中的高效且鲁棒的传感器放置

Efficient and robust Sensor Placement in Complex Environments

The University of Texas at Austin(德克萨斯大学奥斯汀分校);Oden Institute for Computational Engineering and Sciences(奥登计算工程与科学研究所)

Lukas Taus, Yen-Hsi Richard Tsai

AI总结:

本文研究复杂环境中高效且鲁棒的传感器放置问题,提出一种满足多重覆盖约束的贪心算法,并利用深度学习加速目标函数评估,同时分析数据几何特性对网络性能的影响。

摘要:

我们解决在复杂环境中实现高效且无遮挡的监控或通信问题。一方面,人们希望使用最少数量的传感器来覆盖环境。另一方面,考虑对传感器故障或对抗性攻击具有鲁棒性的解决方案通常很重要。本文解决了设计实现多重覆盖约束的最小传感器集的挑战——环境中的每个点都被规定数量的传感器覆盖。我们提出了一种贪心算法来实现该目标。此外,我们探索深度学习技术以加速贪心算法中目标函数的评估。神经网络的训练表明,数据的几何特性显著影响网络的性能,尤其是在末期阶段。通过考虑这些特性,我们讨论了使用贪心和ε-greedy算法生成数据的差异及其对网络鲁棒性的影响。

英文摘要:

We address the problem of efficient and unobstructed surveillance or communication in complex environments. On one hand, one wishes to use a minimal number of sensors to cover the environment. On the other hand, it is often important to consider solutions that are robust against sensor failure or adversarial attacks. This paper addresses these challenges of designing minimal sensor sets that achieve multi-coverage constraints -- every point in the environment is covered by a prescribed number of sensors. We propose a greedy algorithm to achieve the objective. Further, we explore deep learning techniques to accelerate the evaluation of the objective function formulated in the greedy algorithm. The training of the neural network reveals that the geometric properties of the data significantly impact the network's performance, particularly at the end stage. By taking into account these properties, we discuss the differences in using greedy and $ε$-greedy algorithms to generate data and their impact on the robustness of the network.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑