Scheduling algorithms for optimal robot cell coordination - a comparison

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

[1]  Jean-Claude Latombe,et al.  Robot motion planning , 1970, The Kluwer international series in engineering and computer science.

[2]  Nils J. Nilsson,et al.  A mobius automation: an application of artificial intelligence techniques , 1969, IJCAI 1969.

[3]  E. Nowicki,et al.  A Fast Taboo Search Algorithm for the Job Shop Problem , 1996 .

[4]  Lydia E. Kavraki,et al.  Path planning using lazy PRM , 2000, Proceedings 2000 ICRA. Millennium Conference. IEEE International Conference on Robotics and Automation. Symposia Proceedings (Cat. No.00CH37065).

[5]  M. Fabian,et al.  Scheduling of discrete event systems using mixed integer linear programming , 2006, 2006 8th International Workshop on Discrete Event Systems.

[6]  Ming C. Leu,et al.  Swept volume: a retrospective and prospective view , 1997, Neural Parallel Sci. Comput..

[7]  Chanwoo Moon,et al.  PLC based coordination schemes for a multi-robot system , 2001, Proceedings 2001 ICRA. IEEE International Conference on Robotics and Automation (Cat. No.01CH37164).

[8]  Jacek Blazewicz,et al.  The job shop scheduling problem: Conventional and new solution techniques , 1996 .

[9]  Thierry Siméon,et al.  Path coordination for multiple mobile robots: a resolution-complete algorithm , 2002, IEEE Trans. Robotics Autom..

[10]  John Canny,et al.  The complexity of robot motion planning , 1988 .

[11]  Nils J. Nilsson,et al.  A Formal Basis for the Heuristic Determination of Minimum Cost Paths , 1968, IEEE Trans. Syst. Sci. Cybern..

[12]  Frank DiCesare,et al.  Scheduling flexible manufacturing systems using Petri nets and heuristic search , 1994, IEEE Trans. Robotics Autom..

[13]  W. M. Wonham,et al.  The control of discrete event systems , 1989 .

[14]  Rina Dechter,et al.  Generalized best-first search strategies and the optimality of A* , 1985, JACM.

[15]  Rajeev Alur,et al.  A Theory of Timed Automata , 1994, Theor. Comput. Sci..

[16]  Torbjörn Liljenvall.  Scheduling for production systems , 1998 .

[17]  Peter Norvig,et al.  Artificial Intelligence: A Modern Approach , 1995 .

[18]  Egon Balas,et al.  The Shifting Bottleneck Procedure for Job Shop Scheduling , 1988 .

[19]  Tomás Lozano-Pérez,et al.  Deadlock-free and collision-free coordination of two robot manipulators , 1989, Proceedings, 1989 International Conference on Robotics and Automation.

[20]  Ioannis G. Tollis,et al.  Path planning in the presence of vertical obstacles , 1990, IEEE Trans. Robotics Autom..