Response to Tasks of Dynamical Arrival in Sensor Resource Allocation with the Shortest Augmenting Path Algorithm

A shortest augmenting path (SAP) based sensitivity analysis approach is developed to respond to tasks of dynamical arrival in this paper. The sensor resource allocation problem is formulated as a linear programming problem. Its dual problem and the complementary slackness conditions are given. The SAP algorithm with its computational steps, data structure and computational complexity is presented. The sensitivity analysis of workload is discussed. The computational results show that sensitivity analysis method via SAP is superior to the straightforward method via SAP from scratch in computational performance