An Effective Mathematical Programming Model for Production Automatic Robot Path Planning

Abstract

Objective: Path planning for production robots has been investigated. The sequence of the orders to be processed in a certain planning horizon has been planned for the production system. Methods: Production automatic robots are employed to carry parts and products among all production stations and machining centers. The combination of machines in stations and autonomous robot evolves a production network. Results: The problem is to assign orders to robots so that paths are obtained to minimize total waiting times of production system and meanwhile provide collision-free paths. Conclusion: The proposed mathematical formulation is implemented to show the efficiency and effectiveness.