CN106875090A - A kind of multirobot distributed task scheduling towards dynamic task distributes forming method - Google Patents
A kind of multirobot distributed task scheduling towards dynamic task distributes forming method Download PDFInfo
- Publication number
- CN106875090A CN106875090A CN201710015070.8A CN201710015070A CN106875090A CN 106875090 A CN106875090 A CN 106875090A CN 201710015070 A CN201710015070 A CN 201710015070A CN 106875090 A CN106875090 A CN 106875090A
- Authority
- CN
- China
- Prior art keywords
- task
- robot
- auction
- point
- task point
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
Links
- 238000000034 method Methods 0.000 title claims abstract description 30
- 238000004422 calculation algorithm Methods 0.000 claims abstract description 53
- 230000007613 environmental effect Effects 0.000 claims abstract description 17
- 238000004458 analytical method Methods 0.000 claims abstract description 4
- 238000004891 communication Methods 0.000 claims description 21
- 230000004888 barrier function Effects 0.000 claims description 11
- 230000008859 change Effects 0.000 claims description 11
- 230000008901 benefit Effects 0.000 claims description 7
- 230000009286 beneficial effect Effects 0.000 claims description 2
- 241000208340 Araliaceae Species 0.000 claims 1
- 235000005035 Panax pseudoginseng ssp. pseudoginseng Nutrition 0.000 claims 1
- 235000003140 Panax quinquefolius Nutrition 0.000 claims 1
- 235000008434 ginseng Nutrition 0.000 claims 1
- PCHJSUWPFVWCPO-UHFFFAOYSA-N gold Chemical compound [Au] PCHJSUWPFVWCPO-UHFFFAOYSA-N 0.000 claims 1
- 239000010931 gold Substances 0.000 claims 1
- 229910052737 gold Inorganic materials 0.000 claims 1
- 238000012360 testing method Methods 0.000 abstract description 10
- 238000004088 simulation Methods 0.000 abstract description 3
- 238000010586 diagram Methods 0.000 description 7
- 230000006872 improvement Effects 0.000 description 6
- 238000013461 design Methods 0.000 description 3
- 238000010845 search algorithm Methods 0.000 description 3
- 230000000694 effects Effects 0.000 description 2
- 230000002265 prevention Effects 0.000 description 2
- 230000008569 process Effects 0.000 description 2
- 230000003068 static effect Effects 0.000 description 2
- 241001269238 Data Species 0.000 description 1
- 238000013473 artificial intelligence Methods 0.000 description 1
- 238000004364 calculation method Methods 0.000 description 1
- 230000007547 defect Effects 0.000 description 1
- 238000001514 detection method Methods 0.000 description 1
- 238000005516 engineering process Methods 0.000 description 1
- 238000011156 evaluation Methods 0.000 description 1
- 230000003631 expected effect Effects 0.000 description 1
- 238000001727 in vivo Methods 0.000 description 1
- 238000004519 manufacturing process Methods 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
- 238000012544 monitoring process Methods 0.000 description 1
- 238000011160 research Methods 0.000 description 1
- 230000000630 rising effect Effects 0.000 description 1
- 238000006467 substitution reaction Methods 0.000 description 1
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q10/00—Administration; Management
- G06Q10/06—Resources, workflows, human or project management; Enterprise or organisation planning; Enterprise or organisation modelling
- G06Q10/063—Operations research, analysis or management
- G06Q10/0631—Resource planning, allocation, distributing or scheduling for enterprises or organisations
-
- G—PHYSICS
- G05—CONTROLLING; REGULATING
- G05D—SYSTEMS FOR CONTROLLING OR REGULATING NON-ELECTRIC VARIABLES
- G05D1/00—Control of position, course, altitude or attitude of land, water, air or space vehicles, e.g. using automatic pilots
- G05D1/02—Control of position or course in two dimensions
- G05D1/021—Control of position or course in two dimensions specially adapted to land vehicles
- G05D1/0287—Control of position or course in two dimensions specially adapted to land vehicles involving a plurality of land vehicles, e.g. fleet or convoy travelling
- G05D1/0289—Control of position or course in two dimensions specially adapted to land vehicles involving a plurality of land vehicles, e.g. fleet or convoy travelling with means for avoiding collisions between vehicles
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q10/00—Administration; Management
- G06Q10/04—Forecasting or optimisation specially adapted for administrative or management purposes, e.g. linear programming or "cutting stock problem"
- G06Q10/047—Optimisation of routes or paths, e.g. travelling salesman problem
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q10/00—Administration; Management
- G06Q10/06—Resources, workflows, human or project management; Enterprise or organisation planning; Enterprise or organisation modelling
- G06Q10/063—Operations research, analysis or management
- G06Q10/0631—Resource planning, allocation, distributing or scheduling for enterprises or organisations
- G06Q10/06312—Adjustment or analysis of established resource schedule, e.g. resource or task levelling, or dynamic rescheduling
Landscapes
- Business, Economics & Management (AREA)
- Human Resources & Organizations (AREA)
- Engineering & Computer Science (AREA)
- Strategic Management (AREA)
- Economics (AREA)
- Entrepreneurship & Innovation (AREA)
- General Physics & Mathematics (AREA)
- Physics & Mathematics (AREA)
- General Business, Economics & Management (AREA)
- Tourism & Hospitality (AREA)
- Theoretical Computer Science (AREA)
- Marketing (AREA)
- Quality & Reliability (AREA)
- Game Theory and Decision Science (AREA)
- Development Economics (AREA)
- Operations Research (AREA)
- Radar, Positioning & Navigation (AREA)
- Remote Sensing (AREA)
- Educational Administration (AREA)
- Automation & Control Theory (AREA)
- Aviation & Aerospace Engineering (AREA)
- Feedback Control In General (AREA)
- Manipulator (AREA)
Abstract
The present invention provides a kind of multirobot distributed task scheduling towards dynamic task and distributes forming method, and the method includes：Changed according to task dotted state in environmental map, analysis task distribution needs the factor and difficult point for considering, when task point occurs, based on multistage auction algorithm, generate task allocative decision, robot performs task according to the task allocative decision.The present invention solves the problems, such as dynamic task allocation in environment, traditional auction algorithm using primary distribution solve given task, there is significant limitations in face of dynamic task.The present invention passes through times bidding, for the purpose of time optimal, farthest using the resource of robot, the above method is emulated on VC++ and Csharp platforms, shown by substantial amounts of experiment simulation test result, the more traditional auction algorithm of improved auction algorithm more can be good at solving the dynamic task in environment, the demand of real-time be met by repeated dispensing, and can provide close optimal solution.
Description
Technical field
The present invention relates to intelligent robot auction algorithm technical field, more particularly, to a kind of towards dynamic task
Multirobot distributed task scheduling distributes forming method.
Background technology
As people go deep into artificial intelligence and complication system understanding, robot system is in building, military affairs, fire-fighting, work
There is good application prospect in the fields such as industry production.And task quantity is big in current multi-robot system, task point includes information
Complexity, the robot of participation is numerous, and the calculation cost of full search algorithm is presented exponential increase, and this causes full search algorithm very
The difficult optimal solution that Task Allocation Problem is searched out within the time of regulation.Therefore, full search algorithm and inapplicable extensive many
The solution of intelligent body dynamic task allocation problem.Task distribution must meet the requirement of real-time in large scale system, it is intended to
Obtain the solution of " good " within the time of regulation, and the solution for obtaining not necessarily optimal solution.Therefore for the multimachine of time-constrain
Device people's dynamic task allocation Study on Problems is significant.
Current task distribution much uses auction algorithm, and traditional auction algorithm oriented mission is static, is used
Auction algorithm.But there is very big defect more and in the case of dynamic change in face of task point quantity, it is impossible to carry out more
Secondary scheduling, it is impossible to the need for meeting real-time, more cannot get preferable effect.
The content of the invention
The present invention provide it is a kind of overcome above mentioned problem or solve the above problems at least in part towards dynamic task
Multirobot distributed task scheduling distributes forming method, and the method is based on improved auction algorithm, and combines A-star algorithms road
Footpath optimizing, multiple dynamic tasks in environment are solved the problems, such as by cooperative cooperating between robot.
In order to achieve the above object, the present invention provides a kind of multirobot distributed task scheduling towards dynamic task and distributes shape
Into method, the method includes：
S1：According to information in environmental map, factor and difficult point that Task Allocation Problem needs to consider are cleared；
S2：When task occurs, based on multistage auction algorithm, task allocative decision is generated, robot is according to the task
Allocative decision performs task.
Further, in the step S1, including：
S11：A target environment map is given, multiple machines with Mission Capability are distributed with the map
Task point and several barriers that people, attribute are changed over time；
S12：According to the state change of task point, factor and difficult point that task distribution needs to consider are cleared
Further, in the step S11, described environment is robot working environment, and the environmental map to giving is set up
Rectangular coordinate system, with x-axis to the right as positive direction, y-axis is upwards positive direction to coordinate system, and the working environment is divided into multiple grid
Lattice, environmental map is spatially distributed with N (N ∈ Z+) individual task point, M (M ∈ Z+) individual robot and B (B ∈ Z+) individual obstacle
Thing, and the coordinate of robot, task and barrier is determined respectively.
Wherein, task letter j represents that wherein j=1,2 ..., N, task are similar to a point on map.Robot
Represented with alphabetical i, wherein i=1,2 ..., M.Barrier letter b represents, wherein b=1,2 ..., B.
Coordinate of the task point on map beWherein j=1,2 ..., N；Coordinate of the robot on map beWherein i=1,2 ... M；Coordinate of the barrier on map beWherein k=1,2 ..., B.
The distance between task point and robot formula is：
It is assumed that task point j coordinates are respectively with task point j' coordinatesThen distance is public between the two
Formula is：
Further, in the step S12, task dotted state amount is presented exponential function form and changes with the time, task point j (j
=1,2 ..., N) quantity of state at (t+1) moment is expressed as with equation：
In formula：
Sj(t+1), Sj(t):Task j (j=1,2 ..., N) respectively in (t+1) and the task dotted state amount in t stages；
αj:J-th status variation rate of task point；
βi:The executive capability and β of robot ii＞ 0；
Δt:Time difference between t and (t+1)；
ε:Task amount threshold value, setting task amount threshold epsilon judges whether task completes, and works as sjDuring (t) ＜ ε, task has been represented
Complete.
This is a distributed dynamic task allocation problem of task status.The state change of task point is continuous index
Functional form (formula three).Its task amount is Annual distribution, and by how many robot, the task is performed, (intelligent body is held for it
Row ability summation) influence.
The deadline of task point j (j=1,2 ..., N) is inversely proportional with task point j executive capability sums are acted on.When t ranks
The m robot executive capability of section performance objective task j withWhen, show that the m robot cannot complete the task
Point, sjT () is presented the trend for rising；WhenWhen, show that m robot can complete the task point, sjT () is in now
The trend of drop.
Further, in the step S12, the factor that system task distribution needs consider includes task point property parameters and machine
The humanized parameter of device.
The property parameters of task point j (j=1,2 ... N) include：Task amount (i.e. state value) S of task pointjT (), represents t
The task amount of moment task point, wherein j=1,2 ..., N represent the primary quantity S of task point as t=0j(0)；Task point changes
Rate αj；Task point j is spatial distribution, task point j locations on environmental map
The property parameters of robot i (i=1,2 ..., M) include：Movement velocity vi, represent robot i within the unit interval
The path length walked；Robot capability value βi；Robot location on environmental map
With the increase of goal task point and robot quantity, the difficulty of Task Allocation Problem quickly increases, and each target is appointed
Cost, executive capability when significance level, status variation rate and each intelligent body that business is put perform task etc. are all to need to examine
The factor of worry.
It is assumed that going to the robot of j-th task point that other task points are not removed before next stage schemes generation, it is right
In given M (M ∈ Z+) individual robot, N (N ∈ Z+) individual task point, times bidding is carried out to task point and is hadPlant distribution
Scheme, its complexity is
In the step S2, further include：
S21：When detecting task, the nearest robot of chosen distance task point is used as broker machines people；If apart from several
The artificial same robot i (i=1,2 ..., M) of the nearest machine of task point, system can select chosen distance in several task points
The robot i of the nearest task point of rectangular coordinate system origin is its broker machines people；
S22：Broker machines people issue auction information waits to be feedback to the auction robot in communication radius；
S23：The auction robot for receiving auction information selects income highest task to click through according to self benefits function
Row is submitted a tender；
S24：Broker machines people collects bid information, target machine in target robot in being selected with pre-defined rule, and notice
Device people performs task；
S25：Not middle target auction robot performs nearest task point with the Robot Selection for being in communication blind zone.
Further, in the step S2, when detect completed task point and aimless idle machine people when, can be to sky
Not busy robot is auctioned again so that idle machine people regains new task point, so as to draw new allocative decision, directly
After all of task point has been performed into environment, stop auction.
The object-oriented task of the present invention is that, with time dynamic, task point is also distribution on the time point being done
, i.e., task point is inconsistent on the time being performed.
If continuing to use traditional auction algorithm flow, after allocative decision is generated, dynamic object is performed according to the program always
Task, then be difficult to adapt to the dynamic change and requirement of real-time of goal task.
The state change of the auction algorithm meeting real-time tracking task point after improvement, once in the presence of task point has been completed, can deposit
In aimless robot, algorithm can be redistributed to them, so as to draw new allocative decision, by times bidding
Realize, with time optimal to be oriented to, farthest using the resource of robot, realize the mesh of staged design allocative decision
Mark, to adapt to the change of dynamic task.
Further, in the step S22, broker machines people is responsible for issue auction information to the auction machine in communication radius
People, waits to be feedback；The broker machines people of each task point j (j=1,2 ..., N) grasps the relevant auction information of task point j,
The message includes：Suitable machine required for task point j positions, the rate of change of task point j, task point j quantity of states and task point j
Device people's quantity s.The quantity of state of task point is presented exponential function form with the time to be changed.
Suitable machine number s required for task point jjIt is defined as：It is assumed that there is w robot causing
AndRobot optimal number s values are required for task point j：
w≤sj≤ w+2 (formula four)
Robot i (i=1,2 ..., M) there is corresponding communication radius ri(the communication radius of robot can be set to difference
Value), broker machines people is responsible for issue auction information to the auction robot in communication radius.
Further, in the step S23, the auction machine that the individual broker machines people of z (0≤z≤N) issue auction information is received
Device people weighs to these information, and balance standard is：Auction robot is carried out to this z broker machines people issue auction information
Analysis, the present invention is improved traditional auction algorithm, has introduced dynamic economy benefit function, and robot i is calculated and performed
Financial value E after complete certain task point jij(EijIt is real number), and select income highest task point to be submitted a tender.Used is dynamic
State revenue function its be：
Eij=g (k1, Sj(t),αj,βi,n)-h(k2,dij) (formula five)
In formula：
g:Robot i is performed after task point j terminates and acquired an advantage, and is exponential function；
h:Robot i performs the cost of task point j consumption；
K1, k2:Changeable weight parameter, can be set to its corresponding value under different bad borders；
dij:Path length between robot i and task point j；
In above formula, k1 and SjT the product of () is the proportionality coefficient of exponential function, αj,βi, relational expression between n threeIndex in Composition index function, n represent be carrying out task point j robot quantity (in t=0, task point
Performed without robot, now n is for 0)；
H is dijFunction, given parameters k2, then the value of h is by dijDetermine.
There is corresponding executive capability value β in each robot of environmental map for givingi(i=1,2 ..., M), the machine
The ability value of device people i is constant, and the executive capability value between robot can be set to difference.
Further, in the step S24, after broker machines people receives the bid information of auction robot, its information is analyzed,
According to the target that overall efficiency is maximum, target auction robot in selection, and notify the auction robot result of all bids.
Further, in the step S25, the robot of communication blind zone is (due to communication radius in environmental map in map
Limitation there may be do not receive broker machines people issue auction information robot) and not middle target auction robot voluntarily go
Perform the task point away from its nearest neighbours.
Further, in the step S24, broker machines people can be according to target auction robot, tool in pre-defined rule selection
Hold in vivo and be：
The broker machines people of task point j receives njIndividual auction robot bidding message, if nj＞ sj, then it is big according to income
Small sequence, selects (s in the topj- 1) individual auction robot is used as middle scalar robot, and notifies the auction machine of all bids
Device people, if nj＜ sj, then njThe individual all middle scalar robots of auction robot.
Further, in the step S24, robot carries out optimizing by A-star algorithms during traveling to path,
Collision avoidance reasonably can be carried out with other robot collision prevention and with barrier, and search out robot to reach corresponding task point most
Excellent nothing touches path.
Generation task allocative decision, robot starts performance objective task point according to the scheme of distribution, and robot is going to
Position where in real time showing oneself in goal task stroke, while carrying out optimal nothing by A-star algorithms touches path
Search.
In the search procedure of A-star algorithms, using by a cost function come the side of search extension space nodes
Method, the general type of cost function is：
F (i)=g (i)+h (i) (formula six)
In formula:
f(i):Evaluation function of the node i from start node to destination node；
g(i):Actual cost in state space from start node to node i；
h(i):From node i to the estimate cost of destination node optimal path.
The element of searching that optimal nothing touches path is carried out by A-star algorithms, robot run into barrier can reasonably avoid and
Robot will not run into during traveling, and A-star is a kind of effective ways for solving shortest path, improves path planning
Real-time, environmental suitability efficiency.
Following rule is observed in whole implementation procedure by robot：
A) the optimal machine number required for task point j is sj；
B) going to the robot of j-th task point that other task points are not removed before next stage schemes generation；
C) robot will not remove the task point having had been carried out；
D) broker machines people can be according to target auction robot in the rule selection formulated in advance；
E) robot of not middle target auction robot or communication blind zone (does not receive broker machines human hair in communication radius
The robot of the auction information for going out) itself nearest task point can be performed；
F) broker machines people performs the task point of itself agency.
By above-mentioned technical proposal, the present invention ultimately produces carrying into execution a plan for complete set, and obtains all task point quilts
Time required for completing.Time needed for completing all task points is the time that last has been performed task point.
Based on above-mentioned technical proposal, the present invention proposes a kind of multistage auction algorithm towards dynamic task, solves
Dynamic task allocation problem in environment, traditional auction algorithm using primary distribution solve given task, in face of dynamic
There is significant limitations in state task, do not reach expected effect.By the realization of times bidding, for the purpose of time optimal, most
The resource of the utilization robot of big degree, the above method is emulated on VC++ and Csharp platforms, by substantial amounts of reality
Test the simulation results to show, the more traditional auction algorithm of improved auction algorithm more can be good at solving the dynamic in environment
Task, the demand of real-time is met by repeated dispensing, and can provide close optimal solution.
Brief description of the drawings
Fig. 1 is the environmental model figure according to the embodiment of the present invention.
Fig. 2 is the multistage auction algorithm flow chart according to the embodiment of the present invention.
Fig. 3 is the broker machines people's workflow diagram according to the embodiment of the present invention.
Fig. 4 is the auction robot workflow diagram according to the embodiment of the present invention.
Fig. 5 is traditional auction algorithm (single phase auction algorithm) analogous diagram according to the embodiment of the present invention.
Fig. 6 is improvement auction algorithm (multistage auction algorithm) analogous diagram according to the embodiment of the present invention.
Fig. 7 is the multistage auction algorithm and single phase auction algorithm elapsed time comparison diagram according to the embodiment of the present invention.
Specific embodiment
With reference to the accompanying drawings and examples, specific embodiment of the invention is described in further detail.Hereinafter implement
Example is not limited to the scope of the present invention for illustrating the present invention.
The present invention provides a kind of based on improved auction algorithm, and combines A-star algorithm optimum path searches, by machine
Cooperative cooperating solves the problems, such as multiple dynamic tasks in environment between people.
Multistage auction algorithm is improved on the basis of traditional auction algorithm, increases corresponding rule and dynamic is received
Beneficial function.Traditional auction algorithm is applied to the assignment problem for solving static object task, and by benefit and cost parameter point
Not Heng Liang goal task value and robot Executing Cost, design object task is to the auction algorithm of each robot, generation distribution
Scheme, whole system is only once auctioned.
Robot cooperative cooperating is presented as：When robot detects the generation of task point, broker machines people is auctioned by issuing
Information gives auction robot, and auction robot is weighed according to the information of receiving, and is submitted a tender；Broker machines people is according to feedback
Information with the prior rule selection allocative decision formulated, the information that robot can will be appreciated by the process of the task of execution sends
To the communication radius inner machine people of itself, resource-sharing is realized, once after the completion of having task point, idle robot can be by weight
New auction obtains goal task point, goes to assist other robots to perform task point, until all task points are completed.
According in one embodiment of the application, as shown in figure 1, environmental model figure of the present invention, comprises the following steps：
First, rectangular coordinate system is set up to target map, and target map is divided into the map block of multiple equidimensions, each
Map block length and width are equal.
Secondly, in embodiments of the present invention, given target map length and width are all 300 units, then contain ground in map
Segment number 89401.
Can be with specific setting M (M ∈ Z in given environmental map+) individual robot, N (N ∈ Z+) individual task point and B (B
∈Z+) individual barrier.
Distance (formula one) between distance (formula two) and task point and robot between calculating and store tasks point.
Ultimate analysis goal in research of the invention：For robot of the multiple with certain task executive capability, give many
The task that individual attribute is changed over time, sets up the dynamic task allocation strategy of multirobot, optimizes the deadline of all tasks,
Can be weighed with the deadline of last task.
When m (0≤m≤M) individual robot acts on task point j (j=1,2 ..., N), appoint at (t+1) (t >=0) moment
The task status amount formula of business point j is：
As shown in Fig. 2 the multistage auction algorithm flow chart that the present invention is used, details are as follows：
In S201, Detection task first determines the broker machines people of each task point when occurring, and task point j selection principles are
The robot nearest apart from task point j is used as broker machines people.
With reference to shown in Fig. 3, details are as follows for the workflow of broker machines people：
After the message of monitoring system is received, the robot i nearest apart from task point j (j=1,2 ..., N) (i=1,
2 ..., M) be the task point broker machines people.Robot i understands the task specifying information of task point j and it is carried out first
Arrange：Robot optimal number s required for mainly calculating completion task j, obtain task point rate of change αj, task point appoint
Geographical position residing for business quantity of state, task point etc..Then auction information is sent to the auction robot in communication radius, is waited
Feedback.The auction robot for receiving auction information selects income highest task point to be submitted a tender according to self benefits function,
Broker machines people is up to target auction robot in target selection with overall efficiency, and notifies the auction machine of all bids
People.If the quantity n of middle scalar robot reaches the condition of n ＞ s, selection income s robot in the top, machine of not getting the bid
People can reselect closest task point.
In S203, auction robot workflow refers to Fig. 4, and details are as follows：
It is not chosen as broker machines people and is then automatically converted to auction robot, the issue auction letters of broker machines people i first
Cease to the auction robot in communication radius, wait to be feedback.The auction robot of auction information is received according to self benefits letter
Number selection income highest task point is submitted a tender, and broker machines people collects bid information, and is up to system overall efficiency
Target auction robot in target selection.If auction robot successfully gets the bid, start execution task, if failing acceptance of the bid
Robot Selection go to perform nearest task point.If there is task point to be done, idle machine is redistributed according to present case
Device people, until task is completed.
Generation allocative decision, starts execution task, and robot carries out optimizing by A-Star algorithms in traveling to path,
Collision avoidance reasonably can be carried out with other robot collision prevention and with barrier, and search out robot to reach corresponding task point
Optimal nothing touches path.
Once in the presence of task point has been completed, can there is aimless idle machine people, system can be again clapped them
Sell, so as to draw new allocative decision, until all of task point is completed in environment.
Robot cooperated execution task test.
The method of the auction algorithm (multistage auction algorithm) of the improvements mentioned above, there is M robot, N number of task point
And B barrier.Under the constraints of (m is the robot quantity of execution task point j).In order to test
The auction algorithm for using is performing the improvement of dynamic task, is tested using the map of a width of 300 grids of length, contrasts single-order
The effect of section auction algorithm and multistage auction algorithm.
Fig. 5 and Fig. 6 are test case, wherein thick black small circle is broker machines people, robot 3 is the machine of communication blind zone
Device people, it is specific as follows：
Fig. 5 is certain test single phase auction algorithm analogous diagram, and robot 2,4 and 5 is respectively the generation of task point 2,3 and 1
Reason robot, the auction information of broker machines people issue correspondence task point is to the auction robot in communication radius；By the first run
Auction, auction robot 1,6 and 7 is successfully got the bid, and task point 2,3 and 1 is performed respectively.Robot 3 is the robot of communication blind zone
(not in broker machines people communication radius, it is impossible to receive the auction information of broker machines people issue) selection performs distance most
Near task point 1, robot starts performance objective task point after generation task allocative decision, is no longer clapped in implementation procedure
Sell, once there is task point to be performed, idle robot does not assist other robot to go to perform unfinished task point.
Fig. 6 is certain test multistage auction algorithm analogous diagram of identical, and the method for its first sub-distribution and single phase auction
Algorithm distribution method is identical, and multistage auction algorithm feature is to have completed task point once existing, and can there is aimless machine
Device people, algorithm can be redistributed to them, and task point 1 has first been performed in figure, and algorithm divides robot 3,5 and 7 again
Match somebody with somebody, the robot of free time is not wasted, by times bidding, farthest using the resource of robot, realize staged design
The target of allocative decision.
In order to verify the efficiency of the improvement auction algorithm, 8 groups of test datas are have chosen, communication radius is set as 200 lists
Position, k1=1, k2=0.0025；Statistics is as shown in table 1.
Table 1 is testing time statistical form
Simulation result above is depicted as broken line graph, as shown in fig. 7, carrying out comparing result, is introduced towards dynamic task
After corresponding rule and dynamic income function, the whole structure that robot performs dynamic task is greatly improved, by imitative
True test, it was demonstrated that use improved multistage auction algorithm validity towards dynamic task robot.
Finally, the present processes are only preferably embodiment, are not intended to limit the scope of the present invention.It is all
Within the spirit and principles in the present invention, any modification, equivalent substitution and improvements made etc. should be included in protection of the invention
Within the scope of.
Claims (10)
1. a kind of multirobot distributed task scheduling towards dynamic task distributes forming method, it is characterised in that including：
S1：According to information in environmental map, factor and difficult point that task distribution needs to consider are cleared；
S2：When task occurs, based on multistage auction algorithm, task allocative decision is generated, robot is distributed according to the task
Scheme performs task.
2. method according to claim 1, it is characterised in that in the step S1, further include：
S11：A target environment map is given, multiple robots with Mission Capability, category are distributed with the map
Property the task point that changes over time and several barriers；
S12：According to the state change of task point, factor and refractory gold ores that task distribution needs to consider are cleared.
3. method according to claim 2, it is characterised in that in the step S11, described environment is robot work
Environment, the environmental map to giving sets up rectangular coordinate system, and with x-axis to the right as positive direction, y-axis is upwards positive direction to coordinate system,
And the working environment is divided into multiple grids, environmental map is spatially distributed with N (N ∈ Z+) individual task point, M (M ∈ Z+) individual
Robot and B (B ∈ Z+) individual barrier, and the coordinate of each task, robot and barrier is determined respectively.
4. method according to claim 2, it is characterised in that in the step S12, according to the state change of task point,
Task point-like states model is set up, the factor that analysis task distribution needs consider includes task point property parameters and the humanized ginseng of machine
Number, wherein,
Task point property parameters include：The task amount of task point, the status variation rate of task point and task point are on environmental map
The location of；
Robot property parameters include：Movement velocity, robot capability value and the robot location on environmental map.
5. method according to claim 1, it is characterised in that in the step S2, further include：
S21：When detecting task, the nearest robot of chosen distance task point as broker machines people, if apart from several tasks
The artificial same robot i (i=1,2 ..., M) of the nearest machine of point, system can select chosen distance right angle in several task points
The robot i of the nearest task point of coordinate origin is its broker machines people；
S22：Broker machines people issue auction information waits to be feedback to the auction robot in communication radius；
S23:The auction robot for receiving auction information selects income highest task point to be thrown according to self benefits function
Mark；
S24：Broker machines people collects bid information, and target robot performs task in target robot in selection, and notice；
S25：Not middle target auction robot performs nearest task point with the Robot Selection for being in communication blind zone.
6. method according to claim 5, it is characterised in that in the step S22, broker machines people is responsible for issue auction
Information waits to be feedback to the auction robot in communication radius；The broker machines people of each task point grasps the phase of the task point
Auction information is closed, the message includes：The position of task point, the rate of change of task point, the primary quantity of task point and task point institute
The quantity of the suitable machine people of needs.
7. method according to claim 5, it is characterised in that in the step S23, receive z (0≤z≤N) individual agency
The auction robot of robot issue auction information is weighed to these information, and balance standard is：Auction robot is to this z
Auction robot issue auction information is analyzed, and robot is calculated and performed the financial value after certain task point, and selects to receive
Beneficial highest task point is submitted a tender.
8. method according to claim 5, it is characterised in that in the step S24, broker machines people receives auction machine
After the bid information of people, its information is analyzed, according to the target that overall efficiency is maximum, target auction robot in selection, and notified
The auction robot result of all bids.
9. method according to claim 5, it is characterised in that in the step S24, robot leads to during traveling
The optimal nothing for crossing A-star algorithm search arrival task point touches path.
10. method according to claim 5, it is characterised in that in the step S2, when detect completed task point and
During aimless idle machine people, idle machine people can again be auctioned so that idle machine people regains new appointing
Business point, so as to draw new allocative decision, until after all of task point has been performed in environment, stopping auction.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201710015070.8A CN106875090B (en) | 2017-01-09 | 2017-01-09 | Dynamic task-oriented multi-robot distributed task allocation forming method |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201710015070.8A CN106875090B (en) | 2017-01-09 | 2017-01-09 | Dynamic task-oriented multi-robot distributed task allocation forming method |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN106875090A true CN106875090A (en) | 2017-06-20 |
| CN106875090B CN106875090B (en) | 2020-05-08 |
Family
ID=59165639
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201710015070.8A Active CN106875090B (en) | 2017-01-09 | 2017-01-09 | Dynamic task-oriented multi-robot distributed task allocation forming method |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN106875090B (en) |
Cited By (37)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN107479403A (en) * | 2017-09-14 | 2017-12-15 | 长春北方化工灌装设备股份有限公司 | Annular RGV semi-matter simulating systems based on virtual reality and run dispatching algorithm without sky |
| CN107657364A (en) * | 2017-09-06 | 2018-02-02 | 中南大学 | A kind of overloading AGV tasks towards tobacco plant material transportation distribute forming method |
| CN108009012A (en) * | 2017-12-14 | 2018-05-08 | 中南大学 | A kind of multiple agent dynamic task allocation method of task based access control model |
| CN108416488A (en) * | 2017-12-21 | 2018-08-17 | 中南大学 | A kind of more intelligent robot method for allocating tasks towards dynamic task |
| CN108873907A (en) * | 2018-07-11 | 2018-11-23 | 山东大学 | The cooperative control method of how incomplete humanoid robot patrol escort mission based on vector field |
| CN108985580A (en) * | 2018-06-16 | 2018-12-11 | 齐齐哈尔大学 | Multirobot disaster based on improved BP searches and rescues method for allocating tasks |
| CN109254581A (en) * | 2018-08-10 | 2019-01-22 | 安徽库讯自动化设备有限公司 | A kind of AGV trolley intelligence operation regulator control system based on running state analysis |
| CN109426884A (en) * | 2017-08-28 | 2019-03-05 | 杭州海康机器人技术有限公司 | Allocation plan determines method, apparatus and computer readable storage medium |
| CN109426560A (en) * | 2017-08-28 | 2019-03-05 | 杭州海康机器人技术有限公司 | Method for allocating tasks, device and computer readable storage medium |
| CN109447471A (en) * | 2018-10-30 | 2019-03-08 | 北京理工大学 | A kind of multirobot multizone collaboratively searching method for allocating tasks |
| CN109886574A (en) * | 2019-02-20 | 2019-06-14 | 哈尔滨工程大学 | A kind of multi-robot Task Allocation based on improvement threshold method |
| 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 |
| CN110309993A (en) * | 2018-03-27 | 2019-10-08 | 杭州海康机器人技术有限公司 | A kind of automated guided vehicle AGV method for allocating tasks and device |
| CN110362105A (en) * | 2019-06-17 | 2019-10-22 | 广州大学 | Sensor network wireless charging method based on more UAV |
| CN110456633A (en) * | 2019-06-29 | 2019-11-15 | 西南电子技术研究所（中国电子科技集团公司第十研究所） | Airborne multi-platform distributed task scheduling distribution method |
| CN110488807A (en) * | 2018-05-15 | 2019-11-22 | 罗伯特·博世有限公司 | For running method, robot and the multi-agent system of robot |
| CN110618689A (en) * | 2018-06-20 | 2019-12-27 | 陕西师范大学 | Multi-UUV system negotiation cooperation modeling method based on contract net under constraint condition |
| CN110727272A (en) * | 2019-11-11 | 2020-01-24 | 广州赛特智能科技有限公司 | Path planning and scheduling system and method for multiple robots |
| JP2020021454A (en) * | 2018-07-31 | 2020-02-06 | タタ コンサルタンシー サービシズ リミテッドＴＡＴＡ Ｃｏｎｓｕｌｔａｎｃｙ Ｓｅｒｖｉｃｅｓ Ｌｉｍｉｔｅｄ | System and method for semantic knowledge based dynamic utility calculation |
| CN111027875A (en) * | 2019-12-17 | 2020-04-17 | 鲁东大学 | Intelligent warehousing multi-robot task allocation method based on self-adaptive task pool |
| CN111208815A (en) * | 2019-12-24 | 2020-05-29 | 浙江大华技术股份有限公司 | Method for distributing a plurality of handling tasks to a plurality of automated guided vehicles and related device |
| CN111465475A (en) * | 2017-12-22 | 2020-07-28 | 罗伯特·博世有限公司 | Method for operating a robot in a multi-agent system, robot and multi-agent system |
| CN111461488A (en) * | 2020-03-03 | 2020-07-28 | 北京理工大学 | Multi-robot distributed cooperative task allocation method facing workshop carrying problem |
| CN111489049A (en) * | 2020-03-03 | 2020-08-04 | 北京理工大学 | Multi-agent distributed task allocation method |
| CN111680836A (en) * | 2020-06-06 | 2020-09-18 | 杭州电子科技大学 | Distributed multi-robot system task allocation method for online ST-SR problem |
| CN110162043B (en) * | 2019-05-17 | 2020-10-09 | 北京航空航天大学 | Cluster task allocation and control method under constraint of simultaneous arrival of multiple target points |
| CN111798097A (en) * | 2020-06-06 | 2020-10-20 | 浙江科钛机器人股份有限公司 | Autonomous mobile robot task allocation processing method based on market mechanism |
| CN112070383A (en) * | 2020-08-31 | 2020-12-11 | 北京理工大学 | Dynamic task-oriented multi-agent distributed task allocation method |
| CN112181608A (en) * | 2019-07-03 | 2021-01-05 | 中南大学 | Distributed distribution algorithm for multipoint dynamic aggregation tasks based on local information |
| CN112184400A (en) * | 2019-07-03 | 2021-01-05 | 中南大学 | Heterogeneous multi-agent multi-stage distributed auction algorithm based on local information |
| CN112859887A (en) * | 2019-11-28 | 2021-05-28 | 中国科学院沈阳自动化研究所 | Multi-underwater robot autonomous task allocation method based on space-based center |
| CN114330978A (en) * | 2021-11-11 | 2022-04-12 | 深圳大学 | Air-ground robot task dynamic allocation method, storage medium and terminal equipment |
| US11440193B2 (en) | 2020-03-30 | 2022-09-13 | Wipro Limited | Method, device, and system for managing collaboration amongst robots |
| CN115464645A (en) * | 2022-09-13 | 2022-12-13 | 达闼机器人股份有限公司 | Task execution method, device, equipment and storage medium |
| CN115903898A (en) * | 2022-11-17 | 2023-04-04 | 新疆送变电有限公司 | Unmanned aerial vehicle flight control method and device, electronic equipment and storage medium |
| CN116245257A (en) * | 2023-05-06 | 2023-06-09 | 季华实验室 | Multi-robot scheduling method and device |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US8315918B1 (en) * | 2004-04-06 | 2012-11-20 | Ticketmaster | Systems for dynamically allocating finite or unique resources |
| US8726278B1 (en) * | 2004-07-21 | 2014-05-13 | The Mathworks, Inc. | Methods and system for registering callbacks and distributing tasks to technical computing works |
| CN104166750A (en) * | 2014-06-18 | 2014-11-26 | 南京邮电大学 | Robocup rescue cooperation method based on weighing cooperation algorithm |
| CN105843227A (en) * | 2016-04-15 | 2016-08-10 | 上海大学 | Task intensity dynamic adjustment based multiple robots cooperating task hunting allocation algorithm |
| CN106155802A (en) * | 2015-03-30 | 2016-11-23 | 阿里巴巴集团控股有限公司 | Method for scheduling task, device and control node |
-
2017
- 2017-01-09 CN CN201710015070.8A patent/CN106875090B/en active Active
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US8315918B1 (en) * | 2004-04-06 | 2012-11-20 | Ticketmaster | Systems for dynamically allocating finite or unique resources |
| US8726278B1 (en) * | 2004-07-21 | 2014-05-13 | The Mathworks, Inc. | Methods and system for registering callbacks and distributing tasks to technical computing works |
| CN104166750A (en) * | 2014-06-18 | 2014-11-26 | 南京邮电大学 | Robocup rescue cooperation method based on weighing cooperation algorithm |
| CN106155802A (en) * | 2015-03-30 | 2016-11-23 | 阿里巴巴集团控股有限公司 | Method for scheduling task, device and control node |
| CN105843227A (en) * | 2016-04-15 | 2016-08-10 | 上海大学 | Task intensity dynamic adjustment based multiple robots cooperating task hunting allocation algorithm |
Non-Patent Citations (5)
| Title |
|---|
| KRISTINA LERMAN 等: "Analysis of Dynamic Task Allocation in Multi-Robot Systems", 《INTERNATIONAL JOURNAL OF ROBOTICS RESEARCH》 * |
| ZHOU PUCHENG 等: "Extended Contract Net Protocol for Multi-Robot Dynamic Task Allocation", 《INFORMATION TECHNOLOGY JOURNAL》 * |
| 沈杰: "RoboCup机器人救援仿真中的多智能体协作", 《中国优秀硕士学位论文全文数据库 信息科技辑》 * |
| 董昊: "知识化制造环境下的任务分配与动态控制策略", 《中国博士学位论文全文数据库 工程科技Ⅱ辑》 * |
| 高平安: "多移动机器人任务分配的市场方法研究", 《中国博士学位论文全文数据库 信息科技辑》 * |
Cited By (63)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN109426884A (en) * | 2017-08-28 | 2019-03-05 | 杭州海康机器人技术有限公司 | Allocation plan determines method, apparatus and computer readable storage medium |
| CN109426884B (en) * | 2017-08-28 | 2022-02-11 | 杭州海康机器人技术有限公司 | Distribution scheme determination method, device and computer readable storage medium |
| CN109426560A (en) * | 2017-08-28 | 2019-03-05 | 杭州海康机器人技术有限公司 | Method for allocating tasks, device and computer readable storage medium |
| CN107657364A (en) * | 2017-09-06 | 2018-02-02 | 中南大学 | A kind of overloading AGV tasks towards tobacco plant material transportation distribute forming method |
| CN107479403A (en) * | 2017-09-14 | 2017-12-15 | 长春北方化工灌装设备股份有限公司 | Annular RGV semi-matter simulating systems based on virtual reality and run dispatching algorithm without sky |
| CN108009012B (en) * | 2017-12-14 | 2021-12-14 | 中南大学 | Multi-agent dynamic task allocation method based on task model |
| CN108009012A (en) * | 2017-12-14 | 2018-05-08 | 中南大学 | A kind of multiple agent dynamic task allocation method of task based access control model |
| CN108416488A (en) * | 2017-12-21 | 2018-08-17 | 中南大学 | A kind of more intelligent robot method for allocating tasks towards dynamic task |
| CN111465475A (en) * | 2017-12-22 | 2020-07-28 | 罗伯特·博世有限公司 | Method for operating a robot in a multi-agent system, robot and multi-agent system |
| CN110309993B (en) * | 2018-03-27 | 2022-04-05 | 杭州海康机器人技术有限公司 | AGV task allocation method and device for automatic guided transport vehicle |
| CN110309993A (en) * | 2018-03-27 | 2019-10-08 | 杭州海康机器人技术有限公司 | A kind of automated guided vehicle AGV method for allocating tasks and device |
| CN110488807B (en) * | 2018-05-15 | 2024-05-14 | 罗伯特·博世有限公司 | Method for operating a robot, robot and multi-agent system |
| CN110488807A (en) * | 2018-05-15 | 2019-11-22 | 罗伯特·博世有限公司 | For running method, robot and the multi-agent system of robot |
| CN108985580A (en) * | 2018-06-16 | 2018-12-11 | 齐齐哈尔大学 | Multirobot disaster based on improved BP searches and rescues method for allocating tasks |
| CN108985580B (en) * | 2018-06-16 | 2022-09-02 | 齐齐哈尔大学 | Multi-robot disaster search and rescue task allocation method based on improved BP neural network |
| CN110618689B (en) * | 2018-06-20 | 2022-04-26 | 陕西师范大学 | Multi-UUV system negotiation cooperation modeling method based on contract net under constraint condition |
| CN110618689A (en) * | 2018-06-20 | 2019-12-27 | 陕西师范大学 | Multi-UUV system negotiation cooperation modeling method based on contract net under constraint condition |
| CN108873907A (en) * | 2018-07-11 | 2018-11-23 | 山东大学 | The cooperative control method of how incomplete humanoid robot patrol escort mission based on vector field |
| JP7099973B2 (en) | 2018-07-31 | 2022-07-12 | タタ コンサルタンシー サービシズ リミテッド | Systems and methods for dynamic utility calculation based on semantic knowledge |
| JP2020021454A (en) * | 2018-07-31 | 2020-02-06 | タタ コンサルタンシー サービシズ リミテッドＴＡＴＡ Ｃｏｎｓｕｌｔａｎｃｙ Ｓｅｒｖｉｃｅｓ Ｌｉｍｉｔｅｄ | System and method for semantic knowledge based dynamic utility calculation |
| CN109254581A (en) * | 2018-08-10 | 2019-01-22 | 安徽库讯自动化设备有限公司 | A kind of AGV trolley intelligence operation regulator control system based on running state analysis |
| CN109447471B (en) * | 2018-10-30 | 2021-03-23 | 北京理工大学 | Multi-robot multi-region collaborative search task allocation method |
| CN109447471A (en) * | 2018-10-30 | 2019-03-08 | 北京理工大学 | A kind of multirobot multizone collaboratively searching method for allocating tasks |
| CN109919431B (en) * | 2019-01-28 | 2023-04-07 | 重庆邮电大学 | Heterogeneous multi-robot task allocation method based on auction algorithm |
| CN109919431A (en) * | 2019-01-28 | 2019-06-21 | 重庆邮电大学 | Heterogeneous multi-robot method for allocating tasks based on auction algorithm |
| CN109886574B (en) * | 2019-02-20 | 2023-02-14 | 哈尔滨工程大学 | Multi-robot task allocation method based on improved threshold method |
| CN109886574A (en) * | 2019-02-20 | 2019-06-14 | 哈尔滨工程大学 | A kind of multi-robot Task Allocation based on improvement threshold method |
| 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 |
| CN110162043B (en) * | 2019-05-17 | 2020-10-09 | 北京航空航天大学 | Cluster task allocation and control method under constraint of simultaneous arrival of multiple target points |
| CN110362105A (en) * | 2019-06-17 | 2019-10-22 | 广州大学 | Sensor network wireless charging method based on more UAV |
| CN110362105B (en) * | 2019-06-17 | 2022-07-19 | 广州大学 | Sensor network wireless charging method based on multiple UAVs |
| CN110456633A (en) * | 2019-06-29 | 2019-11-15 | 西南电子技术研究所（中国电子科技集团公司第十研究所） | Airborne multi-platform distributed task scheduling distribution method |
| CN110456633B (en) * | 2019-06-29 | 2022-06-14 | 西南电子技术研究所（中国电子科技集团公司第十研究所） | Airborne multi-platform distributed task allocation method |
| CN112181608B (en) * | 2019-07-03 | 2023-10-31 | 中南大学 | Distributed distribution method for multipoint dynamic aggregation tasks based on local information |
| CN112184400A (en) * | 2019-07-03 | 2021-01-05 | 中南大学 | Heterogeneous multi-agent multi-stage distributed auction algorithm based on local information |
| CN112181608A (en) * | 2019-07-03 | 2021-01-05 | 中南大学 | Distributed distribution algorithm for multipoint dynamic aggregation tasks based on local information |
| CN112184400B (en) * | 2019-07-03 | 2024-04-02 | 中南大学 | Heterogeneous multi-agent multi-stage distributed auction algorithm based on local information |
| CN110727272B (en) * | 2019-11-11 | 2023-04-18 | 广州赛特智能科技有限公司 | Path planning and scheduling system and method for multiple robots |
| CN110727272A (en) * | 2019-11-11 | 2020-01-24 | 广州赛特智能科技有限公司 | Path planning and scheduling system and method for multiple robots |
| CN112859887B (en) * | 2019-11-28 | 2022-06-14 | 中国科学院沈阳自动化研究所 | Multi-underwater robot autonomous task allocation method based on space-based center |
| CN112859887A (en) * | 2019-11-28 | 2021-05-28 | 中国科学院沈阳自动化研究所 | Multi-underwater robot autonomous task allocation method based on space-based center |
| CN111027875A (en) * | 2019-12-17 | 2020-04-17 | 鲁东大学 | Intelligent warehousing multi-robot task allocation method based on self-adaptive task pool |
| CN111027875B (en) * | 2019-12-17 | 2023-09-26 | 鲁东大学 | Intelligent warehouse multi-robot task allocation method based on self-adaptive task pool |
| CN111208815A (en) * | 2019-12-24 | 2020-05-29 | 浙江大华技术股份有限公司 | Method for distributing a plurality of handling tasks to a plurality of automated guided vehicles and related device |
| CN111208815B (en) * | 2019-12-24 | 2023-03-31 | 浙江华睿科技股份有限公司 | Method for distributing a plurality of handling tasks to a plurality of automated guided vehicles and related device |
| CN111489049B (en) * | 2020-03-03 | 2022-07-05 | 北京理工大学 | Multi-agent distributed task allocation method |
| CN111461488A (en) * | 2020-03-03 | 2020-07-28 | 北京理工大学 | Multi-robot distributed cooperative task allocation method facing workshop carrying problem |
| CN111489049A (en) * | 2020-03-03 | 2020-08-04 | 北京理工大学 | Multi-agent distributed task allocation method |
| CN111461488B (en) * | 2020-03-03 | 2022-03-11 | 北京理工大学 | Multi-robot distributed cooperative task allocation method facing workshop carrying problem |
| US11440193B2 (en) | 2020-03-30 | 2022-09-13 | Wipro Limited | Method, device, and system for managing collaboration amongst robots |
| CN111798097B (en) * | 2020-06-06 | 2024-04-09 | 浙江科钛机器人股份有限公司 | Autonomous mobile robot task allocation processing method based on market mechanism |
| CN111680836A (en) * | 2020-06-06 | 2020-09-18 | 杭州电子科技大学 | Distributed multi-robot system task allocation method for online ST-SR problem |
| CN111798097A (en) * | 2020-06-06 | 2020-10-20 | 浙江科钛机器人股份有限公司 | Autonomous mobile robot task allocation processing method based on market mechanism |
| CN111680836B (en) * | 2020-06-06 | 2023-05-02 | 杭州电子科技大学 | Task allocation method for ST-SR (ST-SR) problem-oriented distributed multi-robot system |
| CN112070383B (en) * | 2020-08-31 | 2022-04-12 | 北京理工大学 | Dynamic task-oriented multi-agent distributed task allocation method |
| CN112070383A (en) * | 2020-08-31 | 2020-12-11 | 北京理工大学 | Dynamic task-oriented multi-agent distributed task allocation method |
| CN114330978A (en) * | 2021-11-11 | 2022-04-12 | 深圳大学 | Air-ground robot task dynamic allocation method, storage medium and terminal equipment |
| CN115464645A (en) * | 2022-09-13 | 2022-12-13 | 达闼机器人股份有限公司 | Task execution method, device, equipment and storage medium |
| CN115903898A (en) * | 2022-11-17 | 2023-04-04 | 新疆送变电有限公司 | Unmanned aerial vehicle flight control method and device, electronic equipment and storage medium |
| CN115903898B (en) * | 2022-11-17 | 2023-12-29 | 新疆送变电有限公司 | Unmanned aerial vehicle flight control method and device, electronic equipment and storage medium |
| CN116245257B (en) * | 2023-05-06 | 2023-09-12 | 季华实验室 | Multi-robot scheduling method and device |
| CN116245257A (en) * | 2023-05-06 | 2023-06-09 | 季华实验室 | Multi-robot scheduling method and device |
Also Published As
| Publication number | Publication date |
|---|---|
| CN106875090B (en) | 2020-05-08 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN106875090A (en) | A kind of multirobot distributed task scheduling towards dynamic task distributes forming method | |
| CN106155791B (en) | A kind of workflow task dispatching method under distributed environment | |
| Quader et al. | Design of an enhanced multi-aisle order-picking system considering storage assignments and routing heuristics | |
| CN107657364A (en) | A kind of overloading AGV tasks towards tobacco plant material transportation distribute forming method | |
| CN106779859A (en) | A kind of real-time Method for Sales Forecast method of mobile terminal product | |
| CN110533301A (en) | A kind of population dispatching method based on dynamic constrained matrix | |
| CN110400128A (en) | A kind of space crowdsourcing method for allocating tasks based on the perception of worker's preference | |
| CN107317872B (en) | Scheduling method of multi-type tasks in space crowdsourcing | |
| CN109409773A (en) | A kind of earth observation resource dynamic programming method based on Contract Net Mechanism | |
| CN102385364A (en) | Cross-operation-unit control method under flexible path | |
| CN102542411A (en) | Method for carrying out dispatching control on multi-variety multi-process manufacturing enterprise workshop on basis of ACA (Automatic Circuit Analyzer) model | |
| CN109886574B (en) | Multi-robot task allocation method based on improved threshold method | |
| Marie-Sainte et al. | Air passenger demand forecasting using particle swarm optimization and firefly algorithm | |
| CN111798097A (en) | Autonomous mobile robot task allocation processing method based on market mechanism | |
| Qu et al. | Improved particle swarm optimization for laser cutting path planning | |
| Vaghefinezhad et al. | A genetic algorithm approach for solving a flexible job shop scheduling problem | |
| Panda et al. | Effectiveness of GA on short term load forecasting | |
| Wang et al. | A Sustainable Supply Chain Design for Personalized Customization in Industry 5.0 Era | |
| CN106204098A (en) | A kind of whole world underwear industry data is collected and analysis platform and the method for analysis thereof | |
| Nair et al. | Hybrid PSO-BF algorithm for economic dispatch of a power system | |
| Matrenin et al. | Control of power prosumer based on swarm intelligence algorithms | |
| Cavalcante et al. | Improving combinatorial auctions for multi-robot exploration | |
| Salmanpour et al. | An intelligent water drops algorithm for solving robot path planning problem | |
| Tavakkolai et al. | Using gravitational search algorithm for in advance reservation of resources in solving the scheduling problem of works in workflow workshop environment | |
| Baringo | Stochastic complementarity models for investment in wind-power and transmission facilities |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |