CN101618543A - Task allocation method of heterogeneous multi-robot system - Google Patents

Task allocation method of heterogeneous multi-robot system Download PDF

Info

Publication number
CN101618543A
CN101618543A CN200910104420A CN200910104420A CN101618543A CN 101618543 A CN101618543 A CN 101618543A CN 200910104420 A CN200910104420 A CN 200910104420A CN 200910104420 A CN200910104420 A CN 200910104420A CN 101618543 A CN101618543 A CN 101618543A
Authority
CN
China
Prior art keywords
robot
subtask
task
ability
robot system
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
Application number
CN200910104420A
Other languages
Chinese (zh)
Other versions
CN101618543B (en
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.)
Chongqing University of Post and Telecommunications
Original Assignee
Chongqing University of Post and Telecommunications
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 Chongqing University of Post and Telecommunications filed Critical Chongqing University of Post and Telecommunications
Priority to CN2009101044203A priority Critical patent/CN101618543B/en
Publication of CN101618543A publication Critical patent/CN101618543A/en
Application granted granted Critical
Publication of CN101618543B publication Critical patent/CN101618543B/en
Expired - Fee Related legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Landscapes

  • Manipulator (AREA)

Abstract

The invention belongs to the field of automatic control, in particular relates to a task allocation method of a heterogeneous multi-robot system, which comprises the following steps: S1, initializing robots and subtask parameters; S2, executing subtasks with high information concentration near the robots and close to self-capacity and subtask ability requirement by the robots, wherein the robots are skilled in the subtasks. The invention fully considers the influence of a functional structure of the multi-robot system to the task allocation of the multi-robot system, and realizes the task allocation of the heterogeneous multi-robot system.

Description

