Cardinal IP for Intelligent AGV Routing

Transcription

1 Cardinal IP for Intelligent AGV Routing Cardinal Operations

2 Table of Contents Cardinal IP for Intelligent AGV Routing Introduction Strength and Features Application in Warehouse Automation

3 Cardinal IP for Intelligent AGV Routing Introduction AGV (Automated Guided Vehicles) are fully automated transport system using unmanned vehicles which can transport all kinds of products without human intervention. AGV System is currently widely used in Warehouse Automation Automated Container Transport at Port Manufacturing System

4 Cardinal IP for Intelligent AGV Routing Introduction Efficient scheduling and routing algorithm is essential for AGV system,although in real application the hardware of AGV system is different. Designing such algorithm is challenged by two major difficulties: The Size of the Problem Assigning jobs and matching products to demand of each destination are usually NP- Hard optimization problem. The computational time grows exponentially as the size of the problem increases. In typical implementation of AGV system, there is thousands of vehicles, thousands of products, and hundreds of destinations to transport. The Limited Computational Time Thee algorithms are usually implemented in real-time environment. The scheduling and matching are repeated in each operating period. This kind of on-line computation is strongly constrained by limited time resource. For example, in warehouse delivering systems, the typical operating period is 2-3 seconds. That is to say, only few seconds is allowed to compute the matching and guiding plan for thousands of vehicles.

5 Cardinal IP for Intelligent AGV Routing Algorithm Our scientist, engineer, project and service team have the industry expertise to tailor our IP Optimization Algorithm to meet the specific and time-sensitive requirements. Cardinal IP Algorithm which is developed all by Cardinal implements cuttingedge approximation algorithm to find the best scheduling and matching plan in limited computational time. These techniques include: interior-point-method based LP solver the IP based global routing algorithm the problem structure dependent cutting-plan generation methods the customized network flow algorithm Integrating these methods together Cardinal IP algorithm has been successfully applied in many real cases.

6 Cardinal IP for Intelligent AGV Routing Application In a warehouse, there are hundreds of racks. One rack has two sides. In each side, there are some kind of products. There are several work stations. Each workstation has some demands of various products. The AGV needs to carry the rack to the workstation. The cost is from two sources. The distances between vehicles and racks. The distances from racks to the stations. Besides the costs, the matching and routing algorithm must find the best match of the racks to the stations in order all the demands are fulfilled. Framework Input Car-to-Rack cost Inventory Orders Rack to WorkStation Cost Models Cardinal IP Algorithm for Intelligent Routing Output Task-and-Vehicle Matching

7 Cardinal IP for Intelligent AGV Routing Application Our Capabilities Support warehouses of more than 10,000 square meters Support more than 1,000 merchandise goods Support more than 100 workstations Support scheduling of more than 1,000 robots Model with about 1,000,000 solved within 2 Sec.