Abstract This paper addresses the optimization problem of managing the research efforts of a set of sensors in order to minimize the probability of non-detection of a target. A novel formulation of the problem taking into account the traveling costs between the searched areas is proposed; it is more realistic and extends some previous problems addressed in the literature. A greedy heuristic algorithm is devised, it builds a solution gradually, using a linear approximation of the objective function refined at each step. The heuristic algorithm is complemented by a lower bound based on a piecewise linear approximation of the objective function with a parametric error, and extended to the case where the target is moving. Finally, a set of numerical experiments is performed to analyze and evaluate the proposed contributions.

中文翻译：

---

考虑到移动成本，规划多传感器搜索移动目标

摘要 本文解决了管理一组传感器的研究工作的优化问题，以最小化未检测到目标的概率。提出了一种考虑到搜索区域之间的旅行成本的问题的新公式；它更现实，并扩展了文献中解决的一些先前问题。设计了一种贪婪启发式算法，它使用在每一步细化的目标函数的线性近似来逐步构建解决方案。启发式算法由基于具有参数误差的目标函数的分段线性逼近的下界补充，并扩展到目标正在移动的情况。最后，进行了一组数值实验来分析和评估所提出的贡献。