The method for allocating tasks of heterogeneous multi-robot system
Technical field
The invention belongs to automation field, be specifically related to the method for allocating tasks of heterogeneous multi-robot system.
Background technology
The variation of making rapid progress has taken place as one of human greatest invention of 20th century in robot in short more than 40 years.Robot had become representative strategic objective in the high-tech sector in recent years.The appearance of Robotics and development not only make traditional industrial production looks generation essence change, and the mankind's society is produced far-reaching influence.Along with the develop rapidly of social production technology, the application of robot is constantly expanded.Exploration from the automatic production line to marine resources, and even field such as space operation, robot is ubiquitous.Yet with regard to present Robotics level, single robot all is limited at aspects such as the obtaining of information, processing and control abilities, and for the task of complexity and changeable working environment, the ability of single robot is more inadequate.Multi-robot system provides solution route with its exclusive superiority for this problem.
The research of multi-robot system starts from the seventies in 20th century.From then on, domestic and international many colleges and universities and scientific research institution have carried out extensive studies to multi-robot system.Along with multi-robot system is subjected to the increase of attention degree, distribute as the task of a multi-robot coordination part also more and more to cause people's attention.Although it is the part that multi-robot system is coordinated that task is distributed, but because task is distributed the high level that occupy in the multi-robot system, in the process of research, can ignore the bottom details of system, thus the researcher usually task is distributed as one independently subproblem study.Multi-robot system task distribution has at present obtained certain achievement in research, is a NP difficult problem yet find the solution multi-robot system task allocative decision, and the research that multimachine device system task is distributed still is in initial stage, has got long long way to go.The multi-robot system task is assigned one of problem to be solved at present: consider the influence of the functional structure of robot system to the distribution of multi-robot system task.Robot system functional structure difference is also different to the requirement that task is distributed, and robot capability differs in the isomery robot system, need consider when allocating task what ability is different tasks respectively need, and needs which robot to cooperate and finishes.Because the isomery robot system has generality, therefore must consider the influence that the robot system functional structure is distributed the multi-robot system task, and design corresponding task allocation algorithms on this basis, give full play to the ability of robot.
Summary of the invention
In view of this,, the present invention proposes a kind of method for allocating tasks of heterogeneous multi-robot system, adopt improved ant group algorithm, coordinate the execution of heterogeneous multi-robot at least one subtask in order to address the above problem.
The object of the present invention is achieved like this: the method for allocating tasks of heterogeneous multi-robot system comprises the steps:
S1: initialization robot and subtask parameter;
S2: robot selects oneself to be good at, self-ability with the subtask ability need is approaching, from own near, subtask execution that information concentration is high;
Further, among the described step S1, robot and subtask parameter comprise that device people's ability disposes vectorial C i, the subtask the ability need vector M j, the capabilities match parameter K Ij, the horizontal parameter L of robot executive capability Ij, the quantity upper limit N of the required robot in subtask jThe quantity A of robot with current subtasking j
Further, among the described step S2, the i of robot specifically carries out following steps;
S21: upgrade oneself state s i, check the ability configuration of self;
S22: the state and the ability configuration of obtaining the other machines people;
S23: the pheromone concentration that obtains all subtasks;
S24: the selection probability that calculates the subtask;
S25: select the highest subtask of probability to carry out;
Further, step S24 specifically comprises the steps:
Robot quantity also many more, therefore keep robot quantity to be directly proportional with the subtask workload, can improve the average efficiency of multi-robot system; 3) continuity of assurance robot subtasking: a lot of robots are when subtasking, may receive " invitation " of new subtask, among the present invention, have only after robot finishes the work, go again to carry out new subtask, thereby guarantee the performance level maximum of overall task.
Other advantages of the present invention, target, to set forth in the following description to a certain extent with feature, and to a certain extent,, perhaps can obtain instruction from the practice of the present invention based on being conspicuous to those skilled in the art to investigating hereinafter.Target of the present invention and other advantages can be passed through following specification, claims, and the specifically noted structure realizes and obtains in the accompanying drawing.
Description of drawings
In order to make the purpose, technical solutions and advantages of the present invention clearer, the present invention is described in further detail below in conjunction with accompanying drawing:
Fig. 1 shows the method for allocating tasks schematic flow sheet of heterogeneous multi-robot system;
Fig. 2 shows the schematic flow sheet that subtasking is selected by robot;
Fig. 3 shows the embodiment task and distributes initial time figure;
Fig. 4 shows the embodiment task and distributes t 1Time chart;
Fig. 5 shows the embodiment task and distributes t 2Time chart;
Fig. 6 shows the embodiment task and distributes t 3Time chart;
Fig. 7 shows the embodiment task and distributes t 4Time chart;
Fig. 8 shows the embodiment task and distributes t 5Time chart;
Fig. 9 shows the embodiment task and distributes t 6Time chart;
Figure 10 shows the embodiment task and distributes t 7Time chart;
Figure 11 shows the embodiment task and distributes t 8Time chart;
Figure 12 shows the embodiment task and distributes t 9Time chart.
The specific embodiment
Below will be described in detail the preferred embodiments of the present invention.
At first to following parameter declaration:
τ j: the pheromones on the j of subtask;
η Ij=1/d Ij: the inverse of distance between i of robot and the subtask j;
C i: robot capability configuration vector refers to the function that the i of robot itself is possessed;
M j: the ability need vector of subtask refers to the needed function of subtasking j;
K Ij: the capabilities match parameter, whether the expression i of robot is fit to carry out a certain subtask j;
L Ij: the i of robot is to the horizontal parameter of the executive capability of subtask j;
p Ij: the i of robot is to the selection probability variable of subtask j;
A j: the robot quantity of current subtasking j;
N j: the required robot of the subtask j quantity upper limit;
T j: subtask j total amount is constant;
I i: the i of the robot amount of executing the task, this parameter are constant;
R j: the quantity upper limit sign of the required robot in subtask;
F j: the subtask complement mark;
Task Ij: switching variable.
Be located in the working region of task the unknown, the set that contains n robot is R={r 1, r 2, r 3..., r nAnd the set of tasks that contains k subtask be T={t 1, t 2..., t k.N robot at random search mission in the working region, in the time of initial corresponding to all task j (j=1,2 ...) and " hormone " τ jBe τ (τ is a constant) that the state set of n robot is S={s 1, s 2..., s n, 0 is idle condition, 1 is duty.
Robot possesses multiple different function, as perception (vision, sense of smell, the sense of hearing, infrared, ultrasonic etc.), executive capability (move, carrying, processing are handled etc.), operational capability, communication capacity etc., and, also may need multiple different ability to finish for a task.These Capability Categories are refined into single ability, and these all single abilities are formed set.
If by k single ability c jThe competence set of forming is:
S241 compute switch variable task Ij,
task ij=F j·R j·s i·K ij
Wherein, F jBe subtask complement mark, s iThe state of the expression i of robot, K IjBe the i of robot capabilities match parameter, R jBe the quantity upper limit sign of the required robot of subtask j, its expression formula is:
R j = 0 , A j = N j 1 , A j < N j ;
S242: according to the switching variable task of step S21 gained Ij, calculate the selection probability of subtask j by following formula:
p ij=p′ ij·task ij
p &prime; ij = ( &tau; j ) &alpha; &eta; ij &beta; &Sigma; j ( &tau; j ) &alpha; &eta; ij &beta; &CenterDot; ( 1 - &omega; ) + &omega; &CenterDot; L ij ;
In the formula, τ jBe the pheromones on the j of subtask, η IjBe the inverse of distance between i of robot and the subtask j, L IjFor the i of robot to the horizontal parameter of subtask j executive capability, ω is the constant between 0 to 1;
Further, also comprise the steps: after the step S2
S3: judge whether subtask j finishes, as not, the plain τ of lastest imformation then j, and redirect execution in step S3; In this way, execution in step S4 then;
S4: with robotary s iWith pheromones τ jMake zero.
The method for allocating tasks of the heterogeneous multi-robot system that the present invention proposes takes into full account the influence of the functional structure of robot system to the distribution of multi-robot system task, has realized that the task of heterogeneous multi-robot system is distributed; Specifically comprise following advantage: can realize that 1) optimum robot shines upon to the subtask: the subtask in overall task to robot capability require variant, the ability configuration of each robot is also variant, therefore allow each robot select the subtask of mating most, can improve systematic function with self-ability; 2) the robot quantity that guarantees the chooser task is directly proportional with the subtask workload: because working environment space, place, subtask is limited, the robot quantity in the space more at most time of the mutual collision prevention consumption of robot many more, the average efficiency of robot is low more; Simultaneously, the subtask workload is big more, and then working space is relatively also big more, can hold
C={c j},1≤j≤k
1) ability of robot configuration vector
Robot capability configuration vector is meant the function that robot itself is possessed.
Be provided with n the r of robot with difference in functionality i, 1≤i≤n.For the r of robot i, define its ability and dispose vectorial C iFor:
C i=diag{α i1,α i2,…,α ik}·[c 1,c 2,…,c k] T (1)
Wherein, α IkThe expression r of robot iWhether has ability c k, if robot possesses ability c k, α Ik=1; If robot does not possess ability c k, α then Ik=0.
2) the ability need vector M of subtask j
The ability need vector of subtask is meant the needed function of subtasking.
Be provided with m task t j, 1≤j≤m.For task t j, define its ability need vector and be:
M j=diag{β j1,β j2,…,β jk}·[c 1,c 2,…,c k] T (2)
β JkThe correspondence t that finishes the work jWhether need ability c k, if finish the work t jNeed ability c k, β Jk=1, do not need this ability, then β if finish the work Jk=0.
3) capabilities match parameter K Ij
Match parameter K IjBe the ability whether the expression i of robot is fit to carry out a certain task j, set up for realizing the 1st principle.
Whether robot is fit to carry out a certain task, disposes vectorial C with robot capability iAnd the ability need vector M of subtask jRelevant, if C i〉=M j, the r of robot iBe fit to subtasking j; Otherwise, the r of robot iTo be not suitable for subtasking j.If K IjBe the capabilities match parameter, its expression formula is:
K ij = 1 if C i &GreaterEqual; M j 0 if C i < M j - - - ( 3 )
4) the horizontal parameter L of robot executive capability Ij
This parameter is a variable, sets up for realizing the 2nd principle, and its span is between 0-1, and the ability of robot and the ability need of subtask are approaching more, then L IjBig more.Its expression formula is:
L ij = 0 C i < M j M j C i C i &GreaterEqual; M j - - - ( 4 )
5) probability variable p is selected in the subtask Ij
This parameter is set up for realizing the 3rd, 4 principle.Its expression formula is:
p ij = ( &tau; j ) &alpha; &eta; ij &beta; &Sigma; j ( &tau; j ) &alpha; &eta; ij &beta; - - - ( 5 )
Utilize the horizontal parameter L of robot executive capability IjTo p IjHandle:
p′ ij=(1-ω)·p ij+ω·L ij (6)
6) the quantity upper limit N of the required robot in subtask j, this parameter is a constant, its value is according to the needs decision of subtask.
7) the quantity A of robot of current subtasking j, this parameter is a variable
8) the quantity upper limit sign R of the required robot in subtask j, its expression formula is:
R j = 0 , A j = N j 1 , A j < N j - - - ( 7 )
9) subtask complement mark F j
10) switching variable task Ij
task ij=F j·R j·s i·K ij (9)
Wherein, s iThe state of the expression i of robot, its expression formula is:
Figure G2009101044203D00075
Utilize task IjTo p ' IjHandle, select probability variable to be write as again the subtask:
p ij=p′ ij·task ij (11)
Probability variable p selects by the subtask in robot IjThe chooser task, if the subtask remains unfulfilled,, press following formula:
τ j=τ+Δτ>0 (12)
Upgrade the pheromone concentration of subtask, assist to obtain more robot.
Robot satisfies the functional requirement of subtask, and the robot quantity upper limit of subtask does not reach again, and the state of robot is free time, then task Ij=1, switch opens, robot can the chooser task; Otherwise switch cuts out, and robot can not the chooser task.
Referring to Fig. 1, the method for allocating tasks of the heterogeneous multi-robot system of present embodiment comprises the steps:
S1: initialization robot and subtask parameter comprise that device people's ability disposes vectorial C i, the subtask the ability need vector M j, the capabilities match parameter K Ij, the horizontal parameter L of robot executive capability Ij, the quantity upper limit N of the required robot in subtask jThe quantity A of robot with current subtasking j
S2: robot selects oneself to be good at, self-ability with the subtask ability need is approaching, from own near, subtask execution that information concentration is high; The i of robot specifically carries out following steps;
S21: upgrade oneself state s i, check the ability configuration of self;
S22: the state and the ability configuration of obtaining the other machines people;
S23: the pheromone concentration that obtains all subtasks;
S24: the selection probability that calculates the subtask; Specifically comprise the steps:
S241: compute switch variable task Ij,
task ij=F j·R j·s i·K ij
Wherein, F jBe subtask complement mark, s iThe state of the expression i of robot, K IjBe the i of robot capabilities match parameter, R jBe the quantity upper limit sign of the required robot of subtask j, its expression formula is:
R j = 0 , A j = N j 1 , A j < N j ;
S242: according to the switching variable task of step S21 gained Ij, calculate the selection probability of subtask j by following formula:
p ij=p′ ij·task ij
p &prime; ij = ( &tau; j ) &alpha; &eta; ij &beta; &Sigma; j ( &tau; j ) &alpha; &eta; ij &beta; &CenterDot; ( 1 - &omega; ) + &omega; &CenterDot; L ij ; (ω is the constant between 0 to 1)
In the formula, τ jBe the pheromones on the j of subtask, η IjBe the inverse of distance between i of robot and the subtask j, L IjFor the i of robot to the horizontal parameter of subtask j executive capability.
S25: select the highest subtask of probability to carry out;
S3: judge whether subtask j finishes, as not, the plain τ of lastest imformation then j, and redirect execution in step S2; In this way, execution in step S4 then;
S4: with robotary s iWith pheromones τ jMake zero.
Referring to Fig. 2 to 11, be that example is tested with the method for present embodiment with the background that clears land mines, establishing working space is 10 meters * 10 meters, among the figure, counterclockwise to the upper left corner, what occur successively is robot, r by the lower left corner 1, r 2, r 3, r 4The value of each subtask parameter: t 1: M 1=1, N 1=2, T 1=1; t 2: M 2=2, N 2=5, T 2=4; t 3: M 3=1, N 3=3, T 3=3.
The parameter value of each robot: r 1: C 1=2, I 1=1.5; r 2: C 2=2, I 1=1.5; r 3: C 3=1, I 1=1.5; r 4: C 4=3, I 1=1.5.Adopt " blackboard " mode to communicate between the robot, α=1, β=1, initial time, the pheromones on each subtask is: τ=1.
Initial time, r 1, r 2, r 4Search task t 1, t 2, t 3, advance to impact point with the speed of 1m/s and to execute the task.As shown in Figure 3;
The t1 moment: r 4T executes the task after the arrival task 3, to attempt independently finishing the work, the discovery task can not independently be finished by it, increases task t 3Pheromones τ 3, attract the other machines people to cooperate to execute the task, as shown in Figure 4.
T2 is in the r of idle condition constantly 3Be subjected to task t 3On the attraction of pheromones, r 3To t 3Direction walking precedingly removes to assist r 4Carry out t 3, as shown in Figure 5.
The t3 moment: r 1Arrive the t that executes the task of task place behind the cut-through thing 1, attempt independently finishing the work t 1, r 1T can accomplish a task all by oneself 1, after finishing the work, r 1Be in idle condition, r 1At task t 1The place continues to search for other task, as shown in Figure 6.
The t4 moment: r 2Arrive t 2, attempt independently finishing the work, can not independently finish, increase pheromones τ 2, attract the other machines people who is in idle condition to assist, as shown in Figure 7.
T5 is in the r of robot of idle condition constantly 1Be subjected to " attraction ", assist r 2Carry out t 2, as shown in Figure 8.
The t6 moment: r 3Arrival task T3 is with r 4Cooperate together to execute the task t 2The task complexity be that t is finished in 3, two robot cooperations 2, with task t 2Telergone τ 2Zero clearing, r 3, r 4Be in idle condition, as shown in Figure 9.
The t7 moment: r 1Arrive t 2, r 2, r 1Attempt cooperation and finish the work, task still can not be done, so continue to increase t 2Pheromones τ 2, attract the other machines people who is in idle condition to assist, as shown in figure 10.
T8 is in the r of robot of idle condition constantly 4Be subjected to " attraction ", assist r 2, r 1Carry out t 2, as shown in figure 11.
The t9 moment: r 2, r 1, r 4Three robot cooperations t that finishes the work 2, as shown in figure 12.
From Fig. 3 to 12 as can be seen this this method effectively solved the task assignment problem of heterogeneous multi-robot system.
The above is the preferred embodiments of the present invention only, is not limited to the present invention, and obviously, those skilled in the art can carry out various changes and modification and not break away from the spirit and scope of the present invention the present invention.Like this, if of the present invention these are revised and modification belongs within the scope of claim of the present invention and equivalent technologies thereof, then the present invention also is intended to comprise these changes and modification interior.

