CN111798041A - AGV intelligent scheduling method based on time window - Google Patents

AGV intelligent scheduling method based on time window Download PDF

Info

Publication number
CN111798041A
CN111798041A CN202010560493.XA CN202010560493A CN111798041A CN 111798041 A CN111798041 A CN 111798041A CN 202010560493 A CN202010560493 A CN 202010560493A CN 111798041 A CN111798041 A CN 111798041A
Authority
CN
China
Prior art keywords
agv
task
executed
equipment
path
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Pending
Application number
CN202010560493.XA
Other languages
Chinese (zh)
Inventor
李光
于荣荣
林晓青
刘净瑜
王颜
徐建萍
殷宇航
张加波
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Beijing Satellite Manufacturing Factory Co Ltd
Original Assignee
Beijing Satellite Manufacturing Factory Co Ltd
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Beijing Satellite Manufacturing Factory Co Ltd filed Critical Beijing Satellite Manufacturing Factory Co Ltd
Priority to CN202010560493.XA priority Critical patent/CN111798041A/en
Publication of CN111798041A publication Critical patent/CN111798041A/en
Priority to PCT/CN2021/100483 priority patent/WO2021254415A1/en
Pending legal-status Critical Current

Links

Images

Classifications

    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06QINFORMATION 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/00Administration; Management
    • G06Q10/04Forecasting or optimisation specially adapted for administrative or management purposes, e.g. linear programming or "cutting stock problem"
    • G06Q10/047Optimisation of routes or paths, e.g. travelling salesman problem
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06QINFORMATION 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/00Administration; Management
    • G06Q10/06Resources, workflows, human or project management; Enterprise or organisation planning; Enterprise or organisation modelling
    • G06Q10/063Operations research, analysis or management
    • G06Q10/0631Resource planning, allocation, distributing or scheduling for enterprises or organisations
    • G06Q10/06316Sequencing of tasks or work
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06QINFORMATION 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/00Administration; Management
    • G06Q10/08Logistics, e.g. warehousing, loading or distribution; Inventory or stock management
    • G06Q10/083Shipping
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06QINFORMATION 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
    • G06Q50/00Systems or methods specially adapted for specific business sectors, e.g. utilities or tourism
    • G06Q50/04Manufacturing
    • YGENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
    • Y02TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
    • Y02PCLIMATE CHANGE MITIGATION TECHNOLOGIES IN THE PRODUCTION OR PROCESSING OF GOODS
    • Y02P90/00Enabling technologies with a potential contribution to greenhouse gas [GHG] emissions mitigation
    • Y02P90/30Computing systems specially adapted for manufacturing

Landscapes

  • Business, Economics & Management (AREA)
  • Human Resources & Organizations (AREA)
  • Engineering & Computer Science (AREA)
  • Economics (AREA)
  • Strategic Management (AREA)
  • Physics & Mathematics (AREA)
  • Theoretical Computer Science (AREA)
  • General Physics & Mathematics (AREA)
  • Entrepreneurship & Innovation (AREA)
  • Marketing (AREA)
  • General Business, Economics & Management (AREA)
  • Tourism & Hospitality (AREA)
  • Quality & Reliability (AREA)
  • Operations Research (AREA)
  • Development Economics (AREA)
  • Game Theory and Decision Science (AREA)
  • Educational Administration (AREA)
  • Manufacturing & Machinery (AREA)
  • Health & Medical Sciences (AREA)
  • General Health & Medical Sciences (AREA)
  • Primary Health Care (AREA)
  • Traffic Control Systems (AREA)
  • Navigation (AREA)

Abstract

A time window-based AGV intelligent scheduling method is characterized in that a time window calculation method under the principles of high priority and time priority is adopted for pre-occupying paths, time-sharing use and automatic avoidance of multiple AGVs on the same road section are achieved, flexible setting of each path node and priority classification and sequencing of tasks are carried out according to virtual mapping of a field operation environment, the problems that multiple AGV devices in a production field are difficult to operate simultaneously, insufficient path capacity, multi-vehicle conflict, path intersection, loop deadlock and the like are prone to occurring are solved, and operation efficiency and operation safety are effectively improved.

Description

