Energy Efficient and Collision Free Motion of Industrial Robots using Optimal Control
Paper in proceeding, 2013

In a production plant for complex assembled products there could be up to several hundred of robots used for handling and joining operations. Thus, improvement in robot motions can have a huge impact on equipment utilization and energy consumption. These are two of the most important aspects of sustainability in a production system. Therefore, this paper presents an algorithm for generating efficient and collision free motion of industrial robots using path planning and direct transcription methods for numerical optimal control. As a measure of efficiency for moving between configurations we use a combination of the energy norm of the applied actuator torques and the cycle time. Velocity and torque limits are handled and modeled as hard constraints. However, more general problems can be solved by the same approach. Our novel algorithm solves the problem in three steps; (i) first a path planning algorithm calculates an initial collision free path, (ii) a convex optimal control problem is then formulated to follow this path, and finally (iii) a nonlinear optimal control problem is solved to iteratively improve the trajectory. The resulting trajectory is guaranteed to be collision free by restrictions in the configuration space based on a local sensitivity analysis. The algorithm has been successfully applied to several industrial cases demonstrating that the proposed method can be used effectively in practical applications.

Author

Staffan C Björkenstam

Fraunhofer-Chalmers Centre

Daniel Gleeson

Fraunhofer-Chalmers Centre

Robert Bohlin

Fraunhofer-Chalmers Centre

Johan Carlson

Fraunhofer-Chalmers Centre

Bengt Lennartson

Chalmers, Signals and Systems, Systems and control

IEEE International Conference on Automation Science and Engineering

21618070 (ISSN) 21618089 (eISSN)


978-1-4799-1515-6 (ISBN)

Driving Forces

Sustainable development

Areas of Advance

Production

Subject Categories

Computational Mathematics

DOI

10.1109/CoASE.2013.6654025

More information

Latest update

10/5/2023