Claims (5)

1. the method for allocating tasks of heterogeneous multi-robot system in order to coordinate the execution of heterogeneous multi-robot at least one subtask, comprises the steps:
S1: initialization robot and subtask parameter;
S2: robot selects oneself to be good at, self-ability with the subtask ability need is approaching, from own near, subtask execution that information concentration is high.
2. the method for allocating tasks of heterogeneous multi-robot system as claimed in claim 1, it is characterized in that: among the described step S1, robot and subtask parameter comprise that the ability of robot disposes vectorial C i, the subtask the ability need vector M j, the capabilities match parameter K Ij, the horizontal parameter L of robot executive capability Ij, the quantity upper limit N of the required robot in subtask jThe quantity A of robot with current subtasking j
3. the method for allocating tasks of heterogeneous multi-robot system as claimed in claim 1 or 2, it is characterized in that: among the described step S2, the i of robot specifically carries out following steps;
S21: upgrade oneself state s i, check the ability configuration of self;
S22: the state and the ability configuration of obtaining the other machines people;
S23: the pheromone concentration that obtains all subtasks;
S24: the selection probability that calculates the subtask;
S25: select the highest subtask of probability to carry out;
4. the method for allocating tasks of heterogeneous multi-robot system as claimed in claim 3, it is characterized in that: step S24 specifically comprises the steps:
S241 compute switch variable task Ij,
task ij=F j·R j·s i·K ij
Wherein, F jBe subtask complement mark, s iThe state of the expression i of robot, K IjBe the i of robot capabilities match parameter, R jBe the quantity upper limit sign of the required robot of subtask j, its expression formula is:
R j = 0 , A j = N j 1 , A j < N j ;
S242: according to the switching variable task of step S21 gained Ij, calculate the selection probability of subtask j by following formula:
p ij=p′ ij·task ij
p &prime; ij = ( &tau; j ) &alpha; &eta; ij &beta; &Sigma; j ( &tau; j ) &alpha; &eta; ij &beta; &CenterDot; ( 1 - &omega; ) + &omega; &CenterDot; L ij ;
In the formula, τ jBe the pheromones on the j of subtask, η IjBe the inverse of distance between i of robot and the subtask j, L IjFor the i of robot to the horizontal parameter of subtask j executive capability, ω is the constant between 0 to 1.
5. the method for allocating tasks of heterogeneous multi-robot system as claimed in claim 4 is characterized in that: also comprise the steps: after the step S2
S3: judge whether subtask j finishes, as not, the plain τ of lastest imformation then j, and redirect execution in step S2; In this way, execution in step S4 then;
S4: with robotary s iWith pheromones τ jMake zero.
CN2009101044203A 2009-07-23 2009-07-23 Task allocation method of heterogeneous multi-robot system Expired - Fee Related CN101618543B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN2009101044203A CN101618543B (en) 2009-07-23 2009-07-23 Task allocation method of heterogeneous multi-robot system

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN2009101044203A CN101618543B (en) 2009-07-23 2009-07-23 Task allocation method of heterogeneous multi-robot system

