Robotic Task Sequencing Problem: A Survey

被引:92
作者
Alatartsev, Sergey [1 ]
Stellmacher, Sebastian [1 ]
Ortmeier, Frank [1 ]
机构
[1] Otto Von Guericke Univ, D-39106 Magdeburg, Germany
关键词
Robotic task optimization; Robotic task scheduling; Multi-goal path planning; Traveling salesman problem; Robotic task sequencing; TRAVELING-SALESMAN PROBLEM; MULTIPLE-GOAL TASK; POINT-TO-POINT; MOBILE ROBOT; OPTIMIZATION; TIME; ALGORITHMS; INDUSTRIAL; HEURISTICS; MODEL;
D O I
10.1007/s10846-015-0190-6
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Today, robotics is an important cornerstone of modern industrial production. Robots are used for numerous reasons including reliability and continuously high quality of work. The main decision factor is the overall efficiency of the robotic system in the production line. One key issue for this is the optimality of the whole set of robotic movements for industrial applications, which typically consist of multiple atomic tasks such as welding seams, drilling holes, etc. Currently, in many industrial scenarios such movements are optimized manually. This is costly and error-prone. Therefore, researchers have been working on algorithms for automatic computation of optimal trajectories for several years. This problem gets even more complicated due to multiple additional factors like redundant kinematics, collision avoidance, possibilities of ambiguous task performance, etc. This survey article summarizes and categorizes the approaches for optimization of the robotic task sequence. It provides an overview of existing combinatorial problems that are applied for robot task sequencing. It also highlights the strengths and the weaknesses of existing approaches as well as the challenges for future research in this domain. The article is meant for both scientists and practitioners. For scientists, it provides an overview on applied algorithmic approaches. For practitioners, it presents existing solutions, which are categorized according to the classes of input and output parameters.
引用
收藏
页码:279 / 298
页数:20
相关论文
共 96 条
[51]   Survey on model-based manipulation planning of deformable objects [J].
Jimenez, P. .
ROBOTICS AND COMPUTER-INTEGRATED MANUFACTURING, 2012, 28 (02) :154-163
[52]   Sampling-based algorithms for optimal motion planning [J].
Karaman, Sertac ;
Frazzoli, Emilio .
INTERNATIONAL JOURNAL OF ROBOTICS RESEARCH, 2011, 30 (07) :846-894
[53]   Lin-Kernighan heuristic adaptations for the generalized traveling salesman problem [J].
Karapetyan, D. ;
Gutin, G. .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2011, 208 (03) :221-232
[54]   Probabilistic roadmaps for path planning in high-dimensional configuration spaces [J].
Kavraki, LE ;
Svestka, P ;
Latombe, JC ;
Overmars, MH .
IEEE TRANSACTIONS ON ROBOTICS AND AUTOMATION, 1996, 12 (04) :566-580
[55]   Constraint optimization model of a scheduling problem for a robotic arm in automatic systems [J].
Kolakowska, Ewa ;
Smith, Stephen F. ;
Kristiansen, Morten .
ROBOTICS AND AUTONOMOUS SYSTEMS, 2014, 62 (02) :267-280
[56]  
Kovacs A, 2013, P 23 INT C INT C AUT, P457
[57]  
Kuffner J. J. Jr., 2000, Proceedings 2000 ICRA. Millennium Conference. IEEE International Conference on Robotics and Automation. Symposia Proceedings (Cat. No.00CH37065), P995, DOI 10.1109/ROBOT.2000.844730
[58]  
Lattanzi L, 2013, PROC IEEE INT SYMP
[59]   AN ALGORITHM FOR THE TRAVELING SALESMAN PROBLEM [J].
LITTLE, JDC ;
MURTY, KG ;
SWEENEY, DW ;
KAREL, C .
OPERATIONS RESEARCH, 1963, 11 (06) :972-989
[60]   Optimization of industrial, vision-based, intuitively generated robot point-allocating tasks using genetic algorithms [J].
Loredo-Flores, Ambrocio ;
Gonzalez-Galvan, Emilio J. ;
Jesus Cervantes-Sanchez, J. ;
Martinez-Soto, Alvaro .
IEEE TRANSACTIONS ON SYSTEMS MAN AND CYBERNETICS PART C-APPLICATIONS AND REVIEWS, 2008, 38 (04) :600-608