WO1992017796A1 - Organisation des taches de gestion d'un systeme radar - Google Patents

Organisation des taches de gestion d'un systeme radar Download PDF

Info

Publication number
WO1992017796A1
WO1992017796A1 PCT/AU1992/000128 AU9200128W WO9217796A1 WO 1992017796 A1 WO1992017796 A1 WO 1992017796A1 AU 9200128 W AU9200128 W AU 9200128W WO 9217796 A1 WO9217796 A1 WO 9217796A1
Authority
WO
WIPO (PCT)
Prior art keywords
priority
task
base
tasks
list
Prior art date
Application number
PCT/AU1992/000128
Other languages
English (en)
Inventor
Terrance John Soukoulis
Original Assignee
The Commonwealth Of Australia
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by The Commonwealth Of Australia filed Critical The Commonwealth Of Australia
Publication of WO1992017796A1 publication Critical patent/WO1992017796A1/fr

Links

Classifications

    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F9/00—Arrangements for program control, e.g. control units
    • G06F9/06—Arrangements for program control, e.g. control units using stored programs, i.e. using an internal store of processing equipment to receive or retain programs
    • G06F9/46—Multiprogramming arrangements
    • G06F9/48—Program initiating; Program switching, e.g. by interrupt
    • G06F9/4806—Task transfer initiation or dispatching
    • G06F9/4843—Task transfer initiation or dispatching by program, e.g. task dispatcher, supervisor, operating system
    • G06F9/4881—Scheduling strategies for dispatcher, e.g. round robin, multi-level priority queues
    • G06F9/4887—Scheduling strategies for dispatcher, e.g. round robin, multi-level priority queues involving deadlines, e.g. rate based, periodic
    • G—PHYSICS
    • G01—MEASURING; TESTING
    • G01S—RADIO DIRECTION-FINDING; RADIO NAVIGATION; DETERMINING DISTANCE OR VELOCITY BY USE OF RADIO WAVES; LOCATING OR PRESENCE-DETECTING BY USE OF THE REFLECTION OR RERADIATION OF RADIO WAVES; ANALOGOUS ARRANGEMENTS USING OTHER WAVES
    • G01S13/00—Systems using the reflection or reradiation of radio waves, e.g. radar systems; Analogous systems using reflection or reradiation of waves whose nature or wavelength is irrelevant or unspecified
    • G01S13/003—Bistatic radar systems; Multistatic radar systems
    • G—PHYSICS
    • G01—MEASURING; TESTING
    • G01S—RADIO DIRECTION-FINDING; RADIO NAVIGATION; DETERMINING DISTANCE OR VELOCITY BY USE OF RADIO WAVES; LOCATING OR PRESENCE-DETECTING BY USE OF THE REFLECTION OR RERADIATION OF RADIO WAVES; ANALOGOUS ARRANGEMENTS USING OTHER WAVES
    • G01S13/00—Systems using the reflection or reradiation of radio waves, e.g. radar systems; Analogous systems using reflection or reradiation of waves whose nature or wavelength is irrelevant or unspecified
    • G01S13/02—Systems using reflection of radio waves, e.g. primary radar systems; Analogous systems
    • G01S13/0218—Very long range radars, e.g. surface wave radar, over-the-horizon or ionospheric propagation systems
    • G—PHYSICS
    • G01—MEASURING; TESTING
    • G01S—RADIO DIRECTION-FINDING; RADIO NAVIGATION; DETERMINING DISTANCE OR VELOCITY BY USE OF RADIO WAVES; LOCATING OR PRESENCE-DETECTING BY USE OF THE REFLECTION OR RERADIATION OF RADIO WAVES; ANALOGOUS ARRANGEMENTS USING OTHER WAVES
    • G01S7/00—Details of systems according to groups G01S13/00, G01S15/00, G01S17/00
    • G01S7/02—Details of systems according to groups G01S13/00, G01S15/00, G01S17/00 of systems according to group G01S13/00

