The 0-1 programming model and algorithm for the problem of sensor task scheduling for double detection
CSTR:
Author:
Affiliation:

Clc Number:

Fund Project:

  • Article
  • |
  • Figures
  • |
  • Metrics
  • |
  • Reference
  • |
  • Related
  • |
  • Cited by
  • |
  • Materials
  • |
  • Comments
    Abstract:

    In order to resolve the scheduling difficulty in the control of command system, the resource scheduling problem of a special sensor was studied and the constraint conditions including detected times, the interval between two detections, and the resource restrict of sensor were analyzed. A 0-1 programming model was established and transformed to a 0-1 liner integer model whose objective function is the sum of the importance degree of tracking targets. The optimal solution which can reasonably schedule sensor resource when the workload is saturated was obtained by using the cutting plane algorithm. A corresponding simulated annealing algorithm was proposed to improve the speed of solving and was used to solve some examples. Compared with the cutting plane algorithm and the genetic algorithm in terms of resource utilization and the speed of solving, the validity of the proposed model and the high efficiency of the simulated annealing algorithm were proved.

    Reference
    Related
    Cited by
Get Citation
Share
Article Metrics
  • Abstract:
  • PDF:
  • HTML:
  • Cited by:
History
  • Received:May 05,2016
  • Revised:
  • Adopted:
  • Online: July 09,2017
  • Published:
Article QR Code