An AGV automatic control system and method for tobacco production workshop

Through the improved A* algorithm and real-time priority adjustment mechanism, the problem of AGV path planning and multiple AGV conflicts in complex tobacco production workshops is solved, and efficient and safe path planning and traffic are achieved.

CN118625771BActive Publication Date: 2024-11-15RETOO
View PDF 6 Cites 0 Cited by

Patent Information

Application Number
CN202411094187.6
Authority / Receiving Office
CN · China
Patent Type
Patents(China)
Current Assignee / Owner
Filing Date
2024-08-09
Publication Date
2024-11-15
Estimated Expiration
2044-08-09

AI Technical Summary

Technical Problem

The existing AGV automatic control method cannot effectively plan the optimal path in complex tobacco production workshop environments, and path conflicts are prone to occur during multi-AGV control, resulting in low traffic efficiency.

Method used

The improved A* algorithm is used for path planning, combining the actual cost function, heuristic cost function and punishment cost function, considering the slope, obstacles and time factors of the path, and resolving conflicts through real-time priority adjustment and calibration point locking mechanism to improve the path Search efficiency and pass efficiency.

Benefits of technology

More efficient and safe paths are generated, reducing the number of turns and avoidances, improving the efficiency and safety of AGV's trolleys, and solving the problem of path conflicts.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN118625771B_ABST
    Figure CN118625771B_ABST
Patent Text Reader

Abstract

This invention discloses an automatic control system and method for AGVs in a tobacco production workshop. The method includes: detecting environmental information in the tobacco production workshop and constructing a workshop environment map; receiving task requests sent by a cloud platform and performing path planning using an improved A* algorithm; the cloud platform, combining the task paths and time window information of each AGV currently performing a task, determining whether the current AGV's task path conflicts with the remaining path points in the task paths of other AGVs currently performing tasks; if no conflict exists, controlling the AGV to travel according to the task path; otherwise, performing secondary path planning for the AGV currently performing a task. This invention solves the problem of automatic control of AGVs in tobacco production workshops, obtaining safe and efficient automatic travel paths, and achieving efficient conflict avoidance, thereby improving work efficiency.
Need to check novelty before this filing date? Find Prior Art

Description

Technical Field

[0001] The invention belongs to the field of automation technology, and in particular relates to an AGV automatic control system and method for a tobacco production workshop. Background Art

[0002] AGV (Automated Guided Vehicle) is a vehicle equipped with an automatic guidance device that can automatically travel along the guidance equipment or through visual sensors. It is usually used for functions such as cargo handling in workshops. In production workshops, most of the time is spent on material storage, loading and unloading, and transportation. In recent years, with the development of intelligent control technology, autonomous driving technology has also matured. People have found that integrating intelligent control technology into the production process, especially using AGV automatic guided vehicles in production workshops, warehousing, logistics and other occasions, can greatly improve production efficiency, enhance corporate competitiveness, and promote the optimization and upgrading of corporate industrial structure.

[0003] At present, the control technology of a single AGV is relatively mature, but in a production workshop, a single AGV is usually unable to meet the scheduling and control of multiple tasks within the workshop; and because the production workshop environment is relatively complex, with complex roads such as slopes, one-way streets, narrow passages, and relatively complex obstacles, the existing AGV automatic control method cannot meet its automatic control in complex tobacco production workshops.

[0004] In the existing automatic path planning process of AGV vehicles, factors such as obstacles on the path, slope of the path, tortuosity of the path, path time, etc. are not taken into consideration, resulting in the inability to plan the optimal path; and the existing path planning does not adaptively adjust the weights of the path evaluation function, resulting in problems such as multiple node expansions, large amount of calculations, and low search efficiency in automatic path planning; and in the existing multi-AGV automatic control process, when the road section is a one-way street or a narrow channel, path conflicts are prone to occur, and the existing conflict resolution method is usually to lock the conflict area when a vehicle passes through the conflict area, and other vehicles wait, but this method has the problem of low traffic efficiency, which affects traffic efficiency. Summary of the invention

[0005] The object of the present invention is to provide an AGV automatic control system and method for a tobacco production workshop.

[0006] The technical solution of the present invention is as follows:

[0007] In one aspect, the present invention provides an AGV automatic control method for a tobacco production workshop, comprising the following steps:

[0008] S1: Detect environmental information of tobacco production workshop and build workshop environment map;

