The beam analysis algorithm for path planning for redundant manipulators

被引:3
|
作者
Conkur, ES [1 ]
Buckingham, R
Harrison, A
机构
[1] Pamukkale Univ, Dept Mech Engn, TR-20017 Camlik, Denizli, Turkey
[2] OC Robot Ltd, Bristol BS9 4HR, Avon, England
[3] Univ Bristol, Dept Mech Engn, Bristol BS8 1TR, Avon, England
关键词
redundant robots; path planning; obstacle avoidance; potential field;
D O I
10.1016/j.mechatronics.2004.06.009
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
An algorithm for path planning for redundant manipulators is presented in this paper. The algorithm uses harmonic potential fields defined globally in W-space (work space) for both path planning and obstacle avoidance. Although paths generated by harmonic potential fields are collision free for point robots, this is not always the case for manipulators when especially tight manoeuvring is required. To enhance collision avoidance ability of redundant manipulators, the beam analysis algorithm is proposed. The algorithm sends beams along the path generated for point robots to determine virtual obstacle points where collision with obstacle is likely to occur. The potential field is then regenerated to include these virtual obstacle points. Besides, the interaction between manipulator links and the potential field is accomplished by the control points situated on only proximal ends of the links. The virtual obstacle points and selected control points allow the manipulator to achieve tight manoeuvring in W-spaces cluttered with many obstacles. The improvement in performance is also clearly indicated by a benchmark scheme that compares the algorithms by means of the complexity of the environment with respect to link lengths of redundant manipulators. Furthermore, the beam analysis algorithm readily produces safer paths for mobile robots, which does not suffer too far or too close problems. Examples are included to demonstrate these features of the algorithm. (C) 2004 Elsevier Ltd. All rights reserved.
引用
收藏
页码:67 / 94
页数:28
相关论文
共 50 条
  • [41] Trajectory Planning of Redundant Manipulators Moving along Constrained Path and Avoiding Obstacles
    Chembuly, V. V. M. J. Satish
    Voruganti, Hari Kumar
    INTERNATIONAL CONFERENCE ON ROBOTICS AND SMART MANUFACTURING (ROSMA2018), 2018, 133 : 627 - 634
  • [42] Motion Planning for Redundant Manipulators Using a Floating Point Genetic Algorithm
    Lianfang Tian
    Curtis Collins
    Journal of Intelligent and Robotic Systems, 2003, 38 : 297 - 312
  • [43] Motion planning for redundant manipulators using a floating point genetic algorithm
    Tian, LF
    Collins, C
    JOURNAL OF INTELLIGENT & ROBOTIC SYSTEMS, 2003, 38 (3-4) : 297 - 312
  • [44] Path Planning Algorithm for Manipulators based on an improved Backtracking Search Algorithm
    Islam, Md. Nazrul
    Gallardo-Alvardo, Jaime
    Ahmad, Othman bin Hj
    Mamat, Mazlina Binti
    Ghosh, B. K.
    2015 5TH INTERNATIONAL CONFERENCE ON IT CONVERGENCE AND SECURITY (ICITCS), 2015,
  • [45] A real-time path-planning algorithm with extremely tight maneuvering capabilities for hyper-redundant manipulators
    Bulut, Yalcin
    Conkur, Erdinc Sahin
    ENGINEERING SCIENCE AND TECHNOLOGY-AN INTERNATIONAL JOURNAL-JESTECH, 2021, 24 (01): : 247 - 258
  • [46] Task planning for serial redundant manipulators
    Kuo, JA
    Sanger, DJ
    ROBOTICA, 1997, 15 : 75 - 83
  • [47] Evaluation of a new backtrack free path planning algorithm for manipulators
    Islam, Md. Nazrul
    Tamura, Shinsuke
    Murata, Tomonari
    Yanase, Tatsuro
    IEEJ Transactions on Electronics, Information and Systems, 2008, 128 (08): : 1293 - 1302
  • [48] Optimal randomized path planning for redundant manipulators based on Memory-Goal-Biasing
    Han, Dong
    Nie, Hong
    Chen, Jinbao
    Chen, Meng
    INTERNATIONAL JOURNAL OF ADVANCED ROBOTIC SYSTEMS, 2018, 15 (04):
  • [49] User-Guided Path Planning for Redundant Manipulators in Highly Constrained Work Environments
    Rajendran, Pradeep
    Thakar, Shantanu
    Gupta, Satyandra K.
    2019 IEEE 15TH INTERNATIONAL CONFERENCE ON AUTOMATION SCIENCE AND ENGINEERING (CASE), 2019, : 1212 - 1217
  • [50] A NUMERICAL APPROACH FOR TIME-OPTIMAL PATH-PLANNING OF KINEMATICALLY REDUNDANT MANIPULATORS
    WU, CJ
    ROBOTICA, 1994, 12 : 401 - 410