CN109711723B - AGV task allocation method, storage device and scheduling system - Google Patents
AGV task allocation method, storage device and scheduling system Download PDFInfo
- Publication number
- CN109711723B CN109711723B CN201811600987.5A CN201811600987A CN109711723B CN 109711723 B CN109711723 B CN 109711723B CN 201811600987 A CN201811600987 A CN 201811600987A CN 109711723 B CN109711723 B CN 109711723B
- Authority
- CN
- China
- Prior art keywords
- task
- agv
- tasks
- time
- control center
- 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.)
- Active
Links
Images
Landscapes
- Two-Way Televisions, Distribution Of Moving Picture Or The Like (AREA)
- Mobile Radio Communication Systems (AREA)
Abstract
The invention discloses an AGV task allocation method, a storage device and a scheduling system.A central control center reasonably sequences all unexecuted tasks according to the cost of the cost by calculating the cost of all unexecuted tasks according to scene requirements, selects the task with the minimum cost as the next executed task of the AGV, so that the sequence of the tasks executed by the AGV can be changed according to the requirements, and measures the time and the running distance of the AGV executing the tasks by calculating the cost of the AGV executing the tasks, and reasonably allocates the tasks, thereby shortening the total running time and the time of the AGV and improving the total task execution efficiency.
Description
Technical Field
The invention relates to the technical field of AGV, in particular to an AGV task allocation method, a storage device and a scheduling system.
Background
In the automatic AGV dispatching system, a plurality of clients can operate simultaneously, and each client can send a plurality of tasks to the task pool at one time to wait for the execution of the AGV. In the traditional task allocation process, requests are sequentially responded directly according to the sending sequence of tasks, and few researches are made on the task processing sequence. In a scenario where no sequencing is required, this task scheduling scheme may increase the idle rate of the AGV, thereby increasing some unnecessary running costs.
Disclosure of Invention
The invention aims to overcome the defects of the prior art and provide an AGV task allocation method which can coordinate allocation and enables the AGV to execute tasks with high working efficiency.
In order to solve the technical problems, the invention adopts the following technical scheme:
an AGV task allocation method comprises a central control center and an AGV, and comprises the following steps:
a. generating a two-dimensional coordinate graph on an AGV advancing scene and recording the two-dimensional coordinate graph into a central control center, wherein any point has corresponding x and y coordinates;
b. the central control center records the task sending time, the task end position and the current position of the AGV of all the tasks to be executed according to all the tasks sent by the client;
c. the central control center carries out cost operation on all tasks to be executed according to the following formula according to the current position and time;
Cost=(|xposition-xtask|+|yposition-ytask|)×wdis tan ce-(Tnow-Ttask)×wtime
where Cost is the Cost of executing the task, xposition、ypositionX, y coordinates of the current position of the AGVtask、ytaskAs position information of task points, TnowFor the current time, TtaskTime when task is sent, wdistanceIs a distance weight, wtimeIs a time weight; said wtime=VAGV/T0,VAGVFor the operating speed of the AGV, T0 is the time allowed for the task to be reordered, i.e. within T0 there is no strict requirement on the order of execution of the tasks, wdis tan ce=1-wtime;
d. And the central control center sequences the cost of the tasks which are sent in the T0 and do not start to be executed, selects the task with the minimum cost as the task to be executed next by the AGV, and sends the task instruction to the AGV.
Compared with the prior art, according to the AGV task allocation method provided by the invention, under the requirements of different scenes, the sequence of the AGV executing the tasks can be changed according to the requirements, the time and the running distance of the AGV executing the tasks are measured by calculating the cost of the AGV executing the tasks, and the tasks are allocated reasonably, so that the total running time and the time of the AGV are shortened, and the total task executing efficiency is improved.
Preferably, in step c, when the application scenario in which the AGV is located has strict requirements on the execution sequence of the tasks, w is setdis tan ceWhen the task sending time is set to be 0, the central control center sends all the tasks which are not executed to the AGV according to the sequence of the task sending time, so that the AGV executes the tasks in sequence according to the sequence of the task sending time; and for different application scenes, mode conversion is simply carried out according to requirements, and different requirements of customers are met.
Preferably, in step c, when the application scenario in which the AGV is located does not require the execution sequence of the tasks at all, w is settimeSetting the task point to be 0, and preferentially sending all unexecuted tasks to the AGV by the central control center according to the nearest task point to the current position of the AGV, so that the AGV executes the tasks in sequence according to the distance of the executed tasks from small to large; to pairAnd mode conversion is simply carried out according to requirements in different application scenes, so that different requirements of customers are further met.
The invention also provides a storage device, which stores a plurality of execution instructions, wherein the execution instructions are used for loading and executing the following operations by the central control center:
a. generating a two-dimensional coordinate graph on an AGV traveling scene, wherein any point has corresponding x and y coordinates;
b. the client sends the tasks to a central control center, and the central control center records the task sending time, the task end position and the current position of the AGV of all the tasks to be executed;
c. the central control center carries out cost operation on all tasks according to the following formula according to the current position and time;
Cost=(|xposition-xtask|+|yposition-ytask|)×wdis tan ce-(Tnow-Ttask)×wtime
where Cost is the Cost of executing the task, xposition、ypositionX, y coordinates of the current position of the AGVtask、ytaskAs position information of task points, TnowFor the current time, TtaskTime when task is sent, wdis tan ceIs a distance weight, wtimeIs a time weight; said wtime=VAGV/T0,VAGVFor the operating speed of the AGV, T0 is the time allowed for the task to be reordered, i.e. within T0 there is no strict requirement on the order of execution of the tasks, wdis tan ce=1-wtime;
d. The tasks sent in T0 that did not begin execution are ranked in cost, and the least costly task is selected as the next task to be executed by the AGV.
Preferably, in step c, when the application scenario in which the AGV is located has strict requirements on the execution sequence of the tasks, w is transmitted through the central control centerdis tan ceSetting to 0, the central control center sends all the tasks which are not executed to the AGV according to the sequence of the task sending time, so that the AGV sends the tasks according to the sequence of the task sending timeSequentially executing; when the application scene where the AGV is located has no requirement on the execution sequence of the tasks, w is transmitted to the center control centertimeSetting the task point to be 0, and preferentially sending all unexecuted tasks to the AGV by the central control center according to the nearest task point to the current position of the AGV, so that the AGV executes the tasks in sequence according to the distance of the executed tasks from small to large; and for different application scenes, mode conversion is simply carried out according to requirements, so that different requirements of customers are met.
The invention also provides an AGV task scheduling system, which comprises a central control center, an AGV and a storage device used for storing a plurality of execution instructions, wherein the execution instructions are used for the central control center to load and execute the following operations:
a. generating a two-dimensional coordinate graph on an AGV traveling scene, wherein any point has corresponding x and y coordinates;
b. the client sends the tasks to a central control center, and the central control center records the task sending time, the task end position and the current position of the AGV of all the tasks to be executed;
c. the central control center carries out cost operation on all tasks according to the following formula according to the current position and time;
Cost=(|xposition-xtask|+|yposition-ytask|)×wdis tan ce-(Tnow-Ttask)×wtime
where Cost is the Cost of executing the task, xposition、ypositionX, y coordinates of the current position of the AGVtask、ytaskAs position information of task points, TnowFor the current time, TtaskTime when task is sent, wdis tan ceIs a distance weight, wtimeIs a time weight; said wtime=VAGV/T0,VAGVFor the operating speed of the AGV, T0 is the time allowed for the task to be reordered, i.e. within T0 there is no strict requirement on the order of execution of the tasks, wdis tan ce=1-wtime;
d. The tasks sent in T0 that did not begin execution are ranked in cost, and the least costly task is selected as the next task to be executed by the AGV.
Preferably, in step c, when the application scenario in which the AGV is located has strict requirements on the execution sequence of the tasks, w is transmitted through the central control centerdis tan ceWhen the task sending time is set to be 0, the central control center sends all the tasks which are not executed to the AGV according to the sequence of the task sending time, so that the AGV executes the tasks in sequence according to the sequence of the task sending time; when the application scene where the AGV is located has no requirement on the execution sequence of the tasks, w is transmitted to the center control centertimeSetting the task point to be 0, and preferentially sending all unexecuted tasks to the AGV by the central control center according to the nearest task point to the current position of the AGV, so that the AGV executes the tasks in sequence according to the distance of the executed tasks from small to large; and for different application scenes, mode conversion is simply carried out according to requirements, so that different requirements of customers are met.
Drawings
FIG. 1 is a simplified flow diagram of the present invention.
Detailed Description
Preferred embodiments of the present invention will be described below with reference to the accompanying drawings.
The first embodiment is as follows:
referring to fig. 1, an AGV task allocation method includes a central control center and AGVs, where the central control center is preferably a PC terminal, and the central control center is in wireless communication connection with the AGVs, and the task allocation method includes the following steps:
a. generating a two-dimensional coordinate graph on an AGV advancing scene and recording the two-dimensional coordinate graph into a central control center, wherein any point has corresponding x and y coordinates; the central control center detects whether an idle AGV exists, if so, the step b is carried out, if no idle AGV is found, the execution of the AGV task is waited for to be completed, and the idle AGV is detected to exist;
b. the central control center records the task sending time, the task end position and the current position of the AGV of all the tasks to be executed according to all the task requests sent by the client;
c. the central control center carries out cost operation on all tasks to be executed according to the following formula according to the current position and time;
Cost=(|xposition-xtask|+|yposition-ytask|)×wdis tan ce-(Tnow-Ttask)×wtime
where Cost is the Cost of executing the task, xposition、ypositionX, y coordinates of the current position of the AGVtask、ytaskAs position information of task points, TnowFor the current time, TtaskTime when task is sent, wdis tan ceIs a distance weight, wtimeIs a time weight; said wtime=VAGV/T0,VAGVFor the running speed of the AGV, T0 is the time for allowing the task to be reordered, that is, in T0, there is no strict requirement on the execution sequence of the tasks, for example, the tasks sent in 3 minutes are not in the execution sequence, and as long as the running cost is small, the 3 minutes are the time for allowing the task to be reordered, wdis tan ce=1-wtime;
d. And the central control center performs cost sequencing on the tasks which are sent in the T0 and do not start to be executed, selects the task with the minimum cost as the task to be executed next by the AGV, and sends a task instruction to the AGV, wherein the central control center firstly judges all the tasks, if the task is the task with the minimum cost, the task instruction is sent to the AGV as the task to be executed next, if the task is not the task with the minimum cost, the task is suspended, and the judgment is performed after the AGV finishes the next task. .
If the AGV runs at 1m/s, and the scene requires the tasks to be sent within 2min to be sequenced, wtimeWhen w is equal to 0.5dis tan ce=0.5。
As a preferred scheme, in step c, when the application scenario where the AGV is located has strict requirements on the execution sequence of the tasks, that is, the tasks must be executed according to the sending sequence, then w is addeddis tan ceAnd setting the task sending time to be 0, and sending all the tasks which are not executed to the AGV by the central control center according to the sequence of the task sending time, so that the AGV executes the tasks in sequence according to the sequence of the task sending time.
As a preferred embodimentIn step c, when the application scene where the AGV is located has no requirement on the execution sequence of the tasks at all, that is, the efficiency priority, is to execute the tasks with the shortest time consumption; then w will betimeAnd setting the task point to be 0, and preferentially sending all unexecuted tasks to the AGVs by the central control center according to the closest task point to the current positions of the AGVs, so that the AGVs execute the tasks in sequence from small to large according to the task executing distance.
The invention has the beneficial effects that: under the requirements of different scenes, the sequence of the tasks executed by the AGVs can be changed according to the requirements, the time and the running distance of the tasks executed by the AGVs are measured by calculating the cost of the tasks executed by the AGVs, and the tasks are reasonably distributed, so that the total running time and the time of the AGVs are shortened, and the total task execution efficiency is improved; and for different application scenes, mode conversion is simply carried out according to requirements, and different requirements of customers are met.
Example two:
a storage device storing a plurality of execution instructions, the execution instructions for a central control center to load and perform the following operations:
a. generating a two-dimensional coordinate graph on an AGV traveling scene, wherein any point has corresponding x and y coordinates;
b. the client sends the tasks to a central control center, and the central control center records the task sending time, the task end position and the current position of the AGV of all the tasks to be executed;
c. the central control center carries out cost operation on all tasks according to the following formula according to the current position and time;
Cost=(|xposition-xtask|+|yposition-ytask|)×wdis tan ce-(Tnow-Ttask)×wtime
where Cost is the Cost of executing the task, xposition、ypositionX, y coordinates of the current position of the AGVtask、ytaskAs position information of task points, TnowFor the current time, TtaskTime when task is sent, wdis tan ceIs a distance weight, wtimeIs a time weight; said wtime=VAGV/T0,VAGVFor the operating speed of the AGV, T0 is the time allowed for the task to be reordered, i.e. within T0 there is no strict requirement on the order of execution of the tasks, wdis tan ce=1-wtime;
d. The tasks sent in T0 that did not begin execution are ranked in cost, and the least costly task is selected as the next task to be executed by the AGV.
Preferably, in step c, when the application scenario in which the AGV is located has strict requirements on the execution sequence of the tasks, the central control center sends wdis tan ceWhen the task sending time is set to be 0, the central control center sends all the tasks which are not executed to the AGV according to the sequence of the task sending time, so that the AGV executes the tasks in sequence according to the sequence of the task sending time; when the application scene where the AGV is located has no requirement on the execution sequence of the tasks, w is transmitted to the center control centertimeSetting the task point to be 0, and preferentially sending all unexecuted tasks to the AGV by the central control center according to the nearest task point to the current position of the AGV, so that the AGV executes the tasks in sequence according to the distance of the executed tasks from small to large; and for different application scenes, mode conversion is simply carried out according to requirements, so that different requirements of customers are met.
Example three:
an AGV task scheduling system comprises a central control center, an AGV and a storage device used for storing a plurality of execution instructions, wherein the execution instructions are used for the central control center to load and execute the following operations:
a. generating a two-dimensional coordinate graph on an AGV traveling scene, wherein any point has corresponding x and y coordinates;
b. the client sends the tasks to a central control center, and the central control center records the task sending time, the task end position and the current position of the AGV of all the tasks to be executed;
c. the central control center carries out cost operation on all tasks according to the following formula according to the current position and time;
Cost=(|xposition-xtask|+|yposition-ytask|)×wdis tan ce-(Tnow-Ttask)×wtime
where Cost is the Cost of executing the task, xposition、ypositionX, y coordinates of the current position of the AGVtask、ytaskAs position information of task points, TnowFor the current time, TtaskTime when task is sent, wdis tan ceIs a distance weight, wtimeIs a time weight; said wtime=VAGV/T0,VAGVFor the operating speed of the AGV, T0 is the time allowed for the task to be reordered, i.e. within T0 there is no strict requirement on the order of execution of the tasks, wdis tan ce=1-wtime;
d. The tasks sent in T0 that did not begin execution are ranked in cost, and the least costly task is selected as the next task to be executed by the AGV.
Preferably, in step c, when the application scenario in which the AGV is located has strict requirements on the execution sequence of the tasks, the central control center sends wdis tan ceWhen the task sending time is set to be 0, the central control center sends all the tasks which are not executed to the AGV according to the sequence of the task sending time, so that the AGV executes the tasks in sequence according to the sequence of the task sending time; when the application scene where the AGV is located has no requirement on the execution sequence of the tasks, w is transmitted to the center control centertimeSetting the task point to be 0, and preferentially sending all unexecuted tasks to the AGV by the central control center according to the nearest task point to the current position of the AGV, so that the AGV executes the tasks in sequence according to the distance of the executed tasks from small to large; for different application scenes, the mode is simply changed according to the requirements, thereby meeting different requirements of customers
Variations and modifications to the above-described embodiments may occur to those skilled in the art, which fall within the scope and spirit of the above description. Therefore, the present invention is not limited to the specific embodiments disclosed and described above, and some modifications and variations of the present invention should fall within the scope of the claims of the present invention. Furthermore, although specific terms are employed herein, they are used in a generic and descriptive sense only and not for purposes of limitation.
Claims (3)
1. An AGV task allocation method comprises a central control center and an AGV, and is characterized in that: the method comprises the following steps:
a. generating a two-dimensional coordinate graph on an AGV advancing scene and recording the two-dimensional coordinate graph into a central control center, wherein any point has corresponding x and y coordinates;
b. the central control center records the task sending time, the task end position and the current position of the AGV of all the tasks to be executed according to all the tasks sent by the client;
c. the central control center carries out cost operation on all tasks to be executed according to the following formula according to the current position and time;
Cost=(|xposition-xtask|+|yposition-ytask|)×wdistance-(Tnow-Ttask)×wtime
where Cost is the Cost of executing the task, xposition、ypositionX, y coordinates of the current position of the AGVtask、ytaskAs position information of task points, TnowFor the current time, TtaskTime when task is sent, wdistanceIs a distance weight, wtimeIs a time weight; said wtime=VAGV/T0,VAGVFor the operating speed of the AGV, T0 is the time allowed for the task to be reordered, i.e. within T0 there is no strict requirement on the order of execution of the tasks, wdistance=1-wtime;
When the application scene where the AGV is located has strict requirements on the execution sequence of the tasks, w is useddistanceSetting the task sending time to be 0, and sending all unexecuted tasks to the AGV by the central control center according to the sequence of the task sending time;
when the application scene where the AGV is located has no requirement on the execution sequence of the tasks, w is usedtimeSetting the priority sequence of all unexecuted tasks to be 0 according to the distance from the task point to the current position of the AGV from near to far, and sequentially sending the tasks to the AGV by the central control center;
d. and the central control center sequences the cost of the tasks which are sent in the T0 and do not start to be executed, selects the task with the minimum cost as the task to be executed next by the AGV, and sends the task instruction to the AGV.
2. A memory device storing a plurality of execution instructions, the memory device comprising: the execution instruction is used for loading and executing the following operations by the central control center:
a. generating a two-dimensional coordinate graph on an AGV traveling scene, wherein any point has corresponding x and y coordinates;
b. the client sends the tasks to a central control center, and the central control center records the task sending time, the task end position and the current position of the AGV of all the tasks to be executed;
c. the central control center carries out cost operation on all tasks according to the following formula according to the current position and time;
Cost=(|xposition-xtask|+|yposition-ytask|)×wdistance-(Tnow-Ttask)×wtime
where Cost is the Cost of executing the task, xposition、ypositionX, y coordinates of the current position of the AGVtask、ytaskAs position information of task points, TnowFor the current time, TtaskTime when task is sent, wdistanceIs a distance weight, wtimeIs a time weight; said wtime=VAGV/T0,VAGVFor the operating speed of the AGV, T0 is the time allowed for the task to be reordered, i.e. within T0 there is no strict requirement on the order of execution of the tasks, wdistance=1-wtime;
When the application scene where the AGV is located has strict requirements on the execution sequence of the tasks, w is useddistanceSetting the task sending time to be 0, and sending all unexecuted tasks to the AGV by the central control center according to the sequence of the task sending time;
when the application scene where the AGV is located has no requirement on the execution sequence of the tasks, w is usedtimeIs set to 0, inThe control center sets priority sequences of all unexecuted tasks according to the distance from the task point to the current position of the AGV from near to far, and sends the tasks to the AGV in sequence;
d. the tasks sent in T0 that did not begin execution are ranked in cost, and the least costly task is selected as the next task to be executed by the AGV.
3. An AGV task scheduling system comprises a central control center, an AGV and a storage device used for storing a plurality of execution instructions, and is characterized in that: the execution instruction is used for loading and executing the following operations by the central control center:
a. generating a two-dimensional coordinate graph on an AGV traveling scene, wherein any point has corresponding x and y coordinates;
b. the client sends the tasks to a central control center, and the central control center records the task sending time, the task end position and the current position of the AGV of all the tasks to be executed;
c. the central control center carries out cost operation on all tasks according to the following formula according to the current position and time;
Cost=(|xposition-xtask|+|yposition-ytask|)×wdistance-(Tnow-Ttask)×wtime
where Cost is the Cost of executing the task, xposition、ypositionX, y coordinates of the current position of the AGVtask、ytaskAs position information of task points, TnowFor the current time, TtaskTime when task is sent, wdistanceIs a distance weight, wtimeIs a time weight; said wtime=VAGV/T0,VAGVFor the operating speed of the AGV, T0 is the time allowed for the task to be reordered, i.e. within T0 there is no strict requirement on the order of execution of the tasks, wdistance=1-wtime;
When the application scene where the AGV is located has strict requirements on the execution sequence of the tasks, w is useddistanceSetting to 0, the central control center sends all the tasks to be executed according to the sequence of the task sending timeSequentially sending the data to the AGV;
when the application scene where the AGV is located has no requirement on the execution sequence of the tasks, w is usedtimeSetting the priority sequence of all unexecuted tasks to be 0 according to the distance from the task point to the current position of the AGV from near to far, and sequentially sending the tasks to the AGV by the central control center;
d. the tasks sent in T0 that did not begin execution are ranked in cost, and the least costly task is selected as the next task to be executed by the AGV.
Priority Applications (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CN201811600987.5A CN109711723B (en) | 2018-12-26 | 2018-12-26 | AGV task allocation method, storage device and scheduling system |
Applications Claiming Priority (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CN201811600987.5A CN109711723B (en) | 2018-12-26 | 2018-12-26 | AGV task allocation method, storage device and scheduling system |
Publications (2)
Publication Number | Publication Date |
---|---|
CN109711723A CN109711723A (en) | 2019-05-03 |
CN109711723B true CN109711723B (en) | 2021-10-12 |
Family
ID=66258374
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
CN201811600987.5A Active CN109711723B (en) | 2018-12-26 | 2018-12-26 | AGV task allocation method, storage device and scheduling system |
Country Status (1)
Country | Link |
---|---|
CN (1) | CN109711723B (en) |
Families Citing this family (8)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN110955210B (en) * | 2019-11-29 | 2021-10-19 | 广东嘉腾机器人自动化有限公司 | AGV scheduling method, device and system |
CN112990617A (en) * | 2019-12-02 | 2021-06-18 | 杭州海康机器人技术有限公司 | Scheduling method and scheduling device for intelligent mobile robot |
CN111291930A (en) * | 2020-01-21 | 2020-06-16 | 北京猎户星空科技有限公司 | Task allocation method and device, computing equipment and storage medium |
CN111815226B (en) * | 2020-06-11 | 2024-04-16 | 浙江华睿科技股份有限公司 | Automatic guided transport vehicle dispatching method, dispatching system and storage device |
CN112130980B (en) * | 2020-09-29 | 2024-06-25 | 海尔优家智能科技(北京)有限公司 | Operation execution method and device, storage medium and electronic device |
CN113110330B (en) * | 2021-04-15 | 2022-11-22 | 青岛港国际股份有限公司 | AGV dynamic scheduling management method based on global optimal matching |
CN113743747B (en) * | 2021-08-17 | 2024-02-06 | 广州工业智能研究院 | Multi-AGV cooperative scheduling method and device in workshop environment |
CN114527712A (en) * | 2021-11-22 | 2022-05-24 | 广东嘉腾机器人自动化有限公司 | AGV task modification method and modification system |
Family Cites Families (10)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
KR100461869B1 (en) * | 2002-07-04 | 2004-12-14 | 삼성전자주식회사 | Control method of conveying system |
KR100478451B1 (en) * | 2002-07-05 | 2005-03-22 | 삼성전자주식회사 | Control method of conveying system |
FI118260B (en) * | 2006-03-03 | 2007-09-14 | Kone Corp | Lift system |
US7890509B1 (en) * | 2006-12-05 | 2011-02-15 | First American Real Estate Solutions Llc | Parcel data acquisition and processing |
KR101695557B1 (en) * | 2015-07-17 | 2017-01-24 | 고려대학교 산학협력단 | Automated guided vehicle system based on autonomous mobile technique and a method for controlling the same |
CN105069530B (en) * | 2015-08-13 | 2019-02-26 | 肇庆学院 | A kind of multi-robot Task Allocation based on multiple-objection optimization |
CN106251016B (en) * | 2016-08-01 | 2019-05-07 | 江苏海事职业技术学院 | A kind of parking system paths planning method based on dynamic time windows |
CN108490929A (en) * | 2018-02-11 | 2018-09-04 | 成都兴联宜科技有限公司 | A kind of Dispatching monitor and control system and method for AGV trolleies |
CN108764579B (en) * | 2018-06-01 | 2021-09-07 | 成都交大光芒科技股份有限公司 | Storage multi-robot task scheduling method based on congestion control |
CN108958257A (en) * | 2018-07-25 | 2018-12-07 | 深圳市集大自动化有限公司 | The collaboration paths planning method of more AGV integrated navigations |
-
2018
- 2018-12-26 CN CN201811600987.5A patent/CN109711723B/en active Active
Also Published As
Publication number | Publication date |
---|---|
CN109711723A (en) | 2019-05-03 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
CN109711723B (en) | AGV task allocation method, storage device and scheduling system | |
CN110350609B (en) | AGV charging management method and system, equipment and storage medium | |
JP6373432B2 (en) | Real-time optimization of computing infrastructure in virtual environment | |
WO2018059029A1 (en) | Resource allocation method, related device and system | |
CN103294533A (en) | Task flow control method and task flow control system | |
JP2005141762A5 (en) | ||
CN111209091B (en) | Scheduling method of Spark task containing private data in mixed cloud environment | |
WO2018126771A1 (en) | Storage controller and io request processing method | |
CN107251486A (en) | A kind of method for extending linkage, apparatus and system | |
CN103914556A (en) | Large-scale graph data processing method | |
CN103279351A (en) | Method and device for task scheduling | |
CN113377551A (en) | Unmanned vehicle task allocation method and device, electronic equipment and storage medium | |
CN103677959A (en) | Virtual machine cluster migration method and system based on multicast | |
CN106534312B (en) | A kind of service request selection of facing mobile apparatus and dispatching method | |
CN107526632B (en) | Process pool expansion method and device | |
CN114795001B (en) | Cleaning robot control method and device and cloud server | |
CN117193967A (en) | Job task scheduling method, device, equipment and storage medium | |
CN107885589B (en) | Job scheduling method and device | |
CN106411971B (en) | Load adjusting method and device | |
US20190121664A1 (en) | Method, apparatus and computer-readable medium for application scheduling | |
CN112887347B (en) | Dynamic migration method and device for edge calculation in industrial internet | |
CN114070855A (en) | Resource allocation method, resource allocation device, resource allocation system, and storage medium | |
CN112052084A (en) | Resource allocation method and computer equipment | |
TWI825896B (en) | Environmental finishing control method | |
CN110430264B (en) | Data reading method in cloud computing |
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 |