CN115293674A - Carrier moving path optimization method and device and electronic equipment - Google Patents

Carrier moving path optimization method and device and electronic equipment Download PDF

Info

Publication number
CN115293674A
CN115293674A CN202210814911.2A CN202210814911A CN115293674A CN 115293674 A CN115293674 A CN 115293674A CN 202210814911 A CN202210814911 A CN 202210814911A CN 115293674 A CN115293674 A CN 115293674A
Authority
CN
China
Prior art keywords
target
production line
carrier
determining
candidate
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
CN202210814911.2A
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.)
INA Intelligent Technology Zhejiang Co Ltd
Original Assignee
INA Intelligent Technology Zhejiang 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 INA Intelligent Technology Zhejiang Co Ltd filed Critical INA Intelligent Technology Zhejiang Co Ltd
Priority to CN202210814911.2A priority Critical patent/CN115293674A/en
Publication of CN115293674A publication Critical patent/CN115293674A/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/08Logistics, e.g. warehousing, loading or distribution; Inventory or stock management
    • G06Q10/083Shipping
    • G06Q10/0833Tracking
    • 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/08Logistics, e.g. warehousing, loading or distribution; Inventory or stock management
    • G06Q10/083Shipping
    • G06Q10/0835Relationships between shipper or supplier and carriers
    • G06Q10/08355Routing methods
    • 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

Landscapes

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

Abstract

The invention discloses a carrier movement path optimization method, a carrier movement path optimization device and electronic equipment, wherein the method comprises the steps of determining all candidate carrier movement paths based on the current position of a target carrier and a target transportation place; respectively determining equipment information corresponding to each production line and/or bridge station in the candidate carrier moving path, and inquiring unit weight values corresponding to the equipment information in a preset database; calculating the total weight score of the candidate vehicle moving path based on the actual length corresponding to each production line and/or bridge station and each unit weight score; and determining the candidate vehicle moving path with the highest total weight score as the target vehicle moving path. According to the method and the device, experience reckoning is carried out by designers according to actual measurement of different types of production line equipment or using conditions of historical related equipment, the optimal path with the highest total weight score is selected and determined as a standard, the transmission efficiency of the carrier is improved, and the transmission time of the carrier is shortened.

Description

