Artificial Intelligence Control in 4D Cylindrical Space for Industrial Robotic Applications

被引:3
作者
de Giorgio, Andrea [1 ]
Wang, Lihui [1 ]
机构
[1] KTH Royal Inst Technol, Sch Ind Engn & Management, Dept Prod Engn, S-11428 Stockholm, Sweden
关键词
Robot kinematics; Service robots; Manipulators; Aerospace electronics; Heuristic algorithms; Planning; Industrial robot; robot control; algorithm; pathfinding; artificial intelligence; cylindrical symmetry; search space; volumetric information; obstacle avoidance; MOTION; MANIPULATORS;
D O I
10.1109/ACCESS.2020.3026193
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
This article argues that an efficient artificial intelligence control algorithm needs the built-in symmetries of an industrial robot manipulator to be further characterized and exploited. The product of this enhancement is a four-dimensional (4D) discrete cylindrical grid space that can directly replace complex robot models. A* is chosen for its wide use among such algorithms to study the advantages and disadvantages of steering the robot manipulator within the 4D cylindrical discrete grid. The study shows that this approach makes it possible to control a robot without any specific knowledge of the robot kinematic and dynamic models at planning and execution time. In fact, the robot joint positions for each grid cell are pre-calculated and stored as knowledge, then quickly retrieved by the pathfinding algorithm when needed. The 4D cylindrical discrete space has both the advantages of the configuration space and the three-dimensional Cartesian workspace of the robot. Since path optimization is the core of any search algorithms, including A*, the 4D cylindrical grid provides for a search space that can embed further knowledge in form of cell properties, including the presence of obstacles and volumetric occupancy of the entire industrial robot body for obstacle avoidance applications. The main trade-off is between a limited capacity for pre-computed grid knowledge and the path search speed. This innovative approach encourages the use of search algorithms for industrial robotic applications, opens up to the study of other robot symmetries present in different robot models and lays a foundation for the application of dynamic obstacle avoidance algorithms.
引用
收藏
页码:174833 / 174844
页数:12
相关论文
共 42 条
[1]   Robotic Task Sequencing Problem: A Survey [J].
Alatartsev, Sergey ;
Stellmacher, Sebastian ;
Ortmeier, Frank .
JOURNAL OF INTELLIGENT & ROBOTIC SYSTEMS, 2015, 80 (02) :279-298
[2]  
Aljarboua Z., 2009, P WORLD C ENG COMP S, P20
[3]  
Ansari Y, 2016, P IEEE RAS-EMBS INT, P457, DOI 10.1109/BIOROB.2016.7523669
[4]  
Bergerman M, 1997, IEEE INT CONF ROBOT, P549, DOI 10.1109/ROBOT.1997.620094
[5]  
Fernandes E, 2015, 2015 IEEE INTERNATIONAL CONFERENCE ON INDUSTRIAL TECHNOLOGY (ICIT), P3320, DOI 10.1109/ICIT.2015.7125590
[6]   DISCRETE TRAJECTORY PLANNING [J].
FLASH, T ;
POTTS, RB .
INTERNATIONAL JOURNAL OF ROBOTICS RESEARCH, 1988, 7 (05) :48-57
[7]  
Geraerts R, 2003, SPRINGER TRAC ADV RO, V7, P43
[8]  
Junfeng Yao, 2010, Proceedings of the Seventh International Conference on Information Technology: New Generations (ITNG 2010), P1154, DOI 10.1109/ITNG.2010.53
[9]  
Kabir AM, 2019, IEEE INT CONF ROBOT, P8683, DOI [10.1109/icra.2019.8794275, 10.1109/ICRA.2019.8794275]
[10]   Motion planning using dynamic roadmaps [J].
Kallmann, M ;
Mataric, M .
2004 IEEE INTERNATIONAL CONFERENCE ON ROBOTICS AND AUTOMATION, VOLS 1- 5, PROCEEDINGS, 2004, :4399-4404