SYSTEMS AND METHODS FOR SCALABLE MULTI-VEHICLE TASK ALLOCATION

Systems and methods of the present disclosure address the capacity constrained vehicle routing (CVRP) problem that may be applied to a warehouse scenario wherein multi-robot task allocation is required. Conventional methods can solve CVRP instances up to 100 nodes. In the present disclosure, a nearest-neighbor based Clustering And Routing (nCAR) approach is provided that makes the systems and methods of the present disclosure scalable wherein the number of nodes can be in the range of several hundreds to several thousands within an order wave.