[go: up one dir, main page]

CN102156660A - Method for distributing tasks based on two-layer decomposition in multiagent system - Google Patents

Method for distributing tasks based on two-layer decomposition in multiagent system Download PDF

Info

Publication number
CN102156660A
CN102156660A CN2011100907744A CN201110090774A CN102156660A CN 102156660 A CN102156660 A CN 102156660A CN 2011100907744 A CN2011100907744 A CN 2011100907744A CN 201110090774 A CN201110090774 A CN 201110090774A CN 102156660 A CN102156660 A CN 102156660A
Authority
CN
China
Prior art keywords
task
subtask
main body
module
decomposition
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.)
Pending
Application number
CN2011100907744A
Other languages
Chinese (zh)
Inventor
蒋玉俊
孟海战
徐媛
周伟
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Southeast University
Original Assignee
Southeast University
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 Southeast University filed Critical Southeast University
Priority to CN2011100907744A priority Critical patent/CN102156660A/en
Publication of CN102156660A publication Critical patent/CN102156660A/en
Pending legal-status Critical Current

Links

Images

Landscapes

  • Information Transfer Between Computers (AREA)

Abstract

多主体系统中基于双层分解的任务分配方法中,多主体系统中主体之间的结构形式为联邦式结构,即系统由中介子和执行主体构成,其中,中介子是用于接受任务的主体;任务的分配方式为:中介子接受任务后,对任务的关联结构进行分析,根据一定的资源阈值对任务进行首层分解,将任务分解成若干个关联比较紧密的子任务群组模块;接着,系统中的各个主体向中介子反馈主体的信息,反馈的信息包括主体的资源和能力信息以及主体处理任务的结果信息,中介子根据获得的信息对任务群组进行次层分解,将任务分配给各个主体进行求解。能够有效地降低任务的执行时间,使任务的执行时间接近于多主体系统执行能力限制条件下的最短执行时间。

Figure 201110090774

In the task assignment method based on double-layer decomposition in the multi-agent system, the structure between the agents in the multi-agent system is a federated structure, that is, the system is composed of mesons and execution subjects, where the mesons are the subjects used to accept tasks ;Task assignment is as follows: after the intermediary accepts the task, it analyzes the associated structure of the task, decomposes the task at the first level according to a certain resource threshold, and decomposes the task into several closely related subtask group modules; then , each subject in the system feeds back subject information to the meson. The feedback information includes the subject’s resource and capability information and the result information of the subject’s processing task. The meson decomposes the task group according to the obtained information and assigns the task Solve for each subject. The execution time of the task can be effectively reduced, and the execution time of the task is close to the shortest execution time under the limitation of the execution capability of the multi-agent system.

Figure 201110090774

Description

