An Effective Mathematical Programming Model for Production Automatic Robot Path Planning
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.
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.
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.
The proposed mathematical formulation is implemented to show the efficiency and effectiveness.
Correspondence: Address correspondence to this author at the Department of Industrial Engineering, School of Engineering, Damghan University, Damghan, Iran; Tel: +989111137298; E-mail: email@example.com