An Effective Mathematical Programming Model for Production Automatic Robot Path Planning
Identifiers and Pagination:Year: 2019
First Page: 11
Last Page: 16
Publisher Id: TOTJ-13-11
Article History:Received Date: 26/10/2018
Revision Received Date: 20/02/2019
Acceptance Date: 8/03/2019
Print publication date: 26/03/2019
Collection year: 2019
open-access license: This is an open access article distributed under the terms of the Creative Commons Attribution 4.0 International Public License (CC-BY 4.0), a copy of which is available at: (https://creativecommons.org/licenses/by/4.0/legalcode). This license permits unrestricted use, distribution, and reproduction in any medium, provided the original author and source are credited.
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.