The method for allocating tasks that decomposes based on bilayer in the multiagent system
Technical field
The present invention relates to (Multi-Agents System) a kind of optimization method for allocating tasks that decomposes based on bilayer in the multiagent system, specifically be to utilize neutretto (Mediator) task to be carried out bilayer decomposition distribution according to the relational structure of task and the ability and the resource of main body (Agent), and then reduce the task execution time of multiagent system effectively, improve and carry out efficient.
Background technology
In the multiagent system, traditional Task Distribution Study on Problems mainly is with the subproblem after decomposing, and distributes to relatively independent main body according to certain rule and method, by finishing the work sharing out the work and help one another between the main body.Research contents comprises conflict how to avoid between the multiagent, reduce communication cost, improve aspects such as system's parallel processing capability, and model by improving these aspects and algorithm are realized the Task Distribution scheme optimized.But the distribution of task is inseparable with decomposing, and decomposition is the prerequisite of distributing, and different task decomposing schemes are to the Task Distribution important influence.Therefore, with the decomposition of task and distribution combine study Task Distribution more can the optimized distribution method, improve task executions efficient.
Find Yichuan Jiang﹠amp through retrieval to existing document; Jiuchuan Jiang is published in " IEEE Transactions On Parallel And Distributed Systems, VOL.20, No.5 (May 2009) " paper " Contextual Resource Negotiation-Based Task Allocation and Load Balancing in Complex Software Systems " in (IEEE parallel with distributed system journal the 20 volume fifth phase) Task Distribution and the load balancing of sight resource negotiation (in the complicated software system based on), this article has proposed a kind of Task Distribution scheme based on main body (Agent) sight resource, when Task Distribution, not only consider resource and ability that main body self is had, consider that also main body associated therewith is the resource and the ability of the main body in its sight environment, its process is before the Task Distribution, at first detect the resource and the ability of main body, the resource of main body and ability can not satisfy mission requirements, detect the resource and the ability of related with it main body, the task that is incorporated into is handled in the main body array, until satisfying mission requirements, carry out Task Distribution according to the resource and the ability of main body group in the sight environment then; Simultaneously, overweight for fear of the main body load with high sight resource and ability, this paper proposes after the main body of the type obtains certain task, and its sight resource and ability can be cut down, and satisfy the load balancing requirement during Task Distribution to greatest extent.Also find James Guo Ming Fu﹠amp by retrieval; Tirthankar Bandyopadhyay ﹠amp; Marcelo H. Ang Jr is published in " 2009 IEEE International Conference on Robotics and Automation (May 12-17,2009) " paper " Local Voronoi Decomposition for Multi-Agent Task Allocation " (the local Thiessen polygon decomposition algorithm in the multiagent Task Distribution) in (2009 IEEE robots and robotization international conference), this article proposes the decomposition algorithm that a kind of local message according to main body is determined the Thiessen polygon zone of main body, the approaching as theoretic optimal solution of its optimization degree in search problem.
Yet, though above-mentioned paper all provides the optimisation strategy that is used for that task is decomposed or distributes, not with the decomposition of task with distribute the optimization process scheme that combines the task of research.Promptly most at present researchs relevant for Task Distribution are confined to the distribution of task or decompose single aspect, and the research of decomposition being included in the Task Distribution strategy does not also have concrete research approach.
Summary of the invention
Technical matters:The objective of the invention is at above-mentioned the deficiencies in the prior art, a kind of method for allocating tasks that decomposes based on bilayer in the multiagent system is proposed, in the method, version in the multiagent system between the main body is the federal style structure, be that system is made of neutretto and executive agent, this characteristic feature of an invention is that the decomposition of task and distribution are combined as the optimization of probing into the Task Distribution strategy, avoids studying respectively the deficiency of decomposing and dividing timing to occur.
Technical scheme:The present invention is achieved through the following technical solutions, and this method may further comprise the steps:
Step 1, after task was accepted by neutretto, neutretto at first traveled through the relational structure of task, writes down required resource in each subtask and the association between the subtask, relational structure according to the subtask is decomposed into a series of subtasks module with task, finishes first floor task and decomposes; By the adjustment of resource threshold in the module of control subtask, the size of control subtask module;
Step 2, main body in the system is to neutretto feedback resource and ability information separately, the type of the abstract subtask that can handle for main body and each are handled the number of subtask constantly, the subtask result that neutretto was once handled each main body has record, evaluation as this main body sincerity degree, the sincere degree that has according to the feedback information and the neutretto of main body decomposes task, take all factors into consideration the be untreated load balancing of subtask module and the subtask module that is about to be assigned with of each main body simultaneously, finish the sublevel task and decompose.
In the step 1, described resource threshold is by being assigned to total the resource kind and the quantity of the subtask in the module, and promptly how many subtask module resources comes the control module size, rather than comes the control module size with the quantity of subtask in the module.
In the step 2, described load balancing is that certain finishes last neutretto constantly when the load of assessment main body, not only consider untreated load on the main body, also consider to be about to be assigned to of the load of the subtask modular belt of main body to main body, take all factors into consideration the load of each two aspect of main body, can carry out the main body of this subtask module for the overall load minimum following subtask module assignment constantly.
The decomposition of sublevel task is to carry out on the basis that first floor task is decomposed, and according to main body resource in the multiagent system and ability the subtask module that does not satisfy the task solving requirement is decomposed once more in sublevel decomposes.
So-called neutretto is meant the coordination main body that is used to handle each main body association in decomposition;
The resource that so-called subtask is required is meant kind and the quantity of finishing the subtask resource requirement,
Figure 110302DEST_PATH_IMAGE001
The subtask is finished in expression
Figure 154350DEST_PATH_IMAGE002
Need k resource
Figure 786320DEST_PATH_IMAGE003
;
Association between the so-called subtask is meant the preceding sequence task and the follow-up task of the subtask that is traveled through, and preceding sequence task refers to the subtask, upper strata with the subtask direct correlation, and follow-up task refers to the lower floor subtask related with the subtask;
So-called resource threshold is meant the maximum number of all resources in the subtask module that is decomposed.Go control module size Billy more to help objective judgement with contained resource sum in the module and be used for the processing module task executions time with subtask number control module size in the module;
The concrete technical scheme of this step is: after task was accepted by neutretto, neutretto traveled through the task relational structure, and traversing result is recorded in two-dimensional array
Figure 437881DEST_PATH_IMAGE004
, wherein
Figure 670148DEST_PATH_IMAGE005
,
Figure 3041DEST_PATH_IMAGE006
Be respectively applied for and deposit the subtask
Figure 738784DEST_PATH_IMAGE002
Preceding sequence task and follow-up task, Deposit and handle the subtask
Figure 31542DEST_PATH_IMAGE002
Required resource is carried out the first floor according to the result of traversal to task and is decomposed, and the condition that is used to control decomposing module is: The subtask Arbitrary before sequence task Number
Figure 693020DEST_PATH_IMAGE009
Figure 633294DEST_PATH_IMAGE010
The number of resources of subtask module Limit threshold value greater than module
Figure 439719DEST_PATH_IMAGE012
The process flow diagram of decomposition algorithm as shown in Figure 3.
After the relational structure of neutretto by task decomposes the task first floor, original task is decomposed into several degrees of association subtask module more closely, multiagent system is when handling these modules, can reduce the degree of association effectively is assigned to the communication that produces when different main body is handled and expends in the subtask closely, especially when the task scale was huger, the minimizing that communication expends was more obvious.
The concrete method of step 2 is as follows:
Have individual
Figure 868295DEST_PATH_IMAGE013
The multiagent system of individual executive agent is handled to be had
Figure 408998DEST_PATH_IMAGE014
Type
Figure 724572DEST_PATH_IMAGE015
The ancestral task that individual subtask constitutes, ancestral task is broken down into after step 1 is decomposed
Figure 512269DEST_PATH_IMAGE016
Individual sub-task module,
Figure 2011100907744100002DEST_PATH_IMAGE017
The execution time of type subtask is
Figure 913294DEST_PATH_IMAGE018
The executive capability of single main body is that the maximum number of energy subtasking in the unit interval is
Figure 444638DEST_PATH_IMAGE019
, wherein,
Figure 880299DEST_PATH_IMAGE020
Expression can be carried out
Figure 573317DEST_PATH_IMAGE017
Of type subtask
Figure 727218DEST_PATH_IMAGE021
Individual main body;
Figure 609724DEST_PATH_IMAGE022
In the module of subtask
Figure 149158DEST_PATH_IMAGE017
Total number of type subtask is used
Figure 763810DEST_PATH_IMAGE023
The expression (r=1,2,, m;
Figure 388696DEST_PATH_IMAGE017
=1,2,,
Figure 12575DEST_PATH_IMAGE014
).So, the multiagent system required maximum execution time of finishing the work is
Figure 406516DEST_PATH_IMAGE024
, promptly
Figure 457649DEST_PATH_IMAGE016
Total number of every type of subtask multiply by the summation of the unit execution time of carrying out the type subtask divided by system to total executive capability of this kind task in the individual sub-task module, in the case
Figure 382879DEST_PATH_IMAGE016
Individual sub-task module can not be by the multiagent system parallel processing; Multiagent system the shortest required execution time of finishing the work is
Figure 799997DEST_PATH_IMAGE025
, at this moment
Figure 64757DEST_PATH_IMAGE016
Individual sub-task module is handled by multiagent system simultaneously, and the execution time of general assignment is the execution time of the longest subtask module of required time; In view of the executive capability of each main body in the multiagent system, the actual general assignment execution time falls between, and the target of this invention is to make the execution time of general assignment farthest approaching under multiagent system executive capability restrictive condition
Figure 536058DEST_PATH_IMAGE026
Each main body of task is in the load of moment t , wherein
Figure 835638DEST_PATH_IMAGE028
Be last one not being performed of the task that constantly is assigned on the main body A,
Figure 17221DEST_PATH_IMAGE029
For distributing to the subtask of this main body; The result of each main body subtasking of neutretto record promptly can think sincere reliable in the successful execution subtask as the sincere degree of each main body, and it is non-honest reliable to execute the task, and the sincere degree of each main body is
Figure 410156DEST_PATH_IMAGE030
, the sincerity degree increases 1 when main body completes successfully a subtask, otherwise subtracts 1, thinks that when sincere degree is lower than 0 this main body do not have sincere degree, and neutretto is not distributed to body tasks.During original state, the sincere degree and the load of each main body are 0, neutretto distributes according to the resource and the ability antithetical phrase task module of main body, and at first the unique task of the executive agent of antithetical phrase task module or subtask is distributed, to not unique the distributing to of executive agent
Figure 496930DEST_PATH_IMAGE031
Less relatively trusted main body, this moment
Figure 723DEST_PATH_IMAGE032
Be 0; First moment executed the task after the end, each main body is to the load and the execution result of neutretto feedback oneself in the system, the neutretto basis load and the execution result of each main body is this moment distributed to next task constantly of each main body, assigns the task to the main body that satisfies following three conditions:
Condition one: Minimum main body, wherein,
Figure 787600DEST_PATH_IMAGE028
For the moment finishes also untreated subtask on the main body,
Figure 96090DEST_PATH_IMAGE029
Be the subtask that to distribute;
Condition two: communication expends less, and same main body is distributed in the subtask in the module of promptly same subtask, if do not satisfy, the subtask module is decomposed again, distributes according to condition one;
Condition three: sincere degree is higher, satisfy condition one and the basis of condition two on distribute to the higher main body of sincere degree;
The process flow diagram of decomposition algorithm as shown in Figure 4.
On the basis of above-mentioned two-layer decomposition, draw the method for allocating tasks that decomposes based on bilayer, its process flow diagram is as shown in Figure 5.
According to the method for allocating tasks of this invention,, can reduce the untight subtask of the degree of association effectively and be assigned to the different communication that main body caused and expend by the decomposition of the first floor based on the task relational structure; Simultaneously, this is invented each and carries out the load evaluate that finishes constantly by the task of distributing and being about to be assigned with is brought each main body, under the prerequisite of efficiently executing the task, reduced task execution time effectively, thereby made execution time of general assignment approach the shortest execution time under the multiagent system executive capability restrictive condition.
Beneficial effect:Neutretto is the main body that is used to receive an assignment.In the task assigning process, be not only the prioritization scheme research of decomposed task being carried out Task Distribution, and the decomposition of task is considered in the Task Distribution process.The neutretto that receives an assignment in the system at first carries out the first floor according to the relational structure between the task to task and decomposes, and degree of association subtask relatively closely combines, and can reduce expending of the communication resource in the task processes so effectively; Secondly, the feedback information of each main body in the neutretto evaluation system, information comprises the task of the resource of main body and ability, main body carrying and to execute the task result's record of each main body, according to the feedback information of main body, the first floor is decomposed obtaining of task decompose.Wherein, the result that each main body is executed the task is for fear of not being assigned to task time and again by the resource of feedback and the main body of ability successful execution task as a factor of sublevel decomposition.
1, decompose by the first floor based on the task relational structure, the communication that has reduced effectively in the task assigning process expends, and especially effect is more obvious when the task scale is bigger;
The method of the calculating main body load that 2, on the basis of foundation main body resource and ability, proposes, this method is considered the executive capability of the existing task of main body and task to be allocated and main body, reduced the execution time of general assignment effectively, made actual execution time effectively approach the shortest execution time under the multiagent system executive capability restriction;
Description of drawings
Fig. 1 is the structure connection of subtask in the ancestral task and the example displayed map of resource requirement type;
Fig. 2 is the task processing power figure of main body in the multiagent system;
Fig. 3 is based on the first floor task decomposition process figure of subtask relational structure in the ancestral task;
Fig. 4 is based on the sublevel task decomposition process figure of execution environment;
Fig. 5 is based on the double-deck method for allocating tasks process flow diagram that decomposes;
Fig. 6 is the flowchart of the distribution method of decomposing based on bilayer among the embodiment;
The processing power of A2, A3 is respectively 1,1,2; Terminal task is meant the subtask of follow-up task at task relational structure noon among Fig. 3, With
Figure 559750DEST_PATH_IMAGE034
Represent the contained total resource number of task in j sub-task module and this module respectively.
Embodiment
Below in conjunction with accompanying drawing embodiments of the invention are elaborated: present embodiment is being to implement under the prerequisite with the technical solution of the present invention; detailed embodiment and concrete operating process have been provided; but present embodiment is a simple case of the present invention to be used, and protection scope of the present invention is not limited to following embodiment.
Under the prerequisite that does not influence explanation content of the present invention, the main body in task and the multiagent system is done following simplification and setting:
(1) is used to control the resource threshold of subtask block size
Figure 543755DEST_PATH_IMAGE035
=10, the scale of different tasks according to task changed;
(2) do not consider the difference of subtask type in an embodiment, the execution time of subtask is all identical, promptly is provided with
Figure 90274DEST_PATH_IMAGE036
(3) ability of main body processing subtask is respectively in the system ,
Figure 195819DEST_PATH_IMAGE038
, i.e. the maximum subtask number that can handle constantly in unit of main body;
(4) each main body can both be finished subtask module or the subtask that is assigned to, promptly
Figure 101458DEST_PATH_IMAGE039
All constantly increase;
Above-mentioned setting does not influence summary of the invention, just more clearly sets forth the part simplification of doing in order to invent when the small-scale task is handled, when foundation the present invention handles actual task,
Figure 214619DEST_PATH_IMAGE012
,
Figure 926223DEST_PATH_IMAGE040
Character according to task itself is provided with, and
Figure 994673DEST_PATH_IMAGE039
Handle the execution result information of feeding back behind the subtask according to main body, the sincere degree that changes each main body get final product ( Finish a subtask smoothly
Figure 576013DEST_PATH_IMAGE039
) increase 1, otherwise subtract 1).
Step 1, the neutretto in Fig. 2 multiagent at first travels through task, determines the preceding sequence task and the follow-up task of each subtask, is respectively
Figure 278259DEST_PATH_IMAGE042
,
Figure 263532DEST_PATH_IMAGE043
,
Figure 510974DEST_PATH_IMAGE044
,
Figure 503070DEST_PATH_IMAGE045
,
Figure 494159DEST_PATH_IMAGE046
,
Figure 520890DEST_PATH_IMAGE047
,
Figure 1550DEST_PATH_IMAGE048
,
Figure 497253DEST_PATH_IMAGE049
By
Figure 275723DEST_PATH_IMAGE050
For Can judge
Figure 11783DEST_PATH_IMAGE052
Be terminal task, then will
Figure 791520DEST_PATH_IMAGE053
Terminal task compose to , because
Figure 125736DEST_PATH_IMAGE055
Be 1, promptly
Figure 885881DEST_PATH_IMAGE054
(
Figure 345725DEST_PATH_IMAGE053
) preceding sequence task have only
Figure 544625DEST_PATH_IMAGE056
, will Be included into module
Figure 331501DEST_PATH_IMAGE012
, because of
Figure 23514DEST_PATH_IMAGE053
Non-powder task, and =4, i.e. subtask module In the subtask contain the resource sum, satisfy
Figure 838389DEST_PATH_IMAGE058
So, will Tax is given , continuing the first floor and decompose, circulation is divided into task four sub-task modules at last successively, is respectively
Figure 310193DEST_PATH_IMAGE060
,
Figure 848622DEST_PATH_IMAGE061
,
Figure 498915DEST_PATH_IMAGE062
,
Figure 843309DEST_PATH_IMAGE063
, finished the decomposition of first floor task.The task of the first floor that the present invention is undertaken by the relational structure between the subtask is decomposed and has been reduced the subtask that is associated effectively be assigned to the very big communication cost of bringing when different subjects goes to carry out in the task assigning process, and what show in extensive task processes is apparent in view.
Step 2, what the task decomposition of the first floor was played in the process of whole Task Distribution is filtration, and the degree of association is filtered together the subtask more closely, expends thereby reduce communication effectively in the Task Distribution implementation.On the basis that the first floor decomposes, decompose once more according to the demand resource of task and the execution environment of multiagent system, the process flow diagram of decomposition as shown in Figure 4, detailed process is as follows:
In view of the difference of not considering the subtask type among the embodiment, the execution time of subtask all is provided with
Figure 200341DEST_PATH_IMAGE036
, so,
Figure 971988DEST_PATH_IMAGE027
Can be reduced to
Figure 860309DEST_PATH_IMAGE064
Neutretto traversal main information at first distributes executive agent to have only one subtask, will
Figure 929765DEST_PATH_IMAGE065
Affiliated subtask module
Figure 219932DEST_PATH_IMAGE066
Distribute to main body
Figure 343572DEST_PATH_IMAGE066
, the antithetical phrase task module travels through then, can handle
Figure 719189DEST_PATH_IMAGE012
Main body have
Figure 592336DEST_PATH_IMAGE067
, can handle Be main body
Figure 37410DEST_PATH_IMAGE069
, can handle
Figure 962641DEST_PATH_IMAGE070
Be main body
Figure 124632DEST_PATH_IMAGE071
, can handle
Figure 638659DEST_PATH_IMAGE072
Be main body
Figure 595113DEST_PATH_IMAGE066
, calculate each main body this moment
Figure 194591DEST_PATH_IMAGE031
, handle The time main body
Figure 341855DEST_PATH_IMAGE073
Be respectively
Figure 984058DEST_PATH_IMAGE074
, Distribute to Less
Figure 174551DEST_PATH_IMAGE071
, at this moment With
Figure 790526DEST_PATH_IMAGE066
Figure 139511DEST_PATH_IMAGE031
Be respectively 1 and 2, and
Figure 874249DEST_PATH_IMAGE076
Figure 483085DEST_PATH_IMAGE031
Be zero, therefore will
Figure 577949DEST_PATH_IMAGE068
Distribute to
Figure 526313DEST_PATH_IMAGE076
(distribute to
Figure 681220DEST_PATH_IMAGE031
Less main body), finish the Task Distribution in first moment, allocation result is shown in Fig. 6 (a), and multiagent system begins to carry out each subtask module; After constantly finishing, execution result information is fed back to neutretto, neutretto distributes the task of being untreated according to feedback information, by feedback information, to each main body
Figure 777352DEST_PATH_IMAGE031
Estimate with sincere degree (executive agent of subtask is credible all the time),
Figure 426639DEST_PATH_IMAGE077
Figure 478777DEST_PATH_IMAGE078
Figure 555318DEST_PATH_IMAGE079
, the subtask module assignment is given
Figure 325697DEST_PATH_IMAGE071
Fig. 6 (a) is theoretic OPTIMAL TASK allocative decision, and Fig. 6 (b) is the Task Distribution result of the multiagent system under this invention, and as seen in this small-scale Task Distribution embodiment, the present invention can find the optimal distributing scheme of task effectively.
Yet, this invention is not limited to this embodiment, in large-scale Task Distribution process, the present invention carries out the load evaluate that finishes constantly by the task of distributing and being about to be assigned with is brought each main body at each, under the prerequisite of efficiently executing the task, reduced task execution time effectively, thereby made execution time of general assignment approach the shortest execution time under the multiagent system executive capability restrictive condition.
Task Distribution according to the present invention carries out can reduce the task executions time effectively, makes task executions the shortest execution time under multiagent system executive capability restrictive condition around, has improved task executions efficient largely; Simultaneously, in extensive task was handled, by the decomposition based on relational structure, the communication that can reduce effectively between each main body Processing tasks process expended.