[0009] S2: Receive the task request sent by the cloud platform, which includes the task starting point and the task end point. The cloud platform selects the AGV closest to the task starting point of the task request from the idle AGVs according to the task starting point, uses the improved A* algorithm for path planning, generates a task path from the current position of the AGV through the task starting point to the task end point, and adds time window information.

[0010] S3: The cloud platform combines the task paths and time window information of each AGV that is performing a task, and determines whether the task path of the current AGV conflicts with the remaining path points in the task path of the AGV that is performing a task. If there is no conflict, execute step S5;

[0011] S4: If there is a conflict in the path, the AGV of the current task will be further planned for the secondary path to determine whether there is another conflict-free path; if there is a conflict-free path, the task path of the AGV is regenerated, and the time window information is added, and step S5 is executed; otherwise, the real-time priority of each conflicting task is calculated according to the time window of the conflicting task path and the preset priority of the corresponding task; the AGV is automatically controlled according to the real-time priority order, and the task path and time window information are updated;

[0012] S5: The cloud platform sends the task path and the corresponding time window information to the AGV, controls the AGV to drive according to the task path, and updates the path information and time window information in real time;

[0013] S6: Repeat steps S2-S5 until the automatic control of the AGVs requested by all tasks is completed.

[0014] Preferably, the real-time priority of each conflicting task is calculated according to the time window of the conflicting task path and the preset priority of the corresponding task. The calculation formula of the real-time priority is: ;in , k are adjustment parameters, is the total time of the unfinished task paths of task t, i is the preset priority of task t, The real-time priority calculated for task t.

[0015] Preferably, the automatic control of the AGV according to the real-time priority order specifically includes:

[0016] S11: Calibrate the path points of the conflicting road section, determine the path points that need to be calibrated, mark them as calibration points, sort the calibration points, and generate a calibration point sequence;

[0017] S12: determining the path point sequence of each path point of the task path of the AGV vehicle in order of priority;

[0018] S13: when it is determined that the path point sequence includes a calibration point, a calibration point in the path point sequence that has not been passed and has the smallest path point number is marked as a target calibration point, and it is determined whether all calibration points in the calibration point sequence whose calibration point numbers are less than or equal to the target calibration point number can be locked;

[0019] S14: If it can be locked, all the calibration points in the calibration point sequence whose calibration point numbers are less than or equal to the target calibration point numbers are locked, and the AGV is controlled to move; if it cannot be locked, return to step S13;

[0020] S15: When the AGV passes through the locked calibration point, the lock of the calibration point is released;

[0021] S16: Update the target calibration points of each AGV path, and determine whether all calibration points in the calibration point sequence whose calibration point numbers are less than or equal to the serial number of the new target calibration point can be locked; until all AGVs pass through the conflicting section, record the corresponding time window information.

[0022] Preferably, the path points that need to be calibrated include: a starting point, an end point and a path intersection of the conflicting road section, and the starting point, the end point and the path intersection are marked as calibration points.

[0023] Preferably, the updating of the target calibration point of each AGV vehicle path specifically includes: determining whether the unlocked calibration point is the calibration point with the smallest calibration point sequence number among the locked calibration points; if so, updating the target calibration point of the AGV vehicle path.

[0024] Preferably, determining whether all calibration points in the calibration point sequence whose calibration point numbers are less than or equal to the target calibration point's number can be locked specifically includes: determining whether all calibration points in the calibration point sequence whose calibration point numbers are less than or equal to the target calibration point's number are in a locked state; if not, then they can be locked; if there are calibration points in a locked state, determining whether the path direction of the calibration points in the locked state when locked is the same as the current path direction, and if they are the same, then they can be locked.

[0025] Preferably, due to the complex environment of tobacco production workshops, the traditional A* algorithm has a long search time and many turns; an improved A* algorithm is used for path planning, and the objective function of the improved A* algorithm includes setting the actual cost function, the heuristic cost function and the penalty cost function of the current path point, and setting the weight of each cost function to improve the search efficiency of the path; the objective function of the improved A* algorithm is: ;in is the actual cost function from the starting point to the current point; is the heuristic cost function from the current point to the end point; is the penalty cost function of the current point; ; s is the distance from the starting point to the end point; d is the distance from the current point to the end point; ;in is the number of obstacles from the starting point to the end point; M is the shortest distance of the obstacle; is the coordinate of the end point of the path; is the coordinate of the starting point of the path; is the coefficient of the penalty cost function.

[0026] Preferably, the actual cost function is: ;

[0027] The heuristic cost function is: ;

