Scheduling Algorithms for Optimal Robot Cell Coordination - a Comparison
Paper in proceeding, 2006

Flexibility is the keyword in the modern industrial world. Automatic generation of collision- and blocking free, time optimal schedules for industrial robot cells is thus motivated. While a lot of attention has been paid to the control of industrial systems, as well as to the development of general optimization algorithms, there is still a need to properly combine these two research areas. This paper discusses two scheduling algorithms, designed for industrial robot cells, in terms of performance. A novel heuristic to an A*-based algorithm, operating on Discrete Event Systems, is proposed and benchmarked against the well-known MILP algorithm.

Scheduling

MILP

Coordination

Discrete Event Systems

A*

Author

Avenir Kobetski

Chalmers, Signals and Systems, Systems and control, Automation

Domenico Spensieri

Fraunhofer-Chalmers Centre

Martin Fabian

Chalmers, Signals and Systems, Systems and control, Automation

Proc. of IEEE Conference on Automation Science and Engineering

381-386

IEEE International Conference on Automation Science and Engineering (CASE)
Shanghai, China,

Subject Categories

Production Engineering, Human Work Science and Ergonomics

Computational Mathematics

DOI

10.1109/COASE.2006.326912

More information

Latest update

8/30/2021