Claims (4)

1.一种多主体系统中基于双层分解的任务分配方法,其特征在于该方法包括以下两个步骤:1. a task assignment method based on double-layer decomposition in a multi-agent system, characterized in that the method comprises the following two steps: 步骤一,任务被中介子接受之后,中介子首先对任务的关联结构进行遍历,记录各个子任务所需的资源和子任务之间的关联,依据子任务的关联结构将任务分解为一系列子任务模块,完成首层任务分解;通过控制子任务模块中资源阈值的调整,控制子任务模块的大小,;Step 1: After the task is accepted by meson, meson first traverses the association structure of the task, records the resources required by each subtask and the association between subtasks, and decomposes the task into a series of subtasks according to the association structure of subtasks module to complete the task decomposition of the first layer; by controlling the adjustment of the resource threshold in the subtask module, the size of the subtask module is controlled; 步骤二,系统中的主体向中介子反馈各自的资源和能力信息,抽象为主体能够处理的子任务的类型和每个时刻处理子任务的个数,中介子对每个主体曾经处理的子任务结果拥有记录,作为该主体诚信度的评价,根据主体的反馈信息和中介子拥有的诚信度对任务进行分解,同时综合考虑各主体未处理子任务模块和即将被分配的子任务模块的负载均衡,完成次层任务分解。Step 2. The subjects in the system feed back their resource and capability information to the meson, which is abstracted into the types of subtasks that the subject can handle and the number of subtasks that can be processed at each moment. The result has a record, as the evaluation of the integrity of the subject, the task is decomposed according to the feedback information of the subject and the integrity of the intermediary, and at the same time, the load balance of the unprocessed subtask modules of each subject and the subtask modules to be assigned is comprehensively considered. , to complete the sub-level task decomposition. 2.根据权利要求1所述的多主体系统中基于双层分解的任务分配方法,其特征是步骤一中,所述的资源阈值通过已经分配到模块中的子任务的总的资源种类和数量,即子任务模块资源多少来控制模块大小,而不是用模块中子任务的数量来控制模块大小。2. the method for assigning tasks based on double-layer decomposition in the multi-agent system according to claim 1, characterized in that in step 1, the resource threshold has been assigned to the total resource types and quantities of the subtasks in the module , that is, how much subtask module resources control the module size, instead of using the number of subtasks in the module to control the module size. 3.根据权利要求1所述的多主体系统中基于双层分解的任务分配方法,其特征是步骤二中,所述的负载均衡是某时刻结束末中介子在评估主体的负载时,不仅考虑主体上未处理的负载,还考虑即将被分配给主体的子任务模块带给主体的负载,综合考虑各主体两个方面的负载,将下时刻的子任务模块分配给总体负载最小能够执行该子任务模块的主体。3. the task distribution method based on double-layer decomposition in the multi-agent system according to claim 1 is characterized in that in the step 2, the load balancing is that when the end meson evaluates the load of the main body at the end of a certain moment, not only The unprocessed load on the main body also considers the load brought to the main body by the subtask modules that will be assigned to the main body, comprehensively considers the loads of the two aspects of each main body, and assigns the subtask module at the next moment to the subtask module that can execute the subtask with the smallest overall load. The body of the task module. 4.根据权利要求1所述的多主体系统中基于双层分解的任务分配方法,其特征是,次层任务分解是在首层任务分解的基础上进行的,在次层分解中根据多主体系统中的主体资源和能力对不满足任务求解要求的子任务模块进行再次分解。4. the task distribution method based on double-layer decomposition in the multi-agent system according to claim 1, it is characterized in that, the sub-level task decomposition is carried out on the basis of the first-level task decomposition, in the sub-level decomposition according to the multi-subject The main resources and capabilities in the system decompose the subtask modules that do not meet the requirements of task solving.
CN2011100907744A 2011-04-12 2011-04-12 Method for distributing tasks based on two-layer decomposition in multiagent system Pending CN102156660A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN2011100907744A CN102156660A (en) 2011-04-12 2011-04-12 Method for distributing tasks based on two-layer decomposition in multiagent system

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN2011100907744A CN102156660A (en) 2011-04-12 2011-04-12 Method for distributing tasks based on two-layer decomposition in multiagent system