Definitions

  • This invention relates to a method of scheduling the carrying out of components of a task or a number of tasks where each component or task has an assigned priority.
  • the invention will be generally discussed in relation to radar control scheduling for an over-the-horizon radar but it is to be realised that the invention is not restricted to the application but may be used in any field where scheduling of events to occur is necessary.
  • the invention will also be discussed using two priority levels but is not restricted to two levels but may also include situations where each task or each component of a task has a different priority.
  • the radar In the situation of over-the-horizon radar the radar consists of an aperture at a transmission site to radiate a radar beam and an aperture at a reception site to receive the radar return signal. Each aperture can be utilised either as a full aperture or split into two independent half apertures depending upon the coverage area, resolution and update rate required. In bistatic mode the radar may use more than one receive and/or transmit aperture at different locations.
  • a radar task is a request for radar resources, usually with the aim of detecting a particular type of target over a specified surveillance area.
  • the surveillance area is larger than can be covered by the radar beam, therefore, the beam is scanned over the surveillance area.
  • Each of the steps is called a footprint and the time spent in each footprint, before moving to the next, is called to coherent integration time.
  • Radar command and control requires several functional units.
  • a task definition unit allows the operator to define and modify tasks. These tasks are sent to the scheduling unit which determines which task and which footprint will be scanned next.
  • the scheduling unit must then construct a context which specifies how the radar equipment must be set in order to scan that footprint.
  • the context is distributed through the transmit and receive control units which implement the context by setting the radar equipment appropriately.
  • the tasks were initially delivered to both control sites and each site was responsible for its own simple scheduling. Whenever the task needed modification both control sites had to be notified and they had to implement the changes at exactly the same time otherwise the sites would no longer by synchronised.
  • This present invention is directed in its specific form to generating contexts in a control facility and distributing them to the participating control sites and by this means the problem of synchronising changes to tasks is overcome because they are controlled from a central facility.
  • the radar accepts one or more tasks each defining an area to be scanned.
  • the time spend in each footprint is dependent on the coherent integration time specified for that task.
  • Some footprints may have surveillance needs which require more time at a particular footprint. That is the radar steps through the footprints of a task but may dwell on each footprint several times before moving to the next footprint.
  • the number of footprints required for each task can vary as can the coherent integration time for each task.
  • the period between visits to the same footprint is called the revisit period and indicates how often the data from that particular footprint is being updated. This is usually dependent on the number of tasks, their priority and the number of footprints within each task and their relative priorities.
  • Tasks may be added and removed at any time and in any order. There is no restriction to the combination of tasks allowed, tasks using a half aperture may be combined with tasks using a full aperture.
  • a task definition will include a priority which determines in what proportion radar resources will be allocated to that task. Additionally each of the footprints comprising the task may also be given a priority such that the radar frequents designated footprints more than others and in relation to a hit ratio specified by the operator.
  • This invention provides a method for designating the order or the scheduling of tasks and for the scheduling of visits to footprints within a task.
  • the invention is said to reside in a method of scheduling items from a group of items each having an assigned priority, each item having a balance value depending upon its priority, the balance value being increased if an item is not selected at an event and being decreased if an item is selected at the event, the amount of increase being in proportion to its assigned priority and the amount of decrease being in proportion to the sum of all the assigned priorities of the other items, characterised by scheduling an item at each event, being the item with the highest balance value at that event. It will be seen that the method uses a balancing technique to determine selection between the various tasks.
  • the first application of the invention will be discussed in relation to the scheduling of visits to footprints within a task.
  • the footprint scheduling method uses a balancing technique to achieve the required selection ratio or schedule.
  • the balance is adjusted by a base bias whenever a base item is selected and by a priority bias whenever a priority item is selected.
  • One of these biases may be a negative number to allow both groups to compete against each other on the same balance scale.
  • the resulting state of balance then indicates which group the next item is to be selected. It is a matter of convention as to which bias may be negative and therefore what state of the balance indicates which group.
  • the base bias is calculated as the number of members in the priority group multiplied by the hit ratio.
  • the priority bias is calculated as the number of members in the base group.
  • the invention is said to reside in a method of scheduling a task for a radar installation wherein the task has a plurality of footprints, the method comprising the steps of designating a priority for each of the footprints to give a first group of priority footprints and a second group of base footprints and so as to give a priority list and a base list, determining a membership ratio of priority footprints to base footprints, determining a hit ratio whereby setting the number of times a priority footprint is visited as compared to a base footprint, determining a bias ratio being the membership ratio with the priority footprints multiplied by the hit ratio, determining a priority bias and a base bias wherein the priority bias is the negative of the number of items in the base list and the base bias being the product of the hit ratio and the number of members in the priority list, applying the data to a selection of algorithm of the form:
  • BASE INDEX BASEJNDEX + 1 ⁇ point to next footprint in BASEJJST ⁇ ⁇ Return to 1 st footprint if at end of list ⁇
  • BIASBAL BIASBAL + BBIAS ⁇ Adjust balance ⁇ END
  • BIASBAL is the state of balance between the lists BASE INDEX points to the next member for selection in the base list
  • BASE_FEET is the number of members in the base list
  • PRIORITY_FEET is the number of members in the priority list
  • BASEJJST is the group of base footprints
  • ABSIAS Priority bias
  • BBIAS Base bias
  • Next footprint is number 1 4 2 5 3 4 6 5 7 1 4 2 5 3 4 6 5 7
  • the invention is said to reside in a task scheduling algorithm of the form IF BIASBAL £ 0
  • NEXT_TASK PRIORITY_LIST[PRIORITYJNDEX]
  • BIASBAL BIASBAL + ABIAS ⁇ Adjust balance ⁇ ENDIF
  • BIASBAL is the state of balance between lists of different task priorities
  • BASE INDEX points to the next member for selection in a task list of base priority
  • BASE_TASKS is the number of members in the list of base priority
  • PRIORITY_TASKS is the number of members in a priority list
  • BASEJJST is the group of base tasks
  • ABIAS is a bias of the priority tasks and BBIAS is a bias of the base tasks.
  • each of the tasks may be a footprint of a selected priority in an over- the-horizon radar schedule and the algorithm is used to select of visits to the footprints.
  • An alternative problem solved by the method of the present invention is scheduling a number of tasks each of which may have a different priority.
  • the invention is said to reside in a method of selecting a task from a group of tasks each with a distinct priority such that the task is selected in proportion to its assigned priority with respect to the priorities of all the other tasks by means of a task selection algorithm using a multiple balance technique to achieve a required selection ratio wherein each task has its own balance which is adjusted positively (unselected bias) if it was not selected in the previous event or adjusted negatively (selected bias) if it was selected in the previous event wherein the unselected bias is equal to the priority of that task and the selected bias is the sum of the priorities of all the other tasks such that as a task is selected its balance reduces whilst the balance of the unselected tasks will increase and the task with the highest balance or the one with the highest priority if balances are equal will be selected next
  • the task selection algorithm uses a multiple balance technique to achieve the required selection ratios.
  • Each task has its own balance which is adjusted positively (unselected bias) if it was not selected in the previous event or adjusted negatively (selected bias) if it was selected in the previous event.
  • Balances may initially be set to zero or at their task's priority to allow immediate selection of the highest priority task. As a task is selected its balance will reduce whilst the balance of the unselected tasks will increase. The task with the highest balance or the one with the highest priority if balances are equal will be selected next.
  • the unselected bias is equal to the priority of that task.
  • the selected bias is the sum of the priorities of all the other tasks.
  • a further alternative example of task scheduling is when some of the tasks require a full aperture and some require a half aperture.
  • the radar Due to the independent aperture capability of the radar it is able to support parallel processing of tasks which require complementary half apertures. In previous command and control systems the radar worked only in full aperture or half aperture mode and did not allow both types of tasks to be defined in the one mission.
  • the present invention allows definition of any aperture combinations by using two time lines which are synchronised when full aperture tasks are implemented and are split when half aperture tasks are implemented.
  • a balancing technique is used to determine which task is to be selected next. Whenever a task is selected its balance is reduced whilst the other tasks have their balance increased. The task with the highest balance is the next one selected. If more than one task has the highest balance then the task with the highest priority is selected. Full aperture tasks compete amongst themselves and whichever half aperture tasks have the higher total priority.
  • the task selected is termed the primary task and if it only requires a half aperture then a secondary task with a complementary aperture is also selected for scheduling. This effectively provides two available time lines for scheduling.
  • the time allocated for footprint scheduling within each of these tasks is determined by the method discussed above. If the secondary cannot complete its allocation in the time allowed then a proportional adjustment to its balance is made, however, if the secondary completes its allocation within the time allowed then another secondary may be selected so that the available time is not wasted.
  • the selection between secondaries is made on the basis of a secondary set of positive and negative biases determined only from tasks within that aperture type.
  • the tasks selection method uses a multiple balance technique as discussed earlier to achieve the required selection ratios.
  • Each item has its own primary balance which is adjusted positively
  • Each item also has its own secondary balance which is adjusted positively (unselected bias) if it was not selected in the previous secondary selection event or adjusted negatively (selected bias) if it was selected in the previous secondary event.
  • the primary item is selected as the one having the highest primary balance or the one with the highest priority if balances are equal.
  • the secondary item is then selected from the set of items which have complementary resource requirements from the primary item. Secondary selection is again on the basis of highest balance or highest priority if balances are equal. Each item may require a different amount of time to be spent on it (item allocation time) such that more than one secondary selection may be needed to use up the same amount of time as the primary time. Selection of a subsequent secondary item for the same primary item is then based on the secondary balances of the possible secondary items. It is also possible that the secondary item will not complete its allocation in which case a secondary bias adjustment is adjusted in proportion to the ratio of time actually received over that items required allocation time.
  • Balances may initially be set to zero or at their task's priority to allow immediate selection of the highest priority task.
  • the primary and secondary unselected biases are equal to the priority of that item.
  • the primary selected bias is the sum of the priorities of all other competing items these are items of the same or overlapping resource requirements and do not include complementary items.
  • the secondary bias is the sum of priorities of all items with the same resource requirements not including items with overlapping resource requirements.

