Abstract
An algorithm for scheduling tasks for an air and missile defense radar is proposed. The algorithm consists of two sub-algorithms: a task interleaving algorithm followed by a distributed greedy scheduling algorithm. The interleaving algorithm efficiently interleaves range-unambiguous and range-windowed tasks (such as BMD-track tasks) based on knowledge of the task dwell characteristics. The output of the interleaving algorithm and the remaining tasks are then input to a greedy scheduling algorithm which attempts to schedule as many tasks as possible while maintaining temporal regularity between the task update intervals. Simulation results are provided to demonstrate the behavior of the proposed algorithm.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
