Generating optimal dynamic motions for closed-chain robotic systems

被引：6
作者：
Chettibi, T
Haddad, M
Labed, A
Hanchi, S
机构：
[1] Lab Stuct Mech, Algiers, Algeria
[2] Lab Appl Math, Algiers, Algeria
[3] Lab Fluids Mech, Algiers, Algeria
来源：
EUROPEAN JOURNAL OF MECHANICS A-SOLIDS | 2005年 / 24卷 / 03期
关键词：
holonomic systems; optimization; dynamics constraints; motion planning;
D O I：
10.1016/j.euromechsol.2005.01.005
中图分类号：
O3 [力学];
学科分类号：
08 ; 0801 ;
摘要：
In a previous work (Chettibi et al., 2004a) we proposed an efficient method to plan optimal motions for serial manipulators and we asserted that this technique could be extended to handle more complex robotic systems. In this paper, we will show the effectiveness of this method in solving the Optimal Free Motion Planning Problem (OFMPP) for Closed-Chain Robots (CCR) and coordination of multiple robotic mechanisms. These are typical examples of holonomic mechanical systems known to be complex but of a large utility. But the fact that these systems are usually redundantly actuated, induces additional complexity in computing their dynamics and generating optimal motions. (c) 2005 Elsevier SAS. All rights reserved.
引用
收藏
页码：504 / 518
页数：15
相关论文
共 35 条
[1]  
Angeles J., 2020, Fundamentals of Robotic Mechanical Systems: Theory, Methods, and Algorithms
[2]  
Ascher U.M., 1998, COMPUTER METHODS ORD, V61
[3]   Survey of numerical methods for trajectory optimization [J].
Betts, JT .
JOURNAL OF GUIDANCE CONTROL AND DYNAMICS, 1998, 21 (02) :193-207
[4]  
BICCHI A, 2001, P IEEE INT C ROB AUT
[5]  
BIEN Z, 1992, IEEE T ROBOTICS AUTO, V8
[6]  
Bryson A.E., 1999, Dynamic Optimization
[7]  
CHEN Y, 1992, IEEE T AUTOMAT CONTR, V37
[8]  
Cheng H, 2001, IROS 2001: PROCEEDINGS OF THE 2001 IEEE/RJS INTERNATIONAL CONFERENCE ON INTELLIGENT ROBOTS AND SYSTEMS, VOLS 1-4, P171, DOI 10.1109/IROS.2001.973354
[9]   Minimum cost trajectory planning for industrial robots [J].
Chettibi, T ;
Lehtihet, HE ;
Haddad, M ;
Hanchi, S .
EUROPEAN JOURNAL OF MECHANICS A-SOLIDS, 2004, 23 (04) :703-715
[10]  
CHETTIBI T, 2004, 1 INT C INF CONTR AU
1234