AGV intelligent scheduling method based on time window
Technical Field
The invention relates to an AGV intelligent scheduling method based on a time window, and belongs to the technical field of intelligent scheduling.
Background
The AGV is an important component of a flexible manufacturing system, has an important function of being lacking in production process automation and intellectualization, particularly completes instant automatic conveying of multiple lines at multiple indefinite points and multiple stations, realizes automation of manufacturing industry, and performs processing, assembly and the like in discrete manufacturing enterprises. The AGV is an important tool for improving the production and manufacturing efficiency, is beneficial to realizing the intelligent and modern manufacturing of factories, workshops, production lines and the like, and particularly has wide application in industrial technologies such as processing, transportation and the like. The AGV dispatching system completes management, path planning, task allocation, state monitoring and the like of multiple AGVs, and the quality of the performance of the dispatching system directly influences the transfer efficiency, so that the production efficiency, the cost and the like are influenced.
At present, due to the fact that path capacity of a production field is limited, multiple AGVs need to run simultaneously, problems of insufficient path capacity, multiple vehicle conflicts, path intersection, loop deadlock and the like are prone to occurring, and requirements of fields such as precision manufacturing and assembling for automatic, collision-free, deadlock-free and efficient running of the multiple AGVs cannot be met.
Disclosure of Invention
The technical problem solved by the invention is as follows: aiming at the problems that multiple AGV devices in a production field are difficult to operate simultaneously, and the situations of insufficient path capacity, multi-vehicle conflict, path intersection, loop deadlock and the like are easy to occur in the prior art, the AGV intelligent scheduling method based on the time window is provided.
The technical scheme for solving the technical problems is as follows:
an AGV intelligent scheduling method based on a time window comprises the following steps:
(1) according to the characteristics of a field environment and the requirements of a scheduling task, establishing a laser navigation coordinate system, constructing a field map, planning and constructing the running path nodes of the AGV, determining the coordinates, types, positioning modes and path directions of the running path nodes in the laser navigation coordinate system, and generating a field map file according to the field map information;
(2) storing the AGV equipment type, the equipment number, the communication MAC address and the running state in a database according to the scheduling task requirement;
(3) reading a field map file by using an AGV (automatic guided vehicle) scheduling system, dynamically storing field map information, and performing virtual mapping in the AGV scheduling system;
the AGV dispatching system realizes AGV dispatching and management by reading a field map file and AGV equipment information and task information in a database;
(4) reading AGV equipment information in a database by using an AGV dispatching system, acquiring available AGV equipment information in a field map, storing the available AGV equipment information, and initializing the selected AGV equipment;
(5) establishing a communication link between an AGV dispatching system and all available AGV equipment;
(6) acquiring current position coordinates of each AGV device, performing position detection on each AGV device according to field map information, searching a running path node closest to the current position of each AGV device, judging whether the AGV device is in a navigation area or not according to the distance between the running path node and the current position of each AGV device, if so, adding the AGV device into an idle state AGV list, otherwise, the AGV device exceeds the navigation range, and after the position detection of all the AGV devices is finished, updating database data according to the detection result;
(7) reading task requirements in an upper layer system through an AGV dispatching system, and carrying out priority classification and sequencing on tasks to be executed which are not started to be executed according to the emergency degree and the task creation time;
the task to be executed comprises a task model, an initial position, a target position, a task priority and task creation time, wherein the task model comprises AGV equipment actions at the initial position, AGV equipment actions at the target position and AGV equipment types of the task to be executed;
(8) the tasks are executed according to the priority classification and the sequence of the tasks to be executed after the priority classification, and the AGV equipment is assigned according to the current information of the tasks to be executed;
(9) after the current task to be executed is assigned, performing real-time path planning on the assigned AGV equipment, realizing automatic avoidance of other AGV equipment in the task execution process, and updating the execution state of the current task, the assigned AGV running state, the current AGV position coordinate and the node information of the remaining running paths in the database in real time;
(10) and after the task is executed, updating the state of the task in the database to be the execution completion, and simultaneously updating the state of the selected AGV equipment after the task is completed to be an idle state to prepare for the subsequent execution of other tasks.
Matrix codes are arranged at positions, which need to be subjected to visual navigation and visual accurate positioning, in the running path nodes.
And (6) before the position of each AGV device is detected, carrying out point-to-point directional communication by using an AGV dispatching system according to the serial number and the network address of the AGV device to be detected so as to acquire the current position coordinate of each AGV device.
In the step (7), the upper system includes an MES system and an intelligent warehousing system, and the priority classification and sorting specifically includes: and sequencing the tasks to be executed according to the priority urgency degree of the tasks to be executed, and sequencing the tasks to be executed with the same priority according to the creation time sequence of the tasks.
The time interval for reading the task demands in the upper layer system by the AGV dispatching system is 500 ms.
In the step (8), all AGV devices of corresponding types are selected according to the AGV device types of the tasks to be executed in the current information of the tasks to be executed, wherein:
if no task to be executed exists in the current task information to be executed, the AGV equipment of the corresponding type continues to execute the original task or is ready;
if the current task information to be executed contains the task to be executed, judging whether the task information contains a designated AGV equipment number, if the designated AGV equipment number exists, the AGV equipment is in a scheduling system control and non-communication interruption state, is in a navigation area and is in an idle state, and assigning the current task information to be executed for the AGV equipment;
if no designated AGV equipment number exists, judging whether AGV equipment which is controlled by a dispatching system, is in a non-communication interruption state, is in a navigation area and is in an idle state exists in the same type or not according to the type of the AGV equipment of the task to be executed in the task information, and if the number of the idle AGV equipment is 1, directly assigning the AGV equipment; if the number of the idle AGV devices is more than 1, acquiring all paths from the current position to the task starting position of each idle AGV device, calculating the occupation time of each path, selecting the path with the shortest occupation time from all the paths of all the idle AGV devices as an alternative path, judging whether the occupation time windows of all the running path nodes in the selected alternative path conflict with other AGV devices, if the conflicting occupation time windows exist, selecting a new path with the occupation time only being more than that of the alternative path according to the occupation time sequence, judging the occupation time windows again until the new path with the occupation time window not conflicting with other AGV devices is selected as an optimal path, and selecting the AGV device corresponding to the path as an assigned AGV device of the current task to be executed; and if the number of the idle AGV equipment is 0, not assigning, and waiting for the AGV equipment which is controlled by the dispatching system, is in a non-communication interruption state, is in a navigation area and is in an idle state.
And calculating all paths from the current position to the task starting position of each idle AGV device through a dijkstra algorithm.
Compared with the prior art, the invention has the advantages that:
(1) the invention provides an AGV intelligent scheduling method based on a time window, which plans path nodes in advance according to the field running environment of the AGV and stores the path nodes in a database in advance, establishes virtual mapping of an electronic map in a scheduling system to the field environment, can flexibly and changeably set each path node according to actual needs, improves the flexibility of arrangement and change of production lines such as automatic processing or assembly and the like, classifies and sequences tasks according to task execution states, priorities and issuing time, is favorable for priority processing of emergency tasks, and is convenient for a user to manage the AGV tasks and process AGV state information in real time;
(2) the invention adopts the time window calculation method under the time priority principle to pre-occupy the path for the same path node, realizes the time-sharing use and automatic avoidance of multiple AGVs to the same road section, prevents the problems of multiple vehicle conflicts, path intersection, loop deadlock and the like, and effectively improves the operation efficiency and the operation safety.
Drawings
FIG. 1 is a schematic flow chart of an intelligent scheduling method provided by the present invention;
Detailed Description
The utility model provides a AGV intelligent scheduling method based on time window, through judging operation route node state in advance and occupation in advance and the automatic of occupation node to the automation of idle node based on time window, realize the automation of many AGVs in the same region while moving and dodge, improve operating efficiency and operation security, as shown in figure 1, concrete step is:
(1) according to the characteristics of a field environment and the requirements of a scheduling task, establishing a laser navigation coordinate system, constructing a field map, planning and constructing the running path nodes of the AGV, determining the coordinates, types, positioning modes and path directions of the running path nodes in the laser navigation coordinate system, and generating a field map file according to the field map information; matrix codes are arranged at positions, which need to be subjected to visual navigation and visual accurate positioning, of the nodes of the operation path, and the coordinate direction of the matrix codes is the same as that of a laser navigation coordinate system;
the type of the operation path node comprises an acceleration point, a deceleration point, a work station point, a parking point, a charging point and the like, the positioning mode comprises visual positioning, laser positioning, PSD positioning and the like, the path direction comprises forward direction, reverse direction and bidirectional direction, meanwhile, whether the information of AGV rotation, navigation mode, transverse movement and the like are allowed to be stored in an electronic map is judged, and finally a json map file, namely a field map file, is generated according to the attributes;
the AGV equipment can perform autonomous navigation by adopting various navigation modes such as vision, laser and the like, and has the characteristics of line patrol walking, matrix code number identification or self coordinate identification according to field characteristic matching; according to the characteristics that a plurality of fixed obstacles exist in a field environment and the volume of the AGV equipment and the load volume are large, the operable route of the AGV equipment is limited; setting characteristic points with different attributes such as an acceleration point, a deceleration point, a parking point, a rotation point, a work site point and the like in a field environment, measuring corresponding coordinates of each point, and constructing a field two-dimensional map; an electronic map module in the dispatching system stores the attribute information of the points and the road sections in a json file to realize digital modeling of a field environment; the json file is a lightweight data exchange format, is easy to read and write by people and is easy to generate and analyze by a machine;
(2) storing the AGV equipment type, the equipment number, the communication MAC address and the running state in a database according to the scheduling task requirement;
(3) reading a field map file by using an AGV (automatic guided vehicle) scheduling system, dynamically storing field map information, and performing virtual mapping in the AGV scheduling system;
the AGV dispatching system realizes AGV dispatching and management by reading a field map file and AGV equipment information and task information in a database;
in the AGV dispatching system, an equipment manager stores all AGV equipment information in an AGV information table of a database at one time by operating an equipment management module of the dispatching system according to actual equipment conditions so as to facilitate the dispatching system to dispatch and manage a plurality of AGVs, and if AGV equipment is added or deleted subsequently, the dispatching system can operate in an interface and automatically update the database; otherwise, the dispatching system can automatically manage the AGV equipment with the recorded information and automatically update the AGV equipment according to the running state and the like;
(4) reading AGV equipment information in a database by using an AGV dispatching system, acquiring available AGV equipment information in a field map, storing the available AGV equipment information, and initializing the selected AGV equipment;
(5) establishing a communication link between an AGV dispatching system and all available AGV equipment;
setting a communication link, requiring an AGV dispatching system to automatically detect a port of an available communication link, defaulting or changing the selected port, setting parameters of a baud rate, a data bit and a stop bit, automatically opening the port of the communication link after the setting is finished, realizing wireless communication between the dispatching system and the AGV equipment through a wireless communication module, and establishing the communication link between the dispatching system and the AGV equipment;
(6) acquiring current position coordinates of each AGV device, performing position detection on each AGV device according to field map information, searching a running path node closest to the current position of each AGV device, judging whether the AGV device is in a navigation area or not according to the distance between the running path node and the current position of each AGV device, if so, adding the AGV device into an idle state AGV list, otherwise, the AGV device exceeds the navigation range, and after the position detection of all the AGV devices is finished, updating database data according to the detection result;
the navigation area is determined by data stored in the site map information and equipment information of the AGVs, and if the distance between the current position of the AGVs and the path node closest to the current position of the AGVs is more than 2 times of the length of the AGVs, the position of the AGVs is considered to exceed the navigation area; before position detection is carried out on each AGV device, point-to-point directional communication is carried out by using an AGV dispatching system according to the serial number and the network address of the AGV device to be detected so as to obtain the current position coordinate of each AGV device;
(7) reading task requirements in an upper layer system through an AGV dispatching system, and carrying out priority classification and sequencing on tasks to be executed which are not started to be executed according to the emergency degree and the task creation time;
the task to be executed comprises a task model, an initial position, a target position, a task priority and task creation time, wherein the task model comprises AGV equipment actions at the initial position, AGV equipment actions at the target position and AGV equipment types of the task to be executed;
the upper system comprises an MES system, an intelligent warehousing system and the like, and the priority classification and sequencing specifically comprises the following steps: sequencing according to the priority urgency degree of tasks to be executed, sequencing the tasks to be executed with the same priority according to the creation time sequence of the tasks, wherein the time interval for reading task requirements in an upper-layer system by an AGV scheduling system is 500 ms;
(8) the tasks are executed according to the priority classification and the sequence of the tasks to be executed after the priority classification, and the AGV equipment is assigned according to the current information of the tasks to be executed;
all AGV equipment of corresponding types are selected according to the types of the AGV equipment of the tasks to be executed in the current information of the tasks to be executed, and the method specifically comprises the following steps:
if no task to be executed exists in the current task information to be executed, the AGV equipment of the corresponding type continues to execute the original task or is ready;
if the current task information to be executed contains the task to be executed, judging whether the task information contains a designated AGV equipment number, if the designated AGV equipment number exists, the AGV equipment is in a scheduling system control and non-communication interruption state, is in a navigation area and is in an idle state, and assigning the current task information to be executed for the AGV equipment;
if no designated AGV equipment number exists, judging whether AGV equipment which is controlled by a dispatching system, is in a non-communication interruption state, is in a navigation area and is in an idle state exists in the same type or not according to the type of the AGV equipment of the task to be executed in the task information, and if the number of the idle AGV equipment is 1, directly assigning the AGV equipment; if the number of the idle AGV devices is more than 1, acquiring all paths from the current position to the task starting position of each idle AGV device, calculating the occupation time of each path, selecting the path with the shortest occupation time from all the paths of all the idle AGV devices as an alternative path, judging whether the occupation time windows of all the running path nodes in the selected alternative path conflict with other AGV devices, if the conflicting occupation time windows exist, selecting a new path with the occupation time only being more than that of the alternative path according to the occupation time sequence, judging the occupation time windows again until the new path with the occupation time window not conflicting with other AGV devices is selected as an optimal path, and selecting the AGV device corresponding to the path as an assigned AGV device of the current task to be executed; if the number of the idle AGV equipment is 0, no assignment is carried out, and the AGV equipment which is controlled by a dispatching system, is in a non-communication interruption state, is in a navigation area and is in an idle state is waited;
calculating all paths from the current position to the task starting position of each idle AGV device through a dijkstra algorithm;
(9) after the current task to be executed is assigned, performing real-time path planning on the assigned AGV equipment, realizing automatic avoidance of other AGV equipment in the task execution process, and updating the execution state of the current task, the assigned AGV running state, the current AGV position coordinate and the node information of the remaining running paths in the database in real time;
the time window is the time spent by the AGV executing the task in the whole process of entering a certain intersection or a certain road section, and the time window is mainly used for marking the intersection or the driving road section occupied by the AGV so as to avoid deadlock or collision caused by the fact that other AGVs drive in the time period occupied by the intersection or the road section.
In order to avoid deadlock or collision conflict caused by competition of path resources between an AGV executing a task and other AGVs, the system inserts a reasonable and continuous time window for each ordered road section on the feasible path by using a time window algorithm;
(10) and after the task is executed, updating the state of the task in the database and the idle state of the current AGV to prepare for subsequently executing a new task. Marking the AGV executing the task as an idle state, marking the corresponding executed task in the database as the execution completion, and preventing the same task from being repeatedly executed. The idle AGV may execute the new task.
The following is further illustrated with reference to specific examples:
in the embodiment, a laser navigation coordinate system is established, after a field map is established, a running path node of an automatic guided transport vehicle (AGV) is established, attribute information of each running path node in the laser navigation coordinate system is determined, and a json map file of the field map file is generated;
confirming the AGV equipment information, storing the AGV equipment information in a database, reading a field map file by using an AGV dispatching system, dynamically storing the field map information, carrying out virtual mapping in the AGV dispatching system, reading the AGV equipment information in the database by using the AGV dispatching system, acquiring the available AGV equipment information in the field map, and storing the available AGV equipment information;
establishing communication links between an AGV dispatching system and all available AGV equipment, acquiring current position coordinates of the AGV equipment, detecting the positions of the AGV equipment according to site map information, determining that the current positions of the AGV equipment are all located in a navigation area, reading task requirements in an upper layer system through the AGV dispatching system, performing priority classification and sequencing on tasks to be executed which are not started to be executed according to emergency degree and task creation time, and determining current task information to be executed;
selecting all AGV equipment of corresponding types according to task information, wherein the current task information to be executed is internally provided with tasks to be executed, but no designated AGV equipment number exists, so that the judgment is needed, judging whether the number of AGV equipment which is controlled by a dispatching system, is in a non-communication interruption state and is in an idle state in a navigation area is more than 1 in the same type according to the types of the AGV equipment to be executed in the task information, acquiring all paths from the current position to the task starting position of each idle AGV equipment at the moment, calculating the occupied time of each path through a dijkstra algorithm, taking the path with the shortest time as an alternative path, judging the conflict condition of the occupied time windows of all running path nodes in the path, finding out the occupied time windows with conflicts, and selecting a new path with the occupied time only being more than the alternative path according to the sequence of the occupied time to judge the occupied time windows again, finding that the occupied time window does not conflict with other AGV equipment in a third path with the occupied time from short to long according to the new judgment, taking the path as an optimal path, and selecting the AGV equipment corresponding to the path as assigned AGV equipment of the current task to be executed;
and after the task execution is finished, updating the state of the task in the database and the idle state of the current AGV to prepare for the subsequent execution of a new task. Marking the AGV executing the task as an idle state, marking the corresponding executed task in the database as the execution completion, and preventing the same task from being repeatedly executed. The idle AGV may execute the new task.
While the present invention has been described in detail with reference to the preferred embodiments, it should be understood that the above description should not be taken as limiting the invention. Various modifications and alterations to this invention will become apparent to those skilled in the art upon reading the foregoing description. Accordingly, the scope of the invention should be determined from the following claims.