Publications (2)

Publication Number Publication Date
CN101618543A true CN101618543A (en) 2010-01-06
CN101618543B CN101618543B (en) 2011-07-06

Family

ID=41512034

Family Applications (1)

Application Number Title Priority Date Filing Date
CN2009101044203A Expired - Fee Related CN101618543B (en) 2009-07-23 2009-07-23 Task allocation method of heterogeneous multi-robot system

Country Status (1)

Country Link
CN (1) CN101618543B (en)

Cited By (14)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101945492A (en) * 2010-08-09 2011-01-12 哈尔滨工程大学 Clustering-based multi-robot task allocation method
CN102023571A (en) * 2010-09-30 2011-04-20 哈尔滨工程大学 Clustering-based multi-robot task distributing method for use in exploiting tasks
CN105046380A (en) * 2015-09-09 2015-11-11 中国电子科技集团公司第三十八研究所 Radar component intelligent welding task assignment system and assignment method thereof
CN106850695A (en) * 2017-04-07 2017-06-13 国家计算机网络与信息安全管理中心 Strange land isomery virtualized management method, apparatus and system under a kind of cloud computing environment
CN107234616A (en) * 2017-07-07 2017-10-10 上海木爷机器人技术有限公司 Multirobot control method and device
CN107491049A (en) * 2017-08-29 2017-12-19 湖南格兰博智能科技有限责任公司 A kind of more equipment collaboration operational methods and work compound device
US20180085914A1 (en) * 2012-02-07 2018-03-29 X Development Llc Systems and Methods for Allocating Tasks to a Plurality of Robotic Devices
CN107924332A (en) * 2015-07-09 2018-04-17 意大利电信股份公司 The method and system of ICT service provisions
CN109551478A (en) * 2018-11-16 2019-04-02 重庆邮电大学 A kind of dual robot principal and subordinate's control method for coordinating based on Distributed Control System
CN109919431A (en) * 2019-01-28 2019-06-21 重庆邮电大学 Heterogeneous multi-robot method for allocating tasks based on auction algorithm
CN110046795A (en) * 2019-03-01 2019-07-23 斯坦德机器人(深圳)有限公司 The method for allocating tasks and device of robot
CN110515732A (en) * 2019-08-23 2019-11-29 中国人民解放军国防科技大学 A kind of method for allocating tasks based on resource-constrained robot deep learning reasoning
CN110509312A (en) * 2019-08-29 2019-11-29 炬星科技(深圳)有限公司 Robot configures update method, electronic equipment and computer readable storage medium
CN111459163A (en) * 2020-04-07 2020-07-28 三一汽车制造有限公司 Control method and control system for cooperative work of unmanned road roller group

