Urgency-Based Radar Task Scheduling
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing radar scheduling methods become computationally complex and inefficient as the number of tasks increases, requiring repeated searches for optimal task ordering, especially in dynamic naval environments where radar visibility changes.
Innovation Solution
A method utilizing time-based urgency functions with linear gradients before and after a desired execution time to prioritize tasks, storing them in memory lists for efficient retrieval and execution, with a scheduler that identifies and executes the most urgent task based on urgency values.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Manufacturing precision
If a search algorithm is used to iteratively work out the best order for tasks, then task scheduling optimality is improved, but computational complexity increases exponentially as the number of tasks increases
Solution Approach 1:
The patent transforms the scheduling problem from finding optimal task sequences to calculating urgency values based on time parameters. Each task is assigned an urgency value computed from its desired completion time and current time, converting a complex combinatorial optimization problem into a simple parameter-based selection process that scales linearly with task count
Solution Approach 2:
The patent creates simplified representations of tasks as task records containing urgency values and desired completion times. Instead of evaluating all possible task permutations, the system copies and stores essential task parameters in a data structure that enables rapid comparison and selection of the most urgent task
2Productivity
If a search algorithm is used to create the best order list of tasks, then task execution efficiency is improved, but the time required to recalculate scheduling when new tasks are added increases
Solution Approach 1:
The patent performs preliminary calculations by assigning urgency values to tasks based on their desired completion times when they are first added to the system. This preliminary urgency assignment allows new tasks to be integrated into the existing schedule without triggering a complete recalculation, as the urgency-based selection process automatically accommodates new tasks with appropriate priority
Solution Approach 2:
The patent implements a dynamic scheduling system where task urgency values are continuously updated based on current time and desired completion time. As time progresses, the urgency values automatically change, allowing the system to adapt to new tasks and changing conditions without requiring manual intervention or complete re-scheduling
3Adaptability or versatility
If the radar platform moves due to sea motion, then radar visibility changes for certain areas, but task scheduling becomes more complicated
Solution Approach 1:
The patent handles radar visibility changes by modifying the urgency calculation parameters. When radar visibility changes due to platform motion, the desired completion times of affected tasks are updated, which automatically changes their urgency values. This parameter-based approach allows the system to adapt to visibility changes without increasing scheduling complexity
Data Source
Figure 1
Figure 2
Figure 3
AI summary
The present invention relates to a method of scheduling for multi-function radars. Specifically, the present invention relates to an efficient urgency-based scheduling method. The present invention provides a method of scheduling tasks in a radar apparatus comprising the steps of: receiving one or more tasks to schedule; calculating an urgency function for each said task; and storing the said tasks using said urgency function to order each said task relative to the other said tasks; wherein when a task is to be performed, the task having the highest value of urgency function is located.