[0028] The penalty cost function is: ; where n is the current point and g is the end point, is the coordinate of path point i; is the path slope of path point i; is the speed of the AGV; is the load of the AGV; It is the angle between the current point and the previous node and the next node.

[0029] Preferably, the improved A* algorithm is used for path planning to generate a task path from the current position of the AGV through the task starting point to the task end point, and time window information is added, specifically including: judging whether the current position of the AGV is the task starting point, if the current position is the task starting point, then using the improved A* algorithm to plan the path from the task starting point to the task end point to generate the optimal task path; if the current position is not the task starting point, then using the improved A* algorithm to plan the first path from the current position to the task starting point, and using the improved A* algorithm to plan the second path from the task starting point to the task end point, merging the first path and the second path to obtain the optimal task path of the AGV; adding time marks to the path points of the task path according to the speed and driving time of the AGV vehicle.

[0030] On the other hand, the present invention also provides an AGV automatic control system for a tobacco production workshop, including a cloud platform and a plurality of AGV carts; the AGV carts include a map module, a sensor module, a communication module, a control module, and a drive module;

[0031] The AGV communicates with the cloud platform through the communication module;

[0032] The sensor module is used to obtain the environmental information of the tobacco production workshop and the location information of the AGV;

[0033] The map module is used to construct a real-time environment map based on the environment information of the tobacco production workshop obtained by the sensor module, the location information of the AGV car and the original map of the tobacco production workshop;

[0034] The control module uses the above control method to automatically control the AGV; the drive module drives the AGV to travel.

[0035] The present invention provides an AGV automatic control system and method for a tobacco production workshop, which has the following beneficial effects:

[0036] 1. The present invention adopts an improved A* algorithm to plan the path of the AGV, sets the coefficients of the actual cost function and the heuristic cost function, automatically adjusts the coefficients by considering the distance from the current point to the end point, the number of obstacles and the closest distance of obstacles in the actual cost function and the heuristic cost function coefficients, and adds a penalty cost function, considering factors such as the slope of the path, the tortuosity of the path, and the path time, so that the path can have fewer turns, be away from obstacles, and have high calculation efficiency;

[0037] 2. Set up a multi-AGV conflict resolution method. When the road section is a one-way street or a narrow passage, determine the real-time priority of the conflicting AGV based on the actual situation. By setting calibration points on the conflicting section and partially locking the section, multiple vehicles in the narrow passage can be allowed to pass at the same time, improving the travel efficiency and safety of AGVs in the conflicting section. BRIEF DESCRIPTION OF THE DRAWINGS

[0038] Figure 1 This is a flow chart of the AGV automatic control method for a tobacco production workshop of the present invention;

[0039] Figure 2 This is a block diagram of the AGV automatic control system for a tobacco production workshop of the present invention;

[0040] Figure 3 This is a schematic diagram of a road section with a single-lane narrow channel. DETAILED DESCRIPTION

[0041] The following will be combined with the drawings in the embodiments of the present invention to clearly and completely describe the technical solutions in the embodiments of the present invention. Obviously, the described embodiments are only part of the embodiments of the present invention, not all of the embodiments. Based on the embodiments of the present invention, all other embodiments obtained by ordinary technicians in this field without creative work are within the scope of protection of the present invention.

[0042] First embodiment: Figure 1 This embodiment provides an AGV automatic control method for a tobacco production workshop, comprising the following steps:

[0043] S1: Detect the environmental information of the tobacco production workshop and build a workshop environment map.

[0044] S2: Receive the task request sent by the cloud platform, which includes the task starting point and the task end point. According to the task starting point, the cloud platform selects the AGV closest to the task starting point of the task request from the idle AGVs, uses the improved A* algorithm for path planning, generates a task path from the current position of the AGV through the task starting point to the task end point, and adds time window information.

[0045] Due to the complex environment of the tobacco production workshop, the traditional A* algorithm has a long search time and many turns; the improved A* algorithm is used for path planning.

[0046] The objective function of the improved A* algorithm includes setting the actual cost function, heuristic cost function and penalty cost function of the current path point, and setting the weight of each cost function to improve the path search efficiency; the objective function of the improved A* algorithm is: ;

[0047] Wherein, the actual cost function is: ;

[0048] The heuristic cost function is: ;

[0049] The penalty cost function is: ;

