Optimal motion planning of redundant manipulators with controlled task infeasibility

被引:10
|
作者
Kim, Joo H. [1 ]
Joo, Chang B. [1 ]
机构
[1] NYU, Polytech Inst, Dept Mech & Aerosp Engn, Brooklyn, NY USA
关键词
Constraint prioritization; Controlled infeasibility; Normalization; Optimal motion planning; Redundant robot; Sequential quadratic programming; MODEL-PREDICTIVE CONTROL; MULTIOBJECTIVE OPTIMIZATION; CONSTRAINED OPTIMIZATION; ROBOTIC MANIPULATORS; PRIORITY; DESIGN; PERFORMANCE; ALGORITHMS; GENERATION; RESOLUTION;
D O I
10.1016/j.mechmachtheory.2013.02.001
中图分类号
TH [机械、仪表工业];
学科分类号
0802 ;
摘要
In optimal motion planning and control, the complex time-varying nature of redundant robots, environments, and task requirements causes complex domains and conflicting constraints. Since predicting or recovering infeasibility is not always possible, infeasibilities occur frequently and are not completely avoidable. We introduce a constrained nonlinear programming framework of controlled (as opposed to recovered) infeasibility for physically valid solutions while preserving the original problem and variable space. The constraint prioritization hierarchy includes a comprehensive classification of physical consistency, design requirements, and tasks. Priority weight functions having features of normalization and prioritization are incorporated into a sequential quadratic programming (SQP) algorithm to ensure generality and strict satisfaction of high-priority constraints, while lower-priority constraint violations are minimized. These are embedded in SQP through its merit function and composite cost function, in which general nonlinear functions including unilateral, time-dependent, and nonholonomic, can be incorporated in a unified approach. Also, the avoidance of the discontinuity problem with unilateral constraints is due to the time-dependent constraints strategy, which actively adapts to varying states. Numerical examples using multibody dynamic models of a redundant manipulator demonstrate these advantages. (C) 2013 Elsevier Ltd. All rights reserved.
引用
收藏
页码:155 / 174
页数:20
相关论文
共 50 条
  • [11] Active motion planning and collision avoidance for redundant manipulators
    Bu, YH
    Cameron, S
    1997 IEEE INTERNATIONAL SYMPOSIUM ON ASSEMBLY AND TASK PLANNING (ISATP'97) - TOWARDS FLEXIBLE AND AGILE ASSEMBLY AND MANUFACTURING, 1997, : 13 - 18
  • [12] Overall Motion Planning for Kinematically Redundant Parallel Manipulators
    Carretero, Juan A.
    Ebrahimi, Iman
    Boudreau, Roger
    JOURNAL OF MECHANISMS AND ROBOTICS-TRANSACTIONS OF THE ASME, 2012, 4 (02):
  • [13] Optimal trajectory planning of redundant manipulators in constrained workspace
    Tian, LF
    Collins, C
    ELECTRONICS LETTERS, 2002, 38 (14) : 762 - 764
  • [14] New motion planning method of flexible redundant manipulators by optimizing redundant configuration
    Beijing Polytechnic Univ, Beijing, China
    Jixie Gongcheng Xuebao/Chinese Journal of Mechanical Engineering, 2000, 36 (07):
  • [16] SQP-BASED MOBILE MANIPULATOR MOTION PLANNING WITH CONTROLLED INFEASIBILITY FOR PHYSICALLY VALID TASK FAILURE
    Joo, Chang B.
    Kim, Joo H.
    PROCEEDINGS OF THE ASME INTERNATIONAL DESIGN ENGINEERING TECHNICAL CONFERENCES AND COMPUTERS AND INFORMATION IN ENGINEERING CONFERENCE, 2013, VOL 6A, 2014,
  • [17] Task-space separation principle: a force-field approach to motion planning for redundant manipulators
    Tommasino, Paolo
    Campolo, Domenico
    BIOINSPIRATION & BIOMIMETICS, 2017, 12 (02)
  • [18] Motion Planning and Control of Redundant Manipulators for Dynamical Obstacle Avoidance
    Palmieri, Giacomo
    Scoccia, Cecilia
    MACHINES, 2021, 9 (06)
  • [19] Cooperative Motion Planning of Redundant Rover Manipulators on Uneven Terrains
    Raja, Rekha
    Dasgupta, Bhaskar
    Dutta, Ashish
    2017 18TH INTERNATIONAL CONFERENCE ON ADVANCED ROBOTICS (ICAR), 2017, : 99 - 105
  • [20] A multi-objective approach for the motion planning of redundant manipulators
    Marcos, Maria da Graca
    Machado, J. A. Tenreiro
    Azevedo-Perdicoulis, T. -P.
    APPLIED SOFT COMPUTING, 2012, 12 (02) : 589 - 599