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 PDFInfo
- 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
- subtask
- task
- main body
- module
- neutretto
- 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
Links
Images
Landscapes
- Information Transfer Between Computers (AREA)
Abstract
The invention provides a method for distributing tasks based on two-layer decomposition in a multiagent system. A structure form among agents in the multiagent system is a federal style structure, namely the system consists of a neutretto and an execution agent, wherein the neutretto is an agent for receiving the tasks. The method for distributing the tasks comprises the following steps that: after receiving the tasks, the neutretto analyzes an associative structure of the tasks, and performs first-layer decomposition on the tasks according to a certain resource threshold value to decompose the tasks into a plurality of subtask group modules which are associated with one another tightly; then, the other agents in the system feed back information of the agents to the neutretto, wherein the fed information comprises resources and capability information of the agents, and result information of the tasks processed by the agents; and the neutretto performs second-layer decomposition on the task groups according to the acquired information and distributes the tasks to the other agents for calculation. By the method, the execution time of the tasks can be shortened effectively, so that the execution time of the tasks is approximate to the shortest execution time under the condition of restraint of the execution capability of the multiagent system.
Description
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:
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,
The subtask is finished in expression
Need k resource
;
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
, wherein
,
Be respectively applied for and deposit the subtask
Preceding sequence task and follow-up task,
Deposit and handle the subtask
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
The number of resources of subtask module
Limit threshold value greater than module
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
The multiagent system of individual executive agent is handled to be had
Type
The ancestral task that individual subtask constitutes, ancestral task is broken down into after step 1 is decomposed
Individual sub-task module,
The execution time of type subtask is
The executive capability of single main body is that the maximum number of energy subtasking in the unit interval is
, wherein,
Expression can be carried out
Of type subtask
Individual main body;
In the module of subtask
Total number of type subtask is used
The expression (r=1,2,, m;
=1,2,,
).So, the multiagent system required maximum execution time of finishing the work is
, promptly
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
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
, at this moment
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
Each main body of task is in the load of moment t
, wherein
Be last one not being performed of the task that constantly is assigned on the main body A,
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
, 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
Less relatively trusted main body, this moment
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,
For the moment finishes also untreated subtask on the main body,
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
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
=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
(3) ability of main body processing subtask is respectively in the system
,
, 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
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,
,
Character according to task itself is provided with, and
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
) increase 1, otherwise subtract 1).
In view of the difference of not considering the subtask type among the embodiment, the execution time of subtask all is provided with
, so,
Can be reduced to
Neutretto traversal main information at first distributes executive agent to have only one subtask, will
Affiliated subtask module
Distribute to main body
, the antithetical phrase task module travels through then, can handle
Main body have
, can handle
Be main body
, can handle
Be main body
, can handle
Be main body
, calculate each main body this moment
, handle
The time main body
Be respectively
,
Distribute to
Less
, at this moment
With
Be respectively 1 and 2, and
Be zero, therefore will
Distribute to
(distribute to
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
Estimate with sincere degree (executive agent of subtask is credible all the time),
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. the method for allocating tasks that decomposes based on bilayer in the multiagent system is characterized in that this method comprises following two 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.
2. the method for allocating tasks that decomposes based on bilayer in the multiagent system according to claim 1, it is characterized in that 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, be how many subtask module resources comes the control module size, rather than come the control module size with the quantity of subtask in the module.
3. the method for allocating tasks that decomposes based on bilayer in the multiagent system according to claim 1, it is characterized in that 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.
4. the method for allocating tasks that decomposes based on bilayer in the multiagent system according to claim 1, it is characterized in that, 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.
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)
| 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)
| 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 | 昆明理工大学 | Method for modeling complex system on basis of time Petri net and Agent |
-
2011
- 2011-04-12 CN CN2011100907744A patent/CN102156660A/en active Pending
Patent Citations (2)
| 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 | 昆明理工大学 | Method for modeling complex system on basis of time Petri net and Agent |
Non-Patent Citations (2)
| 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)
| 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 |
|---|---|---|
| CN102156660A (en) | Method for distributing tasks based on two-layer decomposition in multiagent system | |
| Jin et al. | Tactical berth and yard template design at container transshipment terminals: A column generation based approach | |
| Delavar et al. | RSDC (reliable scheduling distributed in cloud computing) | |
| Giglio et al. | Multi-manned assembly line balancing problem with skilled workers: a new mathematical formulation | |
| CN104657214A (en) | Multi-queue multi-priority big data task management system and method for achieving big data task management by utilizing system | |
| CN109189094B (en) | Resource scheduling method for hybrid formation of multiple human-machines and multiple unmanned aerial vehicles | |
| CN104657220A (en) | Model and method for scheduling for mixed cloud based on deadline and cost constraints | |
| US8527988B1 (en) | Proximity mapping of virtual-machine threads to processors | |
| CN104166903B (en) | Mission planning method and system based on process division | |
| CN102799467A (en) | Method and system for allocating tasks | |
| CN102779183B (en) | Data inquiry method, equipment and system | |
| Shabtay et al. | A bicriteria approach to maximize the weighted number of just-in-time jobs and to minimize the total resource consumption cost in a two-machine flow-shop scheduling system | |
| CN103617494A (en) | Wide-area multi-stage distributed parallel power grid analysis system | |
| CN109711702B (en) | Earth observation task distributed collaborative planning method facing multiple management platforms | |
| CN106802825A (en) | A kind of dynamic task scheduling method and system based on real-time system | |
| Andersson et al. | Contract types for satisficing task allocation: II experimental results | |
| CN107437138A (en) | Based on the production and transport coordinated dispatching method and system for improving gravitation search algorithm | |
| Khan et al. | Cost Optimization Technique of Task Allocation in Heterogeneous Distributed Computing System | |
| Hassam et al. | Minimizing makespan on identical parallel machines | |
| Krä et al. | Production planning for collaborating resources in cyber-physical production systems | |
| CN100422935C (en) | Dummy multiprocessor system based on network and processing method | |
| Yang et al. | A mapreduce task scheduling algorithm for deadline-constraint in homogeneous environment | |
| Tambe | A Genetic Algorithm Approach for Scheduling Jobs on Identical Parallel Machines | |
| Gnanavelbabu et al. | Multi objective scheduling of jobs, AGVs and AS/RS in FMS using artificial immune system | |
| Liang et al. | Multistage collaborative scheduling of berth and quay crane based on heuristic strategies and particle swarm optimization |
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 |