Carrier movement path optimization method and device and electronic equipment
Technical Field
The application relates to the technical field of automatic control, in particular to a carrier moving path optimization method and device and electronic equipment.
Background
In the existing clothing production line, the hanging carriers are controlled by a single line, namely, each production line produces and controls independently. Along with the development of the industry, factories are increasingly large, the production efficiency of a single production line cannot meet the production requirements, the number of hanging lines of clothes in a factory area is dozens, and the production lines need to be matched with one another for production. The carriers need to be conveyed on each production line, the mode of the existing carrier conveying control method is single and fixed, the carrier conveying efficiency among a plurality of production lines is not high, and the conveying time in the conveying process is long.
Disclosure of Invention
In order to solve the above problems, embodiments of the present application provide a method and an apparatus for optimizing a moving path of a carrier, and an electronic device.
In a first aspect, an embodiment of the present application provides a method for optimizing a moving path of a vehicle, where the method includes:
determining a target transportation place of a target carrier, and determining all candidate carrier movement paths based on the current position of the target carrier and the target transportation place, wherein the candidate carrier movement paths at least comprise a production line;
respectively determining equipment information corresponding to each production line and/or bridge station in the candidate carrier moving path, and inquiring unit weight scores corresponding to the equipment information in a preset database;
calculating the total weight score of the candidate vehicle moving path based on the actual length corresponding to each production line and/or bridge station and each unit weight score;
and determining the candidate vehicle movement path with the highest total weight score as a target vehicle movement path, and controlling the target vehicle to move based on the target vehicle movement path.
Preferably, the determining the target transportation location of the target vehicle includes:
and reading carrier information of a target carrier, and determining a target transportation location of the target carrier based on the carrier information.
Preferably, the determining all candidate vehicle moving paths based on the current position of the target vehicle and the target transportation location, the candidate vehicle moving paths at least including one production line, includes:
determining a current position of the target vehicle and a current position of the target vehicle;
sequentially combining the production lines and the bridge stations according to the distance sequence corresponding to the current position of the target carrier to generate a candidate carrier moving path;
and repeating the step of combining the production lines and the bridging stations according to the distance sequence corresponding to the current position of the target carrier until all the candidate carrier moving paths covering all the combinations are generated.
Preferably, the determining the equipment information corresponding to each production line and/or bridge station in the candidate vehicle moving path and querying a unit weight score corresponding to the equipment information in a preset database respectively includes:
respectively determining equipment information corresponding to each production line and/or the bridging station in the candidate carrier moving path, wherein the equipment information comprises equipment types and equipment running speeds;
inquiring a unit weight score corresponding to the equipment type in a preset database;
and when at least two unit weight scores exist, selecting the unit weight score corresponding to the equipment running speed.
Preferably, after the unit weight score corresponding to the device information is queried in the preset database, the method further includes:
determining the working state of each of said production lines and/or said bridging stations;
reducing the unit weight score of the production line and/or the bridging station for which the operating condition is characterized as a failed repair condition.
Preferably, after the unit weight score corresponding to the device information is queried in the preset database, the method further includes:
counting the abnormal times of each production line and/or the bridging station every time a preset first time period passes;
reducing the unit weight score of the production line and/or the bridging station for which the number of anomalies is greater than a first preset number.
Preferably, the method further comprises:
counting the selection times of the target carrier moving path selected by each production line every time when a preset second time period passes;
and when the selection times corresponding to the target production line are larger than a second preset time, reducing the unit weight score of the target production line in the next second time period.
In a second aspect, an embodiment of the present application provides an apparatus for optimizing a moving path of a vehicle, the apparatus including:
the system comprises a determining module, a processing module and a control module, wherein the determining module is used for determining a target transportation position of a target carrier, and determining all candidate carrier moving paths based on the current position of the target carrier and the target transportation position, and the candidate carrier moving paths at least comprise a production line;
the query module is used for respectively determining equipment information corresponding to each production line and/or bridge station in the candidate carrier moving path and querying a unit weight score corresponding to the equipment information in a preset database;
the calculating module is used for calculating the total weight score of the candidate vehicle moving path based on the actual length corresponding to each production line and/or bridging station and each unit weight score;
and the control module is used for determining the candidate vehicle movement path with the highest total weight score as a target vehicle movement path and controlling the target vehicle to move based on the target vehicle movement path.
In a third aspect, an embodiment of the present application provides an electronic device, which includes a memory, a processor, and a computer program stored on the memory and executable on the processor, where the processor executes the computer program to implement the steps of the method as provided in the first aspect or any one of the possible implementation manners of the first aspect.
In a fourth aspect, the present application provides a computer-readable storage medium, on which a computer program is stored, where the computer program, when executed by a processor, implements the method as provided in the first aspect or any one of the possible implementations of the first aspect.
The beneficial effects of the invention are as follows: the designer carries out empirical calculation according to actual measurement of different types of production line equipment or use conditions of historical related equipment, unit weight scores are set for all the production line equipment, then the total weight scores of all the paths at the current moment are determined through calculation, the optimal path with the highest total weight score is selected and determined through taking the total weight scores as a standard, the transmission efficiency of the carrier is improved, and the transmission duration of the carrier is shortened.
Drawings
In order to more clearly illustrate the technical solutions in the embodiments of the present application, the drawings needed to be used in the embodiments will be briefly described below, and it is obvious that the drawings in the following description are only some embodiments of the present application, and it is obvious for those skilled in the art to obtain other drawings without creative efforts.
Fig. 1 is a schematic flowchart illustrating a method for optimizing a moving path of a vehicle according to an embodiment of the present disclosure;
fig. 2 is a schematic structural diagram of an optimization apparatus for a vehicle moving path according to an embodiment of the present disclosure;
fig. 3 is a schematic structural diagram of an electronic device according to an embodiment of the present application.
Detailed Description
The technical solutions in the embodiments of the present application will be clearly and completely described below with reference to the drawings in the embodiments of the present application.
In the following description, the terms "first," "second," and the like are used for descriptive purposes only and are not to be construed as indicating or implying relative importance. The following description provides embodiments of the present application, where different embodiments may be substituted or combined, and thus the present application is intended to include all possible combinations of the same and/or different embodiments described. Thus, if one embodiment includes features a, B, C and another embodiment includes features B, D, then this application should also be construed to include embodiments that include all other possible combinations of one or more of a, B, C, D, although such embodiments may not be explicitly recited in the following text.
The following description provides examples, and does not limit the scope, applicability, or examples set forth in the claims. Changes may be made in the function and arrangement of elements described without departing from the scope of the disclosure. Various examples may omit, substitute, or add various procedures or components as appropriate. For example, the described methods may be performed in an order different than the order described, and various steps may be added, omitted, or combined. Furthermore, features described with respect to some examples may be combined into other examples.
Referring to fig. 1, fig. 1 is a schematic flowchart illustrating a method for optimizing a moving path of a vehicle according to an embodiment of the present disclosure. In an embodiment of the present application, the method includes:
s101, determining a target transportation place of a target carrier, and determining all candidate carrier movement paths based on the current position of the target carrier and the target transportation place, wherein the candidate carrier movement paths at least comprise a production line.
The execution main body of the application can be a cloud server.
In the embodiment of the application, for a target carrier needing transportation control in a suspension system, a cloud server firstly determines a target transportation place to which the target carrier needs to be transported, so that a candidate carrier moving path which can be used for transporting the target carrier is determined according to the current position of the target from the target and the target transportation place to which the target needs to go. The target carrier is transported through a production line track of the hanging system, so that the candidate carrier moving path is determined to at least comprise one production line, and if more than two production lines exist, the candidate carrier is transported through a bridging station arranged between the production lines.
In one embodiment, the determining the target transportation location of the target vehicle includes:
and reading carrier information of the target carrier, and determining a target transportation place of the target carrier based on the carrier information.
In the embodiment of the present application, the target carriers are generally used for transporting clothes in a hanging system, and each target carrier may record related information of the target carrier by setting a two-dimensional code, a barcode, or the like. On the production line, a chip data recognition device is arranged at intervals to recognize the information of the target carrier and upload the information to the cloud server. Therefore, the cloud server determines the target transportation place to which the target carrier needs to be transported by reading the uploaded carrier information corresponding to the target carrier.
In one embodiment, the determining all candidate vehicle movement paths based on the current position of the target vehicle and the target transportation location, the candidate vehicle movement paths including at least one production line, includes:
determining each production line between the current position of the target vehicle and the target transportation location and a bridging station between each production line;
sequentially combining the production lines and the bridging stations according to the distance sequence corresponding to the current position of the target carrier to generate a candidate carrier moving path;
and repeating the step of combining the production lines and the bridging stations according to the distance sequence corresponding to the current position of the target carrier until all the candidate carrier moving paths covering all the combinations are generated.
In the embodiment of the application, the structure of the whole hanging system is generally complex and consists of a plurality of production lines and bridging stations for connecting the production lines. The cloud server firstly needs to determine which production lines and bridging stations exist between the current position and the target transportation location, and then combines the production lines and the bridging stations in sequence according to the distance sequence of the current position so as to generate a candidate vehicle moving path. On a certain path node, there may be multiple production lines that can be selected, that is, there are multiple combination ways for the path, and in order to determine the optimal path, the cloud server may traverse all combinations to determine all candidate vehicle movement paths.
S102, respectively determining equipment information corresponding to each production line and/or bridge station in the candidate carrier moving path, and inquiring unit weight scores corresponding to the equipment information in a preset database.
In the embodiment of the present application, a designer may perform empirical estimation according to actual measurements of different types of production line devices or usage conditions of historical related devices, so as to set different unit weight scores for each production line device and each bridging station, where the unit weight score is a weight score corresponding to a production line device or a bridging station in a unit length (e.g., 1 meter). The cloud server acquires equipment information of each production line and each bridging station forming a candidate carrier moving path, and inquires in a preset database through the equipment information to determine a unit weight score corresponding to each production line/bridging station.
In one possible embodiment, step S102 includes:
respectively determining equipment information corresponding to each production line and/or the bridging station in the candidate carrier moving path, wherein the equipment information comprises equipment types and equipment running speeds;
inquiring unit weight scores corresponding to the equipment types in a preset database;
and when at least two unit weight scores exist, selecting the unit weight score corresponding to the equipment running speed.
In the embodiment of the application, the cloud server determines the corresponding device types by respectively acquiring the device information of each production line and the bridge station. The unit weight score set corresponding to the equipment type can be inquired in the database through the equipment type. In addition, for some production line equipment, the track speed is not fixed but can be adjusted, and the transportation efficiency of the target vehicle is different under different equipment running speeds, so for the equipment, designers can set different unit weight scores according to different speeds. Therefore, if the cloud server queries more than two unit weight scores, the cloud server needs to select the matched unit weight score according to the device running speed in the device information to perform subsequent calculation.
In an implementation manner, after querying the unit weight score corresponding to the device information in the preset database, the method further includes:
determining the working state of each said production line and/or said bridging station;
reducing the unit weight score of the production line and/or the bridging station for which the operating condition is characterized as a failed repair condition.
In the present embodiment, during actual operation of the suspension system, portions of the production lines or bridging stations may fail or undergo routine maintenance, and the target vehicle should not be transported past these production lines or bridging stations. Therefore, when the cloud server determines the production lines or the bridging stations in the fault maintenance state, the corresponding unit weight scores of the production lines or the bridging stations are reduced, so that the final weight scores of the paths of the selected production lines are not the highest, and the production lines are prevented from being selected in actual transportation.
In an implementation manner, after the querying a unit weight score corresponding to the device information in a preset database, the method further includes:
counting the abnormal times of each production line and/or bridging station every preset first time period;
reducing the unit weight score of the production line and/or the bridging station for which the number of anomalies is greater than a first preset number.
In the embodiment of the present application, since different devices may be different according to actual device types, device operating environments, and structures, part of the production lines or bridging stations may be more prone to failure and damage, and such production lines should be avoided as much as possible during transportation to ensure good transportation of the target carrier. Specifically, the number of times of abnormality of each production line and each bridge station in the period is counted by taking the first time period as an interval, and for an object with the abnormality number greater than the first preset number, the object is considered to be easy to fail, and the unit weight score of the object is reduced, so that the object is prevented from being selected in large quantities in actual transportation.
And S103, calculating the total weight score of the candidate vehicle moving path based on the actual length corresponding to each production line and/or bridge station and each unit weight score.
In the embodiment of the application, after the production line/bridging station is well arranged and constructed, the structure is fixed, and the actual length of each production line/bridging station can be stored in the cloud server. The actual length is multiplied by the unit weight score, so that the weight score of each production line or bridging station can be calculated, and then the total weight score of the candidate vehicle moving path can be obtained by adding all the weight scores.
S104, determining the candidate vehicle movement path with the highest total weight score as a target vehicle movement path, and controlling the target vehicle to move based on the target vehicle movement path.
In the embodiment of the present application, the higher the total weight score is, the better the candidate vehicle moving path is considered to be, so the cloud server determines the candidate vehicle moving path with the highest total weight score as the finally selected target vehicle moving path, and controls the target vehicle to move based on the target vehicle moving path.
In one embodiment, the method further comprises:
counting the selection times of the target carrier moving path selected by each production line every time when a preset second time period passes;
and when the selection times corresponding to the target production line are larger than a second preset time, reducing the unit weight score of the target production line in the next second time period.
In the embodiment of the application, as the practical situation may occur, some production lines with higher unit weight scores are always selected in the calculation process, while some production lines with lower unit weight scores are not selected, so that some production lines are idle, and the transportation of some production lines is overloaded. The cloud server counts the selected times of each production line and the bridge station at intervals of a second time period, if the selected times are larger than a second preset time, the production line is considered to be selected as a transportation route of more target carriers, and in order to avoid congestion caused by overlarge production line load, the unit weight value of the production line is temporarily reduced in the next second time period, so that other production lines are more easily selected as optimal paths in the next second time period, and the production line load is dynamically allocated.
The following describes in detail the optimization apparatus for a moving path of a vehicle according to an embodiment of the present application with reference to fig. 2. It should be noted that the apparatus for optimizing a moving path of a vehicle shown in fig. 2 is used for executing the method of the embodiment shown in fig. 1 of the present application, and for convenience of description, only the portions related to the embodiment of the present application are shown, and specific technical details are not disclosed, please refer to the embodiment shown in fig. 1 of the present application.
Referring to fig. 2, fig. 2 is a schematic structural diagram of an optimization device for a moving path of a carrier according to an embodiment of the present disclosure. As shown in fig. 2, the apparatus includes:
a determining module 201, configured to determine a target transportation location of a target vehicle, and determine all candidate vehicle movement paths based on a current location of the target vehicle and the target transportation location, where the candidate vehicle movement paths at least include one production line;
a query module 202, configured to determine device information corresponding to each of the production lines and/or the bridge stations in the candidate vehicle moving path, and query a unit weight score corresponding to the device information in a preset database;
a calculating module 203, configured to calculate a total weight score of the candidate vehicle movement path based on the actual length corresponding to each production line and/or bridging station and each unit weight score;
the control module 204 is configured to determine the candidate vehicle movement path with the highest total weight score as a target vehicle movement path, and control the target vehicle to move based on the target vehicle movement path.
In one possible implementation, the determining module 201 includes:
and the reading unit is used for reading the carrier information of the target carrier and determining the target transportation site of the target carrier based on the carrier information.
In one possible implementation, the determining module 201 further includes:
a first determination unit for determining each production line between the current position of the target vehicle and the target transportation location and a bridging station between the production lines;
the combination unit is used for sequentially combining the production lines and the bridging stations according to the distance sequence corresponding to the current position of the target carrier to generate a candidate carrier moving path;
and the repeating unit is used for repeating the step of combining the production lines and the bridging stations according to the distance sequence corresponding to the current position of the target carrier until all the candidate carrier moving paths covering all the combinations are generated.
In one possible implementation, the query module 202 includes:
a second determining unit, configured to determine device information corresponding to each production line and/or the bridging station in the candidate vehicle moving path, where the device information includes a device type and a device operating speed;
the query unit is used for querying a unit weight score corresponding to the equipment type in a preset database;
and the first judgment unit is used for selecting the unit weight score corresponding to the equipment running speed when at least two unit weight scores exist.
In one possible implementation, the query module 202 further includes:
a third determination unit for determining the working state of each of the production lines and/or the bridging stations;
a first adjustment unit for reducing the unit weight score of the production line and/or the bridging station for which the operating state is characterized as a trouble-shooting state.
In one possible implementation, the query module 202 further includes:
the first counting unit is used for counting the abnormal times of each production line and/or the bridging station every time a preset first time period passes;
a second adjusting unit for reducing the unit weight score of the production line and/or the bridging station, the number of abnormalities of which is greater than a first preset number.
In one embodiment, the apparatus further comprises:
the counting module is used for counting the selection times of the moving path of the target carrier selected by each production line every time when a preset second time period passes;
and the adjusting module is used for reducing the unit weight score of the target production line in the next second time period when the selection times corresponding to the target production line are larger than a second preset time.
It is clear to a person skilled in the art that the solution according to the embodiments of the present application can be implemented by means of software and/or hardware. The "unit" and "module" in this specification refer to software and/or hardware that can perform a specific function independently or in cooperation with other components, where the hardware may be, for example, a Field-Programmable Gate Array (FPGA), an Integrated Circuit (IC), or the like.
Each processing unit and/or module in the embodiments of the present application may be implemented by an analog circuit that implements the functions described in the embodiments of the present application, or may be implemented by software that executes the functions described in the embodiments of the present application.
Referring to fig. 3, a schematic structural diagram of an electronic device according to an embodiment of the present application is shown, where the electronic device may be used to implement the method in the embodiment shown in fig. 1. As shown in fig. 3, the electronic device 300 may include: at least one central processor 301, at least one network interface 304, a user interface 303, a memory 305, at least one communication bus 302.
Wherein a communication bus 302 is used to enable the connection communication between these components.
The user interface 303 may include a Display screen (Display) and a Camera (Camera), and the optional user interface 303 may further include a standard wired interface and a wireless interface.
The network interface 304 may optionally include a standard wired interface, a wireless interface (e.g., WI-FI interface), among others.
The central processor 301 may include one or more processing cores. The central processor 301 connects various parts within the entire electronic device 300 using various interfaces and lines, and performs various functions of the terminal 300 and processes data by executing or executing instructions, programs, code sets, or instruction sets stored in the memory 305 and calling data stored in the memory 305. Alternatively, the central Processing unit 301 may be implemented in at least one hardware form of Digital Signal Processing (DSP), field-Programmable Gate Array (FPGA), and Programmable Logic Array (PLA). The Central Processing Unit 301 may integrate one or a combination of a Central Processing Unit (CPU), a Graphics Processing Unit (GPU), a modem, and the like. Wherein, the CPU mainly processes an operating system, a user interface, an application program and the like; the GPU is used for rendering and drawing the content required to be displayed by the display screen; the modem is used to handle wireless communications. It is to be understood that the modem may not be integrated into the cpu 301, and may be implemented by a single chip.
The Memory 305 may include a Random Access Memory (RAM) or a Read-Only Memory (Read-Only Memory). Optionally, the memory 305 includes a non-transitory computer-readable medium. The memory 305 may be used to store instructions, programs, code sets, or instruction sets. The memory 305 may include a stored program area and a stored data area, wherein the stored program area may store instructions for implementing an operating system, instructions for at least one function (such as a touch function, a sound playing function, an image playing function, etc.), instructions for implementing the various method embodiments described above, and the like; the storage data area may store data and the like referred to in the above respective method embodiments. The memory 305 may alternatively be at least one storage device located remotely from the central processor 301. As shown in fig. 3, memory 305, which is a type of computer storage medium, may include an operating system, a network communication module, a user interface module, and program instructions.
In the electronic device 300 shown in fig. 3, the user interface 303 is mainly used for providing an input interface for a user to obtain data input by the user; the cpu 301 may be configured to call the optimization application of the vehicle moving path stored in the memory 305, and specifically perform the following operations:
determining a target transportation place of a target carrier, and determining all candidate carrier movement paths based on the current position of the target carrier and the target transportation place, wherein the candidate carrier movement paths at least comprise a production line;
respectively determining equipment information corresponding to each production line and/or bridge station in the candidate carrier moving path, and inquiring unit weight scores corresponding to the equipment information in a preset database;
calculating the total weight score of the candidate vehicle moving path based on the actual length corresponding to each production line and/or bridging station and each unit weight score;
and determining the candidate vehicle movement path with the highest total weight score as a target vehicle movement path, and controlling the target vehicle to move based on the target vehicle movement path.
The present application also provides a computer-readable storage medium having stored thereon a computer program which, when executed by a processor, carries out the steps of the above-mentioned method. The computer-readable storage medium may include, but is not limited to, any type of disk including floppy disks, optical disks, DVD, CD-ROMs, microdrive, and magneto-optical disks, ROMs, RAMs, EPROMs, EEPROMs, DRAMs, VRAMs, flash memory devices, magnetic or optical cards, nanosystems (including molecular memory ICs), or any type of media or device suitable for storing instructions and/or data.
It should be noted that, for simplicity of description, the above-mentioned method embodiments are described as a series of acts or combination of acts, but those skilled in the art will recognize that the present application is not limited by the order of acts described, as some steps may occur in other orders or concurrently depending on the application. Further, those skilled in the art should also appreciate that the embodiments described in the specification are preferred embodiments and that the acts and modules referred to are not necessarily required in this application.
In the foregoing embodiments, the descriptions of the respective embodiments have respective emphasis, and for parts that are not described in detail in a certain embodiment, reference may be made to the related descriptions of other embodiments.
In the embodiments provided in the present application, it should be understood that the disclosed apparatus may be implemented in other manners. For example, the above-described apparatus embodiments are merely illustrative, and for example, the division of the units is only one type of logical functional division, and other divisions may be realized in practice, for example, multiple units or components may be combined or integrated into another system, or some features may be omitted, or not executed. In addition, the shown or discussed mutual coupling or direct coupling or communication connection may be an indirect coupling or communication connection of some service interfaces, devices or units, and may be an electrical or other form.
The units described as separate parts may or may not be physically separate, and parts displayed as units may or may not be physical units, may be located in one position, or may be distributed on multiple network units. Some or all of the units can be selected according to actual needs to achieve the purpose of the solution of the embodiment.
In addition, functional units in the embodiments of the present application may be integrated into one processing unit, or each unit may exist alone physically, or two or more units are integrated into one unit. The integrated unit can be realized in a form of hardware, and can also be realized in a form of a software functional unit.
The integrated unit, if implemented in the form of a software functional unit and sold or used as a stand-alone product, may be stored in a computer readable memory. Based on such understanding, the technical solution of the present application may be substantially implemented or a part of or all or part of the technical solution contributing to the prior art may be embodied in the form of a software product stored in a memory, and including several instructions for causing a computer device (which may be a personal computer, a server, or a network device) to execute all or part of the steps of the method described in the embodiments of the present application. And the aforementioned memory comprises: various media capable of storing program codes, such as a usb disk, a Read-Only Memory (ROM), a Random Access Memory (RAM), a removable hard disk, a magnetic disk, or an optical disk.
Those skilled in the art will appreciate that all or part of the steps in the methods of the above embodiments may be implemented by a program, which is stored in a computer-readable memory, and the memory may include: flash disks, read-Only memories (ROMs), random Access Memories (RAMs), magnetic or optical disks, and the like.
The above description is only an exemplary embodiment of the present disclosure, and the scope of the present disclosure should not be limited thereby. That is, all equivalent changes and modifications made in accordance with the teachings of the present disclosure are intended to be included within the scope of the present disclosure. Embodiments of the present disclosure will be readily apparent to those skilled in the art from consideration of the specification and practice of the disclosure herein. This application is intended to cover any variations, uses, or adaptations of the disclosure following, in general, the principles of the disclosure and including such departures from the present disclosure as come within known or customary practice within the art to which the disclosure pertains. It is intended that the specification and examples be considered as exemplary only, with a true scope and spirit of the disclosure being indicated by the following claims.

