摘要

Sensor optimization is the problem of minimizing sensor activation in a controlled discrete event system. During the evolutionary process, the available resources are supposed to be limited. Therefore, sensors are activated by the agent when it is necessary. Sensor activation policies are the functions that determine which sensors are to be activated. One policy is considered to minimal, if any strictly less activation decided by the agent satisfies the feasibility. In this paper, a new algorithm is proposed to compute the minimal sensor activation policy. The algorithm, based on the operation of Reverse Change and the property of the Label-reached, calculates the minimal solution of sensor activation and achieves a lower complexity of computation relatively.

全文