Claims (7)

1. An AGV intelligent scheduling method based on a time window is characterized by comprising the following steps:
(1) according to the characteristics of a field environment and the requirements of a scheduling task, establishing a laser navigation coordinate system, constructing a field map, planning and constructing the running path nodes of the AGV, determining the coordinates, types, positioning modes and path directions of the running path nodes in the laser navigation coordinate system, and generating a field map file according to the field map information;
(2) storing the AGV equipment type, the equipment number, the communication MAC address and the running state in a database according to the scheduling task requirement;
(3) reading a field map file by using an AGV (automatic guided vehicle) scheduling system, dynamically storing field map information, and performing virtual mapping in the AGV scheduling system;
the AGV dispatching system realizes AGV dispatching and management by reading a field map file and AGV equipment information and task information in a database;
(4) reading AGV equipment information in a database by using an AGV dispatching system, acquiring available AGV equipment information in a field map, storing the available AGV equipment information, and initializing the selected AGV equipment;
(5) establishing a communication link between an AGV dispatching system and all available AGV equipment;
(6) acquiring current position coordinates of each AGV device, performing position detection on each AGV device according to field map information, searching a running path node closest to the current position of each AGV device, judging whether the AGV device is in a navigation area or not according to the distance between the running path node and the current position of each AGV device, if so, adding the AGV device into an idle state AGV list, otherwise, the AGV device exceeds the navigation range, and after the position detection of all the AGV devices is finished, updating database data according to the detection result;
(7) reading task requirements in an upper layer system through an AGV dispatching system, and carrying out priority classification and sequencing on tasks to be executed which are not started to be executed according to the emergency degree and the task creation time;
the task to be executed comprises a task model, an initial position, a target position, a task priority and task creation time, wherein the task model comprises AGV equipment actions at the initial position, AGV equipment actions at the target position and AGV equipment types of the task to be executed;
(8) the tasks are executed according to the priority classification and the sequence of the tasks to be executed after the priority classification, and the AGV equipment is assigned according to the current information of the tasks to be executed;
(9) after the current task to be executed is assigned, performing real-time path planning on the assigned AGV equipment, realizing automatic avoidance of other AGV equipment in the task execution process, and updating the execution state of the current task, the assigned AGV running state, the current AGV position coordinate and the node information of the remaining running paths in the database in real time;
(10) and after the task is executed, updating the state of the task in the database to be the execution completion, and simultaneously updating the state of the selected AGV equipment after the task is completed to be an idle state to prepare for the subsequent execution of other tasks.
2. The AGV intelligent scheduling method based on time window of claim 1, wherein: matrix codes are arranged at positions, which need to be subjected to visual navigation and visual accurate positioning, in the running path nodes.
3. The AGV intelligent scheduling method based on time window of claim 1, wherein: and (6) before the position of each AGV device is detected, carrying out point-to-point directional communication by using an AGV dispatching system according to the serial number and the network address of the AGV device to be detected so as to acquire the current position coordinate of each AGV device.
4. The AGV intelligent scheduling method based on time window of claim 1, wherein: in the step (7), the upper system includes an MES system and an intelligent warehousing system, and the priority classification and sorting specifically includes: and sequencing the tasks to be executed according to the priority urgency degree of the tasks to be executed, and sequencing the tasks to be executed with the same priority according to the creation time sequence of the tasks.
5. The AGV intelligent scheduling method based on time window of claim 4, wherein: the time interval for reading the task demands in the upper layer system by the AGV dispatching system is 500 ms.
6. The AGV intelligent scheduling method based on time window of claim 1, wherein: in the step (8), all AGV devices of corresponding types are selected according to the AGV device types of the tasks to be executed in the current information of the tasks to be executed, wherein:
if no task to be executed exists in the current task information to be executed, the AGV equipment of the corresponding type continues to execute the original task or is ready;
if the current task information to be executed contains the task to be executed, judging whether the task information contains a designated AGV equipment number, if the designated AGV equipment number exists, the AGV equipment is in a scheduling system control and non-communication interruption state, is in a navigation area and is in an idle state, and assigning the current task information to be executed for the AGV equipment;
if no designated AGV equipment number exists, judging whether AGV equipment which is controlled by a dispatching system, is in a non-communication interruption state, is in a navigation area and is in an idle state exists in the same type or not according to the type of the AGV equipment of the task to be executed in the task information, and if the number of the idle AGV equipment is 1, directly assigning the AGV equipment; if the number of the idle AGV devices is more than 1, acquiring all paths from the current position to the task starting position of each idle AGV device, calculating the occupation time of each path, selecting the path with the shortest occupation time from all the paths of all the idle AGV devices as an alternative path, judging whether the occupation time windows of all the running path nodes in the selected alternative path conflict with other AGV devices, if the conflicting occupation time windows exist, selecting a new path with the occupation time only being more than that of the alternative path according to the occupation time sequence, judging the occupation time windows again until the new path with the occupation time window not conflicting with other AGV devices is selected as an optimal path, and selecting the AGV device corresponding to the path as an assigned AGV device of the current task to be executed; and if the number of the idle AGV equipment is 0, not assigning, and waiting for the AGV equipment which is controlled by the dispatching system, is in a non-communication interruption state, is in a navigation area and is in an idle state.
7. The AGV intelligent scheduling method based on time window of claim 6, wherein: and calculating all paths from the current position to the task starting position of each idle AGV device through a dijkstra algorithm.
CN202010560493.XA 2020-06-18 2020-06-18 AGV intelligent scheduling method based on time window Pending CN111798041A (en)