Claims (10)

1. A method for optimizing a vehicle movement path, the method comprising:
determining a target transportation place of a target carrier, and determining all candidate carrier movement paths based on the current position of the target carrier and the target transportation place, wherein the candidate carrier movement paths at least comprise a production line;
respectively determining equipment information corresponding to each production line and/or bridge station in the candidate carrier moving path, and inquiring unit weight scores corresponding to the equipment information in a preset database;
calculating the total weight score of the candidate vehicle moving path based on the actual length corresponding to each production line and/or bridge station and each unit weight score;
and determining the candidate vehicle movement path with the highest total weight score as a target vehicle movement path, and controlling the target vehicle to move based on the target vehicle movement path.
2. The method of claim 1, wherein the determining the target transportation location of the target vehicle comprises:
and reading carrier information of a target carrier, and determining a target transportation location of the target carrier based on the carrier information.
3. The method of claim 1, wherein determining all candidate vehicle movement paths based on the current location of the target vehicle and the target transportation location, the candidate vehicle movement paths including at least one production line, comprises:
determining each production line between the current position of the target vehicle and the target transportation location and a bridging station between each production line;
sequentially combining the production lines and the bridge stations according to the distance sequence corresponding to the current position of the target carrier to generate a candidate carrier moving path;
and repeating the step of combining the production lines and the bridging stations according to the distance sequence corresponding to the current position of the target carrier until all the candidate carrier moving paths covering all the combinations are generated.
4. The method according to claim 3, wherein the determining the equipment information corresponding to each production line and/or bridge station in the candidate vehicle moving path respectively, and querying a predetermined database for the unit weight score corresponding to the equipment information comprises:
respectively determining equipment information corresponding to each production line and/or bridging station in the candidate vehicle moving path, wherein the equipment information comprises equipment types and equipment running speeds;
inquiring unit weight scores corresponding to the equipment types in a preset database;
and when at least two unit weight scores exist, selecting the unit weight score corresponding to the equipment running speed.
5. The method according to claim 1, wherein after querying the unit weight score corresponding to the device information in a preset database, the method further comprises:
determining the working state of each said production line and/or said bridging station;
reducing the unit weight score of the production line and/or the bridging station for which the operating condition is characterized as a failed repair condition.
6. The method according to claim 1, wherein after querying the unit weight score corresponding to the device information in a preset database, the method further comprises:
counting the abnormal times of each production line and/or the bridging station every time a preset first time period passes;
reducing the unit weight score of the production line and/or the bridging station for which the number of anomalies is greater than a first preset number.
7. The method of claim 1, further comprising:
counting the selection times of the moving path of the target carrier selected by each production line every time when a preset second time period passes;
and when the selection times corresponding to the target production line are larger than a second preset time, reducing the unit weight score of the target production line in the next second time period.
8. An apparatus for optimizing a movement path of a vehicle, the apparatus comprising:
the system comprises a determining module, a processing module and a control module, wherein the determining module is used for determining a target transportation position of a target carrier, and determining all candidate carrier moving paths based on the current position of the target carrier and the target transportation position, and the candidate carrier moving paths at least comprise a production line;
the query module is used for respectively determining equipment information corresponding to each production line and/or bridge station in the candidate carrier moving path and querying a unit weight score corresponding to the equipment information in a preset database;
the calculating module is used for calculating the total weight score of the candidate vehicle moving path based on the actual length corresponding to each production line and/or bridging station and each unit weight score;
and the control module is used for determining the candidate vehicle movement path with the highest total weight score as a target vehicle movement path and controlling the target vehicle to move based on the target vehicle movement path.
9. An electronic device comprising a memory, a processor and a computer program stored on the memory and executable on the processor, characterized in that the steps of the method according to any of claims 1-7 are implemented when the computer program is executed by the processor.
10. A computer-readable storage medium, on which a computer program is stored which, when being executed by a processor, carries out the steps of the method according to any one of claims 1 to 7.
CN202210814911.2A 2022-07-12 2022-07-12 Carrier moving path optimization method and device and electronic equipment Pending CN115293674A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202210814911.2A CN115293674A (en) 2022-07-12 2022-07-12 Carrier moving path optimization method and device and electronic equipment

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202210814911.2A CN115293674A (en) 2022-07-12 2022-07-12 Carrier moving path optimization method and device and electronic equipment

Publications (1)

Publication Number Publication Date
CN115293674A true CN115293674A (en) 2022-11-04

Family

ID=83821680

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202210814911.2A Pending CN115293674A (en) 2022-07-12 2022-07-12 Carrier moving path optimization method and device and electronic equipment

Country Status (1)

Country Link
CN (1) CN115293674A (en)

Similar Documents

Publication Publication Date Title
JP6671507B2 (en) Method and Apparatus for Returning to Robot Site {METHOD AND DEVICE FOR RETURNING ROBOTS FROM SITE}
CN112723052B (en) Elevator dispatching method and device
US10921791B2 (en) Production plan generation device, production plan generation method, and production plan
US20190369625A1 (en) Automatic charging system for robot and method thereof
CN105516347A (en) Method and device for load balance allocation of streaming media server
CN102932175A (en) Node partition dividing method, device and server
CN114971205A (en) Order dispatching method and system
CN114612049B (en) Path generation method and device, computer equipment and storage medium
CN115293676A (en) Carrier moving path optimization method and device and electronic equipment
CN115293677A (en) Carrier moving path optimization method and device and electronic equipment
CN115293675A (en) Carrier moving path optimization method and device and electronic equipment
CN115293674A (en) Carrier moving path optimization method and device and electronic equipment
CN109697117A (en) Terminal control method, device and computer readable storage medium
CN113888769A (en) Inspection method and device and electronic equipment
CN116280961A (en) Storage track full-bin feedback optimization method and device
CN112415953A (en) Elevator dispatching method and device
CN115220445A (en) Inspection control method and device of inspection unit and electronic equipment
CN115123775B (en) Transportation route selection method and device for heavy clothing and electronic equipment
US20190057351A1 (en) System and method for management of goods delivery
CN113361739A (en) Method and device for generating goods picking path
CN103619025A (en) Method and device for calculating network capacity
US20240045443A1 (en) Method for controlling a plurality of robots for environment maintenance
CN115187176B (en) Cargo transfer method and device for optimizing cargo storage space
CN116354011A (en) Carrier scheduling method and device of double-layer track structure and electronic equipment
CN115542895A (en) Abnormal inspection control method and device of inspection unit and electronic equipment

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