Radar Task Scheduling with Gaussian Random Shifted Start Time

A radar task scheduling algorithm, Gaussian random shifted start time (GRSST), is proposed. The algorithm shifts each task's start time by a Gaussian distribution instead of a uniform distribution within the time window which was used in the random shifted start time (RSST) algorithm. Each task's priority is used to calculate its distribution variance. The random search is not related to the priorities. A higher priority task will have a smaller variance, so that its movable range is less than that of a lower priority task. Similar to the RSST, multiple searches help to find the solution with the lowest cost. Monte Carlo simulations show that the GRSST reduces the cost significantly with much less searches, which saves a lot of computation time too. The GRSST with 50 searches provides a better solution which costs around 2 times less than the RSST with 350 searches. The GRSST's average computation time is reduced to 1ms from 7ms.