Priority Applications (2)

Application Number Priority Date Filing Date Title
CN202010560493.XA CN111798041A (en) 2020-06-18 2020-06-18 AGV intelligent scheduling method based on time window
PCT/CN2021/100483 WO2021254415A1 (en) 2020-06-18 2021-06-17 Time window-based agv intelligent scheduling method

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202010560493.XA CN111798041A (en) 2020-06-18 2020-06-18 AGV intelligent scheduling method based on time window

Publications (1)

Publication Number Publication Date
CN111798041A true CN111798041A (en) 2020-10-20

Family

ID=72803127

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202010560493.XA Pending CN111798041A (en) 2020-06-18 2020-06-18 AGV intelligent scheduling method based on time window

Country Status (2)

Country Link
CN (1) CN111798041A (en)
WO (1) WO2021254415A1 (en)

Cited By (10)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN112288270A (en) * 2020-10-28 2021-01-29 湖南大学 Scheduling method for complex rail transmission system
CN112506163A (en) * 2020-12-18 2021-03-16 长沙长泰智能装备有限公司 RGV avoidance control system and avoidance method
CN112541701A (en) * 2020-12-22 2021-03-23 珠海格力智能装备有限公司 Scheduling method and device based on scheduling system
CN113077643A (en) * 2021-03-23 2021-07-06 上海振华重工(集团)股份有限公司 Traffic control method, traffic control system and storage medium
CN113627775A (en) * 2021-08-04 2021-11-09 昆山塔米机器人有限公司 Robot scheduling method, device, equipment and storage medium
CN113716495A (en) * 2021-09-02 2021-11-30 衡阳宝坤机械制造有限公司 Intelligent storage forklift control system
CN113759909A (en) * 2021-09-02 2021-12-07 上海上实龙创智能科技股份有限公司 Control method, device and system for automatic navigation vehicle and storage medium
WO2021254415A1 (en) * 2020-06-18 2021-12-23 北京卫星制造厂有限公司 Time window-based agv intelligent scheduling method
CN114137960A (en) * 2021-11-01 2022-03-04 天行智控科技(无锡)有限公司 Unmanned vehicle cooperation method of intelligent transportation system of closed area
CN114326610A (en) * 2021-12-02 2022-04-12 一汽物流有限公司 AGV operation optimization system and method based on double-layer space-time network structure

