260 research outputs found

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

    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๋ฐ•

    Visual guidance of unmanned aerial manipulators

    Get PDF
    The ability to fly has greatly expanded the possibilities for robots to perform surveillance, inspection or map generation tasks. Yet it was only in recent years that research in aerial robotics was mature enough to allow active interactions with the environment. The robots responsible for these interactions are called aerial manipulators and usually combine a multirotor platform and one or more robotic arms. The main objective of this thesis is to formalize the concept of aerial manipulator and present guidance methods, using visual information, to provide them with autonomous functionalities. A key competence to control an aerial manipulator is the ability to localize it in the environment. Traditionally, this localization has required external infrastructure of sensors (e.g., GPS or IR cameras), restricting the real applications. Furthermore, localization methods with on-board sensors, exported from other robotics fields such as simultaneous localization and mapping (SLAM), require large computational units becoming a handicap in vehicles where size, load, and power consumption are important restrictions. In this regard, this thesis proposes a method to estimate the state of the vehicle (i.e., position, orientation, velocity and acceleration) by means of on-board, low-cost, light-weight and high-rate sensors. With the physical complexity of these robots, it is required to use advanced control techniques during navigation. Thanks to their redundancy on degrees-of-freedom, they offer the possibility to accomplish not only with mobility requirements but with other tasks simultaneously and hierarchically, prioritizing them depending on their impact to the overall mission success. In this work we present such control laws and define a number of these tasks to drive the vehicle using visual information, guarantee the robot integrity during flight, and improve the platform stability or increase arm operability. The main contributions of this research work are threefold: (1) Present a localization technique to allow autonomous navigation, this method is specifically designed for aerial platforms with size, load and computational burden restrictions. (2) Obtain control commands to drive the vehicle using visual information (visual servo). (3) Integrate the visual servo commands into a hierarchical control law by exploiting the redundancy of the robot to accomplish secondary tasks during flight. These tasks are specific for aerial manipulators and they are also provided. All the techniques presented in this document have been validated throughout extensive experimentation with real robotic platforms.La capacitat de volar ha incrementat molt les possibilitats dels robots per a realitzar tasques de vigilร ncia, inspecciรณ o generaciรณ de mapes. Tot i aixรฒ, no รฉs fins fa pocs anys que la recerca en robรฒtica aรจria ha estat prou madura com per comenรงar a permetre interaccions amb lโ€™entorn dโ€™una manera activa. Els robots per a fer-ho sโ€™anomenen manipuladors aeris i habitualment combinen una plataforma multirotor i un braรง robรฒtic. Lโ€™objectiu dโ€™aquesta tesi รฉs formalitzar el concepte de manipulador aeri i presentar mรจtodes de guiatge, utilitzant informaciรณ visual, per dotar dโ€™autonomia aquest tipus de vehicles. Una competรจncia clau per controlar un manipulador aeri รฉs la capacitat de localitzar-se en lโ€™entorn. Tradicionalment aquesta localitzaciรณ ha requerit dโ€™infraestructura sensorial externa (GPS, cร meres IR, etc.), limitant aixรญ les aplicacions reals. Pel contrari, sistemes de localitzaciรณ exportats dโ€™altres camps de la robรฒtica basats en sensors a bord, com per exemple mรจtodes de localitzaciรณ i mapejat simultร nis (SLAM), requereixen de gran capacitat de cรฒmput, caracterรญstica que penalitza molt en vehicles on la mida, pes i consum elรจctric son grans restriccions. En aquest sentit, aquesta tesi proposa un mรจtode dโ€™estimaciรณ dโ€™estat del robot (posiciรณ, velocitat, orientaciรณ i acceleraciรณ) a partir de sensors instalยทlats a bord, de baix cost, baix consum computacional i que proporcionen mesures a alta freqรผรจncia. Degut a la complexitat fรญsica dโ€™aquests robots, รฉs necessari lโ€™รบs de tรจcniques de control avanรงades. Grร cies a la seva redundร ncia de graus de llibertat, aquests robots ens ofereixen la possibilitat de complir amb els requeriments de mobilitat i, simultร niament, realitzar tasques de manera jerร rquica, ordenant-les segons lโ€™impacte en lโ€™acompliment de la missiรณ. En aquest treball es presenten aquestes lleis de control, juntament amb la descripciรณ de tasques per tal de guiar visualment el vehicle, garantir la integritat del robot durant el vol, millorar de lโ€™estabilitat del vehicle o augmentar la manipulabilitat del braรง. Aquesta tesi es centra en tres aspectes fonamentals: (1) Presentar una tรจcnica de localitzaciรณ per dotar dโ€™autonomia el robot. Aquest mรจtode estร  especialment dissenyat per a plataformes amb restriccions de capacitat computacional, mida i pes. (2) Obtenir les comandes de control necessร ries per guiar el vehicle a partir dโ€™informaciรณ visual. (3) Integrar aquestes accions dins una estructura de control jerร rquica utilitzant la redundร ncia del robot per complir altres tasques durant el vol. Aquestes tasques son especรญfiques per a manipuladors aeris i tambรฉ es defineixen en aquest document. Totes les tรจcniques presentades en aquesta tesi han estat avaluades de manera experimental amb plataformes robรฒtiques real

    Experience-driven optimal motion synthesis in complex and shared environments

    Get PDF
    Optimal loco-manipulation planning and control for high-dimensional systems based on general, non-linear optimisation allows for the specification of versatile motion subject to complex constraints. However, complex, non-linear system and environment dynamics, switching contacts, and collision avoidance in cluttered environments introduce non-convexity and discontinuity in the optimisation space. This renders finding optimal solutions in complex and changing environments an open and challenging problem in robotics. Global optimisation methods can take a prohibitively long time to converge. Slow convergence makes them unsuitable for live deployment and online re-planning of motion policies in response to changes in the task or environment. Local optimisation techniques, in contrast, converge fast within the basin of attraction of a minimum but may not converge at all without a good initial guess as they can easily get stuck in local minima. Local methods are, therefore, a suitable choice provided we can supply a good initial guess. If a similarity between problems can be found and exploited, a memory of optimal solutions can be computed and compressed efficiently in an offline computation process. During runtime, we can query this memory to bootstrap motion synthesis by providing a good initial seed to the local optimisation solver. In order to realise such a system, we need to address several connected problems and questions: First, the formulation of the optimisation problem (and its parametrisation to allow solutions to transfer to new scenarios), and related, the type and granularity of user input, along with a strategy for recovery and feedback in case of unexpected changes or failure. Second, a sampling strategy during the database/memory generation that explores the parameter space efficiently without resorting to exhaustive measures---i.e., to balance storage size/memory with online runtime to adapt/repair the initial guess. Third, the question of how to represent the problem and environment to parametrise, compute, store, retrieve, and exploit the memory efficiently during pre-computation and runtime. One strategy to make the problem computationally tractable is to decompose planning into a series of sequential sub-problems, e.g., contact-before-motion approaches which sequentially perform goal state planning, contact planning, motion planning, and encoding. Here, subsequent stages operate within the null-space of the constraints of the prior problem, such as the contact mode or sequence. This doctoral thesis follows this line of work. It investigates general optimisation-based formulations for motion synthesis along with a strategy for exploration, encoding, and exploitation of a versatile memory-of-motion for providing an initial guess to optimisation solvers. In particular, we focus on manipulation in complex environments with high-dimensional robot systems such as humanoids and mobile manipulators. The first part of this thesis focuses on collision-free motion generation to reliably generate motions. We present a general, collision-free inverse kinematics method using a combination of gradient-based local optimisation with random/evolution strategy restarting to achieve high success rates and avoid local minima. We use formulations for discrete collision avoidance and introduce a novel, computationally fast continuous collision avoidance objective based on conservative advancement and harmonic potential fields. Using this, we can synthesise continuous-time collision-free motion plans in the presence of moving obstacles. It further enables to discretise trajectories with fewer waypoints, which in turn considerably reduces the optimisation problem complexity, and thus, time to solve. The second part focuses on problem representations and exploration. We first introduce an efficient solution encoding for trajectory library-based approaches. This representation, paired with an accompanying exploration strategy for offline pre-computation, permits the application of inexpensive distance metrics during runtime. We demonstrate how our method efficiently re-uses trajectory samples, increases planning success rates, and reduces planning time while being highly memory-efficient. We subsequently present a method to explore the topological features of the solution space using tools from computational homology. This enables us to cluster solutions according to their inherent structure which increases the success of warm-starting for problems with discontinuities and multi-modality. The third part focuses on real-world deployment in laboratory and field experiments as well as incorporating user input. We present a framework for robust shared autonomy with a focus on continuous scene monitoring for assured safety. This framework further supports interactive adjustment of autonomy levels from fully teleoperated to automatic execution of stored behaviour sequences. Finally, we present sensing and control for the integration and embodiment of the presented methodology in high-dimensional real-world platforms used in laboratory experiments and real-world deployment. We validate our presented methods using hardware experiments on a variety of robot platforms demonstrating generalisation to other robots and environments

    ๊ตฌ์กฐ๋กœ๋ด‡์„ ์œ„ํ•œ ๊ฐ•๊ฑดํ•œ ๊ณ„์ธต์  ๋™์ž‘ ๊ณ„ํš ๋ฐ ์ œ์–ด

    Get PDF
    ํ•™์œ„๋…ผ๋ฌธ(๋ฐ•์‚ฌ) -- ์„œ์šธ๋Œ€ํ•™๊ต๋Œ€ํ•™์› : ๊ณต๊ณผ๋Œ€ํ•™ ๊ธฐ๊ณ„ํ•ญ๊ณต๊ณตํ•™๋ถ€, 2021.8. ๋ฐ•์ข…์šฐ.Over the last several years, robotics has experienced a striking development, and a new generation of robots has emerged that shows great promise in being able to accomplish complex tasks associated with human behavior. Nowadays the objectives of the robots are no longer restricted to the automaton in the industrial process but are changing into explorers for hazardous, harsh, uncooperative, and extreme environments. As these robots usually operate in dynamic and unstructured environments, they should be robust, adaptive, and reactive under various changing operation conditions. We propose online hierarchical optimization-based planning and control methodologies for a rescue robot to execute a given mission in such a highly unstructured environment. A large number of degrees of freedom is provided to robots in order to achieve diverse kinematic and dynamic tasks. However, accomplishing such multiple objectives renders on-line reactive motion planning and control problems more difficult to solve due to the incompatible tasks. To address this problem, we exploit a hierarchical structure to precisely resolve conflicts by creating a priority in which every task is achieved as much as possible according to the levels. In particular, we concentrate on the reasoning about the task regularization to ensure the convergence and robustness of a solution in the face of singularity. As robotic systems with real-time motion planners or controllers often execute unrehearsed missions, a desired task cannot always be driven to a singularity free configuration. We develop a generic solver for regularized hierarchical quadratic programming without resorting to any off-the-shelf QP solver to take advantage of the null-space projections for computational efficiency. Therefore, the underlying principles are thoroughly investigated. The robust optimal solution is obtained under both equality and inequality tasks or constraints while addressing all problems resulting from the regularization. Especially as a singular value decomposition centric approach is leveraged, all hierarchical solutions and Lagrange multipliers for properly handling the inequality constraints are analytically acquired in a recursive procedure. The proposed algorithm works fast enough to be used as a practical means of real-time control system, so that it can be used for online motion planning, motion control, and interaction force control in a single hierarchical optimization. Core system design concepts of the rescue robot are presented. The goals of the robot are to safely extract a patient and to dispose a dangerous object instead of humans. The upper body is designed humanoid in form with replaceable modularized dual arms. The lower body is featured with a hybrid tracked and legged mobile platform to simultaneously acquire versatile manipulability and all-terrain mobility. Thus, the robot can successfully execute a driving task, dangerous object manipulation, and casualty extraction missions by changing the pose and modularized equipments in an optimized manner. Throughout the dissertation, all proposed methods are validated through extensive numerical simulations and experimental tests. We highlight precisely how the rescue robot can execute a casualty extraction and a dangerous object disposal mission both in indoor and outdoor environments that none of the existing robots has performed.์ตœ๊ทผ์— ๋“ฑ์žฅํ•œ ์ƒˆ๋กœ์šด ์„ธ๋Œ€์˜ ๋กœ๋ด‡์€ ๊ธฐ์กด์—๋Š” ์ธ๊ฐ„๋งŒ์ด ํ•  ์ˆ˜ ์žˆ์—ˆ๋˜ ๋ณต์žกํ•œ ์ผ์„ ๋กœ๋ด‡ ๋˜ํ•œ ์ˆ˜ํ–‰ํ•  ์ˆ˜ ์žˆ์Œ์„ ๋ณด์—ฌ์ฃผ์—ˆ๋‹ค. ํŠนํžˆ DARPA Robotics Challenge๋ฅผ ํ†ตํ•ด ์ด๋Ÿฌํ•œ ์‚ฌ์‹ค์„ ์ž˜ ํ™•์ธํ•  ์ˆ˜ ์žˆ์œผ๋ฉฐ, ์ด ๋กœ๋ด‡๋“ค์€ ๊ณต์žฅ๊ณผ ๊ฐ™์€ ์ •ํ˜•ํ™”๋œ ํ™˜๊ฒฝ์—์„œ ์ž๋™ํ™”๋œ ์ผ์„ ๋ฐ˜๋ณต์ ์œผ๋กœ ์ˆ˜ํ–‰ํ•˜๋˜ ์ž„๋ฌด์—์„œ ๋” ๋‚˜์•„๊ฐ€ ๊ทนํ•œ์˜ ํ™˜๊ฒฝ์—์„œ ์ธ๊ฐ„์„ ๋Œ€์‹ ํ•˜์—ฌ ์œ„ํ—˜ํ•œ ์ž„๋ฌด๋ฅผ ์ˆ˜ํ–‰ํ•  ์ˆ˜ ์žˆ๋Š” ๋ฐฉํ–ฅ์œผ๋กœ ๋ฐœ์ „ํ•˜๊ณ  ์žˆ๋‹ค. ๊ทธ๋ž˜์„œ ์‚ฌ๋žŒ๋“ค์€ ์žฌ๋‚œํ™˜๊ฒฝ์—์„œ ์•ˆ์ „ํ•˜๊ณ  ์‹œ์˜ ์ ์ ˆํ•˜๊ฒŒ ๋Œ€์‘ํ•  ์ˆ˜ ์žˆ๋Š” ์—ฌ๋Ÿฌ ๊ฐ€์ง€ ๋Œ€์•ˆ ์ค‘์—์„œ ์‹คํ˜„ ๊ฐ€๋Šฅ์„ฑ์ด ๋†’์€ ๋Œ€์ฒ˜ ๋ฐฉ์•ˆ์œผ๋กœ ๋กœ๋ด‡์„ ์ƒ๊ฐํ•˜๊ฒŒ ๋˜์—ˆ๋‹ค. ํ•˜์ง€๋งŒ ์ด๋Ÿฌํ•œ ๋กœ๋ด‡์€ ๋™์ ์œผ๋กœ ๋ณ€ํ™”ํ•˜๋Š” ๋น„์ •ํ˜• ํ™˜๊ฒฝ์—์„œ ์ž„๋ฌด๋ฅผ ์ˆ˜ํ–‰ํ•  ์ˆ˜ ์žˆ์–ด์•ผ ํ•˜๊ธฐ ๋•Œ๋ฌธ์— ๋ถˆํ™•์‹ค์„ฑ์— ๋Œ€ํ•ด ๊ฐ•๊ฑดํ•ด์•ผํ•˜๊ณ , ๋‹ค์–‘ํ•œ ํ™˜๊ฒฝ ์กฐ๊ฑด์—์„œ ๋Šฅ๋™์ ์œผ๋กœ ๋ฐ˜์‘์„ ํ•  ์ˆ˜ ์žˆ์–ด์•ผ ํ•œ๋‹ค. ๋ณธ ํ•™์œ„๋…ผ๋ฌธ์—์„œ๋Š” ๋กœ๋ด‡์ด ๋น„์ •ํ˜• ํ™˜๊ฒฝ์—์„œ ๊ฐ•๊ฑดํ•˜๋ฉด์„œ๋„ ์ ์‘์ ์œผ๋กœ ๋™์ž‘ํ•  ์ˆ˜ ์žˆ๋Š” ์‹ค์‹œ๊ฐ„ ์ตœ์ ํ™” ๊ธฐ๋ฐ˜์˜ ๋™์ž‘ ๊ณ„ํš ๋ฐ ์ œ์–ด ๋ฐฉ๋ฒ•๊ณผ ๊ตฌ์กฐ ๋กœ๋ด‡์˜ ์„ค๊ณ„ ๊ฐœ๋…์„ ์ œ์•ˆํ•˜๊ณ ์ž ํ•œ๋‹ค. ์ธ๊ฐ„์€ ๋งŽ์€ ์ž์œ ๋„๋ฅผ ๊ฐ€์ง€๊ณ  ์žˆ์œผ๋ฉฐ, ํ•˜๋‚˜์˜ ์ „์‹  ๋™์ž‘์„ ์ƒ์„ฑํ•  ๋•Œ ๋‹ค์–‘ํ•œ ๊ธฐ๊ตฌํ•™ ํ˜น์€ ๋™์—ญํ•™์  ํŠน์„ฑ์„ ๊ฐ€์ง€๋Š” ์„ธ๋ถ€ ๋™์ž‘ ํ˜น์€ ์ž‘์—…์„ ์ •์˜ํ•˜๊ณ , ์ด๋ฅผ ํšจ๊ณผ์ ์œผ๋กœ ์ข…ํ•ฉํ•  ์ˆ˜ ์žˆ๋‹ค. ๊ทธ๋ฆฌ๊ณ  ํ•™์Šต์„ ํ†ตํ•ด ๊ฐ ๋™์ž‘ ์š”์†Œ๋“ค์„ ์ตœ์ ํ™”ํ•  ๋ฟ๋งŒ ์•„๋‹ˆ๋ผ ์ƒํ™ฉ ์— ๋”ฐ๋ผ ๊ฐ ๋™์ž‘ ์š”์†Œ์— ์šฐ์„ ์ˆœ์œ„๋ฅผ ๋ถ€์—ฌํ•˜์—ฌ ์ด๋ฅผ ํšจ๊ณผ์ ์œผ๋กœ ๊ฒฐํ•ฉํ•˜๊ฑฐ๋‚˜ ๋ถ„๋ฆฌํ•˜์—ฌ ์‹ค์‹œ๊ฐ„์œผ๋กœ ์ตœ์ ์˜ ๋™์ž‘์„ ์ƒ์„ฑํ•˜๊ณ  ์ œ์–ดํ•œ๋‹ค. ์ฆ‰, ์ƒํ™ฉ์— ๋”ฐ๋ผ ์ค‘์š”ํ•œ ๋™์ž‘์š”์†Œ๋ฅผ ์šฐ์„ ์ ์œผ๋กœ ์ˆ˜ํ–‰ํ•˜๊ณ  ์šฐ์„ ์ˆœ์œ„๊ฐ€ ๋‚ฎ์€ ๋™์ž‘์š”์†Œ๋Š” ๋ถ€๋ถ„ ํ˜น์€ ์ „์ฒด์ ์œผ๋กœ ํฌ๊ธฐํ•˜๊ธฐ๋„ ํ•˜๋ฉด์„œ ๋งค์šฐ ์œ ์—ฐํ•˜๊ฒŒ ์ „์ฒด ๋™์ž‘์„ ์ƒ์„ฑํ•˜๊ณ  ์ตœ์ ํ™” ํ•œ๋‹ค. ์ธ๊ฐ„๊ณผ ๊ฐ™์ด ๋‹ค์ž์œ ๋„๋ฅผ ๋ณด์œ ํ•œ ๋กœ๋ด‡ ๋˜ํ•œ ๊ธฐ๊ตฌํ•™๊ณผ ๋™์—ญํ•™์  ํŠน์„ฑ์„ ๊ฐ€์ง€๋Š” ๋‹ค์–‘ํ•œ ์„ธ๋ถ€ ๋™์ž‘ ํ˜น์€ ์ž‘์—…์„ ์ž‘์—…๊ณต๊ฐ„(task space) ํ˜น์€ ๊ด€์ ˆ๊ณต๊ฐ„(configuration space)์—์„œ ์ •์˜ํ•  ์ˆ˜ ์žˆ์œผ๋ฉฐ, ์šฐ์„ ์ˆœ์œ„์— ๋”ฐ๋ผ ์ด๋ฅผ ํšจ๊ณผ์ ์œผ๋กœ ๊ฒฐํ•ฉํ•˜์—ฌ ์ „์ฒด ๋™์ž‘์„ ์ƒ ์„ฑํ•˜๊ณ  ์ œ์–ดํ•  ์ˆ˜ ์žˆ๋‹ค. ์„œ๋กœ ์–‘๋ฆฝํ•˜๊ธฐ ์–ด๋ ค์šด ๋กœ๋ด‡์˜ ๋™์ž‘ ๋ฌธ์ œ๋ฅผ ํ•ด๊ฒฐํ•˜๊ธฐ ์œ„ํ•ด ๋™์ž‘๋“ค ์‚ฌ์ด์— ์šฐ์„ ์ˆœ์œ„๋ฅผ ๋ถ€์—ฌํ•˜์—ฌ ๊ณ„์ธต์„ ์ƒ์„ฑํ•˜๊ณ , ์ด์— ๋”ฐ๋ผ ๋กœ๋ด‡์˜ ์ „์‹  ๋™์ž‘์„ ๊ตฌํ˜„ํ•˜๋Š” ๋ฐฉ๋ฒ•์€ ์˜ค๋žซ๋™์•ˆ ์—ฐ๊ตฌ๊ฐ€ ์ง„ํ–‰๋˜์–ด ์™”๋‹ค. ์ด๋Ÿฌํ•œ ๊ณ„์ธต์  ์ตœ์ ํ™”๋ฅผ ์ด์šฉํ•˜๋ฉด ์šฐ์„ ์ˆœ์œ„๊ฐ€ ๋†’์€ ๋™์ž‘๋ถ€ํ„ฐ ์ˆœ์ฐจ์ ์œผ๋กœ ์‹คํ–‰ํ•˜์ง€๋งŒ, ์šฐ์„ ์ˆœ์œ„๊ฐ€ ๋‚ฎ์€ ๋™์ž‘์š”์†Œ๋“ค๋„ ๊ฐ€๋Šฅํ•œ ๋งŒ์กฑ์‹œํ‚ค๋Š” ์ตœ์ ์˜ ํ•ด๋ฅผ ์ฐพ์„ ์ˆ˜ ์žˆ๋‹ค. ํ•˜์ง€๋งŒ ๊ด€์ ˆ์˜ ๊ตฌ๋™ ๋ฒ”์œ„์™€ ๊ฐ™์€ ๋ถ€๋“ฑ์‹์˜ ์กฐ๊ฑด์ด ํฌํ•จ๋œ ๊ณ„์ธต์  ์ตœ์ ํ™” ๋ฌธ์ œ์—์„œ ํŠน์ด์ ์— ๋Œ€ํ•œ ๊ฐ•๊ฑด์„ฑ๊นŒ์ง€ ํ™•๋ณดํ•  ์ˆ˜ ์žˆ๋Š” ๋ฐฉ๋ฒ•์— ๋Œ€ํ•ด์„œ๋Š” ์•„์ง๊นŒ์ง€ ๋งŽ์€ ๋ถ€๋ถ„์ด ๋ฐ ํ˜€์ง„ ๋ฐ”๊ฐ€ ์—†๋‹ค. ๋”ฐ๋ผ์„œ ๋ณธ ํ•™์œ„๋…ผ๋ฌธ์—์„œ๋Š” ๋“ฑ์‹๊ณผ ๋ถ€๋“ฑ์‹์œผ๋กœ ํ‘œํ˜„๋˜๋Š” ๊ตฌ์†์กฐ๊ฑด ํ˜น์€ ๋™์ž‘์š”์†Œ๋ฅผ ๊ณ„์ธต์  ์ตœ์ ํ™”์— ๋™์‹œ์— ํฌํ•จ์‹œํ‚ค๊ณ , ํŠน์ด์ ์ด ์กด์žฌํ•˜๋”๋ผ๋„ ๊ฐ•๊ฑด์„ฑ๊ณผ ์ˆ˜๋ ด์„ฑ์„ ๋ณด์žฅํ•˜๋Š” ๊ด€์ ˆ๊ณต๊ฐ„์—์„œ์˜ ์ตœ์ ํ•ด๋ฅผ ํ™•๋ณดํ•˜๋Š”๋ฐ ์ง‘์ค‘ํ•œ๋‹ค. ์™œ๋‚˜ํ•˜๋ฉด ๋น„์ •ํ˜• ์ž„๋ฌด๋ฅผ ์ˆ˜ํ–‰ํ•˜๋Š” ๋กœ๋ด‡์€ ์‚ฌ์ „์— ๊ณ„ํš๋œ ๋™์ž‘์„ ์ˆ˜ํ–‰ํ•˜๋Š” ๊ฒƒ์ด ์•„๋‹Œ ๋ณ€ํ™”ํ•˜๋Š” ํ™˜๊ฒฝ์กฐ๊ฑด์— ๋”ฐ๋ผ ์‹ค์‹œ๊ฐ„์œผ๋กœ ๋™์ž‘์„ ๊ณ„ํšํ•˜๊ณ  ์ œ์–ดํ•ด์•ผ ํ•˜๊ธฐ ๋•Œ๋ฌธ์— ํŠน์ด์ ์ด ์—†๋Š” ์ž์„ธ๋กœ ๋กœ๋ด‡์„ ํ•ญ์ƒ ์ œ์–ดํ•˜๊ธฐ๊ฐ€ ์–ด๋ ต๋‹ค. ๊ทธ๋ฆฌ๊ณ  ์ด๋ ‡๊ฒŒ ํŠน์ด์ ์„ ํšŒํ”ผํ•˜๋Š” ๋ฐฉํ–ฅ์œผ๋กœ ๋กœ๋ด‡์„ ์ œ์–ดํ•˜๋Š” ๊ฒƒ์€ ๋กœ๋ด‡์˜ ์šด์šฉ์„ฑ์„ ์‹ฌ๊ฐํ•˜๊ฒŒ ์ €ํ•ด์‹œํ‚ฌ ์ˆ˜ ์žˆ๋‹ค. ํŠน์ด์  ๊ทผ๋ฐฉ์—์„œ์˜ ํ•ด์˜ ๊ฐ•๊ฑด์„ฑ์ด ๋ณด์žฅ๋˜์ง€ ์•Š์œผ๋ฉด ๋กœ๋ด‡ ๊ด€์ ˆ์— ๊ณผ๋„ํ•œ ์†๋„ ํ˜น์€ ํ† ํฌ๊ฐ€ ๋ฐœ์ƒํ•˜์—ฌ ๋กœ๋ด‡์˜ ์ž„๋ฌด ์ˆ˜ํ–‰์ด ๋ถˆ๊ฐ€๋Šฅํ•˜๊ฑฐ๋‚˜ ํ™˜๊ฒฝ๊ณผ ๋กœ๋ด‡์˜ ์†์ƒ์„ ์ดˆ๋ž˜ํ•  ์ˆ˜ ์žˆ์œผ๋ฉฐ, ๋‚˜์•„๊ฐ€ ๋กœ๋ด‡๊ณผ ํ•จ๊ป˜ ์ž„๋ฌด๋ฅผ ์ˆ˜ํ–‰ํ•˜๋Š” ์‚ฌ๋žŒ์—๊ฒŒ ์ƒํ•ด๋ฅผ ๊ฐ€ํ•  ์ˆ˜๋„ ์žˆ๋‹ค. ํŠน์ด์ ์— ๋Œ€ํ•œ ๊ฐ•๊ฑด์„ฑ์„ ํ™•๋ณดํ•˜๊ธฐ ์œ„ํ•ด ์šฐ์„ ์ˆœ์œ„ ๊ธฐ๋ฐ˜์˜ ๊ณ„์ธต์  ์ตœ์ ํ™”์™€ ์ •๊ทœํ™” (regularization)๋ฅผ ํ†ตํ•ฉํ•˜์—ฌ ์ •๊ทœํ™”๋œ ๊ณ„์ธต์  ์ตœ์ ํ™” (RHQP: Regularized Hierarchical Quadratic Program) ๋ฌธ์ œ๋ฅผ ๋‹ค๋ฃฌ๋‹ค. ๋ถ€๋“ฑ์‹์ด ํฌํ•จ๋œ ๊ณ„์ธต์  ์ตœ์ ํ™”์— ์ •๊ทœํ™”๋ฅผ ๋™์‹œ์— ๊ณ ๋ คํ•จ์œผ๋กœ์จ ์•ผ๊ธฐ๋˜๋Š” ๋งŽ์€ ๋ฌธ์ œ์ ๋“ค์„ ํ•ด๊ฒฐํ•˜๊ณ  ํ•ด์˜ ์ตœ์ ์„ฑ๊ณผ ๊ฐ•๊ฑด์„ฑ์„ ํ™•๋ณดํ•  ์ˆ˜ ์žˆ๋Š” ๋ฐฉ๋ฒ•์„ ์ œ์•ˆํ•œ๋‹ค. ํŠนํžˆ ์™ธ๋ถ€์˜ ์ตœ์ ํ™” ํ”„๋กœ๊ทธ๋žจ์„ ์‚ฌ์šฉํ•˜์ง€ ์•Š๊ณ  ์ˆ˜์น˜์  ์ตœ์ ํ™” (numerical optimization) ์ด๋ก ๊ณผ ์šฐ์„ ์ˆœ์œ„์— ๊ธฐ๋ฐ˜์„ ๋‘๋Š” ์—ฌ์œ ์ž์œ ๋„ ๋กœ๋ด‡์˜ ํ•ด์„ ๊ธฐ๋ฒ•์„ ์ด์šฉํ•˜์—ฌ ๊ณ„์‚ฐ์˜ ํšจ์œจ์„ฑ์„ ๊ทน๋Œ€ํ™”ํ•  ์ˆ˜ ์žˆ๋Š” ์ด์ฐจ ํ”„๋กœ๊ทธ๋žจ(quadratic programming)์„ ์ œ์•ˆํ•œ๋‹ค. ๋˜ํ•œ ์ด์™€ ๋™์‹œ์— ์ •๊ทœํ™”๋œ ๊ณ„์ธต์  ์ตœ์ ํ™” ๋ฌธ์ œ์˜ ์ด๋ก ์  ๊ตฌ์กฐ๋ฅผ ์ฒ ์ €ํ•˜๊ฒŒ ๋ถ„์„ํ•œ๋‹ค. ํŠนํžˆ ํŠน์ด๊ฐ’ ๋ถ„ํ•ด (singular value decomposition)๋ฅผ ํ†ตํ•ด ์ตœ์ ํ•ด์™€ ๋ถ€๋“ฑ์‹ ์กฐ๊ฑด์„ ์ฒ˜๋ฆฌํ•˜๋Š”๋ฐ ํ•„์š”ํ•œ ๋ผ๊ทธ๋ž‘์ง€ ์Šน์ˆ˜๋ฅผ ์žฌ๊ท€์ ์ธ ๋ฐฉ๋ฒ•์œผ๋กœ ํ•ด์„์  ํ˜•ํƒœ๋กœ ๊ตฌํ•จ์œผ๋กœ์จ ๊ณ„์‚ฐ์˜ ํšจ์œจ์„ฑ์„ ์ฆ๋Œ€์‹œํ‚ค๊ณ  ๋™์‹œ์— ๋ถ€๋“ฑ์‹์˜ ์กฐ๊ฑด์„ ์˜ค๋ฅ˜ ์—†์ด ์ •ํ™•ํ•˜๊ฒŒ ์ฒ˜๋ฆฌํ•  ์ˆ˜ ์žˆ๋„๋ก ํ•˜์˜€๋‹ค. ๊ทธ๋ฆฌ๊ณ  ์ •๊ทœํ™”๋œ ๊ณ„์ธต์  ์ตœ์ ํ™”๋ฅผ ํž˜์ œ์–ด๊นŒ์ง€ ํ™•์žฅํ•˜์—ฌ ํ™˜๊ฒฝ๊ณผ ๋กœ๋ด‡์˜ ์•ˆ์ „ํ•œ ์ƒํ˜ธ์ž‘์šฉ์„ ๋ณด์žฅํ•˜์—ฌ ๋กœ๋ด‡์ด ์ ์ ˆํ•œ ํž˜์œผ๋กœ ํ™˜๊ฒฝ๊ณผ ์ ‘์ด‰ํ•  ์ˆ˜ ์žˆ๋„๋ก ํ•˜์˜€๋‹ค. ๋ถˆํ™•์‹ค์„ฑ์ด ์กด์žฌํ•˜๋Š” ๋น„์ •ํ˜• ํ™˜๊ฒฝ์—์„œ ๋น„์ •ํ˜• ์ž„๋ฌด๋ฅผ ์ˆ˜ํ–‰ํ•  ์ˆ˜ ์žˆ๋Š” ๊ตฌ์กฐ๋กœ๋ด‡์˜ ํ•ต์‹ฌ ์„ค๊ณ„ ๊ฐœ๋…์„ ์ œ์‹œํ•œ๋‹ค. ๋น„์ •ํ˜• ํ™˜๊ฒฝ์—์„œ์˜ ์กฐ์ž‘ ์„ฑ๋Šฅ๊ณผ ์ด๋™ ์„ฑ๋Šฅ์„ ๋™์‹œ์— ํ™•๋ณดํ•  ์ˆ˜ ์žˆ๋Š” ํ˜•์ƒ์œผ๋กœ ๋กœ๋ด‡์„ ์„ค๊ณ„ํ•˜์—ฌ ๊ตฌ์กฐ ๋กœ๋ด‡์œผ๋กœ ํ•˜์—ฌ๊ธˆ ์ตœ์ข… ๋ชฉ์ ์œผ๋กœ ์„ค์ •๋œ ์ธ๊ฐ„์„ ๋Œ€์‹ ํ•˜์—ฌ ๋ถ€์ƒ์ž๋ฅผ ๊ตฌ์กฐํ•˜๊ณ  ์œ„ํ—˜๋ฌผ์„ ์ฒ˜๋ฆฌํ•˜๋Š” ์ž„๋ฌด๋ฅผ ํšจ๊ณผ์ ์œผ๋กœ ์ˆ˜ํ–‰ํ•  ์ˆ˜ ์žˆ๋„๋ก ํ•œ๋‹ค. ๊ตฌ์กฐ ๋กœ๋ด‡์— ํ•„์š”ํ•œ ๋งค๋‹ˆํ“ฐ๋ ˆ์ดํ„ฐ๋Š” ๋ถ€์ƒ์ž ๊ตฌ์กฐ ์ž„๋ฌด์™€ ์œ„ํ—˜๋ฌผ ์ฒ˜๋ฆฌ ์ž„๋ฌด์— ๋”ฐ๋ผ ๊ต์ฒด ๊ฐ€๋Šฅํ•œ ๋ชจ๋“ˆํ˜•์œผ๋กœ ์„ค๊ณ„ํ•˜์—ฌ ๊ฐ๊ฐ์˜ ์ž„๋ฌด์— ๋”ฐ๋ผ ์ตœ์ ํ™”๋œ ๋งค๋‹ˆํ“ฐ ๋ ˆ์ดํ„ฐ๋ฅผ ์žฅ์ฐฉํ•˜์—ฌ ์ž„๋ฌด๋ฅผ ์ˆ˜ํ–‰ํ•  ์ˆ˜ ์žˆ๋‹ค. ํ•˜์ฒด๋Š” ํŠธ๋ž™๊ณผ ๊ด€์ ˆ์ด ๊ฒฐํ•ฉ๋œ ํ•˜์ด๋ธŒ๋ฆฌ๋“œ ํ˜•ํƒœ๋ฅผ ์ทจํ•˜๊ณ  ์žˆ์œผ๋ฉฐ, ์ฃผํ–‰ ์ž„๋ฌด์™€ ์กฐ์ž‘์ž„๋ฌด์— ๋”ฐ๋ผ ํ˜•์ƒ์„ ๋ณ€๊ฒฝํ•  ์ˆ˜ ์žˆ๋‹ค. ํ˜•์ƒ ๋ณ€๊ฒฝ๊ณผ ๋ชจ๋“ˆํ™”๋œ ๋งค๋‹ˆํ“ฐ๋ ˆ์ดํ„ฐ๋ฅผ ํ†ตํ•ด์„œ์กฐ์ž‘ ์„ฑ๋Šฅ๊ณผ ํ—˜ํ•œ ์ง€ํ˜•์—์„œ ์ด๋™ํ•  ์ˆ˜ ์žˆ๋Š” ์ฃผํ–‰ ์„ฑ๋Šฅ์„ ๋™์‹œ์— ํ™•๋ณดํ•˜์˜€๋‹ค. ์ตœ์ข…์ ์œผ๋กœ ๊ตฌ์กฐ๋กœ๋ด‡์˜ ์„ค๊ณ„์™€ ์‹ค์‹œ๊ฐ„ ๊ณ„์ธต์  ์ œ์–ด๋ฅผ ์ด์šฉํ•˜์—ฌ ๋น„์ •ํ˜• ์‹ค๋‚ด์™ธ ํ™˜๊ฒฝ์—์„œ ๊ตฌ์กฐ๋กœ๋ด‡์ด ์ฃผํ–‰์ž„๋ฌด, ์œ„ํ—˜๋ฌผ ์กฐ์ž‘์ž„๋ฌด, ๋ถ€์ƒ์ž ๊ตฌ์กฐ ์ž„๋ฌด๋ฅผ ์„ฑ๊ณต์ ์œผ๋กœ ์ˆ˜ ํ–‰ํ•  ์ˆ˜ ์žˆ์Œ์„ ํ•ด์„๊ณผ ์‹คํ—˜์„ ํ†ตํ•˜์—ฌ ์ž…์ฆํ•จ์œผ๋กœ์จ ๋ณธ ํ•™์œ„๋…ผ๋ฌธ์—์„œ ์ œ์•ˆํ•œ ์„ค๊ณ„์™€ ์ •๊ทœํ™”๋œ ๊ณ„์ธต์  ์ตœ์ ํ™” ๊ธฐ๋ฐ˜์˜ ์ œ์–ด ์ „๋žต์˜ ์œ ์šฉ์„ฑ์„ ๊ฒ€์ฆํ•˜์˜€๋‹ค.1 Introduction 1 1.1 Motivations 1 1.2 Related Works and Research Problems for Hierarchical Control 3 1.2.1 Classical Approaches 3 1.2.2 State-of-the-Art Strategies 4 1.2.3 Research Problems 7 1.3 Robust Rescue Robots 9 1.4 Research Goals 12 1.5 Contributions of ThisThesis 13 1.5.1 Robust Hierarchical Task-Priority Control 13 1.5.2 Design Concepts of Robust Rescue Robot 16 1.5.3 Hierarchical Motion and ForceControl 17 1.6 Dissertation Preview 18 2 Preliminaries for Task-Priority Control Framework 21 2.1 Introduction 21 2.2 Task-Priority Inverse Kinematics 23 2.3 Recursive Formulation of Null Space Projector 28 2.4 Conclusion 31 3 Robust Hierarchical Task-Priority Control 33 3.1 Introduction 33 3.1.1 Motivations 35 3.1.2 Objectives 36 3.2 Task Function Approach 37 3.3 Regularized Hierarchical Optimization with Equality Tasks 41 3.3.1 Regularized Hierarchical Optimization 41 3.3.2 Optimal Solution 45 3.3.3 Task Error and Hierarchical Matrix Decomposition 49 3.3.4 Illustrative Examples for Regularized Hierarchical Optimization 56 3.4 Regularized Hierarchical Optimization with Inequality Constraints 60 3.4.1 Lagrange Multipliers 61 3.4.2 Modified Active Set Method 66 3.4.3 Illustrative Examples of Modified Active Set Method 70 3.4.4 Examples for Hierarchical Optimization with Inequality Constraint 72 3.5 DLS-HQP Algorithm 79 3.6 Concluding Remarks 80 4 Rescue Robot Design and Experimental Results 83 4.1 Introduction 83 4.2 Rescue Robot Design 85 4.2.1 System Design 86 4.2.2 Variable Configuration Mobile Platform 92 4.2.3 Dual Arm Manipulators 95 4.2.4 Software Architecture 97 4.3 Performance Verification for Hierarchical Motion Control 99 4.3.1 Real-Time Motion Generation 99 4.3.2 Task Specifications 103 4.3.3 Singularity Robust Task Priority 106 4.3.4 Inequality Constraint Handling and Computation Time 111 4.4 Singularity Robustness and Inequality Handling for Rescue Mission 117 4.5 Field Tests 122 4.6 Concluding Remarks 126 5 Hierarchical Motion and Force Control 129 5.1 Introduction 129 5.2 Operational Space Control 132 5.3 Acceleration-Based Hierarchical Motion Control 134 5.4 Force Control 137 5.4.1 Force Control with Inner Position Loop 141 5.4.2 Force Control with Inner Velocity Loop 144 5.5 Motion and Force Control 145 5.6 Numerical Results for Acceleration-Based Motion and Force Control 148 5.6.1 Task Specifications 150 5.6.2 Force Control Performance 151 5.6.3 Singularity Robustness and Inequality Constraint Handling 155 5.7 Velocity Resolved Motion and Force Control 160 5.7.1 Velocity-Based Motion and Force Control 161 5.7.2 Experimental Results 163 5.8 Concluding Remarks 167 6 Conclusion 169 6.1 Summary 169 6.2 Concluding Remarks 173 A Appendix 175 A.1 Introduction to PID Control 175 A.2 Inverse Optimal Control 176 A.3 Experimental Results and Conclusion 181 Bibliography 183 Abstract 207๋ฐ•

    Selected topics in robotics for space exploration

    Get PDF
    Papers and abstracts included represent both formal presentations and experimental demonstrations at the Workshop on Selected Topics in Robotics for Space Exploration which took place at NASA Langley Research Center, 17-18 March 1993. The workshop was cosponsored by the Guidance, Navigation, and Control Technical Committee of the NASA Langley Research Center and the Center for Intelligent Robotic Systems for Space Exploration (CIRSSE) at RPI, Troy, NY. Participation was from industry, government, and other universities with close ties to either Langley Research Center or to CIRSSE. The presentations were very broad in scope with attention given to space assembly, space exploration, flexible structure control, and telerobotics
    • โ€ฆ
    corecore