Landscapes

  • Engineering & Computer Science (AREA)
  • Radar, Positioning & Navigation (AREA)
  • Remote Sensing (AREA)
  • Physics & Mathematics (AREA)
  • General Physics & Mathematics (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Software Systems (AREA)
  • Theoretical Computer Science (AREA)
  • General Engineering & Computer Science (AREA)
  • Traffic Control Systems (AREA)
  • Radar Systems Or Details Thereof (AREA)

Abstract

On décrit une méthode de classification de postes parmi un groupe de postes dont chacun possède une priorité qui lui a été attribuée. A chaque poste on peut attribuer une valeur d'équilibrage en fonction de sa priorité, ladite valeur d'équilibrage étant augmentée si un poste n'est pas sélectionné pour l'événement et étant diminuée si un poste est sélectionné pour l'événement, l'importance de l'augmentation étant fonction de la priorité attribuée au poste en question et l'importance de la diminution étant fonction de la somme de toutes les priorités attribuées aux autres postes. Par événement programmé on entend le poste dont la valeur d'équilibrage est la plus élevée pour cet événement. Il peut y avoir un certain nombre de tâches avec seulement deux niveaux de priorité, ou chaque tâche peut avoir une priorité propre. Si l'on prend un groupe de tâches dont chaque tâche possède une priorité distincte et parmi lesquelles une seule doit être correctement choisie, toutes les tâches devant être classées en fonction des priorités qui leur ont été attribuées, l'algorithme de sélection des tâches utilise une technique d'équilibrage multiple pour obtenir les rapports de sélection voulus. Les tâches peuvent être des 'empreintes' dans un système radar transhorizon.
PCT/AU1992/000128 1991-03-28 1992-03-27 Organisation des taches de gestion d'un systeme radar WO1992017796A1 (fr)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
AUPK534791 1991-03-28
AUPK5347 1991-03-28

Publications (1)

Publication Number Publication Date
WO1992017796A1 true WO1992017796A1 (fr) 1992-10-15

Family

ID=3775302

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/AU1992/000128 WO1992017796A1 (fr) 1991-03-28 1992-03-27 Organisation des taches de gestion d'un systeme radar

Country Status (1)

Country Link
WO (1) WO1992017796A1 (fr)

Cited By (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US6151538A (en) * 1997-05-23 2000-11-21 Rolls-Royce Plc Control system
WO2005116687A1 (fr) * 2004-05-28 2005-12-08 Telefonaktiebolaget Lm Ericsson (Publ) Procede d'optimisation de la distribution des ressources de detection
WO2009034369A1 (fr) * 2007-09-12 2009-03-19 Bae Systems Plc Ordonnancement basé sur l'urgence
WO2009034368A1 (fr) * 2007-09-14 2009-03-19 Bae Systems Plc Planification de tâches radar basée sur la priorité en temps réel
EP1123516B1 (fr) * 1998-10-30 2013-02-20 Raytheon Company Temps de tenue adaptatif pour poursuite radar
CN104076333A (zh) * 2014-07-05 2014-10-01 中国船舶重工集团公司第七二四研究所 基于双排序的旋转相控阵雷达波束自适应编排的实现方法

Citations (8)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US4481583A (en) * 1981-10-30 1984-11-06 At&T Bell Laboratories Method for distributing resources in a time-shared system
US4482962A (en) * 1979-09-05 1984-11-13 Hitachi, Ltd. Engine control method
US4612418A (en) * 1983-06-14 1986-09-16 Tamura Electric Works, Ltd. Method for controlling task process and device thereof
AU6244686A (en) * 1985-09-17 1987-03-19 Codex Corporation Multiple task control
WO1987002486A1 (fr) * 1985-10-15 1987-04-23 Burroughs Corporation Processeur specialise pour le dechargement de nombreuses fonctions d'un systeme de fonctionnement dans un grand systeme de traitement de donnees
US4724438A (en) * 1983-10-07 1988-02-09 The Marconi Company Limited Radar apparatus
WO1989010571A1 (fr) * 1988-04-23 1989-11-02 Plessey Overseas Limited Systeme radar utilisant des modules de transmission/reception actifs electroniquement orientables
EP0442615A2 (fr) * 1990-02-14 1991-08-21 International Business Machines Corporation Adaptateur de communication

Patent Citations (8)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US4482962A (en) * 1979-09-05 1984-11-13 Hitachi, Ltd. Engine control method
US4481583A (en) * 1981-10-30 1984-11-06 At&T Bell Laboratories Method for distributing resources in a time-shared system
US4612418A (en) * 1983-06-14 1986-09-16 Tamura Electric Works, Ltd. Method for controlling task process and device thereof
US4724438A (en) * 1983-10-07 1988-02-09 The Marconi Company Limited Radar apparatus
AU6244686A (en) * 1985-09-17 1987-03-19 Codex Corporation Multiple task control
WO1987002486A1 (fr) * 1985-10-15 1987-04-23 Burroughs Corporation Processeur specialise pour le dechargement de nombreuses fonctions d'un systeme de fonctionnement dans un grand systeme de traitement de donnees
WO1989010571A1 (fr) * 1988-04-23 1989-11-02 Plessey Overseas Limited Systeme radar utilisant des modules de transmission/reception actifs electroniquement orientables
EP0442615A2 (fr) * 1990-02-14 1991-08-21 International Business Machines Corporation Adaptateur de communication

Cited By (8)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US6151538A (en) * 1997-05-23 2000-11-21 Rolls-Royce Plc Control system
EP1123516B1 (fr) * 1998-10-30 2013-02-20 Raytheon Company Temps de tenue adaptatif pour poursuite radar
WO2005116687A1 (fr) * 2004-05-28 2005-12-08 Telefonaktiebolaget Lm Ericsson (Publ) Procede d'optimisation de la distribution des ressources de detection
US7469194B2 (en) 2004-05-28 2008-12-23 Telefonaktiebolaget Lm Ericsson (Publ) Method for optimizing the distribution of sensor resources
WO2009034369A1 (fr) * 2007-09-12 2009-03-19 Bae Systems Plc Ordonnancement basé sur l'urgence
US8924980B2 (en) 2007-09-12 2014-12-30 Bae Systems Plc Urgency based scheduling
WO2009034368A1 (fr) * 2007-09-14 2009-03-19 Bae Systems Plc Planification de tâches radar basée sur la priorité en temps réel
CN104076333A (zh) * 2014-07-05 2014-10-01 中国船舶重工集团公司第七二四研究所 基于双排序的旋转相控阵雷达波束自适应编排的实现方法

Similar Documents

Publication Publication Date Title
US6148324A (en) Prioritized load balancing among non-communicating processes in a time-sharing system
DE69118560T2 (de) Verfahren zur Behandlung von durch phasengesteuerte Gruppenantennen erzeugten Strahlen und Gerät dafür
EP0276454B1 (fr) Système de poursuite d'une cible
EP0652513A1 (fr) Système de planning de séquence de tâches pour un système multiprocesseur
US5564062A (en) Resource arbitration system with resource checking and lockout avoidance
EP2643885B1 (fr) Allocation de ressource dynamique dans un système multi-rôle ou multi-fonction
US4720711A (en) Agile-beam track-while-scan radar system
JP2006059325A (ja) 規則に基づく階層化意思決定法を用いてセンサを管理をする方法
CN107192985B (zh) 分布式mimo雷达系统多目标速度估计的资源联合优化方法
WO1992017796A1 (fr) Organisation des taches de gestion d'un systeme radar
CN103916269A (zh) 用于加权公平队列的方法与系统
Izquierdo-Fuente et al. Optimal radar pulse scheduling using a neural network
CN109740832A (zh) 一种用于增强卫星系统自主导航能力的连接计划设计方法
AU1432792A (en) Radar control task scheduling
EP0140597A2 (fr) Radar à fonctions multiples
CN113207128A (zh) 强化学习下的无人机集群雷达通信一体化资源分配方法
Cone et al. Scheduling for sensor management using genetic search
US6381591B1 (en) Method for transformation of fuzzy logic, which is used to simulate a technical process, into a neural network
KR20070019482A (ko) 위협 표적의 무장 리소스 할당 제어 시스템 및 그 방법
Andreadakis Analysis and synthesis of decision-making organizations
HOUSTON et al. The ideal free distribution with unequal competitors: the effects of modelling methods
Stoffel Heuristic energy management for active array multifunction radars
EP1766432B1 (fr) Procede d'optimisation de la distribution des ressources de detection
JPH0535747A (ja) スケジユーリング方式
US20030140125A1 (en) Process for assigning addresses in a network, and components for said process

Legal Events

Date Code Title Description
AK Designated states

Kind code of ref document: A1

Designated state(s): AU CA JP US

AL Designated countries for regional patents

Kind code of ref document: A1

Designated state(s): AT BE CH DE DK ES FR GB GR IT LU MC NL SE

CFP Corrected version of a pamphlet front page
CR1 Correction of entry in section i

Free format text: IN PAT.BUL.26/92,UNDER INID (22) INTERNATIONAL FILING DATE REPLACE "920327" BY "920326"

DFPE Request for preliminary examination filed prior to expiration of 19th month from priority date (pct application filed before 20040101)
122 Ep: pct application non-entry in european phase
NENP Non-entry into the national phase

Ref country code: CA