Families Citing this family (23)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN114326621B (en) * 2021-12-25 2023-11-14 长安大学 Group intelligent airport consignment car scheduling method and system based on layered architecture
CN114415684A (en) * 2022-01-19 2022-04-29 深圳市今天国际物流技术股份有限公司 Corrugated paper packaging carton conveying method and system based on AGV trolley positioning
CN114485670A (en) * 2022-01-21 2022-05-13 清华大学 Path planning method and device for mobile unit, electronic equipment and medium
CN114648267B (en) * 2022-02-15 2023-04-18 无锡星智数服科技有限公司 Optimization method and system for dispatching path of automatic stereoscopic warehouse
CN114613140B (en) * 2022-03-18 2023-03-14 西安主函数智能科技有限公司 Intelligent scheduling method and device for cross area of unmanned vehicle
CN114880085B (en) * 2022-04-02 2024-02-20 合肥工业大学 Dynamic task scheduling method capable of realizing region expansion remapping
CN114655038B (en) * 2022-04-13 2023-08-29 益模(重庆)智能制造研究院有限公司 Guide vehicle operation scheduling method based on state of charge
CN114988036B (en) * 2022-06-07 2024-02-20 济宁市海富电子科技有限公司 Workshop semi-finished product transportation method based on Internet of things
CN114819420B (en) * 2022-06-29 2022-09-30 弥费实业(上海)有限公司 Overhead traveling crane transportation path planning method based on conflict resolution
CN115265522B (en) * 2022-09-27 2022-12-27 山东明源智能装备股份有限公司 Automatic navigation method and system for mine vehicles
CN115375251B (en) * 2022-10-27 2023-01-10 埃克斯工业有限公司 Material handling scheduling method, equipment and medium based on ROPN technology
CN116485302A (en) * 2023-04-06 2023-07-25 宝驷智慧物流(珠海)有限公司 Control system, method, equipment and medium for cross-border transportation
CN116562481B (en) * 2023-04-06 2023-12-15 江苏智慧工场技术研究院有限公司 AGV multi-target point autonomous navigation method, system, terminal and storage medium
CN116774603B (en) * 2023-04-18 2024-01-30 湖南大学 Multi-AGV cooperative scheduling simulation platform and simulation method
CN116205474B (en) * 2023-05-06 2023-07-18 深圳市森歌数据技术有限公司 AGV task allocation method and device for parking lot, electronic equipment and storage medium
CN116303475B (en) * 2023-05-17 2023-08-08 吉奥时空信息技术股份有限公司 Management method and device for intelligent storage of multi-source index data
CN117114215A (en) * 2023-06-27 2023-11-24 上海师范大学 Multi-vehicle conflict avoidance algorithm based on grid map self-adaptive time window
CN116542417B (en) * 2023-07-05 2023-09-12 泓浒(苏州)半导体科技有限公司 Control system and method for semiconductor production line conveying system
CN116757444B (en) * 2023-08-11 2023-11-14 无锡凯乐士科技有限公司 Method for dispatching folding trays of mobile robot
CN117151590A (en) * 2023-09-13 2023-12-01 哈尔滨理工大学 AGV scheduling method based on translation time window and task path planning
CN116934059B (en) * 2023-09-18 2023-12-19 华芯(嘉兴)智能装备有限公司 Crown block scheduling method, crown block scheduling device, crown block scheduling equipment and readable storage medium
CN117172398B (en) * 2023-10-31 2024-01-26 民航机场成都电子工程设计有限责任公司 Map node calculation method based on digital twin simulation platform
CN117826736A (en) * 2024-03-01 2024-04-05 西安诚合工业自动化设备有限公司 AGV trolley task allocation and charging management method

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN109976320A (en) * 2017-12-27 2019-07-05 中国科学院沈阳自动化研究所 A kind of more AGV paths planning methods based on time window on-line amending
WO2019141218A1 (en) * 2018-01-19 2019-07-25 库卡机器人(广东)有限公司 Conflict management method and system for multiple mobile robots
CN110989582A (en) * 2019-11-26 2020-04-10 北京卫星制造厂有限公司 Automatic avoidance type intelligent scheduling method for multiple AGV based on path pre-occupation
CN111026128A (en) * 2019-12-27 2020-04-17 芜湖哈特机器人产业技术研究院有限公司 Avoidance method of multi-laser AGV