[0050] Among them, n is the current point, g is the end point, is the coordinate of path point i; is the path slope of path point i; by dividing the Euclidean distance between two points by the cosine value of the slope of the path point, the actual distance cost considering the slope can be obtained; is the coefficient of the penalty cost function; ; s is the distance from the starting point to the end point; d is the distance from the current point to the end point; ;in is the number of obstacles from the starting point to the end point; M is the shortest distance of the obstacle; is the coordinate of the end point of the path; is the coordinate of the starting point of the path; is the coefficient of the penalty cost function; by setting the coefficients of the adaptive actual cost function and the heuristic cost function, the distance from the current point to the end point, the number of obstacles and the closest distance of the obstacles are considered in the actual cost function and the heuristic cost function coefficients, the search efficiency can be improved, obstacles can be kept away, and an efficient and safe path can be obtained; the penalty cost function is: ; where n is the current point and g is the end point, is the coordinate of path point i; is the speed of the AGV; is the load of the AGV; It is the angle between the current point and the previous node and the next node.

[0051] Preferably, the improved A* algorithm is used for path planning to generate a task path from the current position of the AGV through the task starting point to the task end point, and time window information is added, specifically including: judging whether the current position of the AGV is the task starting point, if the current position is the task starting point, then using the improved A* algorithm to plan the path from the task starting point to the task end point to generate the optimal task path; if the current position is not the task starting point, then using the improved A* algorithm to plan the first path from the current position to the task starting point, and using the improved A* algorithm to plan the second path from the task starting point to the task end point, merging the first path and the second path to obtain the optimal task path of the AGV; adding time marks to the path points of the task path according to the speed and driving time of the AGV vehicle.

[0052] S3: The cloud platform combines the task path and time window information of each AGV vehicle that is performing a task to determine whether the task path of the current AGV conflicts with the remaining path points in the task path of the AGV vehicle that is performing a task. If there is no conflict, execute step S5.

[0053] S4: If there is a conflict in the path, the AGV car of the current task will perform secondary path planning to determine whether there are other conflict-free paths; if there is a conflict-free path, the task path of the AGV is regenerated, and the time window information is added, and step S5 is executed; otherwise, the real-time priority of each conflicting task is calculated based on the time window of the conflicting task path and the preset priority of the corresponding task; the AGV is automatically controlled according to the real-time priority order, and the task path and time window information are updated.

[0054] Preferably, the automatic control of the AGV according to the real-time priority order specifically includes:

[0055] S11: Calibrate the path points of the conflicting road section, determine the path points that need to be calibrated, and mark them as calibration points, sort the calibration points, and generate a calibration point sequence; the path points that need to be calibrated include: the starting point, end point and path intersection of the conflicting road section, and the starting point, end point and path intersection are marked as calibration points.

[0056] like Figure 3 As shown, it is a conflicting section. The waypoints K1, K2, K3, K4, K5, and K6 in the section are set as calibration points and sorted. The waypoint sequences are 1-6 respectively.

[0057] S12: Determine the path point sequence of each path point of the task path of the AGV vehicle in order of priority; if the current path of the AGV vehicle in the conflicting section is K1-K2-K7-K8; then the generated path point sequence is 1-4, that is, the sequence number of K1 is 1, the sequence number of K2 is 2, the sequence number of K7 is 3, and the sequence number of K8 is 4.

[0058] S13: when it is determined that the path point sequence includes a calibration point, a calibration point in the path point sequence that has not been passed and has the smallest path point number is marked as a target calibration point, and it is determined whether all calibration points in the calibration point sequence whose calibration point numbers are less than or equal to the target calibration point number can be locked;

[0059] For example, in the path K1-K2-K7-K8, K1 is selected as the target calibration point, and only whether K1 can be locked is determined;

[0060] If the path is K9-K4-K3-K2-K1, the generated path point sequence is 1-5, that is, K9 is number 1, K4 is number 2, K3 is number 3, K2 is number 4, and K1 is number 5; K4 is the target calibration point, then determine whether K4-K3-K2-K1 can be locked.

[0061] S14: If it can be locked, then lock all the calibration points in the calibration point sequence whose calibration point numbers are less than or equal to the target calibration point number, and control the AGV movement; if it cannot be locked, return to step S13.

[0062] S15: When the AGV passes through the locked calibration point, the lock of the calibration point is released;

[0063] S16: Update the target calibration points of each AGV path, and determine whether all calibration points in the calibration point sequence whose calibration point numbers are less than or equal to the serial number of the new target calibration point can be locked; until all AGVs pass through the conflicting section, record the corresponding time window information.

