Wu Xiang, Zhang Kanjian, Sun Changyin
School of Automation, Southeast University, Nanjing 210096, PR China; Key Laboratory of Measurement and Control of CSE, Ministry of Education, Southeast University, Nanjing 210096, PR China; School of Electrical and Information Engineering, Hunan Institute of Technology, Hengyang 421002, PR China.
School of Automation, Southeast University, Nanjing 210096, PR China; Key Laboratory of Measurement and Control of CSE, Ministry of Education, Southeast University, Nanjing 210096, PR China.
ISA Trans. 2014 May;53(3):793-801. doi: 10.1016/j.isatra.2013.12.024. Epub 2014 Mar 12.
This paper considers an optimal sensor scheduling problem in continuous time. In order to make the model more close to the practical problems, suppose that the following conditions are satisfied: only one sensor may be active at any one time; an admissible sensor schedule is a piecewise constant function with a finite number of switches; and each sensor either doesn't operate or operates for a minimum non-negligible amount of time. However, the switching times are unknown, and the feasible region isn't connected. Thus, it's difficult to solve the problem by conventional optimization techniques. To overcome this difficulty, by combining a binary relaxation, a time-scaling transformation and an exact penalty function, an algorithm is developed for solving this problem. Numerical results show that the algorithm is effective.
本文考虑了连续时间下的最优传感器调度问题。为使模型更贴近实际问题，假设满足以下条件：在任何时刻只有一个传感器可以处于工作状态；一个可允许的传感器调度是一个具有有限个切换点的分段常数函数；并且每个传感器要么不工作，要么工作一段最小的不可忽略的时间量。然而，切换时间是未知的，并且可行域不连通。因此，用传统的优化技术很难解决这个问题。为克服这一困难，通过结合二元松弛、时间尺度变换和精确罚函数，开发了一种求解该问题的算法。数值结果表明该算法是有效的。