Family Cites Families (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN111798041A (en) * 2020-06-18 2020-10-20 北京卫星制造厂有限公司 AGV intelligent scheduling method based on time window

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN109976320A (en) * 2017-12-27 2019-07-05 中国科学院沈阳自动化研究所 A kind of more AGV paths planning methods based on time window on-line amending
WO2019141218A1 (en) * 2018-01-19 2019-07-25 库卡机器人(广东)有限公司 Conflict management method and system for multiple mobile robots
CN110989582A (en) * 2019-11-26 2020-04-10 北京卫星制造厂有限公司 Automatic avoidance type intelligent scheduling method for multiple AGV based on path pre-occupation
CN111026128A (en) * 2019-12-27 2020-04-17 芜湖哈特机器人产业技术研究院有限公司 Avoidance method of multi-laser AGV

Cited By (13)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2021254415A1 (en) * 2020-06-18 2021-12-23 北京卫星制造厂有限公司 Time window-based agv intelligent scheduling method
CN112288270A (en) * 2020-10-28 2021-01-29 湖南大学 Scheduling method for complex rail transmission system
CN112288270B (en) * 2020-10-28 2023-09-29 湖南大学 Scheduling method for complex rail transmission system
CN112506163A (en) * 2020-12-18 2021-03-16 长沙长泰智能装备有限公司 RGV avoidance control system and avoidance method
CN112541701A (en) * 2020-12-22 2021-03-23 珠海格力智能装备有限公司 Scheduling method and device based on scheduling system
CN113077643B (en) * 2021-03-23 2022-05-03 上海振华重工(集团)股份有限公司 Traffic control method, traffic control system and storage medium
CN113077643A (en) * 2021-03-23 2021-07-06 上海振华重工(集团)股份有限公司 Traffic control method, traffic control system and storage medium
CN113627775A (en) * 2021-08-04 2021-11-09 昆山塔米机器人有限公司 Robot scheduling method, device, equipment and storage medium
CN113627775B (en) * 2021-08-04 2024-01-19 昆山塔米机器人有限公司 Scheduling method, device, equipment and storage medium of robot
CN113759909A (en) * 2021-09-02 2021-12-07 上海上实龙创智能科技股份有限公司 Control method, device and system for automatic navigation vehicle and storage medium
CN113716495A (en) * 2021-09-02 2021-11-30 衡阳宝坤机械制造有限公司 Intelligent storage forklift control system
CN114137960A (en) * 2021-11-01 2022-03-04 天行智控科技(无锡)有限公司 Unmanned vehicle cooperation method of intelligent transportation system of closed area
CN114326610A (en) * 2021-12-02 2022-04-12 一汽物流有限公司 AGV operation optimization system and method based on double-layer space-time network structure

Also Published As

Publication number Publication date
WO2021254415A1 (en) 2021-12-23

Similar Documents

Publication Publication Date Title
CN111798041A (en) AGV intelligent scheduling method based on time window
CN110989582B (en) Multi-AGV automatic avoiding type intelligent scheduling method based on path pre-occupation
CN111596658A (en) Multi-AGV collision-free operation path planning method and scheduling system
CN107168316B (en) Multi-AGV dispatching system based on single-direction and two-direction mixed paths
CN111103887B (en) Multi-sensor-based multi-mobile-robot scheduling system design method
CN107179078A (en) A kind of AGV paths planning methods optimized based on time window
CN107036618A (en) A kind of AGV paths planning methods based on shortest path depth optimization algorithm
CN108267149B (en) Conflict management method and system for multiple mobile robots
CN107368072A (en) A kind of AGV operation control systems and paths planning method that can configure based on map
CN114489062B (en) Workshop logistics-oriented multi-automatic guided vehicle distributed dynamic path planning method
TWI796017B (en) Automated guided vehicle scheduling method, electronic device and computer-readable storage medium
CN108268037B (en) Conflict management method and system for multiple mobile robots
JP2021071891A (en) Travel control device, travel control method, and computer program
CN116605574B (en) Parameter configuration and collaborative scheduling platform for large-scale robot picking system
CN116540656A (en) Digital twinning-based multi-AGV collision-free path scheduling method for manufacturing workshops
CN113919543A (en) AGV dispatching path optimization method based on 5G Internet of things
CN115220447A (en) Multi-robot motion scheduling method and device
CN113743747B (en) Multi-AGV cooperative scheduling method and device in workshop environment
CN113762597A (en) Intelligent AGV (automatic guided vehicle) scheduling system and method based on cloud platform management
CN113253726B (en) Magnetic navigation robot and navigation scheduling system under Internet of things
Zhao et al. Dynamic node allocation-based multirobot path planning
CN113835431B (en) Scheduling method and system for multiple four-way shuttle same-area jobs
CN214778857U (en) Scheduling system for automatic guided vehicle and product production line
CN114924538A (en) Multi-AGV real-time scheduling and conflict resolution method based on graph structure
CN114326713A (en) Multi-AGV mobile robot path optimization method based on two-dimensional code navigation

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