[0064] Preferably, the updating of the target calibration point of each AGV vehicle path specifically includes: determining whether the unlocked calibration point is the calibration point with the smallest calibration point sequence number among the locked calibration points; if so, updating the target calibration point of the AGV vehicle path.

[0065] Preferably, determining whether all calibration points in the calibration point sequence whose calibration point numbers are less than or equal to the target calibration point's number can be locked specifically includes: determining whether all calibration points in the calibration point sequence whose calibration point numbers are less than or equal to the target calibration point's number are in a locked state; if not, then they can be locked; if there are calibration points in a locked state, determining whether the path direction of the calibration points in the locked state when locked is the same as the current path direction, and if they are the same, then they can be locked.

[0066] If the paths are the first path K1-K2-K7-K8 and the second path K1-K2-K3-K4-K9, if the first path has locked the calibration point K1, when the second path also needs to lock K1, because they have the same driving direction, both paths can lock K1 at the same time, thereby achieving efficient synchronous operation.

[0067] S5: The cloud platform sends the task path and the corresponding time window information to the AGV, controls the AGV to drive according to the task path, and updates the path information and time window information in real time.

[0068] S6: Repeat steps S2-S5 until the automatic control of the AGVs requested by all tasks is completed.

[0069] Preferably, the real-time priority of each conflicting task is calculated according to the time window of the conflicting task path and the preset priority of the corresponding task. The calculation formula of the real-time priority is: ;in , k are adjustment parameters, is the total time of the unfinished task paths of task t, i is the preset priority of task t, The real-time priority calculated for task t.

[0070] Second embodiment: Figure 2 A tobacco production workshop AGV automatic control system includes a cloud platform and multiple AGV vehicles; the AGV vehicle includes a map module, a sensor module, a communication module, a control module, and a drive module;

[0071] The AGV communicates with the cloud platform through the communication module;

[0072] The sensor module is used to obtain the environmental information of the tobacco production workshop and the location information of the AGV;

[0073] The map module is used to construct a real-time environment map based on the environment information of the tobacco production workshop obtained by the sensor module, the location information of the AGV car and the original map of the tobacco production workshop;

[0074] The control module uses the above control method to automatically control the AGV; the drive module drives the AGV to travel.

[0075] In a third embodiment, the present invention provides a computer-readable storage medium, comprising one or more programs for execution by one or more processors of an electronic device, wherein the one or more programs include instructions for executing the aforementioned method for automatic control of an AGV in a tobacco production workshop.

[0076] The above description is only a preferred embodiment of the present invention and is not intended to limit the present invention. Any modifications, equivalent substitutions and improvements made within the spirit and principles of the present invention should be included in the protection scope of the present invention.

Claims

1. A tobacco production workshop AGV automatic control method, characterized in that: The steps include: S1: Detect environmental information of tobacco production workshop and build workshop environment map; S2: Receive the task request sent by the cloud platform, which includes the task starting point and the task end point. The cloud platform selects the AGV closest to the task starting point among the idle AGVs according to the task starting point, and uses the improved The algorithm performs path planning, generates a task path from the current position of the AGV through the task starting point to the task end point, and adds time window information; S3: The cloud platform combines the task paths and time window information of each AGV that is performing a task, and determines whether the task path of the current AGV conflicts with the remaining path points in the task path of the AGV that is performing a task. If there is no conflict, execute step S5; S4: If there is a conflict in the path, the AGV of the current task is further planned for the secondary path to determine whether there is another conflict-free path; if there is a conflict-free path, the task path of the AGV is regenerated, and the time window information is added, and step S5 is executed; otherwise, the real-time priority of each conflicting task is calculated according to the time window of the conflicting task path and the preset priority of the corresponding task; the AGV is automatically controlled according to the real-time priority order, and the task path and time window information are updated; The automatic control of the AGV according to the real-time priority order specifically includes: S11: Calibrate the path points of the conflicting road section, determine the path points that need to be calibrated, mark them as calibration points, sort the calibration points, and generate a calibration point sequence; S12: determining the path point sequence of each path point of the task path of the AGV vehicle in order of priority; S13: when it is determined that the path point sequence includes a calibration point, a calibration point in the path point sequence that has not been passed and has the smallest path point number is marked as a target calibration point, and it is determined whether all calibration points in the calibration point sequence whose calibration point numbers are less than or equal to the target calibration point number can be locked; S14: If it can be locked, all the calibration points in the calibration point sequence whose calibration point numbers are less than or equal to the target calibration point numbers are locked, and the AGV is controlled to move; if it cannot be locked, return to step S13; S15: When the AGV passes through the locked calibration point, the lock of the calibration point is released; S16: Update the target calibration points of each AGV path, and determine whether all calibration points in the calibration point sequence whose calibration point numbers are less than or equal to the serial number of the new target calibration point can be locked; until all AGVs pass through the conflicting section, and record the corresponding time window information; S5: The cloud platform sends the task path and the corresponding time window information to the AGV, controls the AGV to drive according to the task path, and updates the path information and time window information in real time; S6: Repeat steps S2-S5 until the automatic control of the AGVs requested by all tasks is completed; Using improved The improved algorithm performs path planning. The objective function of the algorithm includes the actual cost function, the heuristic cost function and the penalty cost function for setting the current path point; the improved The objective function of the algorithm is: ;in is the actual cost function from the starting point to the current point; is the heuristic cost function from the current point to the end point; is the penalty cost function of the current point; ; s is the distance from the starting point to the end point; d is the distance from the current point to the end point; ;in is the number of obstacles from the starting point to the end point; M is the shortest distance of the obstacle; is the coordinate of the end point of the path; is the coordinate of the starting point of the path; is the coefficient of the penalty cost function; The actual cost function is: ; The heuristic cost function is: ; The penalty cost function is: ; Among them, n is the current point, g is the end point, is the coordinate of path point i; is the path slope of path point i; is the speed of the AGV; is the load of the AGV; It is the angle between the current point and the previous node and the next node.