Publications (1)

Publication Number Publication Date
CN102156660A true CN102156660A (en) 2011-08-17

Family

ID=44438168

Family Applications (1)

Application Number Title Priority Date Filing Date
CN2011100907744A Pending CN102156660A (en) 2011-04-12 2011-04-12 Method for distributing tasks based on two-layer decomposition in multiagent system

Country Status (1)

Country Link
CN (1) CN102156660A (en)

Cited By (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2013029329A1 (en) * 2011-09-02 2013-03-07 海尔集团公司 Intelligence software service platform system and method, device and system including said system
CN103001837A (en) * 2011-09-09 2013-03-27 海尔集团公司 System and method for controlling household internet of things, device and system comprising system for controlling household internet of things
CN107145384A (en) * 2017-04-17 2017-09-08 广州孩教圈信息科技股份有限公司 Method for allocating tasks and system
CN108804377A (en) * 2018-04-24 2018-11-13 桂林长海发展有限责任公司 A kind of bus task processing method and system
CN111639867A (en) * 2020-06-01 2020-09-08 嘉兴久昌人力资源有限公司 Human resource task allocation management system
CN111652396A (en) * 2019-12-09 2020-09-11 武汉空心科技有限公司 Task allocation method for designated user of working platform

Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20060107264A1 (en) * 2004-11-18 2006-05-18 Hamilton Sundstrand Corporation Operating system and architecture for embedded system
CN101872378A (en) * 2010-06-24 2010-10-27 昆明理工大学 A Modeling Method of Complex System Based on Time Petri Net and Agent

Patent Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20060107264A1 (en) * 2004-11-18 2006-05-18 Hamilton Sundstrand Corporation Operating system and architecture for embedded system
CN101872378A (en) * 2010-06-24 2010-10-27 昆明理工大学 A Modeling Method of Complex System Based on Time Petri Net and Agent

Non-Patent Citations (2)

* Cited by examiner, † Cited by third party
Title
YICHUAN JIANG等: "Contextual Resource Negotiation-Based Task Allocation and Load Balancing in Complex Software Systems", 《PARALLEL AND DISTRIBUTED SYSTEMS, IEEE TRANSACTIONS ON》 *
侯亮等: "跨企业产品协同开发中的设计任务分解与分配", 《浙江大学学报(工学版)》 *

Cited By (7)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2013029329A1 (en) * 2011-09-02 2013-03-07 海尔集团公司 Intelligence software service platform system and method, device and system including said system
CN102970193A (en) * 2011-09-02 2013-03-13 海尔集团公司 System and method for intelligent software service platform, and device and family intelligence system comprising system
CN103001837A (en) * 2011-09-09 2013-03-27 海尔集团公司 System and method for controlling household internet of things, device and system comprising system for controlling household internet of things
CN107145384A (en) * 2017-04-17 2017-09-08 广州孩教圈信息科技股份有限公司 Method for allocating tasks and system
CN108804377A (en) * 2018-04-24 2018-11-13 桂林长海发展有限责任公司 A kind of bus task processing method and system
CN111652396A (en) * 2019-12-09 2020-09-11 武汉空心科技有限公司 Task allocation method for designated user of working platform
CN111639867A (en) * 2020-06-01 2020-09-08 嘉兴久昌人力资源有限公司 Human resource task allocation management system

Similar Documents

Publication Publication Date Title
Li et al. Subtask scheduling for distributed robots in cloud manufacturing
Tsai et al. Optimized task scheduling and resource allocation on cloud computing environment using improved differential evolution algorithm
CN104331321B (en) Cloud computing task scheduling method based on tabu search and load balancing
CN102156660A (en) Method for distributing tasks based on two-layer decomposition in multiagent system
Giglio et al. Multi-manned assembly line balancing problem with skilled workers: a new mathematical formulation
Zhang et al. An augmented Lagrangian coordination method for optimal allocation of cloud manufacturing services
Delavar et al. RSDC (reliable scheduling distributed in cloud computing)
CN101868792A (en) Allocation of resources for concurrent query execution via adaptive segmentation
Rustogi et al. Parallel machine scheduling: Impact of adding extra machines
CN106991006B (en) Support the cloud workflow task clustering method relied on and the time balances
Li et al. Research on the collaboration of service selection and resource scheduling for IoT simulation workflows
CN103617494A (en) Wide-area multi-stage distributed parallel power grid analysis system
Bai et al. Efficient performance impact algorithms for multirobot task assignment with deadlines
Fontes et al. Job-shop scheduling-joint consideration of production, transport, and storage/retrieval systems
Mahato et al. Load balanced transaction scheduling using Honey Bee Optimization considering performability in on‐demand computing system
Menon et al. Streamlining task planning systems for improved enactment in contemporary computing surroundings
Davidović et al. Parallel local search to schedule communicating tasks on identical processors
Awada et al. Air-to-air collaborative learning: A multi-task orchestration in federated aerial computing
Brinkmann et al. Scheduling shared continuous resources on many-cores
Werner et al. Systematic Literature Review of Data Exchange Strategies for Range-limited Particle Interactions.
Xun et al. Distributed tasks-platforms scheduling method to holonic-C2 organization
CN115525424A (en) Distributed computing system and method for group robots
CN108988933A (en) A kind of satellite data reception window global optimization distribution method
Frutos et al. Evolutionary multi-objective scheduling procedures in non-standardized production processes
Chen et al. A genetic algorithm for subtask allocation within human and robot coordinated assembly

Legal Events

Date Code Title Description
C06 Publication
PB01 Publication
C10 Entry into substantive examination
SE01 Entry into force of request for substantive examination
C02 Deemed withdrawal of patent application after publication (patent law 2001)
WD01 Invention patent application deemed withdrawn after publication

Application publication date: 20110817