Collision-free path coordination and cycle time optimization of industrial robot cells

Doktorsavhandling, 2021

In industry, short ramp-up times, product quality, product customization and high production rates are among the main drivers of technological progress. This is especially true for automotive manufacturers whose market is very competitive, constantly pushing for new solutions. In this industry, many of the processes are carried out by robots: for example, operations such as stud/spot welding, sealing, painting and inspection. Besides higher production rates, the improvement of these processes is important from a sustainability perspective, since an optimized equipment utilization may be achieved, in terms of resources used, including such things as robots, energy, and physical prototyping.

The achievements of such goals may, nowadays, be reached also thanks to virtual methods, which make modeling, simulation and optimization of industrial processes possible. The work in this thesis may be positioned in this area and focuses on virtual product and production development for throughput improvement of robotics processes in the automotive industry. Specifically, the thesis presents methods, algorithms and tools to avoid collisions and minimize cycle time in multi-robot stations. It starts with an overview of the problem, providing insights into the relationship between the volumes shared by the robots' workspaces and more abstract modeling spaces. It then describes a computational method for minimizing cycle time when robot paths are geometrically fixed and only velocity tuning is allowed to avoid collisions.

Additional requirements are considered for running these solutions in industrial setups, specifically the time delays introduced when stopping robots to exchange information with a programmable logic controller (PLC). A post-processing step is suggested, with algorithms taking into account these practical constraints. When no communication at all with the PLC is highly desirable, a method of providing such programs is described to give completely separated robot workspaces. Finally, when this is not possible (in very cluttered environments and with densely distributed tasks, for example), robot routes are modified by changing the order of operations to avoid collisions between robots.

In summary, by requiring fewer iterations between different planning stages, using automatic tools to optimize the process and by reducing physical prototyping, the research presented in this thesis (and the corresponding implementation in software platforms) will improve virtual product and production realization for robotic applications.