2. The AGV automatic control method for a tobacco production workshop according to claim 1, characterized in that: The real-time priority of each conflicting task is calculated according to the time window of the conflicting task path and the preset priority of the corresponding task. The calculation formula of the real-time priority is: ;in , k are adjustment parameters, is the total time of the unfinished task paths of task t, i is the preset priority of task t, The real-time priority calculated for task t.

3. The AGV automatic control method for a tobacco production workshop according to claim 2, characterized in that: The path points that need to be calibrated include: the starting point, the end point and the path intersection of the conflicting road section, and the starting point, the end point and the path intersection are marked as calibration points.

4. The AGV automatic control method for a tobacco production workshop according to claim 3, characterized in that: The updating of the target calibration point of each AGV vehicle path specifically includes: determining whether the unlocked calibration point is the calibration point with the smallest calibration point sequence number among the locked calibration points; if so, updating the target calibration point of the AGV vehicle path.

5. The AGV automatic control method for a tobacco production workshop according to claim 4, characterized in that: The improved The algorithm performs path planning, generates a task path from the current position of the AGV through the task starting point to the task end point, and adds time window information, including: Determine whether the current position of the AGV is the starting point of the task. If the current position is the starting point of the task, the improved The algorithm plans the path from the task starting point to the task end point and generates the optimal task path; if the current position is not the task starting point, the improved The algorithm plans the first path from the current position to the starting point of the task and adopts the improved The algorithm plans the second path from the task starting point to the task end point, merges the first path and the second path, and obtains the optimal task path for the AGV; according to the speed and driving time of the AGV, the path points of the task path are time-stamped.

6. An AGV automatic control system for a tobacco production workshop, characterized in that: It includes a cloud platform and multiple AGVs; the AGVs include a map module, a sensor module, a communication module, a control module, and a drive module; The AGV communicates with the cloud platform through the communication module; The sensor module is used to obtain the environmental information of the tobacco production workshop and the location information of the AGV; The map module is used to construct a real-time environment map based on the environment information of the tobacco production workshop obtained by the sensor module, the location information of the AGV car and the original map of the tobacco production workshop; The control module performs automatic control by using the AGV automatic control method for a tobacco production workshop as described in any one of claims 1 to 5; and the drive module drives the AGV trolley to travel.

7. A computer-readable storage medium, characterized in that: It comprises one or more programs executed by one or more processors of an electronic device, wherein the one or more programs comprise instructions for executing an AGV automatic control method for a tobacco production workshop as claimed in any one of claims 1 to 5.

Citation Information

Patent Citations

  • Multi-AGV collision-free operation path planning method and scheduling system

    CN111596658A

  • Multi-AGV path planning method and system based on time window and improved A* algorithm

    CN114924558A

  • Multi-AGV path planning method and device based on dynamic priority express distribution center

    CN115097843A

  • Multi-AGV scheduling conflict resolution method for sudden obstacles

    CN118092359A

  • Travel control device and computer program

    JP2021071795A