472 research outputs found

    Faster Motion on Cartesian Paths Exploiting Robot Redundancy at the Acceleration Level

    Get PDF
    The problem of minimizing the transfer time along a given Cartesian path for redundant robots can be approached in two steps, by separating the generation of a joint path associated to the Cartesian path from the exact minimization of motion time under kinematic/dynamic bounds along the obtained parameterized joint path. In this framework, multiple suboptimal solutions can be found, depending on how redundancy is locally resolved in the joint space within the first step. We propose a solution method that works at the acceleration level, by using weighted pseudoinversion, optimizing an inertia-related criterion, and including null-space damping. Several numerical results obtained on different robot systems demonstrate consistently good behaviors and definitely faster motion times in comparison with related methods proposed in the literature. The motion time obtained with our method is reasonably close to the global time-optimal solution along same Cartesian path. Experimental results on a KUKA LWR IV are also reported, showing the tracking control performance on the executed motions

    Optimal redundancy control for robot manipulators

    Get PDF
    Optimal control for kinematically redundant robots is addressed for two different optimization problems. In the first optimization problem, we consider the minimization of the transfer time along a given Cartesian path for a redundant robot. This problem can be solved in two steps, by separating the generation of a joint path associated to the Cartesian path from the exact minimization of motion time under kinematic/dynamic bounds along the obtained parametrized joint path. In this thesis, multiple sub-optimal solutions can be found, depending on how redundancy is locally resolved in the joint space within the first step. A solution method that works at the acceleration level is proposed, by using weighted pseudoinversion, optimizing an inertia-related criterion, and including null-space damping. The obtained results demonstrate consistently good behaviors and definitely faster motion times in comparison with related methods proposed in the literature. The motion time obtained with the proposed method is close to the global time-optimal solution along the same Cartesian path. Furthermore, a reasonable tracking control performance is obtained on the experimental executed motions. In the second optimization problem, we consider the known phenomenon of torque oscillations and motion instabilities that occur in redundant robots during the execution of sufficiently long Cartesian trajectories when the joint torque is instantaneously minimized. In the framework of on-line local redundancy resolution methods, we propose basic variations of the minimum torque scheme to address this issue. Either the joint torque norm is minimized over two successive discrete-time samples using a short preview window, or we minimize the norm of the difference with respect to a desired momentum-damping joint torque, or the two schemes are combined together. The resulting local control methods are all formulated as well-posed linear-quadratic problems, and their closed-form solutions generate also low joint velocities while addressing the primary torque optimization objectives. Stable and consistent behaviors are obtained along short or long Cartesian position trajectories. For the two addressed optimization problems in this thesis, the results are obtained using three different robot systems, namely a 3R planar arm, a 6R Universal Robots UR10, and a 7R KUKA LWR robot

    Configuration control of seven-degree-of-freedom arms

    Get PDF
    A seven degree of freedom robot arm with a six degree of freedom end effector is controlled by a processor employing a 6 by 7 Jacobian matrix for defining location and orientation of the end effector in terms of the rotation angles of the joints, a 1 (or more) by 7 Jacobian matrix for defining 1 (or more) user specified kinematic functions constraining location or movement of selected portions of the arm in terms of the joint angles, the processor combining the two Jacobian matrices to produce an augmented 7 (or more) by 7 Jacobian matrix, the processor effecting control by computing in accordance with forward kinematics from the augmented 7 by 7 Jacobian matrix and from the seven joint angles of the arm a set of seven desired joint angles for transmittal to the joint servo loops of the arm. One of the kinematic functions constraints the orientation of the elbow plane of the arm. Another one of the kinematic functions minimizes a sum of gravitational torques on the joints. Still another kinematic function constrains the location of the arm to perform collision avoidance. Generically, one kinematic function minimizes a sum of selected mechanical parameters of at least some of the joints associated with weighting coefficients which may be changed during arm movement. The mechanical parameters may be velocity errors or gravity torques associated with individual joints

    Locomotion Trajectory Generation For Legged Robots

    Get PDF
    This thesis addresses the problem of generating smooth and efficiently executable locomotion trajectories for legged robots under contact constraints. In addition, we want the trajectories to have the property that small changes in the foot position generate small changes in the joint target path. The first part of this thesis explores methods to select poses for a legged robot that maximises the workspace reachability while maintaining stability and contact constraints. It also explores methods to select configurations based on a reduced-dimensional search of the configuration space. The second part analyses time scaling strategy which tries to minimize the execution time while obeying the velocity and acceleration constraints. These two parts effectively result in smooth feasible trajectories for legged robots. Experiments on the RoboSimian robot demonstrate the effectiveness and scalability of the strategies described for walking and climbing on a rock climbing wall

    Geometry-aware Manipulability Learning, Tracking and Transfer

    Full text link
    Body posture influences human and robots performance in manipulation tasks, as appropriate poses facilitate motion or force exertion along different axes. In robotics, manipulability ellipsoids arise as a powerful descriptor to analyze, control and design the robot dexterity as a function of the articulatory joint configuration. This descriptor can be designed according to different task requirements, such as tracking a desired position or apply a specific force. In this context, this paper presents a novel \emph{manipulability transfer} framework, a method that allows robots to learn and reproduce manipulability ellipsoids from expert demonstrations. The proposed learning scheme is built on a tensor-based formulation of a Gaussian mixture model that takes into account that manipulability ellipsoids lie on the manifold of symmetric positive definite matrices. Learning is coupled with a geometry-aware tracking controller allowing robots to follow a desired profile of manipulability ellipsoids. Extensive evaluations in simulation with redundant manipulators, a robotic hand and humanoids agents, as well as an experiment with two real dual-arm systems validate the feasibility of the approach.Comment: Accepted for publication in the Intl. Journal of Robotics Research (IJRR). Website: https://sites.google.com/view/manipulability. Code: https://github.com/NoemieJaquier/Manipulability. 24 pages, 20 figures, 3 tables, 4 appendice

    ๊ธฐ๊ตฌํ•™์  ๋ฐ ๋™์  ์ œํ•œ์กฐ๊ฑด๋“ค์„ ๊ณ ๋ คํ•œ ๋ชจ๋ฐ”์ผ ๋งค๋‹ˆํ“ฐ๋ ˆ์ดํ„ฐ์˜ ์ž‘์—… ์ค‘์‹ฌ ์ „์‹  ๋™์ž‘ ์ƒ์„ฑ ์ „๋žต

    Get PDF
    ํ•™์œ„๋…ผ๋ฌธ(๋ฐ•์‚ฌ) -- ์„œ์šธ๋Œ€ํ•™๊ต๋Œ€ํ•™์› : ์œตํ•ฉ๊ณผํ•™๊ธฐ์ˆ ๋Œ€ํ•™์› ์œตํ•ฉ๊ณผํ•™๋ถ€(์ง€๋Šฅํ˜•์œตํ•ฉ์‹œ์Šคํ…œ์ „๊ณต), 2023. 2. ๋ฐ•์žฌํฅ.๋ชจ๋ฐ”์ผ ๋งค๋‹ˆํ“ฐ๋ ˆ์ดํ„ฐ๋Š” ๋ชจ๋ฐ”์ผ ๋กœ๋ด‡์— ์žฅ์ฐฉ๋œ ๋งค๋‹ˆํ“ฐ๋ ˆ์ดํ„ฐ์ž…๋‹ˆ๋‹ค. ๋ชจ๋ฐ”์ผ ๋งค๋‹ˆํ“ฐ๋ ˆ์ดํ„ฐ๋Š” ๊ณ ์ •ํ˜• ๋งค๋‹ˆํ“ฐ๋ ˆ์ดํ„ฐ์— ๋น„ํ•ด ๋ชจ๋ฐ”์ผ ๋กœ๋ด‡์˜ ์ด๋™์„ฑ์„ ์ œ๊ณต๋ฐ›๊ธฐ ๋•Œ๋ฌธ์— ๋‹ค์–‘ํ•˜๊ณ  ๋ณต์žกํ•œ ์ž‘์—…์„ ์ˆ˜ํ–‰ํ•  ์ˆ˜ ์žˆ์Šต๋‹ˆ๋‹ค. ๊ทธ๋Ÿฌ๋‚˜ ๋‘ ๊ฐœ์˜ ์„œ๋กœ ๋‹ค๋ฅธ ์‹œ์Šคํ…œ์„ ๊ฒฐํ•ฉํ•จ์œผ๋กœ์จ ๋ชจ๋ฐ”์ผ ๋งค๋‹ˆํ“ฐ๋ ˆ์ดํ„ฐ์˜ ์ „์‹ ์„ ๊ณ„ํšํ•˜๊ณ  ์ œ์–ดํ•  ๋•Œ ์—ฌ๋Ÿฌ ํŠน์ง•์„ ๊ณ ๋ คํ•ด์•ผ ํ•ฉ๋‹ˆ๋‹ค. ์ด๋Ÿฌํ•œ ํŠน์ง•๋“ค์€ ์—ฌ์ž์œ ๋„, ๋‘ ์‹œ์Šคํ…œ์˜ ๊ด€์„ฑ ์ฐจ์ด ๋ฐ ๋ชจ๋ฐ”์ผ ๋กœ๋ด‡์˜ ๋น„ํ™€๋กœ๋…ธ๋ฏน ์ œํ•œ ์กฐ๊ฑด ๋“ฑ์ด ์žˆ์Šต๋‹ˆ๋‹ค. ๋ณธ ๋…ผ๋ฌธ์˜ ๋ชฉ์ ์€ ๊ธฐ๊ตฌํ•™์  ๋ฐ ๋™์  ์ œํ•œ์กฐ๊ฑด๋“ค์„ ๊ณ ๋ คํ•˜์—ฌ ๋ชจ๋ฐ”์ผ ๋งค๋‹ˆํ“ฐ๋ ˆ์ดํ„ฐ์˜ ์ „์‹  ๋™์ž‘ ์ƒ์„ฑ ์ „๋žต์„ ์ œ์•ˆํ•˜๋Š” ๊ฒƒ์ž…๋‹ˆ๋‹ค. ๋จผ์ €, ๋ชจ๋ฐ”์ผ ๋งค๋‹ˆํ“ฐ๋ ˆ์ดํ„ฐ๊ฐ€ ์ดˆ๊ธฐ ์œ„์น˜์—์„œ ๋ฌธ์„ ํ†ต๊ณผํ•˜์—ฌ ๋ชฉํ‘œ ์œ„์น˜์— ๋„๋‹ฌํ•˜๊ธฐ ์œ„ํ•œ ์ „์‹  ๊ฒฝ๋กœ๋ฅผ ๊ณ„์‚ฐํ•˜๋Š” ํ”„๋ ˆ์ž„์›Œํฌ๋ฅผ ์ œ์•ˆํ•ฉ๋‹ˆ๋‹ค. ์ด ํ”„๋ ˆ์ž„์›Œํฌ๋Š” ๋กœ๋ด‡๊ณผ ๋ฌธ์— ์˜ํ•ด ์ƒ๊ธฐ๋Š” ๊ธฐ๊ตฌํ•™์  ์ œํ•œ์กฐ๊ฑด์„ ๊ณ ๋ คํ•ฉ๋‹ˆ๋‹ค. ์ œ์•ˆํ•˜๋Š” ํ”„๋ ˆ์ž„์›Œํฌ๋Š” ๋‘ ๋‹จ๊ณ„๋ฅผ ๊ฑฐ์ณ ์ „์‹ ์˜ ๊ฒฝ๋กœ๋ฅผ ์–ป์Šต๋‹ˆ๋‹ค. ์ฒซ ๋ฒˆ์งธ ๋‹จ๊ณ„์—์„œ๋Š” ๊ทธ๋ž˜ํ”„ ํƒ์ƒ‰ ์•Œ๊ณ ๋ฆฌ์ฆ˜์„ ์ด์šฉํ•˜์—ฌ ๋ชจ๋ฐ”์ผ ๋กœ๋ด‡์˜ ์ž์„ธ ๊ฒฝ๋กœ์™€ ๋ฌธ์˜ ๊ฐ๋„ ๊ฒฝ๋กœ๋ฅผ ๊ณ„์‚ฐํ•ฉ๋‹ˆ๋‹ค. ํŠนํžˆ, ๊ทธ๋ž˜ํ”„ ํƒ์ƒ‰์—์„œ area indicator๋ผ๋Š” ์ •์ˆ˜ ๋ณ€์ˆ˜๋ฅผ ์ƒํƒœ์˜ ๊ตฌ์„ฑ ์š”์†Œ๋กœ์„œ ์ •์˜ํ•˜๋Š”๋ฐ, ์ด๋Š” ๋ฌธ์— ๋Œ€ํ•œ ๋ชจ๋ฐ”์ผ ๋กœ๋ด‡์˜ ์ƒ๋Œ€์  ์œ„์น˜๋ฅผ ๋‚˜ํƒ€๋ƒ…๋‹ˆ๋‹ค. ๋‘ ๋ฒˆ์งธ ๋‹จ๊ณ„์—์„œ๋Š” ๋ชจ๋ฐ”์ผ ๋กœ๋ด‡์˜ ๊ฒฝ๋กœ์™€ ๋ฌธ์˜ ๊ฐ๋„๋ฅผ ํ†ตํ•ด ๋ฌธ์˜ ์†์žก์ด ์œ„์น˜๋ฅผ ๊ณ„์‚ฐํ•˜๊ณ  ์—ญ๊ธฐ๊ตฌํ•™์„ ํ™œ์šฉํ•˜์—ฌ ๋งค๋‹ˆํ“ฐ๋ ˆ์ดํ„ฐ์˜ ๊ด€์ ˆ ์œ„์น˜๋ฅผ ๊ณ„์‚ฐํ•ฉ๋‹ˆ๋‹ค. ์ œ์•ˆ๋œ ํ”„๋ ˆ์ž„์›Œํฌ์˜ ํšจ์œจ์„ฑ์€ ๋น„ํ™€๋กœ๋…ธ๋ฏน ๋ชจ๋ฐ”์ผ ๋งค๋‹ˆํ“ฐ๋ ˆ์ดํ„ฐ๋ฅผ ์‚ฌ์šฉํ•œ ์‹œ๋ฎฌ๋ ˆ์ด์…˜ ๋ฐ ์‹ค์ œ ์‹คํ—˜์„ ํ†ตํ•ด ๊ฒ€์ฆ๋˜์—ˆ์Šต๋‹ˆ๋‹ค. ๋‘˜ ์งธ, ์ตœ์ ํ™” ๋ฐฉ๋ฒ•์„ ๊ธฐ๋ฐ˜์œผ๋กœํ•œ ์ „์‹  ์ œ์–ด๊ธฐ๋ฅผ ์ œ์•ˆํ•ฉ๋‹ˆ๋‹ค. ์ด ๋ฐฉ๋ฒ•์€ ๋“ฑ์‹ ๋ฐ ๋ถ€๋“ฑ์‹ ์ œํ•œ์กฐ๊ฑด ๋ชจ๋‘์— ๋Œ€ํ•ด ๊ฐ€์ค‘ ํ–‰๋ ฌ์„ ๋ฐ˜์˜ํ•œ ๊ณ„์ธต์  ์ตœ์ ํ™” ๋ฌธ์ œ์˜ ํ•ด๋ฅผ ๊ณ„์‚ฐํ•ฉ๋‹ˆ๋‹ค. ์ด ๋ฐฉ๋ฒ•์€ ๋ชจ๋ฐ”์ผ ๋งค๋‹ˆํ“ฐ๋ ˆ์ดํ„ฐ ๋˜๋Š” ํœด๋จธ๋…ธ์ด๋“œ์™€ ๊ฐ™์ด ์ž์œ ๋„๊ฐ€ ๋งŽ์€ ๋กœ๋ด‡์˜ ์—ฌ์ž์œ ๋„๋ฅผ ํ•ด๊ฒฐํ•˜๊ธฐ ์œ„ํ•ด ๊ฐœ๋ฐœ๋˜์–ด ์ž‘์—… ์šฐ์„  ์ˆœ์œ„์— ๋”ฐ๋ผ ๊ฐ€์ค‘์น˜๊ฐ€ ๋‹ค๋ฅธ ๊ด€์ ˆ ๋™์ž‘์œผ๋กœ ์—ฌ๋Ÿฌ ์ž‘์—…์„ ์ˆ˜ํ–‰ํ•  ์ˆ˜ ์žˆ์Šต๋‹ˆ๋‹ค. ์ œ์•ˆ๋œ ๋ฐฉ๋ฒ•์€ ๊ฐ€์ค‘ ํ–‰๋ ฌ์„ ์ตœ์ ํ™” ๋ฌธ์ œ์˜ 1์ฐจ ์ตœ์  ์กฐ๊ฑด์„ ๋งŒ์กฑํ•˜๋„๋ก ํ•˜๋ฉฐ, Active-set ๋ฐฉ๋ฒ•์„ ํ™œ์šฉํ•˜์—ฌ ๋“ฑ์‹ ๋ฐ ๋ถ€๋“ฑ์‹ ์ž‘์—…์„ ์ฒ˜๋ฆฌํ•ฉ๋‹ˆ๋‹ค. ๋˜ํ•œ, ๋Œ€์นญ์ ์ธ ์˜๊ณต๊ฐ„ ์‚ฌ์˜ ํ–‰๋ ฌ์„ ์‚ฌ์šฉํ•˜์—ฌ ๊ณ„์‚ฐ์ƒ ํšจ์œจ์ ์ž…๋‹ˆ๋‹ค. ๊ฒฐ๊ณผ์ ์œผ๋กœ, ์ œ์•ˆ๋œ ์ œ์–ด๊ธฐ๋ฅผ ํ™œ์šฉํ•˜๋Š” ๋กœ๋ด‡์€ ์šฐ์„  ์ˆœ์œ„์— ๋”ฐ๋ผ ๊ฐœ๋ณ„์ ์ธ ๊ด€์ ˆ ๊ฐ€์ค‘์น˜๋ฅผ ๋ฐ˜์˜ํ•˜์—ฌ ์ „์‹  ์›€์ง์ž„์„ ํšจ๊ณผ์ ์œผ๋กœ ๋ณด์—ฌ์ค๋‹ˆ๋‹ค. ์ œ์•ˆ๋œ ์ œ์–ด๊ธฐ์˜ ํšจ์šฉ์„ฑ์€ ๋ชจ๋ฐ”์ผ ๋งค๋‹ˆํ“ฐ๋ ˆ์ดํ„ฐ์™€ ํœด๋จธ๋…ธ์ด๋“œ๋ฅผ ์ด์šฉํ•œ ์‹คํ—˜์„ ํ†ตํ•ด ๊ฒ€์ฆํ•˜์˜€์Šต๋‹ˆ๋‹ค. ๋งˆ์ง€๋ง‰์œผ๋กœ, ๋ชจ๋ฐ”์ผ ๋งค๋‹ˆํ“ฐ๋ ˆ์ดํ„ฐ์˜ ๋™์  ์ œํ•œ์กฐ๊ฑด๋“ค ์ค‘ ํ•˜๋‚˜๋กœ์„œ ์ž๊ฐ€ ์ถฉ๋Œ ํšŒํ”ผ ์•Œ๊ณ ๋ฆฌ์ฆ˜์„ ์ œ์•ˆํ•ฉ๋‹ˆ๋‹ค. ์ œ์•ˆ๋œ ๋ฐฉ๋ฒ•์€ ๋งค๋‹ˆํ“ฐ๋ ˆ์ดํ„ฐ์™€ ๋ชจ๋ฐ”์ผ ๋กœ๋ด‡ ๊ฐ„์˜ ์ž๊ฐ€ ์ถฉ๋Œ์— ์ค‘์ ์„ ๋‘ก๋‹ˆ๋‹ค. ๋ชจ๋ฐ”์ผ ๋กœ๋ด‡์˜ ๋ฒ„ํผ ์˜์—ญ์„ ๋‘˜๋Ÿฌ์‹ธ๋Š” 3์ฐจ์› ๊ณก๋ฉด์ธ distance buffer border์˜ ๊ฐœ๋…์„ ์ •์˜ํ•ฉ๋‹ˆ๋‹ค. ๋ฒ„ํผ ์˜์—ญ์˜ ๋‘๊ป˜๋Š” ๋ฒ„ํผ ๊ฑฐ๋ฆฌ์ž…๋‹ˆ๋‹ค. ๋งค๋‹ˆํ“ฐ๋ ˆ์ดํ„ฐ์™€ ๋ชจ๋ฐ”์ผ ๋กœ๋ด‡ ์‚ฌ์ด์˜ ๊ฑฐ๋ฆฌ๊ฐ€ ๋ฒ„ํผ ๊ฑฐ๋ฆฌ๋ณด๋‹ค ์ž‘์€ ๊ฒฝ์šฐ, ์ฆ‰ ๋งค๋‹ˆํ“ฐ๋ ˆ์ดํ„ฐ๊ฐ€ ๋ชจ๋ฐ”์ผ ๋กœ๋ด‡์˜ ๋ฒ„ํผ ์˜์—ญ ๋‚ด๋ถ€์— ์žˆ๋Š” ๊ฒฝ์šฐ ์ œ์•ˆ๋œ ์ „๋žต์€ ๋งค๋‹ˆํ“ฐ๋ ˆ์ดํ„ฐ๋ฅผ ๋ฒ„ํผ ์˜์—ญ ๋ฐ–์œผ๋กœ ๋‚ด๋ณด๋‚ด๊ธฐ ์œ„ํ•ด ๋ชจ๋ฐ”์ผ ๋กœ๋ด‡์˜ ์›€์ง์ž„์„ ์ƒ์„ฑํ•ฉ๋‹ˆ๋‹ค. ๋”ฐ๋ผ์„œ ๋งค๋‹ˆํ“ฐ๋ ˆ์ดํ„ฐ๋Š” ๋ฏธ๋ฆฌ ์ •์˜๋œ ๋งค๋‹ˆํ“ฐ๋ ˆ์ดํ„ฐ์˜ ์›€์ง์ž„์„ ์ˆ˜์ •ํ•˜์ง€ ์•Š๊ณ ๋„ ๋ชจ๋ฐ”์ผ ๋กœ๋ด‡๊ณผ์˜ ์ž๊ฐ€ ์ถฉ๋Œ์„ ํ”ผํ•  ์ˆ˜ ์žˆ์Šต๋‹ˆ๋‹ค. ๋ชจ๋ฐ”์ผ ๋กœ๋ด‡์˜ ์›€์ง์ž„์€ ๊ฐ€์ƒ์˜ ํž˜์„ ๊ฐ€ํ•จ์œผ๋กœ์จ ์ƒ์„ฑ๋ฉ๋‹ˆ๋‹ค. ํŠนํžˆ, ํž˜์˜ ๋ฐฉํ–ฅ์€ ์ฐจ๋™ ๊ตฌ๋™ ์ด๋™ ๋กœ๋ด‡์˜ ๋น„ํ™€๋กœ๋…ธ๋ฏน ์ œ์•ฝ ๋ฐ ์กฐ์ž‘๊ธฐ์˜ ๋„๋‹ฌ ๊ฐ€๋Šฅ์„ฑ์„ ๊ณ ๋ คํ•˜์—ฌ ๊ฒฐ์ •๋ฉ๋‹ˆ๋‹ค. ์ œ์•ˆ๋œ ์•Œ๊ณ ๋ฆฌ์ฆ˜์€ 7์ž์œ ๋„ ๋กœ๋ด‡ํŒ”์„ ๊ฐ€์ง„ ์ฐจ๋™ ๊ตฌ๋™ ๋ชจ๋ฐ”์ผ ๋กœ๋ด‡์— ์ ์šฉํ•˜์—ฌ ๋‹ค์–‘ํ•œ ์‹คํ—˜ ์‹œ๋‚˜๋ฆฌ์˜ค์—์„œ ์ž…์ฆ๋˜์—ˆ์Šต๋‹ˆ๋‹ค.A mobile manipulator is a manipulator mounted on a mobile robot. Compared to a fixed-base manipulator, the mobile manipulator can perform various and complex tasks because the mobility is offered by the mobile robot. However, combining two different systems causes several features to be considered when generating the whole-body motion of the mobile manipulator. The features include redundancy, inertia difference, and non-holonomic constraint. The purpose of this thesis is to propose the whole-body motion generation strategy of the mobile manipulator for considering kinematic and dynamic constraints. First, a planning framework is proposed that computes a path for the whole-body configuration of the mobile manipulator to navigate from the initial position, traverse through the door, and arrive at the target position. The framework handles the kinematic constraint imposed by the closed-chain between the robot and door. The proposed framework obtains the path of the whole-body configuration in two steps. First, the path for the pose of the mobile robot and the path for the door angle are computed by using the graph search algorithm. In graph search, an integer variable called area indicator is introduced as an element of state, which indicates where the robot is located relative to the door. Especially, the area indicator expresses a process of door traversal. In the second step, the configuration of the manipulator is computed by the inverse kinematics (IK) solver from the path of the mobile robot and door angle. The proposed framework has a distinct advantage over the existing methods that manually determine several parameters such as which direction to approach the door and the angle of the door required for passage. The effectiveness of the proposed framework was validated through experiments with a nonholonomic mobile manipulator. Second, a whole-body controller is presented based on the optimization method that can consider both equality and inequality constraints. The method computes the optimal solution of the weighted hierarchical optimization problem. The method is developed to resolve the redundancy of robots with a large number of Degrees of Freedom (DOFs), such as a mobile manipulator or a humanoid, so that they can execute multiple tasks with differently weighted joint motion for each task priority. The proposed method incorporates the weighting matrix into the first-order optimality condition of the optimization problem and leverages an active-set method to handle equality and inequality constraints. In addition, it is computationally efficient because the solution is calculated in a weighted joint space with symmetric null-space projection matrices for propagating recursively to a low priority task. Consequently, robots that utilize the proposed controller effectively show whole-body motions handling prioritized tasks with differently weighted joint spaces. The effectiveness of the proposed controller was validated through experiments with a nonholonomic mobile manipulator as well as a humanoid. Lastly, as one of dynamic constraints for the mobile manipulator, a reactive self-collision avoidance algorithm is developed. The proposed method mainly focuses on self-collision between a manipulator and the mobile robot. We introduce the concept of a distance buffer border (DBB), which is a 3D curved surface enclosing a buffer region of the mobile robot. The region has the thickness equal to buffer distance. When the distance between the manipulator and mobile robot is less than the buffer distance, i.e. the manipulator lies inside the buffer region of the mobile robot, the proposed strategy is to move the mobile robot away from the manipulator in order for the manipulator to be placed outside the border of the region, the DBB. The strategy is achieved by exerting force on the mobile robot. Therefore, the manipulator can avoid self-collision with the mobile robot without modifying the predefined motion of the manipulator in a world Cartesian coordinate frame. In particular, the direction of the force is determined by considering the non-holonomic constraint of the differentially driven mobile robot. Additionally, the reachability of the manipulator is considered to arrive at a configuration in which the manipulator can be more maneuverable. To realize the desired force and resulting torque, an avoidance task is constructed by converting them into the accelerations of the mobile robot and smoothly inserted with a top priority into the controller. The proposed algorithm was implemented on a differentially driven mobile robot with a 7-DOFs robotic arm and its performance was demonstrated in various experimental scenarios.1 INTRODUCTION 1 1.1 Motivation 1 1.2 Contributions of thesis 2 1.3 Overview of thesis 3 2 WHOLE-BODY MOTION PLANNER : APPLICATION TO NAVIGATION INCLUDING DOOR TRAVERSAL 5 2.1 Background & related works 7 2.2 Proposed framework 9 2.2.1 Computing path for mobile robot and door angle - S1 10 2.2.1.1 State 10 2.2.1.2 Action 13 2.2.1.3 Cost 15 2.2.1.4 Search 18 2.2.2 Computing path for arm configuration - S2 20 2.3 Results 21 2.3.1 Application to pull and push-type door 21 2.3.2 Experiment in cluttered environment 22 2.3.3 Experiment with different robot platform 23 2.3.4 Comparison with separate planning by existing works 24 2.3.5 Experiment with real robot 29 2.4 Conclusion 29 3 WHOLE-BODY CONTROLLER : WEIGHTED HIERARCHICAL QUADRATIC PROGRAMMING 31 3.1 Related works 32 3.2 Problem statement 34 3.2.1 Pseudo-inverse with weighted least-squares norm for each task 35 3.2.2 Problem statement 37 3.3 WHQP with equality constraints 37 3.4 WHQP with inequality constraints 45 3.5 Experimental results 48 3.5.1 Simulation experiment with nonholonomic mobile manipulator 48 3.5.1.1 Scenario description 48 3.5.1.2 Task and weighting matrix description 49 3.5.1.3 Results 51 3.5.2 Real experiment with nonholonomic mobile manipulator 53 3.5.2.1 Scenario description 53 3.5.2.2 Task and weighting matrix description 53 3.5.2.3 Results 54 3.5.3 Real experiment with humanoid 55 3.5.3.1 Scenario description 55 3.5.3.2 Task and weighting matrix description 55 3.5.3.3 Results 57 3.6 Discussions and implementation details 57 3.6.1 Computation cost 57 3.6.2 Composite weighting matrix in same hierarchy 59 3.6.3 Nullity of WHQP 59 3.7 Conclusion 59 4 WHOLE-BODY CONSTRAINT : SELF-COLLISION AVOIDANCE 61 4.1 Background & related Works 64 4.2 Distance buffer border and its score computation 65 4.2.1 Identification of potentially colliding link pairs 66 4.2.2 Distance buffer border 67 4.2.3 Evaluation of distance buffer border 69 4.2.3.1 Singularity of the differentially driven mobile robot 69 4.2.3.2 Reachability of the manipulator 72 4.2.3.3 Score of the DBB 74 4.3 Self-collision avoidance algorithm 75 4.3.1 Generation of the acceleration for the mobile robot 76 4.3.2 Generation of the repulsive acceleration for the other link pair 82 4.3.3 Construction of an acceleration-based task for self-collision avoidance 83 4.3.4 Insertion of the task in HQP-based controller 83 4.4 Experimental results 86 4.4.1 System overview 87 4.4.2 Experimental results 87 4.4.2.1 Self-collision avoidance while tracking the predefined trajectory 87 4.4.2.2 Self-collision avoidance while manually guiding the end-effector 89 4.4.2.3 Extension to obstacle avoidance when opening the refrigerator 91 4.4.3 Discussion 94 4.5 Conclusion 95 5 CONCLUSIONS 97 Abstract (In Korean) 113 Acknowlegement 116๋ฐ•

    Dynamics and Motion of a Six Degree of Freedom Robot Manipulator

    Get PDF
    In this thesis, a strategy to accomplish pick-and-place operations using a six degree-of-freedom (DOF) robotic arm attached to a wheeled mobile robot is presented. This research work is part of a bigger project in developing a robotic-assisted nursing to be used in medical settings. The significance of this project relies on the increasing demand for elderly and disabled skilled care assistance which nowadays has become insufficient. Strong efforts have been made to incorporate technology to fulfill these needs. Several methods were implemented to make a 6-DOF manipulator capable of performing pick-and-place operations. Some of these methods were used to achieve specific tasks such as: solving the inverse kinematics problem, or planning a collision-free path. Other methods, such as forward kinematics description, workspace evaluation, and dexterity analysis, were used to describe the manipulator and its capabilities. The manipulator was accurately described by obtaining the link transformation matrices from each joint using the Denavit-Hartenberg (DH) notations. An Iterative Inverse Kinematics method (IIK) was used to find multiple configurations for the manipulator along a given path. The IIK method was based on the specific geometric characteristic of the manipulator, in which several joints share a common plane. To find admissible solutions along the path, the workspace of the manipulator was considered. Algebraic formulations to obtain the specific workspace of the 6-DOF manipulator on the Cartesian coordinate space were derived from the singular configurations of the manipulator. Local dexterity analysis was also required to identify possible orientations of the end-effector for specific Cartesian coordinate positions. The closed-form expressions for the range of such orientations were derived by adapting an existing dexterity method. Two methods were implemented to plan the free-collision path needed to move an object from one place to another without colliding with an obstacle. Via-points were added to avoid the robot mobile platform and the zones in which the manipulator presented motion difficulties. Finally, the segments located between initial, final, and via-points positions, were connected using straight lines forming a global path. To form the collision-free path, the straight-line were modified to avoid the obstacles that intersected the path. The effectiveness of the proposed analysis was verified by comparing simulation and experimental results. Three predefined paths were used to evaluate the IIK method. Ten different scenarios with different number and pattern of obstacles were used to verify the efficiency of the entire path planning algorithm. Overall results confirmed the efficiency of the implemented methods for performing pick-and-place operations with a 6-DOF manipulator
    • โ€ฆ
    corecore