Family Cites Families (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101364110B (en) * 2008-09-28 2010-08-18 重庆邮电大学 Cooperating work control method and system for robot of multiple degree of freedom
CN101382429B (en) * 2008-10-17 2011-06-22 北京航空航天大学 Earth-air special-shaped multi-robot searching and rescuing system

Cited By (23)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101945492A (en) * 2010-08-09 2011-01-12 哈尔滨工程大学 Clustering-based multi-robot task allocation method
CN101945492B (en) * 2010-08-09 2013-02-06 哈尔滨工程大学 Clustering-based multi-robot task allocation method
CN102023571A (en) * 2010-09-30 2011-04-20 哈尔滨工程大学 Clustering-based multi-robot task distributing method for use in exploiting tasks
CN102023571B (en) * 2010-09-30 2012-05-09 哈尔滨工程大学 Clustering-based multi-robot task distributing method for use in exploiting tasks
US10500718B2 (en) * 2012-02-07 2019-12-10 X Development Llc Systems and methods for allocating tasks to a plurality of robotic devices
US20180085914A1 (en) * 2012-02-07 2018-03-29 X Development Llc Systems and Methods for Allocating Tasks to a Plurality of Robotic Devices
CN107924332B (en) * 2015-07-09 2023-06-06 意大利电信股份公司 ICT service supply method and system
CN107924332A (en) * 2015-07-09 2018-04-17 意大利电信股份公司 The method and system of ICT service provisions
CN105046380A (en) * 2015-09-09 2015-11-11 中国电子科技集团公司第三十八研究所 Radar component intelligent welding task assignment system and assignment method thereof
CN106850695A (en) * 2017-04-07 2017-06-13 国家计算机网络与信息安全管理中心 Strange land isomery virtualized management method, apparatus and system under a kind of cloud computing environment
CN107234616B (en) * 2017-07-07 2018-08-14 广州木木机器人技术有限公司 Multirobot control method and device
CN107234616A (en) * 2017-07-07 2017-10-10 上海木爷机器人技术有限公司 Multirobot control method and device
CN107491049A (en) * 2017-08-29 2017-12-19 湖南格兰博智能科技有限责任公司 A kind of more equipment collaboration operational methods and work compound device
CN109551478A (en) * 2018-11-16 2019-04-02 重庆邮电大学 A kind of dual robot principal and subordinate's control method for coordinating based on Distributed Control System
CN109919431A (en) * 2019-01-28 2019-06-21 重庆邮电大学 Heterogeneous multi-robot method for allocating tasks based on auction algorithm
CN109919431B (en) * 2019-01-28 2023-04-07 重庆邮电大学 Heterogeneous multi-robot task allocation method based on auction algorithm
CN110046795A (en) * 2019-03-01 2019-07-23 斯坦德机器人(深圳)有限公司 The method for allocating tasks and device of robot
CN110046795B (en) * 2019-03-01 2021-11-05 斯坦德机器人(深圳)有限公司 Task allocation method and device for robot
CN110515732A (en) * 2019-08-23 2019-11-29 中国人民解放军国防科技大学 A kind of method for allocating tasks based on resource-constrained robot deep learning reasoning
CN110515732B (en) * 2019-08-23 2021-06-18 中国人民解放军国防科技大学 Task allocation method based on deep learning inference of resource-constrained robot
CN110509312A (en) * 2019-08-29 2019-11-29 炬星科技(深圳)有限公司 Robot configures update method, electronic equipment and computer readable storage medium
CN110509312B (en) * 2019-08-29 2021-03-26 炬星科技(深圳)有限公司 Robot configuration updating method, electronic device and computer-readable storage medium
CN111459163A (en) * 2020-04-07 2020-07-28 三一汽车制造有限公司 Control method and control system for cooperative work of unmanned road roller group

Also Published As

Publication number Publication date
CN101618543B (en) 2011-07-06

Similar Documents

Publication Publication Date Title
CN101618543B (en) Task allocation method of heterogeneous multi-robot system
CN101127657B (en) Dynamic modeling and control technology for independent mobile sensor network
CN105045094B (en) The task search and task executing method of multirobot group
CN110083166A (en) For the coordinated dispatching method of multirobot, device, equipment and medium
CN106529776B (en) The autonomous cotasking distribution method of multiple agent
CN103383569B (en) Mobile robot optimum circuit route footpath based on linear time temporal logic establishing method
CN108036790A (en) Robot path planning method and system based on mutillid algorithm under a kind of obstacle environment
CN109108963A (en) Based on differential evolution particle swarm algorithm space articulated robot paths planning method
CN107632614A (en) A kind of multiple no-manned plane formation self-organizing cooperative control method theoretical based on rigidity figure
CN102169347A (en) Multi-robot path planning system based on cooperative co-evolution and multi-population genetic algorithm
Henchiri et al. Particle swarm optimization combined with tabu search in a multi-agent model for flexible job shop problem
CN105652833A (en) Bi-directional intelligent search-based manufacturing enterprise shop scheduling optimization method
CN102566431A (en) Method for dispatching and controlling fuzzy parameter operation workshop under dynamic disturbance based on improved genetic algorithm
CN101188025A (en) A high-efficiency real time group animation frame
CN110045738A (en) Robot path planning method based on ant group algorithm and Maklink figure
CN102982389A (en) Method for solving combination and optimization problems using ant colony optimization technology based on Map Reduce
Aliyu et al. Efficient metaheuristic population-based and deterministic algorithm for resource provisioning using ant colony optimization and spanning tree
CN101477475A (en) Method for optimizing dynamic grid work flow by employing ant colony algorithm
Sujit et al. Multiple UAV coalition formation
Zheng et al. Improving sequential single-item auctions
Xu et al. Resource-aware distributed submodular maximization: A paradigm for multi-robot decision-making
Hao et al. An adaptive parameter control strategy for ACO
Yuan-hui et al. Research on optimal planning method of USV for complex obstacles
Juntao et al. Study on robot path collision avoidance planning based on the improved ant colony algorithm
Li et al. Three-phase qubits-based quantum ant colony optimization algorithm for path planning of automated guided vehicles

Legal Events

Date Code Title Description
C06 Publication
PB01 Publication
C10 Entry into substantive examination
SE01 Entry into force of request for substantive examination
C14 Grant of patent or utility model
GR01 Patent grant
CF01 Termination of patent right due to non-payment of annual fee

Granted publication date: 20110706

Termination date: 20140723

EXPY Termination of patent right or utility model