Monte Carlo tree search-based meta-heuristic method for faster optimal cluster allocation

Through the branch delimiting and Monte Carlo tree search method combined with the dual graph method, the cost minimization problem of selecting a suitable AMR machine group in the automation facility is solved, and the global optimal machine group composition and task allocation are found within a reasonable time, which improves the material Stream throughput and reduce operational costs.

CN119067204APending Publication Date: 2024-12-03FORD GLOBAL TECH LLC
View PDF 0 Cites 0 Cited by

Patent Information

Application Number
CN202410661911.2
Authority / Receiving Office
CN · China
Patent Type
Applications(China)
Current Assignee / Owner
Priority Date
2023-06-02
Filing Date
2024-05-27
Publication Date
2024-12-03

AI Technical Summary

Technical Problem

In automation facilities, selecting the appropriate autonomous mobile robot (AMR) fleet to minimize costs is a large-scale optimization problem, and prior art is difficult to find global or near-optimal fleet composition and tasks within reasonable computing time. Allocation plan.

Method used

The waypoint sequence is determined by branch bounding (B&B) method, the path is determined by the dual graph method, and the group composition and task allocation are determined by combining the Monte Carlo tree search (MCTS) method. Multiple processors are used to divide the search space and randomly walk Sub-update operation costs to enable rapid exploration and local search.

Benefits of technology

Significantly reduces computing time, finds global or near-optimal cluster composition and task allocation schemes, improves material flow throughput, and reduces operating costs.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN119067204A_ABST
    Figure CN119067204A_ABST
Patent Text Reader

Abstract

The invention provides a meta-heuristic method based on Monte Carlo tree search for faster optimal cluster allocation. A method of managing a robotic fleet for delivering material in a facility is provided. The method comprises: delimiting by a branch delimiting (Bamp; b) determining a waypoint sequence by a method; determining a path passing through the waypoint sequence through a dual graph method; and through the Bamp; task allocation between the fleet composition and the robot is determined by a method A, a method B and a Monte Carlo Tree Search (MCTS) method.
Need to check novelty before this filing date? Find Prior Art