Multi-robot scheduling method and device

Abstract

The purpose of the present invention is to provide a multi-robot scheduling method and equipment. The server program of the present invention mainly plays the role of sharing operation data, and is responsible for collecting and distributing the operation data packets of shared robots to individual robots; The multi-machine scheduling of the corresponding scheduling strategy will be triggered only when the area is inside. The decision-making process of multi-machine scheduling is not initiated by the server, but is completed independently by the client program carried by the individual robot. The basis of the scheduling strategy can be the preset of the corresponding scheduling area. Decision tree model. The invention adopts light-weight data packet format to exchange operation information between the robot and the server, which greatly reduces the communication load caused by the oversized data packet and the retransmission mechanism. The server of the present invention can be set in the local area network without connecting to the external network, so as to ensure the information security in the user environment, and the amount of interactive communication between the server and the robot is small.

Description

technical field [0001] The invention relates to the field of computers, in particular to a multi-robot scheduling method and equipment. Background technique [0002] In recent years, with the rapid development of sensor technology and artificial intelligence technology, service robots have gradually transformed from laboratory research objects into intelligent products that can be applied on the ground. Service robots replace humans in specific scenarios to complete highly repetitive and high-risk tasks. Among them, the joint application of multi-robots in large-scale scenarios is one of the common landing scenarios, such as food delivery robots and distribution robots. In such application scenarios, there are problems such as the installation position of the robot’s sensors at the same position, the blind area limitation of the sensor, and the independent path planning methods used by individual robots in the process of performing tasks, etc., resulting in occasional colli...

AI Technical Summary

Problems solved by technology

[0003] 1. Existing solutions are often only applicable to homogeneous robot groups (or robot products of the same company), but future robot applications will be a diversified application scenario, so multi-machine scheduling solutions should also support heterogeneous robot groups

[0004] 2. Existing solutions often rely heavily on centralized servers. This model will cause the following bottleneck problems:

However, the deadlock problem caused by mutual blocking between robots will cause the robot to fall into an endless loop and stop executing tasks, which also restricts the execution of scene tasks, and is also a key problem to be solved in the multi-machine scheduling system.

[0008] 3. The scheduling behavior of the existing solution is relatively fixed and does not support custom development of the user end, which is not conducive to defining the robot scheduling behavior in a specific user scenario, and cannot meet the intelligent needs of the user scenario

Images