CN108376105A - A kind of radar fence method for allocating tasks constraining combination Double Auction based on timeliness - Google Patents
A kind of radar fence method for allocating tasks constraining combination Double Auction based on timeliness Download PDFInfo
- Publication number
- CN108376105A CN108376105A CN201810249975.6A CN201810249975A CN108376105A CN 108376105 A CN108376105 A CN 108376105A CN 201810249975 A CN201810249975 A CN 201810249975A CN 108376105 A CN108376105 A CN 108376105A
- Authority
- CN
- China
- Prior art keywords
- task
- radar
- resource
- demand
- time
- Prior art date
- Legal status (The legal status 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 status listed.)
- Granted
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/50—Allocation of resources, e.g. of the central processing unit [CPU]
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q30/00—Commerce
- G06Q30/06—Buying, selling or leasing transactions
- G06Q30/08—Auctions
Abstract
The invention discloses a kind of radar fence method for allocating tasks constraining combination Double Auction based on timeliness, belong to Radar Technology field, are related to the timeliness constraint combination Double Auction technology of multifunction radar net task distribution.The problem of the present invention overcomes task values to change over time, and when radar is unable to real time processing tasks, and radar resource cannot be distributed effectively.Its feature is that the information provision of the demand information and radar first by mission requirements person is uploaded to auction center, then auction center determines the price of all kinds of resources according to the relation between supply and demand of radar resource, the allocation order of task is finally determined by the time according to the task of each task, it is maximized using total revenue as allocation criteria, multiple tasks multiclass resource is allocated simultaneously, it efficiently solves task value time-varying in practical applications, and radar is when being unable to real time processing tasks, the problem of task can not be distributed effectively, to realize the reasonable distribution to multifunction radar net task.
Description
Technical field
The invention belongs to Radar Technology fields, are related to the timeliness constraint combination Double Auction of multifunction radar net task distribution
Technical research.
Background technology
The distribution of multifunction radar net task is i.e. according to battlefield real-time situation, by limited time, antenna and signal processing list
The different types of resource such as member reasonably distributes to search, tracking, identification and other types of task.The high motor-driven spy of targeted cache
Property, enemy's interference etc. all can dynamically influence the resource requirement of pending task, different time sections are to each pending task
Resource allocation needs real-time change.Rational resource allocation, the overall combat effectiveness for the multifunction radar net that can be improved, is current
One of the research hotspot of domestic and international field of radar expert.
For multifunction radar net system, it is that a NP-hard is asked that limited radar resource, which is distributed to different tasks,
Topic, optimum allocation are difficult to solve.The advantages of combining Double Auction method combination combinational auction and Double Auction method, Ke Yiyou
The NP-hard for solving the problems, such as multifunction radar net resource allocation of effect.In document " Phased array radar resource
management using continuous double auction,IEEE Transactions on Aerospace&
In Electronic Systems, vol.51, no.3, pp.2212-2224,2015 ", using combination Double Auction method to more
Function Radar Task is allocated, but it does not account for the response time of the time variation of task value and radar.From current disclosure
From the point of view of the document delivered, the multifunction radar net task distribution for being worth time-varying to task using combination Double Auction method does not have also
Research.
Invention content
The purpose of the present invention is be directed to background technology there are the problem of, research and design one kind be based on timeliness constraint combination it is bilateral
The multifunction radar net method for allocating tasks of auction, the task value of solution changes over time, and radar cannot be real
When processing task when, the problem of task cannot be distributed effectively.
The information provision of the demand information of mission requirements person and radar is uploaded to auction center by the present invention first, is then clapped
Sell center determines the price of all kinds of resources finally according to the task of each task by the time according to the relation between supply and demand of radar resource
The allocation order for determining task is maximized using total revenue and is allocated as allocation criteria, while to multiple tasks multiclass resource,
This method efficiently solves task value time-varying in practical applications and radar is when being unable to real time processing tasks, and task is unable to get
The problem of effectively distributing, to realize the reasonable distribution to multifunction radar net resource.
In order to facilitate description present disclosure, following term is explained first：
Term 1：Auction center
Auction center is responsible for collecting the information provision of the demand information of all tasks and all radars, according to price mechanism
Radar resource is allocated
Term 2：Task is by the time
Task is by time TdThe deadline date that i.e. task is performed is 0 more than task value after this time, needs to abandon
Term 3：Response time
Response time TrI.e. radar starts the time of execution task
Term 4：Resource price
The price of resource price, that is, unit resource, is determined by resources requirement and supply, the resource valence of different task
Lattice are different.
The present invention proposes a kind of radar fence method for allocating tasks constraining combination Double Auction based on timeliness, this method packet
It includes：
Step 1：Collection demand and information provision；
M mission requirements person D=[d collects in auction center1,d2,…,dM] demand information { demand resource quantity X, resource
Type L, task are by time TdAnd the portions N radar R=[r1,r2,…,rN] information provision supply resource quantity Y, it is resources-type
Type L, response time Tr}；
Step 2：Determine resource price；
For each task, auction center determines resource price, i.e. i-th of task pair according to the relation between supply and demand of radar resource
The quantity required and all radars of l class resources determine the difference of the overall supplies of such resource the l of i-th of task
The price of class resource；
Step 3：Solving system income；
Complete the total revenues of all tasks the difference of the cost that resource is consumed be provided with radar to obtain system total revenue,
It takes and allocation criteria is turned to system benefit maximum, when system benefit reaches maximum, then show that task obtains optimal distribution；
For di, i=1,2 ..., M, task need to complete in its task before the time, only response time TrLess than it by the time
'sPortion's radar could execute its task；Reduce because task is worth over time, the response time of different radars is not
Equally, so the income of different radar execution acquisitions is also different；System benefit when i-th of task is completed to maximize, it will
The radar chosen is ranked up according to its sequence of resource consumption cost from low to high, i.e., preferentially uses low in resources consumption radar
The distribution of carry out task is combined into according to radar collection after the sequence from excellent to secondary
Step 4：Task is distributed；
Step 4.1：Determine task allocation order；
All mission requirements persons are ranked up according to its task by the sequence of time from low to high, i.e., preferential execute is appointed
Being engaged in by morning time for task；
Step 4.2：Judge whether task can successful execution；
Judge mission requirements person diTo the quantity required x of l class resourcesilWith choose the resource quantity that radar can be provided total
WithRelation between supply and demand, wherein l=1,2 ..., L；IfI.e. demand is more than supply, judges that task is lost
It loses, and by mission failure number MfailAdd 1, turn to step 4.4, otherwise, turns to step 4.5；
Step 4.3：Constant task completion rate；
In mission failure number Mfail＞ 0 then passes through the response time T of adjusting radarr- δ, wherein δ indicate adjust step-length according to
Actual conditions determine, increase the selected chance of radar, turn to step 4.2, reselect Response to selection time TrLess than its section
To the radar of time；
Step 4.4：Task assignment procedure；
Judge mission requirements person diTo the quantity required x of l class resourcesilWhether radar r is more than1The quantity that can be provided
y1lIf xil≤y1l, then show diTask by r1It completes, update radar r1Resource information be y1l-xil, turn to lower one kind
Otherwise resource shows r1D cannot individually be metiDemand to l class resources then updates diUnmet demand resource be xil-
y1lAnd turn to radar r2；
Judge mission requirements person diUnmet demand resource and radar r2The size for the resource quantity that can be provided, if (xil-
y1l)≤y1l, then show diThe demand assignment of l class resources is completed, update radar r1And r2Resource information, carry out lower one kind
The distribution of resource, otherwise being then updated diUnmet demand resource be xil-y1l-y2l, turn to r3；And so on, until
Complete diDistribution to l class resources turns to the distribution of lower a kind of resource；Step 4.5 is repeated, until completing diTo all types
Resource at the distribution of work, then show diMission Success distribution, turn to next task；Step 4.2-4.5 is repeated, until complete
At the distribution of all tasks.
Further, using the price p of the l class resources of i-th of task of following formula in the step 2il；
Wherein, λ is the regulatory factor that supply and demand difference amount influences, determines according to actual conditions, xilIndicate i-th of task pair
The quantity required of l class resources, yjlIndicate the supply quantity of jth portion radar pair l class resources.
Further, the specific method of the step 3 is；
Step 3.1：Determine that task is worth；
For i-th of task, i=1,2 ..., M, Response to selection time TrLess than it by the timePortion's radar executes
Its task；The average value of its L kind resourceFor：
Wherein：Ti dIndicate i-th task by the time,Indicate the response time of jth portion radar, pilIt indicates i-th
The price of the l class resources of task；
Step 3.2：Determine resource consumption cost；
For jth portion radar rj, wherein j=1,2 ..., N determine its execution according to job start time and supply price
The average cost of the unit resource amount of the L kind resources consumed when task, i.e.,
Step 3.3：Maximization system total revenue；
It is it to the demand of all resources and the average value of L kind resources to complete the income that i-th of task is obtained
Product, i.e.,
Radar rjThe cost consumed be that the average cost of the supply of resource and the unit resource amount of L kind resources is provided
Product, i.e.,
Then completing the system benefit that i-th of task obtains is
System benefit J when i-th of task is completed to maximizei, by what is chosenPortion's radar is according to its resource consumption generation
The sequence of valence from low to high is ranked up, i.e., the distribution of task, the thunder after sequence are preferentially carried out using low in resources consumption radar
It is combined into up to collection
Beneficial effects of the present invention：The present invention first uploads the information provision of the demand information of mission requirements person and radar
To auction center, then auction center determines the price of all kinds of resources according to the relation between supply and demand of radar resource, finally according to each
The task of task determines the allocation order of task by the time, is maximized using total revenue as allocation criteria, while to multiple
Business multiclass resource is allocated, and this method efficiently solves task value time-varying in practical applications and radar cannot be handled in real time
When task, the problem of task is unable to get reasonable distribution.It is an advantage of the invention that changed over time suitable for task value, and thunder
Optimum allocation is carried out up to the actual conditions for being unable to real time processing tasks, while to the more resources of multitask, improves multifunction radar
The fighting efficiency of net.Present invention could apply to the fields such as civilian military affairs.
Description of the drawings
Fig. 1 is the system block diagram of the method provided by the present invention；
Fig. 2 is the flow diagram of the method provided by the present invention；
Fig. 3 is the resource price schematic diagram of each task determined by the specific embodiment of the invention；
Fig. 4 is the task completion rate schematic diagram of the specific embodiment of the invention；
Fig. 5 is the system total revenue schematic diagram of the specific embodiment of the invention.
Specific implementation mode
The present invention mainly uses the method for emulation experiment to verify, and all steps, conclusion are all tested on Matlab2015
Card is correct.With regard to specific implementation mode, the present invention is described in further detail below.
Step 1：Collection demand and information provision
M mission requirements person D=[d collects in auction center1,d2,…,dM] demand information { demand resource quantity X, resource
Type L, task are by time TdAnd the portions N radar R=[r1,r2,…,rN] information provision supply resource quantity Y, it is resources-type
Type L, response time Tr}。
It is indicated using following matrix：
xilIndicate the quantity required of i-th of task pair l class resource, wherein
Ti dIndicate i-th task by time, wherein i=1,2 ..., M；
yjlThe supply quantity of expression jth portion radar pair l class resources, wherein j=1,
2 ..., N, l=1,2 ..., L；
Indicate the response time of jth portion radar, wherein j=1,2 ..., N；
Step 2：Determine resource price
For each task, auction center according to the relation between supply and demand of radar resource, i.e. i-th task pair l class resource
Quantity required and all radars determine the valence of the l class resources of i-th of task to the difference of the overall supplies of such resource
Lattice,
Wherein, λ is the regulatory factor that supply and demand difference amount influences.
Then the average price of the l class resources of each task is
Step 3：Solving system income
Step 3.1：Determine that task is worth
For i-th of mission requirements person di, i=1,2 ..., M, task need to complete in its task before the time, only
Response time TrLess than it by the timePortion's radar could execute its task；Because task was worth with the time
Passage and reduce, the response time of different radars is different, so to execute the income obtained also different for different radar.I-th
The average value of the L kind resources of a task is
Step 3.2：Determine resource consumption cost
For jth portion radar rj, j=1,2 ..., N determine its execution task according to job start time and supply price
When the average cost of the unit resource amounts of L kind resources that is consumed, i.e.,
Step 3.3：Maximize system benefit
It is it to the demand of all resources and the average value of L kind resources to complete the income that i-th of task is obtained
Product, i.e.,
Radar rjThe cost consumed be that the average cost of the supply of resource and the unit resource amount of L kind resources is provided
Product, i.e.,
Then completing the system benefit that i-th of task obtains is
System benefit J when i-th of task is completed to maximizei, by what is chosenPortion's radar is according to its resource consumption generation
The sequence of valence from low to high is ranked up, i.e., the distribution of task, the thunder after sequence are preferentially carried out using low in resources consumption radar
It is combined into up to collection
Step 4：Task is distributed
Step 4.1：Determine task allocation order
All mission requirements persons are ranked up according to its task by the sequence of time from low to high, i.e., preferential execute is appointed
Being engaged in by morning time for task.
Step 4.2：Judge whether task can successful execution
Judge diTo l, l=1,2 ..., the quantity required x of L class resourcesilWith the set R choseniIn radar can carry
The resource quantity summation of confessionRelation between supply and demand, ifI.e. demand is more than supply, judges mission failure,
And by mission failure number MfailAdd 1, turn to step 4.4, otherwise, turns to step 4.5.
Step 4.3：Constant task completion rate
In mission failure number Mfail＞ 0, i.e. task completion rate are less than 100%, then pass through the response time T of adjusting radarr-
δ turns to step 4.2, reselects Response to selection time TrLess than its radar by the time, that is, update set Ri.It is consumed
The average costs of L kind resources become
Wherein, δ is the response time to change the factor.
Step 4.4：Task assignment procedure
Judge diTo l, l=1,2 ..., the quantity required x of L class resourcesilWhether radar r is more than1The quantity that can be provided
y1lIf xil≤y1l, then show diTask by r1It completes, updates r1Resource information be y1l-xil, lower a kind of resource is turned to,
Otherwise show r1D cannot individually be metiDemand to l class resources then updates diUnmet demand resource be xil-y1lAnd turn
To r2；
Judge diUnmet demand resource and r2The size for the resource quantity that can be provided, if (xil-y1l)≤y1l, then show
diTo l, l=1,2 ..., the demand assignment of L class resources is completed, update radar r1And r2Resource information, carry out lower a kind of money
The distribution in source, otherwise being then updated diUnmet demand resource be xil-y1l-y2l, turn to r3；And so on, until complete
At diTo l, l=1,2 ..., the distribution of L class resources turns to the distribution of lower a kind of resource.Step 4.5 is repeated, until completing di
To all types of resources at the distribution of work, then show diMission Success distribution, turn to next task.Repeat step 4.2-
4.5, until completing the distribution of all tasks.
The effect of the present invention is further illustrated by following l-G simulation test：
Simulating scenes：Assuming that system shares 20 mission requirements persons, 10 radars have A, B, C three classes resource.Each task
U (0,20) (U (a, b) indicates the uniform value between a to b) is obeyed to the quantity required of every class resource, every radar can carry
The resource quantity of confession obeys U (0,40), and task obeys U (5,10) by time and the response time of radar.Mission requirements
The design parameter of the demand information of person and the information provision of radar difference is as shown in Table 1 and Table 2.
(a) 1 mission requirements person's demand information of table
(b) information provision of 2 radar of table
| Radar | Resource A | Resource B | Resource C | Response time | Radar | Resource A | Resource B | Resource C | Response time |
| r1 | 13 | 20 | 11 | 5.95 | r6 | 19 | 15 | 2 | 6.41 |
| r2 | 12 | 1 | 19 | 5.43 | r7 | 14 | 10 | 2 | 6.01 |
| r3 | 17 | 15 | 30 | 8.89 | r8 | 10 | 40 | 20 | 7.82 |
| r4 | 29 | 20 | 16 | 9.16 | r9 | 20 | 14 | 33 | 8.38 |
| r5 | 21 | 12 | 7 | 5.68 | r10 | 13 | 9 | 6 | 8.8 |
By step 2 it is recognised that resource price is determined by the resource requirement quantity of task and the supply quantity of radar.
The average price of the l class resources of each task can be obtained according to formula (2), as shown in Figure 3.
All mission requirements persons and radar are risen according to their own task by time and response time respectively
Sequence arranges, the information provided according to Tables 1 and 2, it can be appreciated that the task execution sequence of mission requirements person is { d15, d3,
d6, d9, d2, d5, d8, d13, d1, d4, d14, d10, d11, d7, d17, d20, d12, d12, d16, d19, d18, the supply sequence of radar is
{r7, r6, r4, r8, r10, r9, r3, r5, r2, r1}。
First to d15Task be allocated, the collection of the radar earlier than its task by the time is combined into R15={ r7,r6,r4,
r8,r10,r9,r3,r5,r2,r1}。d154 unit resource A, 2 unit resource B, 4 unit resource C are needed to complete its task, from table 2
It can be seen that r714 unit resource A, 10 unit resource B, 2 unit resource C can be provided.Then resource A and resource B can expire
Foot, and there is still a need for the resource C of 2 units to complete its task, and remaining resource by supply sequence in deputy r6It provides,
And r6The requirement of 2 unit resource C can be met.So far d15Task complete, by r74 unit resource A, 2 units money are provided
Source B, r7、r62 unit resource C are provided.Update r7Residue can provide resource be { 10,8,0 }, r6Residue resource can be provided be
{ 19,15,0 } continue to execute and come the deputy d of execution task3Task.And so on, until all tasks are all completed to divide
Match.Specific allocation result is as shown in table 3.
(c) 3 task allocation result of table
The completion rate situation of task as seen from Figure 4, red triangle line is indicated using constant task completion rate in figure
Situation, the completion rate of task and the quantity of task are unrelated at this time, are always maintained at the equal successful execution of all tasks；Blue box line table
The case where showing without constant task completion rate, it can be seen that worse and worse with the increase of number of tasks its task completion rate.
System benefit when Fig. 5 is indicated using constant task completion completion rate and without constant task completion rate.As can be seen that
It is higher than the feelings without constant task completion rate because the number of tasks successfully completed increases its system benefit using when constant task completion rate
Condition.
Specific implementation mode can be seen that the present invention and can be very good processing task valence in practical applications through the invention
It is worth time-varying, and when radar is unable to real time processing tasks, the problem of task can not be distributed effectively.
Claims (3)
1. a kind of radar fence method for allocating tasks constraining combination Double Auction based on timeliness, this method include：
Step 1：Collection demand and information provision；
M mission requirements person D=[d collects in auction center1,d2,…,dM] demand information { demand resource quantity X, resource type
L, task is by time TdAnd the portions N radar R=[r1,r2,…,rN] information provision supply resource quantity Y, resource type L,
Response time Tr}；
Step 2：Determine resource price；
For each task, auction center determines resource price, i.e. i-th of task pair l according to the relation between supply and demand of radar resource
The quantity required of class resource and all radars determine the difference of the overall supplies of such resource the l classes of i-th of task
The price of resource；
Step 3：Solving system income；
It completes the total revenues of all tasks the difference of the cost that resource is consumed is provided with radar to obtain system total revenue, take
Allocation criteria is turned to system benefit maximum, when system benefit reaches maximum, then shows that task obtains optimal distribution；For
di, i=1,2 ..., M, task need to complete in its task before the time, only response time TrLess than it by the timePortion's radar could execute its task；Reduce because task is worth over time, the response time of different radars differs
Sample, so the income that different radars executes acquisition is also different；System benefit when i-th of task is completed to maximize, and will be selected
In radar be ranked up according to its sequence of resource consumption cost from low to high, i.e., preferentially use low in resources consumption radar into
The distribution of row task is combined into according to radar collection after the sequence from excellent to secondary
Step 4：Task is distributed；
Step 4.1：Determine task allocation order；
All mission requirements persons are ranked up according to its task by the sequence of time from low to high, i.e., preferentially executes task and cuts
To the task of morning time；
Step 4.2：Judge whether task can successful execution；
Judge mission requirements person diTo the quantity required x of l class resourcesilWith the resource quantity summation for choosing radar can be providedRelation between supply and demand, wherein l=1,2 ..., L；IfI.e. demand is more than supply, judges mission failure,
And by mission failure number MfailAdd 1, turn to step 4.4, otherwise, turns to step 4.5；
Step 4.3：Constant task completion rate；
In mission failure number Mfail＞ 0 then passes through the response time T of adjusting radarr- δ, wherein δ indicate to adjust step-length according to reality
Situation determines, increases the selected chance of radar, turns to step 4.2, reselect Response to selection time TrLess than its by when
Between radar；
Step 4.4：Task assignment procedure；
Judge mission requirements person diTo the quantity required x of l class resourcesilWhether radar r is more than1The quantity y that can be provided1l, such as
Fruit xil≤y1l, then show diTask by r1It completes, update radar r1Resource information be y1l-xil, lower a kind of resource is turned to, it is no
Then show r1D cannot individually be metiDemand to l class resources then updates diUnmet demand resource be xil-y1lAnd it turns to
Radar r2；
Judge mission requirements person diUnmet demand resource and radar r2The size for the resource quantity that can be provided, if (xil-y1l)
≤y1l, then show diThe demand assignment of l class resources is completed, update radar r1And r2Resource information, carry out lower a kind of resource
Distribution, otherwise being then updated diUnmet demand resource be xil-y1l-y2l, turn to r3；And so on, until completing
diDistribution to l class resources turns to the distribution of lower a kind of resource；Step 4.5 is repeated, until completing diTo all types of moneys
Source at the distribution of work, then show diMission Success distribution, turn to next task；Step 4.2-4.5 is repeated, until completing institute
There is the distribution of task.
2. a kind of radar fence method for allocating tasks constraining combination Double Auction based on timeliness as described in claim 1, special
Sign is the price p of the l class resources using i-th of task of following formula in the step 2il；
Wherein, λ is the regulatory factor that supply and demand difference amount influences, determines according to actual conditions, xilIndicate i-th of task pair l class
The quantity required of resource, yjlIndicate the supply quantity of jth portion radar pair l class resources.
3. a kind of radar fence method for allocating tasks constraining combination Double Auction based on timeliness as described in claim 1, special
Sign is that the specific method of the step 3 is；
Step 3.1：Determine that task is worth；
For i-th of task, i=1,2 ..., M, Response to selection time TrLess than it by the timePortion's radar executes it
Business；The average value of its L kind resourceFor：
Wherein：Ti dIndicate i-th task by the time,Indicate the response time of jth portion radar, pilIndicate i-th of task
L class resources price；
Step 3.2：Determine resource consumption cost；
For jth portion radar rj, wherein j=1,2 ..., N, when determining that it executes task according to job start time and supply price
The average cost of the unit resource amount of the L kind resources consumed, i.e.,
Step 3.3：Maximization system total revenue；
The income that i-th of task is obtained is completed as its product to the demand of all resources and the average value of L kind resources,
I.e.
Radar rjThe cost consumed be that the supply of resource and multiplying for the average cost of the unit resource amount of L kind resources are provided
Product, i.e.,
Then completing the system benefit that i-th of task obtains is
System benefit J when i-th of task is completed to maximizei, by what is chosenPortion's radar according to its resource consumption cost by
Low to high sequence is ranked up, i.e., the distribution of task, the radar collection after sequence are preferentially carried out using low in resources consumption radar
It is combined into
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201810249975.6A CN108376105B (en) | 2018-03-26 | 2018-03-26 | Radar network task allocation method based on time-effect constraint combination bilateral auction |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201810249975.6A CN108376105B (en) | 2018-03-26 | 2018-03-26 | Radar network task allocation method based on time-effect constraint combination bilateral auction |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN108376105A true CN108376105A (en) | 2018-08-07 |
| CN108376105B CN108376105B (en) | 2021-12-03 |
Family
ID=63019223
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201810249975.6A Active CN108376105B (en) | 2018-03-26 | 2018-03-26 | Radar network task allocation method based on time-effect constraint combination bilateral auction |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN108376105B (en) |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN112406748A (en) * | 2020-11-19 | 2021-02-26 | 广州瑞修得信息科技有限公司 | Vehicle data acquisition method and device and vehicle diagnosis system |
| CN115618166A (en) * | 2022-10-18 | 2023-01-17 | 中国电子科技集团公司信息科学研究院 | Time resource scheduling method and device based on multi-task radar |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20080244607A1 (en) * | 2007-03-27 | 2008-10-02 | Vladislav Rysin | Economic allocation and management of resources via a virtual resource market |
| CN102289766A (en) * | 2011-07-29 | 2011-12-21 | 东北大学 | Method for scheduling grid resources based on continuous two-way auction mechanism |
| US20120233668A1 (en) * | 2011-03-08 | 2012-09-13 | Rackspace Us, Inc. | Pluggable Allocation in a Cloud Computing System |
| US20130301609A1 (en) * | 2010-07-15 | 2013-11-14 | Rivada Networks, Llc | Methods and Systems for Dynamic Spectrum Arbitrage |
| CN106506607A (en) * | 2016-10-19 | 2017-03-15 | 云南大学 | Cloud computing resources distribution method based on fair credible two way auction mechanism |
-
2018
- 2018-03-26 CN CN201810249975.6A patent/CN108376105B/en active Active
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20080244607A1 (en) * | 2007-03-27 | 2008-10-02 | Vladislav Rysin | Economic allocation and management of resources via a virtual resource market |
| US20130301609A1 (en) * | 2010-07-15 | 2013-11-14 | Rivada Networks, Llc | Methods and Systems for Dynamic Spectrum Arbitrage |
| US20120233668A1 (en) * | 2011-03-08 | 2012-09-13 | Rackspace Us, Inc. | Pluggable Allocation in a Cloud Computing System |
| CN102289766A (en) * | 2011-07-29 | 2011-12-21 | 东北大学 | Method for scheduling grid resources based on continuous two-way auction mechanism |
| CN106506607A (en) * | 2016-10-19 | 2017-03-15 | 云南大学 | Cloud computing resources distribution method based on fair credible two way auction mechanism |
Non-Patent Citations (3)
| Title |
|---|
| J. OSTWAKD等: "Combinatorial auctions for resource allocation in a distributed sensor network", 《26TH IEEE INTERNATIONAL REAL-TIME SYSTEMS SYMPOSIUM (RTSS 05)》 * |
| TUANWEI TIAN等: "A combinatorial double auction based tasks scheduling approach for multifunction radar network", 《2018 IEEE RADAR CONFERENCE (RADARCONF18)》 * |
| 王强等: "多功能组网雷达可变参数任务规划方法", 《现代雷达》 * |
Cited By (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN112406748A (en) * | 2020-11-19 | 2021-02-26 | 广州瑞修得信息科技有限公司 | Vehicle data acquisition method and device and vehicle diagnosis system |
| CN112406748B (en) * | 2020-11-19 | 2023-08-01 | 广州瑞修得信息科技有限公司 | Vehicle data acquisition method and device and vehicle diagnosis system |
| CN115618166A (en) * | 2022-10-18 | 2023-01-17 | 中国电子科技集团公司信息科学研究院 | Time resource scheduling method and device based on multi-task radar |
| CN115618166B (en) * | 2022-10-18 | 2023-09-12 | 中国电子科技集团公司信息科学研究院 | Time resource scheduling method and device based on multi-task radar |
Also Published As
| Publication number | Publication date |
|---|---|
| CN108376105B (en) | 2021-12-03 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Dixit et al. | Airport capacity management: A review and bibliometric analysis | |
| McCabe et al. | Smart computer-assisted markets | |
| CN109409773B (en) | Dynamic planning method for earth observation resources based on contract network mechanism | |
| Pellegrini et al. | Secondary trading of airport slots as a combinatorial exchange | |
| CN107944625A (en) | Single air station flight season time slot optimization method based on history data driving | |
| CN106327090A (en) | Real task allocation method applied to preference crowd-sourcing system | |
| Gong et al. | Split-award contracts with investment | |
| Gershkov et al. | When queueing is better than push and shove | |
| CN108376105A (en) | A kind of radar fence method for allocating tasks constraining combination Double Auction based on timeliness | |
| CN109819047A (en) | A kind of mobile edge calculations resource allocation methods based on incentive mechanism | |
| CN106789118A (en) | Cloud computing charging method based on service-level agreement | |
| Henning et al. | Networks and transaction costs | |
| CN110009233A (en) | Based on the method for allocating tasks of game theory in intelligent perception | |
| CN110456633A (en) | Airborne multi-platform distributed task scheduling distribution method | |
| CN105975332A (en) | Method for forming multi-agent distributed union | |
| Parkhurst et al. | Tradable set-aside requirements (TSARs): conserving spatially dependent environmental amenities | |
| DE202022106297U1 (en) | Intelligent system for energy demand forecasting and sustainable energy management through machine learning and artificial intelligence | |
| CN114971819A (en) | User bidding method and device based on multi-agent reinforcement learning algorithm under federal learning | |
| CN105528647A (en) | Airport traffic demand possibility prediction method based on big data analysis | |
| DE202013012479U1 (en) | System to commit execution of transactions on remote servers | |
| US20080275790A1 (en) | Bid groups for online auctions | |
| CN101098255A (en) | Option pricing model scheduling algorithm based implementation in interactive gridding system | |
| CN108446174A (en) | Multinuclear job scheduling method based on pre-allocation of resources and public guiding agency | |
| CN109872086A (en) | A kind of Phased Array Radar Resource Scheduling scheme evaluation system of task based access control section | |
| CN107832864A (en) | The net bidded under environment about special train distribution and pricing method |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |