WO2024011850A1 - 一种载具移动路径的优化方法、装置及电子设备 - Google Patents

一种载具移动路径的优化方法、装置及电子设备 Download PDF

Info

Publication number
WO2024011850A1
WO2024011850A1 PCT/CN2022/139828 CN2022139828W WO2024011850A1 WO 2024011850 A1 WO2024011850 A1 WO 2024011850A1 CN 2022139828 W CN2022139828 W CN 2022139828W WO 2024011850 A1 WO2024011850 A1 WO 2024011850A1
Authority
WO
WIPO (PCT)
Prior art keywords
target
movement path
production line
vehicle movement
weight score
Prior art date
Application number
PCT/CN2022/139828
Other languages
English (en)
French (fr)
Inventor
翁端文
褚如昶
吕新
Original Assignee
浙江衣拿智能科技股份有限公司
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 浙江衣拿智能科技股份有限公司 filed Critical 浙江衣拿智能科技股份有限公司
Publication of WO2024011850A1 publication Critical patent/WO2024011850A1/zh

Links

Classifications

    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q10/00—Administration; Management
    • G06Q10/08—Logistics, e.g. warehousing, loading or distribution; Inventory or stock management
    • G06Q10/083—Shipping
    • G06Q10/0833—Tracking
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q10/00—Administration; Management
    • G06Q10/04—Forecasting or optimisation specially adapted for administrative or management purposes, e.g. linear programming or "cutting stock problem"
    • G06Q10/047—Optimisation of routes or paths, e.g. travelling salesman problem
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q10/00—Administration; Management
    • G06Q10/08—Logistics, e.g. warehousing, loading or distribution; Inventory or stock management
    • G06Q10/083—Shipping
    • G06Q10/0835—Relationships between shipper or supplier and carriers
    • G06Q10/08355—Routing methods
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q50/00—Information and communication technology [ICT] specially adapted for implementation of business processes of specific business sectors, e.g. utilities or tourism
    • G06Q50/04—Manufacturing

Definitions

  • the present application relates to the field of automatic control technology, and specifically, to an optimization method, device and electronic equipment for a vehicle movement path.
  • embodiments of the present application provide a method, device and electronic equipment for optimizing a carrier movement path.
  • embodiments of the present application provide a method for optimizing a vehicle movement path.
  • the method includes:
  • the equipment information includes the equipment weight score and expected transit time
  • the actual passage time it takes for the target carrier to pass through the production line is determined, and the corresponding time of the production line is adjusted based on the difference between the actual passage time and the expected passage time.
  • Equipment weight score is the average of the actual passage time and the expected passage time.
  • determining the target transportation location of the target vehicle includes:
  • the vehicle information of the target vehicle is read, and the target transportation location of the target vehicle is determined based on the vehicle information.
  • all candidate vehicle movement paths are determined based on the current location of the target vehicle and the target transportation location, and the candidate vehicle movement paths include at least one production line, including:
  • calculating the total weight score corresponding to each of the candidate vehicle movement paths based on each of the device information includes:
  • the weight scores of each device corresponding to each candidate vehicle movement path are respectively accumulated to obtain a total weight score corresponding to each candidate vehicle movement path.
  • the adjustment of the equipment weight score corresponding to the production line based on the difference between the actual passing time and the expected passing time includes:
  • mapping comparison table Query the preset mapping comparison table to determine the weight adjustment score corresponding to the difference range. Different difference mappings in the mapping comparison table correspond to different weight adjustment scores;
  • the equipment weight score corresponding to the production line is adjusted based on the weight adjustment score.
  • the adjustment of the equipment weight score corresponding to the production line based on the weight adjustment score includes:
  • embodiments of the present application provide a device for optimizing a carrier movement path, which device includes:
  • a determination module configured to determine the target transportation location of the target vehicle, and determine all candidate vehicle movement paths based on the current location of the target vehicle and the target transportation location, and the candidate vehicle movement paths include at least one production line;
  • a calculation module configured to respectively determine the equipment information of each production line in the candidate vehicle movement path, and calculate the total weight score corresponding to each candidate vehicle movement path based on each of the equipment information, where the equipment information includes Equipment weight score and expected transit time;
  • a control module configured to determine the candidate vehicle movement path with the highest total weight score as the target vehicle movement path, and control the movement of the target vehicle based on the target vehicle movement path;
  • An adjustment module configured to determine the actual passing time it takes for the target carrier to pass through one of the production lines each time the target carrier passes through the production line, and adjust the said target carrier based on the difference between the actual passing time and the expected passing time.
  • embodiments of the present application provide an electronic device, including a memory, a processor, and a computer program stored in the memory and executable on the processor.
  • the processor executes the computer program, the first Method steps provided by any possible implementation manner of the aspect or the first aspect.
  • embodiments of the present application provide a computer-readable storage medium on which a computer program is stored.
  • the computer program When the computer program is executed by a processor, the computer program implements the first aspect or any possible implementation of the first aspect. method provided.
  • each production line is set with an equipment weight score in advance, and the optimal target load is selected by calculating the total weight score of each candidate vehicle movement path based on the equipment weight score.
  • the actual passing time of the target vehicle through each production line is continuously determined during the actual movement of the target vehicle.
  • the corresponding equipment weight score is dynamically adjusted in real time to ensure that the target vehicle movement path selected in the subsequent process is the optimal path with the highest transportation efficiency, thereby ensuring that the target vehicle movement path is the most efficient path.
  • Tool transportation efficiency is
  • Figure 1 is a schematic flowchart of a method for optimizing a vehicle movement path provided by an embodiment of the present application
  • Figure 2 is a schematic structural diagram of a vehicle movement path optimization device provided by an embodiment of the present application.
  • FIG. 3 is a schematic structural diagram of an electronic device provided by an embodiment of the present application.
  • first and second are used for descriptive purposes only and shall not be understood as indicating or implying relative importance.
  • the following description provides multiple embodiments of the present application, and different embodiments can be replaced or combined. Therefore, the present application can also be considered to include all possible combinations of the same and/or different embodiments described. Thus, if one embodiment contains features A, B, C, and another embodiment contains features B, D, then the application should also be considered to include all other possible combinations containing one or more of A, B, C, D embodiment, although this embodiment may not be explicitly documented in the following content.
  • Figure 1 is a schematic flowchart of a method for optimizing a vehicle movement path provided by an embodiment of the present application.
  • the method includes:
  • S101 Determine the target transportation location of the target vehicle, and determine all candidate vehicle movement paths based on the current location of the target vehicle and the target transportation location.
  • the candidate vehicle movement paths include at least one production line.
  • the execution subject of this application may be a cloud server.
  • the cloud server will first determine the target transportation location to which it is to be transported, so as to determine the target vehicle's current location and the destination it needs to go to.
  • the target transportation location is used to determine the candidate vehicle movement path that can be used to transport it.
  • the target vehicle will be transported through the production line track of the suspension system, so it is determined that the candidate vehicle movement path will include at least one production line. If there are more than two production lines, it will also need to be transported through the bridge station set up between the production lines.
  • determining the target transportation location of the target vehicle includes:
  • the vehicle information of the target vehicle is read, and the target transportation location of the target vehicle is determined based on the vehicle information.
  • the target carrier is generally used to transport clothing in a hanging system.
  • Each target carrier can record relevant information of the target carrier by setting a QR code, a barcode, etc.
  • On the production line there is a chip data identification device at regular intervals to identify the target vehicle's information and upload it to the cloud server. Therefore, the cloud server will determine the target transportation location to which the target vehicle needs to be transported by reading the vehicle information corresponding to the uploaded target vehicle.
  • all candidate vehicle movement paths are determined based on the current location of the target vehicle and the target transportation location, and the candidate vehicle movement paths include at least one production line, including:
  • the structure of the entire hanging system is generally relatively complex and consists of many production lines and bridging stations used to connect each production line.
  • the cloud server first needs to determine which production lines and bridge stations exist between the current location and the target transportation location, and then combines each production line and bridge station in order of distance from the current location to generate a candidate vehicle movement path. On a certain path node, there may be multiple production lines to choose from, that is, there are many combinations of paths. In order to determine the optimal path, the cloud server will traverse all combinations and determine all candidate vehicle movements. path.
  • the equipment information includes the equipment weight score. value and expected transit time.
  • each production line is provided with equipment information.
  • the equipment information includes the equipment weight score set manually for the production line in advance based on experience and the estimated equipment weight score based on the moving speed of the transportation track on the production line and the length of the production line. expected transit time. Since the production lines included in each candidate vehicle movement path are known, based on the equipment weight scores of each production line, the total weight score corresponding to each candidate vehicle movement path can be calculated.
  • calculating the total weight score corresponding to each of the candidate vehicle movement paths based on each of the device information includes:
  • the weight scores of each device corresponding to each candidate vehicle movement path are respectively accumulated to obtain a total weight score corresponding to each candidate vehicle movement path.
  • the staff can set an equipment weight score for each production line in advance based on experience.
  • the higher the weight score the higher the transportation efficiency of the production line.
  • the total weight score of each candidate vehicle transportation route can be obtained.
  • the higher the total weight score the better the overall weight of the route.
  • the higher the transportation efficiency. By repeating the above calculation process, the total weight score corresponding to each candidate vehicle movement path can be determined.
  • the cloud server will determine the candidate vehicle movement path with the highest total weight score as the final selected target vehicle. Movement path, and the target vehicle is controlled to move based on the movement path of the target vehicle.
  • the actual passing time required for the target carrier to pass through the production line will fluctuate.
  • the cloud server will determine the actual passing time it takes for the target vehicle to pass through the production line, and determine the difference between the actual passing time and the expected passing time.
  • adjusting the equipment weight score corresponding to the production line based on the difference between the actual passing time and the expected passing time includes:
  • mapping comparison table Query the preset mapping comparison table to determine the weight adjustment score corresponding to the difference range. Different difference mappings in the mapping comparison table correspond to different weight adjustment scores;
  • the equipment weight score corresponding to the production line is adjusted based on the weight adjustment score.
  • the difference range to which the difference value belongs will first be determined. According to different difference ranges, different weight adjustment scores are set in advance through the mapping comparison table. Therefore, after determining the travel difference range, the weight adjustment score can be determined by querying the mapping comparison table, and the equipment weight score can be adjusted using the weight adjustment score.
  • adjusting the equipment weight score corresponding to the production line based on the weight adjustment score includes:
  • the device for optimizing the carrier movement path provided by the embodiment of the present application will be introduced in detail below with reference to Figure 2 . It should be noted that the optimization device of the carrier movement path shown in Figure 2 is used to execute the method of the embodiment shown in Figure 1 of the present application. For convenience of explanation, only the parts related to the embodiment of the present application are shown. If specific technical details are not disclosed, please refer to the embodiment shown in Figure 1 of this application.
  • Figure 2 is a schematic structural diagram of a device for optimizing a carrier movement path provided by an embodiment of the present application. As shown in Figure 2, the device includes:
  • the determination module 201 is used to determine the target transportation location of the target vehicle, and determine all candidate vehicle movement paths based on the current location of the target vehicle and the target transportation location.
  • the candidate vehicle movement paths include at least one production line. ;
  • the calculation module 202 is used to determine the equipment information of each production line in the candidate vehicle movement path, and calculate the total weight score corresponding to each candidate vehicle movement path based on each of the equipment information.
  • the equipment information Includes equipment weight score and expected transit time;
  • the control module 203 is configured to determine the candidate vehicle movement path with the highest total weight score as the target vehicle movement path, and control the movement of the target vehicle based on the target vehicle movement path;
  • the adjustment module 204 is configured to determine the actual passing time it takes for the target carrier to pass through one of the production lines each time the target carrier passes through the production line, and adjust the result based on the difference between the actual passing time and the expected passing time.
  • the determining module 201 includes:
  • the reading unit is configured to read the vehicle information of the target vehicle and determine the target transportation location of the target vehicle based on the vehicle information.
  • the determining module 201 further includes:
  • a first determination unit configured to determine each production line between the current position of the target carrier and the target transportation location and the bridging station between each of the production lines;
  • a combination unit configured to sequentially combine each of the production lines and bridge stations in order of distance corresponding to the current position of the target vehicle to generate a candidate vehicle movement path;
  • a repeating unit configured to repeat the step of combining the production lines and bridging stations in order of distance corresponding to the current position of the target carrier until all candidate carrier movement paths covering all combinations are generated.
  • the computing module 202 includes:
  • the first calculation unit is configured to accumulate the weight scores of each device corresponding to each candidate vehicle movement path, and obtain a total weight score corresponding to each candidate vehicle movement path.
  • the adjustment module 204 includes:
  • the second calculation unit is used to calculate the difference between the actual passage time and the expected passage time, and determine the difference range corresponding to the difference;
  • a query unit is used to query a preset mapping comparison table to determine the weight adjustment score corresponding to the difference range. Different difference mappings in the mapping comparison table correspond to different weight adjustment scores;
  • An adjustment unit configured to adjust the equipment weight score corresponding to the production line based on the weight adjustment score.
  • the “units” and “modules” in this specification refer to software and/or hardware that can independently complete or cooperate with other components to complete specific functions.
  • the hardware can be, for example, a field-programmable gate array (Field-Programmable Gate Array, FPGA), integrated circuit (Integrated Circuit, IC) etc.
  • Each processing unit and/or module in the embodiments of this application can be implemented by an analog circuit that implements the functions described in the embodiments of this application, or by software that performs the functions described in the embodiments of this application.
  • the electronic device 300 may include: at least one central processing unit 301 , at least one network interface 304 , a user interface 303 , a memory 305 , and at least one communication bus 302 .
  • the communication bus 302 is used to realize 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 also include a standard wired interface and a wireless interface.
  • Display display screen
  • Camera Camera
  • the optional user interface 303 may also include a standard wired interface and a wireless interface.
  • the network interface 304 may optionally include a standard wired interface and a wireless interface (such as a WI-FI interface).
  • the central processing unit 301 may include one or more processing cores.
  • the central processing unit 301 uses various interfaces and lines to connect various parts of the entire electronic device 300, by running or executing instructions, programs, code sets or instruction sets stored in the memory 305, and calling data stored in the memory 305, Execute various functions of the terminal 300 and process data.
  • the central processor 301 can use digital signal processing (Digital Signal Processing (DSP), Field-Programmable Gate Array (FPGA), Programmable Logic Array (Programmable Logic Array (PLA) in at least one form of hardware.
  • DSP Digital Signal Processing
  • FPGA Field-Programmable Gate Array
  • PDA Programmable Logic Array
  • the central processing unit 301 can integrate a central processing unit (CPU), a graphics central processing unit (Graphics Processing Unit) Unit, GPU) and modem, etc. One or a combination of several.
  • the CPU mainly handles the operating system, user interface, and applications; the GPU is responsible for rendering and drawing the content that needs to be displayed on the display; and the modem is used to handle wireless communications. It can be understood that the above-mentioned modem may not be integrated into the central processor 301 and may be implemented by a separate chip.
  • the memory 305 may include random access memory (Random Access Memory (RAM), which can also include read-only memory (Read-Only Memory).
  • the memory 305 includes non-transitory computer-readable media (non-transitory computer-readable storage medium).
  • Memory 305 may be used to store instructions, programs, codes, sets of codes, or sets of instructions.
  • the memory 305 may include a program storage area and a data storage area, where the program storage area may store instructions for implementing the operating system, instructions for at least one function (such as touch function, sound playback function, image playback function, etc.), Instructions, etc., used to implement each of the above method embodiments; the storage data area can store data, etc. involved in each of the above method embodiments.
  • the memory 305 may optionally be at least one storage device located away from the aforementioned central processor 301 .
  • memory 305 which is a computer storage medium, may include an operating system, a network communication module, a user interface module and program instructions.
  • the user interface 303 is mainly used to provide an input interface for the user and obtain the data input by the user; and the central processor 301 can be used to call the optimization of the vehicle movement path stored in the memory 305. application and specifically do the following:
  • the equipment information includes the equipment weight score and expected transit time
  • the actual passage time it takes for the target carrier to pass through the production line is determined, and the corresponding time of the production line is adjusted based on the difference between the actual passage time and the expected passage time.
  • Equipment weight score is the average of the actual passage time and the expected passage time.
  • This application also provides a computer-readable storage medium on which a computer program is stored, which implements the steps of the above method when executed by a processor.
  • the computer-readable storage medium may include, but is not limited to, any type of disk, including floppy disks, optical disks, DVDs, CD-ROMs, microdrives and magneto-optical disks, ROM, RAM, EPROM, EEPROM, DRAM, VRAM, 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.
  • the disclosed device can be implemented in other ways.
  • the device embodiments described above are only illustrative.
  • the division of the units is only a logical function division. In actual implementation, there may be other division methods.
  • multiple units or components may be combined or may be Integrated into another system, or some features can be ignored, or not implemented.
  • the coupling or direct coupling or communication connection between each other shown or discussed may be through some service interfaces, and the indirect coupling or communication connection of the devices or units may be in electrical or other forms.
  • the units described as separate components may or may not be physically separated, and the components shown as units may or may not be physical units, that is, they may be located in one place, or they may be distributed to multiple network units. Some or all of the units can be selected according to actual needs to achieve the purpose of the solution of this embodiment.
  • each functional unit in various embodiments of the present application may be integrated into one processing unit, or each unit may exist physically alone, or two or more units may be integrated into one unit.
  • the above integrated units can be implemented in the form of hardware or software functional units.
  • the integrated unit is implemented in the form of a software functional unit and sold or used as an independent product, it may be stored in a computer-readable memory.
  • the technical solution of the present application is essentially or contributes to the existing technology, or all or part of the technical solution can be embodied in the form of a software product, and the computer software product is stored in a memory, It includes several instructions to cause a computer device (which can be a personal computer, a server or a network device, etc.) to execute all or part of the steps of the methods described in various embodiments of this application.
  • the aforementioned memory includes: U disk, read-only memory (ROM), random access memory (Random Access Memory, RAM), mobile hard disk, magnetic disk or optical disk and other media that can store program code.
  • the program can be stored in a computer-readable memory.
  • the memory can include: flash memory. disk, read-only memory (Read-Only Memory, ROM), random access device (Random Access Memory (RAM), magnetic disk or optical disk, etc.

Landscapes

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

Abstract

本发明公开了一种载具移动路径的优化方法、装置及电子设备，该方法包括确定目标载具的目标运输地点，基于目标载具的当前位置和目标运输地点确定全部的候选载具移动路径；基于各设备信息计算各候选载具移动路径对应的总权重分值；将总权重分值最高的候选载具移动路径确定为目标载具移动路径，并基于目标载具移动路径控制目标载具移动；每当目标载具通过一个所述生产线，基于实际通过时间与预期通过时间的差值调整设备权重分值。本发明实现了根据实际通过时间与该生产线的预期通过时间来实时动态调整其所对应的设备权重分值，以此保证后续过程所选取的目标载具移动路径是运输效率最高的最优路径，进而保证目标载具的运输效率。

Description

一种载具移动路径的优化方法、装置及电子设备 技术领域
本申请涉及自动控制技术领域，具体而言，涉及一种载具移动路径的优化方法、装置及电子设备。
 背景技术
在现有的服装生产线中，吊挂载具都是单条线进行控制，即每条生产线独立生产、独立控制。
 技术问题
而随着行业的发展，工厂越来越大，单条生产线的生产效率已无法满足生产需求，厂区内服装的吊挂线多达几十条，且生产线之间需要配合生产。这使得载具需要在各生产线上传输，而目前的载具输送控制方法模式较为单一固定，多条生产线之间的载具传输效率不高，传输过程中的输送时间较长。
 技术解决方案
为了解决上述问题，本申请实施例提供了一种载具移动路径的优化方法、装置及电子设备。
第一方面，本申请实施例提供了一种载具移动路径的优化方法，所述方法包括：
确定目标载具的目标运输地点，基于所述目标载具的当前位置和所述目标运输地点确定全部的候选载具移动路径，所述候选载具移动路径至少包含一个生产线；
分别确定所述候选载具移动路径中各所述生产线的设备信息，基于各所述设备信息计算各所述候选载具移动路径对应的总权重分值，所述设备信息包括设备权重分值和预期通过时间；
将所述总权重分值最高的所述候选载具移动路径确定为目标载具移动路径，并基于所述目标载具移动路径控制所述目标载具移动；
每当所述目标载具通过一个所述生产线，确定所述目标载具通过所述生产线花费的实际通过时间，基于所述实际通过时间与预期通过时间的差值调整所述生产线对应的所述设备权重分值。
优选的，所述确定目标载具的目标运输地点，包括：
读取目标载具的载具信息，基于所述载具信息确定所述目标载具的目标运输地点。
优选的，所述基于所述目标载具的当前位置和所述目标运输地点确定全部的候选载具移动路径，所述候选载具移动路径至少包含一个生产线，包括：
确定所述目标载具的当前位置和所述目标运输地点之间的各生产线和各所述生产线之间的桥接站；
按与所述目标载具的当前位置对应的距离顺序依次组合各所述生产线和桥接站，生成候选载具移动路径；
重复所述按与所述目标载具的当前位置对应的距离顺序组合各所述生产线和桥接站的步骤，直至生成涵盖所有组合的全部所述候选载具移动路径。
优选的，所述基于各所述设备信息计算各所述候选载具移动路径对应的总权重分值，包括：
分别累加各所述候选载具移动路径对应的各所述设备权重分值，得到各所述候选载具移动路径对应的总权重分值。
优选的，所述基于所述实际通过时间与预期通过时间的差值调整所述生产线对应的所述设备权重分值，包括：
计算所述实际通过时间与预期通过时间的差值，确定所述差值对应的差值范围；
查询预设的映射对照表格，确定所述差值范围对应的权重调整分值，所述映射对照表格中不同差值映射对应有不同的权重调整分值；
基于所述权重调整分值调整所述生产线对应的所述设备权重分值。
优选的，所述基于所述权重调整分值调整所述生产线对应的所述设备权重分值，包括：
在预设的统计周期内，统计所有所述目标载具通过所述生产线后生成的所述权重调整分值；
计算所述统计周期内所有所述权重调整分值的平均调整分值，基于所述平均调整分值调整所述生产线对应的所述设备权重分值。
第二方面，本申请实施例提供了一种载具移动路径的优化装置，所述装置包括：
确定模块，用于确定目标载具的目标运输地点，基于所述目标载具的当前位置和所述目标运输地点确定全部的候选载具移动路径，所述候选载具移动路径至少包含一个生产线；
计算模块，用于分别确定所述候选载具移动路径中各所述生产线的设备信息，基于各所述设备信息计算各所述候选载具移动路径对应的总权重分值，所述设备信息包括设备权重分值和预期通过时间；
控制模块，用于将所述总权重分值最高的所述候选载具移动路径确定为目标载具移动路径，并基于所述目标载具移动路径控制所述目标载具移动；
调整模块，用于每当所述目标载具通过一个所述生产线，确定所述目标载具通过所述生产线花费的实际通过时间，基于所述实际通过时间与预期通过时间的差值调整所述生产线对应的所述设备权重分值。
第三方面，本申请实施例提供了一种电子设备，包括存储器、处理器及存储在存储器上并可在处理器上运行的计算机程序，所述处理器执行所述计算机程序时实现如第一方面或第一方面的任意一种可能的实现方式提供的方法的步骤。
第四方面，本申请实施例提供了一种计算机可读存储介质，其上存储有计算机程序，所述计算机程序被处理器执行时实现如第一方面或第一方面的任意一种可能的实现方式提供的方法。
 有益效果
本发明的有益效果为：预先为每个生产线设置有设备权重分值，通过根据各设备权重分值计算每条候选载具移动路径的总权重分值，以此来选择出最优的目标载具移动路径后，在目标载具实际移动过程中，持续确定其经过每个生产线的实际通过时间。根据实际通过时间与该生产线的预期通过时间来实时动态调整其所对应的设备权重分值，以此保证后续过程所选取的目标载具移动路径是运输效率最高的最优路径，进而保证目标载具的运输效率。
 附图说明
为了更清楚地说明本申请实施例中的技术方案，下面将对实施例中所需使用的附图作简单地介绍，显而易见地，下面描述中的附图仅仅是本申请的一些实施例，对于本领域普通技术人员来讲，在不付出创造性劳动的前提下，还可以根据这些附图获得其他的附图。
图1为本申请实施例提供的一种载具移动路径的优化方法的流程示意图；
图2为本申请实施例提供的一种载具移动路径的优化装置的结构示意图；
图3为本申请实施例提供的一种电子设备的结构示意图。
 本发明的实施方式
下面将结合本申请实施例中的附图，对本申请实施例中的技术方案进行清楚、完整地描述。
在下述介绍中，术语“第一”、“第二”仅为用于描述的目的，而不能理解为指示或暗示相对重要性。下述介绍提供了本申请的多个实施例，不同实施例之间可以替换或者合并组合，因此本申请也可认为包含所记载的相同和/或不同实施例的所有可能组合。因而，如果一个实施例包含特征A、B、C，另一个实施例包含特征B、D，那么本申请也应视为包括含有A、B、C、D的一个或多个所有其他可能的组合的实施例，尽管该实施例可能并未在以下内容中有明确的文字记载。
下面的描述提供了示例，并且不对权利要求书中阐述的范围、适用性或示例进行限制。可以在不脱离本申请内容的范围的情况下，对描述的元素的功能和布置做出改变。各个示例可以适当省略、替代或添加各种过程或组件。例如所描述的方法可以以所描述的顺序不同的顺序来执行，并且可以添加、省略或组合各种步骤。此外，可以将关于一些示例描述的特征组合到其他示例中。
参见图1，图1是本申请实施例提供的一种载具移动路径的优化方法的流程示意图。在本申请实施例中，所述方法包括：
S101、确定目标载具的目标运输地点，基于所述目标载具的当前位置和所述目标运输地点确定全部的候选载具移动路径，所述候选载具移动路径至少包含一个生产线。
本申请的执行主体可以是云端服务器。
在本申请实施例中，对于吊挂系统中需要进行运输控制的目标载具，云端服务器首先将确定其所要运输至的目标运输地点，以此来根据目标载具的当前位置和其需要前往的目标运输地点来确定出可以用于对其进行运输的候选载具移动路径。目标载具将通过吊挂系统的生产线轨道进行运输，故确定出候选载具移动路径至少将包含有一个生产线，若存在两个以上的生产线，还需要通过生产线之间设置的桥接站进行运输。
在一种可实施方式中，所述确定目标载具的目标运输地点，包括：
读取目标载具的载具信息，基于所述载具信息确定所述目标载具的目标运输地点。
在本申请实施例中，目标载具一般是用于吊挂系统中对衣物的运输，每个目标载具上都可以通过设置二维码、条形码等方式来记录该目标载具的相关信息。在生产线上，每隔一段距离便存在一个芯片数据识别装置来识别目标载具的信息，并将其上传至云端服务器。故云端服务器将通过读取上传的目标载具对应的载具信息的方式，确定出目标载具需要运往的目标运输地点。
在一种可实施方式中，所述基于所述目标载具的当前位置和所述目标运输地点确定全部的候选载具移动路径，所述候选载具移动路径至少包含一个生产线，包括：
确定所述目标载具的当前位置和所述目标运输地点之间的各生产线和各所述生产线之间的桥接站；
按与所述目标载具的当前位置对应的距离顺序依次组合各所述生产线和桥接站，生成候选载具移动路径；
重复所述按与所述目标载具的当前位置对应的距离顺序组合各所述生产线和桥接站的步骤，直至生成涵盖所有组合的全部所述候选载具移动路径。
在本申请实施例中，整个吊挂系统的结构一般比较复杂，由很多个生产线和用于连接各个生产线的桥接站组成。云端服务器首先需要通过当前位置和目标运输地点确定出二者之间存在有哪些生产线和桥接站，接着按照由当前位置的距离顺序来依次组合各个生产线和桥接站，以此生成一条候选载具移动路径。在某一路径节点上，是可能存在有多条生产线可以选择的，即路径存在有多种组合方式，为了确定出最优的路径，云端服务器会遍历所有组合，确定出全部的候选载具移动路径。
S102、分别确定所述候选载具移动路径中各所述生产线的设备信息，基于各所述设备信息计算各所述候选载具移动路径对应的总权重分值，所述设备信息包括设备权重分值和预期通过时间。
在本申请实施例中，每个生产线对应设置有设备信息，设备信息中包含有预先人工根据经验为该生产线设置的设备权重分值以及根据生产线上运输轨道的移动速度和生产线长度所预估出的预期通过时间。由于每条候选载具移动路径包含的生产线是已知的，根据各生产线的设备权重分值，便能够计算出每一条候选载具移动路径所对应的总权重分值。
在一种可实施方式中，所述基于各所述设备信息计算各所述候选载具移动路径对应的总权重分值，包括：
分别累加各所述候选载具移动路径对应的各所述设备权重分值，得到各所述候选载具移动路径对应的总权重分值。
在本申请实施例中，具体而言，对于每一个生产线，根据其结构、功能、负载、轨道运行速度等参数的不同，工作人员可以凭借经验预先为每一个生产线设置一个设备权重分值，设备权重分值越高则认为该生产线的运输效率更高。通过将一条候选载具运输路线中的各个生产线所对应的设备权重分值进行累加，则能够得到各候选载具运输路线的总权重分值，总权重分值越高，则说明该路线的整体运输效率越高。通过重复上述计算过程，便能够确定出每一条候选载具移动路径所对应的总权重分值。
S103、将所述总权重分值最高的所述候选载具移动路径确定为目标载具移动路径，并基于所述目标载具移动路径控制所述目标载具移动。
在本申请实施例中，总权重分值越高，则认为该候选载具移动路径越优，故云端服务器会将总权重分值最高的候选载具移动路径确定为最终所选择的目标载具移动路径，并且控制目标载具基于该目标载具移动路径来移动。
S104、每当所述目标载具通过一个所述生产线，确定所述目标载具通过所述生产线花费的实际通过时间，基于所述实际通过时间与预期通过时间的差值调整所述生产线对应的所述设备权重分值。
在本申请实施例中，根据生产线上实际挂载的载具数量的不同，即生产线繁忙程度的不同，目标载具经过该生产线所需要的实际通过时间是会产生波动的。为了能够确定出在当前情况下运输效率最高的路径，是需要考虑到每一条生产线的运输时间的波动状况的。因此，每当目标载具在控制下通过了一个生产线后，云端服务器便会确定出目标载具通过该生产线所花费的实际通过时间，并确定实际通过时间与预期通过时间的差值，根据差值来实时调整该生产线所对应的设备权重分值，使得后续其他目标载具进行最优路径的计算时，所使用的设备权重分值能够体现出生产线的真实情况，进而使得能够切实确定出运输效率最高的目标载具移动路径。
在一种可实施方式中，所述基于所述实际通过时间与预期通过时间的差值调整所述生产线对应的所述设备权重分值，包括：
计算所述实际通过时间与预期通过时间的差值，确定所述差值对应的差值范围；
查询预设的映射对照表格，确定所述差值范围对应的权重调整分值，所述映射对照表格中不同差值映射对应有不同的权重调整分值；
基于所述权重调整分值调整所述生产线对应的所述设备权重分值。
在本申请实施例中，将预先设置划分有若干个差值范围，计算出差值后，首先将确定出差值所属的差值范围。根据不同的差值范围，预先通过映射对照表格设置了不同的权重调整分值。故在确定出差值范围后，通过查询映射对照表格便能够确定出权重调整分值，并以该权重调整分值来对设备权重分值进行调整。
在一种可实施方式中，所述基于所述权重调整分值调整所述生产线对应的所述设备权重分值，包括：
在预设的统计周期内，统计所有所述目标载具通过所述生产线后生成的所述权重调整分值；
计算所述统计周期内所有所述权重调整分值的平均调整分值，基于所述平均调整分值调整所述生产线对应的所述设备权重分值。
在本申请实施例中，在实际情况中，同时会存在非常多的目标载具被控制运输，若每当有一个目标载具通过生产线便进行一次权值调整，将会造成大量无用的冗余数据。因此，可以设置一个统计周期，在统计周期内统计所有经过的目标载具所计算生成的权重调整分值，并在统计周期结束后，根据各个权重调整分值的平均值来调整设备权重分值，避免产生大量无用的冗余数据，提高数据计算处理效率。
下面将结合附图2，对本申请实施例提供的载具移动路径的优化装置进行详细介绍。需要说明的是，附图2所示的载具移动路径的优化装置，用于执行本申请图1所示实施例的方法，为了便于说明，仅示出了与本申请实施例相关的部分，具体技术细节未揭示的，请参照本申请图1所示的实施例。
请参见图2，图2是本申请实施例提供的一种载具移动路径的优化装置的结构示意图。如图2所示，所述装置包括：
确定模块201，用于确定目标载具的目标运输地点，基于所述目标载具的当前位置和所述目标运输地点确定全部的候选载具移动路径，所述候选载具移动路径至少包含一个生产线；
计算模块202，用于分别确定所述候选载具移动路径中各所述生产线的设备信息，基于各所述设备信息计算各所述候选载具移动路径对应的总权重分值，所述设备信息包括设备权重分值和预期通过时间；
控制模块203，用于将所述总权重分值最高的所述候选载具移动路径确定为目标载具移动路径，并基于所述目标载具移动路径控制所述目标载具移动；
调整模块204，用于每当所述目标载具通过一个所述生产线，确定所述目标载具通过所述生产线花费的实际通过时间，基于所述实际通过时间与预期通过时间的差值调整所述生产线对应的所述设备权重分值。
在一种可实施方式中，确定模块201包括：
读取单元，用于读取目标载具的载具信息，基于所述载具信息确定所述目标载具的目标运输地点。
在一种可实施方式中，确定模块201还包括：
第一确定单元，用于确定所述目标载具的当前位置和所述目标运输地点之间的各生产线和各所述生产线之间的桥接站；
组合单元，用于按与所述目标载具的当前位置对应的距离顺序依次组合各所述生产线和桥接站，生成候选载具移动路径；
重复单元，用于重复所述按与所述目标载具的当前位置对应的距离顺序组合各所述生产线和桥接站的步骤，直至生成涵盖所有组合的全部所述候选载具移动路径。
在一种可实施方式中，计算模块202包括：
第一计算单元，用于分别累加各所述候选载具移动路径对应的各所述设备权重分值，得到各所述候选载具移动路径对应的总权重分值。
在一种可实施方式中，调整模块204包括：
第二计算单元，用于计算所述实际通过时间与预期通过时间的差值，确定所述差值对应的差值范围；
查询单元，用于查询预设的映射对照表格，确定所述差值范围对应的权重调整分值，所述映射对照表格中不同差值映射对应有不同的权重调整分值；
调整单元，用于基于所述权重调整分值调整所述生产线对应的所述设备权重分值。
本领域的技术人员可以清楚地了解到本申请实施例的技术方案可借助软件和/或硬件来实现。本说明书中的“单元”和“模块”是指能够独立完成或与其他部件配合完成特定功能的软件和/或硬件，其中硬件例如可以是现场可编程门阵列（Field－Programmable Gate Array，FPGA）、集成电路（Integrated Circuit，IC）等。
本申请实施例的各处理单元和/或模块，可通过实现本申请实施例所述的功能的模拟电路而实现，也可以通过执行本申请实施例所述的功能的软件而实现。
参见图3，其示出了本申请实施例所涉及的一种电子设备的结构示意图，该电子设备可以用于实施图1所示实施例中的方法。如图3所示，电子设备300可以包括：至少一个中央处理器301，至少一个网络接口304，用户接口303，存储器305，至少一个通信总线302。
其中，通信总线302用于实现这些组件之间的连接通信。
其中，用户接口303可以包括显示屏（Display）、摄像头（Camera），可选用户接口303还可以包括标准的有线接口、无线接口。
其中，网络接口304可选的可以包括标准的有线接口、无线接口（如WI-FI接口）。
其中，中央处理器301可以包括一个或者多个处理核心。中央处理器301利用各种接口和线路连接整个电子设备300内的各个部分，通过运行或执行存储在存储器305内的指令、程序、代码集或指令集，以及调用存储在存储器305内的数据，执行终端300的各种功能和处理数据。可选的，中央处理器301可以采用数字信号处理（Digital Signal Processing，DSP）、现场可编程门阵列（Field-Programmable Gate Array，FPGA）、可编程逻辑阵列（Programmable Logic Array，PLA）中的至少一种硬件形式来实现。中央处理器301可集成中央中央处理器（Central Processing Unit，CPU）、图像中央处理器（Graphics Processing Unit，GPU）和调制解调器等中的一种或几种的组合。其中，CPU主要处理操作系统、用户界面和应用程序等；GPU用于负责显示屏所需要显示的内容的渲染和绘制；调制解调器用于处理无线通信。可以理解的是，上述调制解调器也可以不集成到中央处理器301中，单独通过一块芯片进行实现。
其中，存储器305可以包括随机存储器（Random Access Memory，RAM），也可以包括只读存储器（Read-Only Memory）。可选的，该存储器305包括非瞬时性计算机可读介质（non-transitory computer-readable storage medium）。存储器305可用于存储指令、程序、代码、代码集或指令集。存储器305可包括存储程序区和存储数据区，其中，存储程序区可存储用于实现操作系统的指令、用于至少一个功能的指令（比如触控功能、声音播放功能、图像播放功能等）、用于实现上述各个方法实施例的指令等；存储数据区可存储上面各个方法实施例中涉及到的数据等。存储器305可选的还可以是至少一个位于远离前述中央处理器301的存储装置。如图3所示，作为一种计算机存储介质的存储器305中可以包括操作系统、网络通信模块、用户接口模块以及程序指令。
在图3所示的电子设备300中，用户接口303主要用于为用户提供输入的接口，获取用户输入的数据；而中央处理器301可以用于调用存储器305中存储的载具移动路径的优化应用程序，并具体执行以下操作：
确定目标载具的目标运输地点，基于所述目标载具的当前位置和所述目标运输地点确定全部的候选载具移动路径，所述候选载具移动路径至少包含一个生产线；
分别确定所述候选载具移动路径中各所述生产线的设备信息，基于各所述设备信息计算各所述候选载具移动路径对应的总权重分值，所述设备信息包括设备权重分值和预期通过时间；
将所述总权重分值最高的所述候选载具移动路径确定为目标载具移动路径，并基于所述目标载具移动路径控制所述目标载具移动；
每当所述目标载具通过一个所述生产线，确定所述目标载具通过所述生产线花费的实际通过时间，基于所述实际通过时间与预期通过时间的差值调整所述生产线对应的所述设备权重分值。
本申请还提供一种计算机可读存储介质，其上存储有计算机程序，该程序被处理器执行时实现上述方法的步骤。其中，计算机可读存储介质可以包括但不限于任何类型的盘，包括软盘、光盘、DVD、CD-ROM、微型驱动器以及磁光盘、ROM、RAM、EPROM、EEPROM、DRAM、VRAM、闪速存储器设备、磁卡或光卡、纳米系统（包括分子存储器IC），或适合于存储指令和/或数据的任何类型的媒介或设备。
需要说明的是，对于前述的各方法实施例，为了简单描述，故将其都表述为一系列的动作组合，但是本领域技术人员应该知悉，本申请并不受所描述的动作顺序的限制，因为依据本申请，某些步骤可以采用其他顺序或者同时进行。其次，本领域技术人员也应该知悉，说明书中所描述的实施例均属于优选实施例，所涉及的动作和模块并不一定是本申请所必须的。
在上述实施例中，对各个实施例的描述都各有侧重，某个实施例中没有详述的部分，可以参见其他实施例的相关描述。
在本申请所提供的几个实施例中，应该理解到，所揭露的装置，可通过其它的方式实现。例如，以上所描述的装置实施例仅仅是示意性的，例如所述单元的划分，仅仅为一种逻辑功能划分，实际实现时可以有另外的划分方式，例如多个单元或组件可以结合或者可以集成到另一个系统，或一些特征可以忽略，或不执行。另一点，所显示或讨论的相互之间的耦合或直接耦合或通信连接可以是通过一些服务接口，装置或单元的间接耦合或通信连接，可以是电性或其它的形式。
所述作为分离部件说明的单元可以是或者也可以不是物理上分开的，作为单元显示的部件可以是或者也可以不是物理单元，即可以位于一个地方，或者也可以分布到多个网络单元上。可以根据实际的需要选择其中的部分或者全部单元来实现本实施例方案的目的。
另外，在本申请各个实施例中的各功能单元可以集成在一个处理单元中，也可以是各个单元单独物理存在，也可以两个或两个以上单元集成在一个单元中。上述集成的单元既可以采用硬件的形式实现，也可以采用软件功能单元的形式实现。
所述集成的单元如果以软件功能单元的形式实现并作为独立的产品销售或使用时，可以存储在一个计算机可读取存储器中。基于这样的理解，本申请的技术方案本质上或者说对现有技术做出贡献的部分或者该技术方案的全部或部分可以以软件产品的形式体现出来，该计算机软件产品存储在一个存储器中，包括若干指令用以使得一台计算机设备（可为个人计算机、服务器或者网络设备等）执行本申请各个实施例所述方法的全部或部分步骤。而前述的存储器包括：U盘、只读存储器（Read-Only Memory， ROM）、随机存取存储器（Random Access Memory，RAM）、移动硬盘、磁碟或者光盘等各种可以存储程序代码的介质。
本领域普通技术人员可以理解上述实施例的各种方法中的全部或部分步骤是可以通进程序来指令相关的硬件来完成，该程序可以存储于一计算机可读存储器中，存储器可以包括：闪存盘、只读存储器（Read-Only Memory， ROM）、随机存取器（Random Access Memory，RAM）、磁盘或光盘等。
以上所述者，仅为本公开的示例性实施例，不能以此限定本公开的范围。即但凡依本公开教导所作的等效变化与修饰，皆仍属本公开涵盖的范围内。本领域技术人员在考虑说明书及实践这里的公开后，将容易想到本公开的其实施方案。本申请旨在涵盖本公开的任何变型、用途或者适应性变化，这些变型、用途或者适应性变化遵循本公开的一般性原理并包括本公开未记载的本技术领域中的公知常识或惯用技术手段。说明书和实施例仅被视为示例性的，本公开的范围和精神由权利要求限定。

Claims (9)

  1. 一种载具移动路径的优化方法，其特征在于，所述方法包括：
    确定目标载具的目标运输地点，基于所述目标载具的当前位置和所述目标运输地点确定全部的候选载具移动路径，所述候选载具移动路径至少包含一个生产线；
    分别确定所述候选载具移动路径中各所述生产线的设备信息，基于各所述设备信息计算各所述候选载具移动路径对应的总权重分值，所述设备信息包括设备权重分值和预期通过时间；
    将所述总权重分值最高的所述候选载具移动路径确定为目标载具移动路径，并基于所述目标载具移动路径控制所述目标载具移动；
    每当所述目标载具通过一个所述生产线，确定所述目标载具通过所述生产线花费的实际通过时间，基于所述实际通过时间与预期通过时间的差值调整所述生产线对应的所述设备权重分值。
  2. 根据权利要求1所述的方法，其特征在于，所述确定目标载具的目标运输地点，包括：
    读取目标载具的载具信息，基于所述载具信息确定所述目标载具的目标运输地点。
  3. 根据权利要求1所述的方法，其特征在于，所述基于所述目标载具的当前位置和所述目标运输地点确定全部的候选载具移动路径，所述候选载具移动路径至少包含一个生产线，包括：
    确定所述目标载具的当前位置和所述目标运输地点之间的各生产线和各所述生产线之间的桥接站；
    按与所述目标载具的当前位置对应的距离顺序依次组合各所述生产线和桥接站，生成候选载具移动路径；
    重复所述按与所述目标载具的当前位置对应的距离顺序组合各所述生产线和桥接站的步骤，直至生成涵盖所有组合的全部所述候选载具移动路径。
  4. 根据权利要求1所述的方法，其特征在于，所述基于各所述设备信息计算各所述候选载具移动路径对应的总权重分值，包括：
    分别累加各所述候选载具移动路径对应的各所述设备权重分值，得到各所述候选载具移动路径对应的总权重分值。
  5. 根据权利要求1所述的方法，其特征在于，所述基于所述实际通过时间与预期通过时间的差值调整所述生产线对应的所述设备权重分值，包括：
    计算所述实际通过时间与预期通过时间的差值，确定所述差值对应的差值范围；
    查询预设的映射对照表格，确定所述差值范围对应的权重调整分值，所述映射对照表格中不同差值映射对应有不同的权重调整分值；
    基于所述权重调整分值调整所述生产线对应的所述设备权重分值。
  6. 根据权利要求5所述的方法，其特征在于，所述基于所述权重调整分值调整所述生产线对应的所述设备权重分值，包括：
    在预设的统计周期内，统计所有所述目标载具通过所述生产线后生成的所述权重调整分值；
    计算所述统计周期内所有所述权重调整分值的平均调整分值，基于所述平均调整分值调整所述生产线对应的所述设备权重分值。
  7. 一种载具移动路径的优化装置，其特征在于，所述装置包括：
    确定模块，用于确定目标载具的目标运输地点，基于所述目标载具的当前位置和所述目标运输地点确定全部的候选载具移动路径，所述候选载具移动路径至少包含一个生产线；
    计算模块，用于分别确定所述候选载具移动路径中各所述生产线的设备信息，基于各所述设备信息计算各所述候选载具移动路径对应的总权重分值，所述设备信息包括设备权重分值和预期通过时间；
    控制模块，用于将所述总权重分值最高的所述候选载具移动路径确定为目标载具移动路径，并基于所述目标载具移动路径控制所述目标载具移动；
    调整模块，用于每当所述目标载具通过一个所述生产线，确定所述目标载具通过所述生产线花费的实际通过时间，基于所述实际通过时间与预期通过时间的差值调整所述生产线对应的所述设备权重分值。
  8. 一种电子设备，包括存储器、处理器及存储在存储器上并可在处理器上运行的计算机程序，其特征在于，所述处理器执行所述计算机程序时实现如权利要求1-6任一项所述方法的步骤。
  9. 一种计算机可读存储介质，其上存储有计算机程序，其特征在于，所述计算机程序被处理器执行时实现如权利要求1-6任一项所述方法的步骤。
PCT/CN2022/139828 2022-07-12 2022-12-18 一种载具移动路径的优化方法、装置及电子设备 WO2024011850A1 (zh)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CN202210815148.5 2022-07-12
CN202210815148.5A CN115293676A (zh) 2022-07-12 2022-07-12 一种载具移动路径的优化方法、装置及电子设备

Publications (1)

Publication Number Publication Date
WO2024011850A1 true WO2024011850A1 (zh) 2024-01-18

Family

ID=83821733

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2022/139828 WO2024011850A1 (zh) 2022-07-12 2022-12-18 一种载具移动路径的优化方法、装置及电子设备

Country Status (2)

Country Link
CN (1) CN115293676A (zh)
WO (1) WO2024011850A1 (zh)

Families Citing this family (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN115293676A (zh) * 2022-07-12 2022-11-04 浙江衣拿智能科技股份有限公司 一种载具移动路径的优化方法、装置及电子设备

Citations (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN112926808A (zh) * 2021-04-22 2021-06-08 湖北普罗劳格科技股份有限公司 物流路径规划方法、装置、设备和计算机可读存储介质
CN114111830A (zh) * 2021-12-16 2022-03-01 童浩峰 一种基于ai模型的路径规划方法及装置
US20220090922A1 (en) * 2020-08-03 2022-03-24 Kpn Innovations, Llc. Method of and system for path selection
CN114298612A (zh) * 2022-01-12 2022-04-08 中电九天智能科技有限公司 一种提供最优生产路径设备选择的方法
CN115293676A (zh) * 2022-07-12 2022-11-04 浙江衣拿智能科技股份有限公司 一种载具移动路径的优化方法、装置及电子设备
CN115293677A (zh) * 2022-07-12 2022-11-04 浙江衣拿智能科技股份有限公司 一种载具移动路径的优化方法、装置及电子设备

Patent Citations (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20220090922A1 (en) * 2020-08-03 2022-03-24 Kpn Innovations, Llc. Method of and system for path selection
CN112926808A (zh) * 2021-04-22 2021-06-08 湖北普罗劳格科技股份有限公司 物流路径规划方法、装置、设备和计算机可读存储介质
CN114111830A (zh) * 2021-12-16 2022-03-01 童浩峰 一种基于ai模型的路径规划方法及装置
CN114298612A (zh) * 2022-01-12 2022-04-08 中电九天智能科技有限公司 一种提供最优生产路径设备选择的方法
CN115293676A (zh) * 2022-07-12 2022-11-04 浙江衣拿智能科技股份有限公司 一种载具移动路径的优化方法、装置及电子设备
CN115293677A (zh) * 2022-07-12 2022-11-04 浙江衣拿智能科技股份有限公司 一种载具移动路径的优化方法、装置及电子设备

Also Published As

Publication number Publication date
CN115293676A (zh) 2022-11-04

Similar Documents

Publication Publication Date Title
JP2022500775A (ja) 分散型システムのデータ同期方法、装置、コンピュータプログラム、及び電子機器
US20240080246A1 (en) Techniques for artificial intelligence capabilities at a network switch
WO2021219053A1 (zh) 联邦学习建模方法、装置、设备及可读存储介质
WO2021147353A1 (zh) 订单调度
CN107734558A (zh) 一种基于多服务器的移动边缘计算控制及资源调度方法
US11148693B2 (en) Platoon traffic system and platoon traffic control method
WO2024011850A1 (zh) 一种载具移动路径的优化方法、装置及电子设备
WO2024001077A1 (zh) 一种巡检单元的巡检控制方法、装置及电子设备
WO2024104284A1 (zh) 一种基于nwdaf对计算资源的管理和决策的方法
WO2024011886A1 (zh) 一种载具移动路径的优化方法、装置及电子设备
CN116934059B (zh) 一种天车调度方法、装置、设备及可读存储介质
WO2018179125A1 (ja) ネットワーク構成情報生成方法および通信機器
CN115150891A (zh) 一种基于移动边缘计算的中断概率辅助任务卸载优化方法
CN113301126B (zh) 一种适用于异构组网网关的边缘计算方法
CN102780632B (zh) 一种负载分担方法和流量转发设备
CN109361625A (zh) 核查转发表项的方法、装置和控制器
CN113778675A (zh) 一种基于面向区块链网络的计算任务分配系统及方法
US20210125133A1 (en) Dispatch system for scheduling workers
CN110930092B (zh) 一种配送路线调整方法、装置、电子设备和存储介质
CN115293677A (zh) 一种载具移动路径的优化方法、装置及电子设备
CN112714146A (zh) 一种资源调度方法、装置、设备及计算机可读存储介质
CN113743685B (zh) 确定公交车时刻表的方法及电子设备
CN115185658A (zh) 一种基于时间和通信可靠的任务卸载调度方法及相关产品
CN115268821A (zh) 音频播放方法及装置、设备和介质
EP3816801A1 (en) Method and apparatus for orchestrating resources in multi-access edge computing (mec) network

Legal Events

Date Code Title Description
121 Ep: the epo has been informed by wipo that ep was designated in this application

Ref document number: 22950957

Country of ref document: EP

Kind code of ref document: A1