587 research outputs found

    ๋ชจ์…˜ ํ”„๋ฆฌ๋จธํ‹ฐ๋ธŒ๋ฅผ ์ด์šฉํ•œ ๋ณต์žกํ•œ ๋กœ๋ด‡ ์ž„๋ฌด ํ•™์Šต ๋ฐ ์ผ๋ฐ˜ํ™” ๊ธฐ๋ฒ•

    Get PDF
    ํ•™์œ„๋…ผ๋ฌธ (๋ฐ•์‚ฌ) -- ์„œ์šธ๋Œ€ํ•™๊ต ๋Œ€ํ•™์› : ๊ณต๊ณผ๋Œ€ํ•™ ํ•ญ๊ณต์šฐ์ฃผ๊ณตํ•™๊ณผ, 2020. 8. ๊น€ํ˜„์ง„.Learning from demonstrations (LfD) is a promising approach that enables robots to perform a specific movement. As robotic manipulations are substituting a variety of tasks, LfD algorithms are widely used and studied for specifying the robot configurations for the various types of movements. This dissertation presents an approach based on parametric dynamic movement primitives (PDMP) as a motion representation algorithm which is one of relevant LfD techniques. Unlike existing motion representation algorithms, this work not only represents a prescribed motion but also computes the new behavior through a generalization of multiple demonstrations in the actual environment. The generalization process uses Gaussian process regression (GPR) by representing the nonlinear relationship between the PDMP parameters that determine motion and the corresponding environmental variables. The proposed algorithm shows that it serves as a powerful optimal and real-time motion planner among the existing planning algorithms when optimal demonstrations are provided as dataset. In this dissertation, the safety of motion is also considered. Here, safety refers to keeping the system away from certain configurations that are unsafe. The safety criterion of the PDMP internal parameters are computed to check the safety. This safety criterion reflects the new behavior computed through the generalization process, as well as the individual motion safety of the demonstration set. The demonstrations causing unsafe movement are identified and removed. Also, the demolished demonstrations are replaced by proven demonstrations upon this criterion. This work also presents an extension approach reducing the number of required demonstrations for the PDMP framework. This approach is effective where a single mission consists of multiple sub-tasks and requires numerous demonstrations in generalizing them. The whole trajectories in provided demonstrations are segmented into multiple sub-tasks representing unit motions. Then, multiple PDMPs are formed independently for correlated-segments. The phase-decision process determines which sub-task and associated PDMPs to be executed online, allowing multiple PDMPs to be autonomously configured within an integrated framework. GPR formulations are applied to obtain execution time and regional goal configuration for each sub-task. Finally, the proposed approach and its extension are validated with the actual experiments of mobile manipulators. The first two scenarios regarding cooperative aerial transportation demonstrate the excellence of the proposed technique in terms of quick computation, generation of efficient movement, and safety assurance. The last scenario deals with two mobile manipulations using ground vehicles and shows the effectiveness of the proposed extension in executing complex missions.์‹œ์—ฐ ํ•™์Šต ๊ธฐ๋ฒ•(Learning from demonstrations, LfD)์€ ๋กœ๋ด‡์ด ํŠน์ • ๋™์ž‘์„ ์ˆ˜ํ–‰ํ•  ์ˆ˜ ์žˆ๋„๋ก ํ•˜๋Š” ์œ ๋งํ•œ ๋™์ž‘ ์ƒ์„ฑ ๊ธฐ๋ฒ•์ด๋‹ค. ๋กœ๋ด‡ ์กฐ์ž‘๊ธฐ๊ฐ€ ์ธ๊ฐ„ ์‚ฌํšŒ์—์„œ ๋‹ค์–‘ํ•œ ์—…๋ฌด๋ฅผ ๋Œ€์ฒดํ•ด ๊ฐ์— ๋”ฐ๋ผ, ๋‹ค์–‘ํ•œ ์ž„๋ฌด๋ฅผ ์ˆ˜ํ–‰ํ•˜๋Š” ๋กœ๋ด‡์˜ ๋™์ž‘์„ ์ƒ์„ฑํ•˜๊ธฐ ์œ„ํ•ด LfD ์•Œ๊ณ ๋ฆฌ์ฆ˜๋“ค์€ ๋„๋ฆฌ ์—ฐ๊ตฌ๋˜๊ณ , ์‚ฌ์šฉ๋˜๊ณ  ์žˆ๋‹ค. ๋ณธ ๋…ผ๋ฌธ์€ LfD ๊ธฐ๋ฒ• ์ค‘ ๋ชจ์…˜ ํ”„๋ฆฌ๋จธํ‹ฐ๋ธŒ ๊ธฐ๋ฐ˜์˜ ๋™์ž‘ ์žฌ์ƒ์„ฑ ์•Œ๊ณ ๋ฆฌ์ฆ˜์ธ Parametric dynamic movement primitives(PDMP)์— ๊ธฐ์ดˆํ•œ ์•Œ๊ณ ๋ฆฌ์ฆ˜์„ ์ œ์‹œํ•˜๋ฉฐ, ์ด๋ฅผ ํ†ตํ•ด ๋‹ค์–‘ํ•œ ์ž„๋ฌด๋ฅผ ์ˆ˜ํ–‰ํ•˜๋Š” ๋ชจ๋ฐ”์ผ ์กฐ์ž‘๊ธฐ์˜ ๊ถค์ ์„ ์ƒ์„ฑํ•œ๋‹ค. ๊ธฐ์กด์˜ ๋™์ž‘ ์žฌ์ƒ์„ฑ ์•Œ๊ณ ๋ฆฌ์ฆ˜๊ณผ ๋‹ฌ๋ฆฌ, ์ด ์—ฐ๊ตฌ๋Š” ์ œ๊ณต๋œ ์‹œ์—ฐ์—์„œ ํ‘œํ˜„๋œ ๋™์ž‘์„ ๋‹จ์ˆœํžˆ ์žฌ์ƒ์„ฑํ•˜๋Š” ๊ฒƒ์— ๊ทธ์น˜์ง€ ์•Š๊ณ , ์ƒˆ๋กœ์šด ํ™˜๊ฒฝ์— ๋งž๊ฒŒ ์ผ๋ฐ˜ํ™” ํ•˜๋Š” ๊ณผ์ •์„ ํฌํ•จํ•œ๋‹ค. ์ด ๋…ผ๋ฌธ์—์„œ ์ œ์‹œํ•˜๋Š” ์ผ๋ฐ˜ํ™” ๊ณผ์ •์€ PDMPs์˜ ๋‚ด๋ถ€ ํŒŒ๋ผ๋ฏธํ„ฐ ๊ฐ’์ธ ์Šคํƒ€์ผ ํŒŒ๋ผ๋ฏธํ„ฐ์™€ ํ™˜๊ฒฝ ๋ณ€์ˆ˜ ์‚ฌ์ด์˜ ๋น„์„ ํ˜• ๊ด€๊ณ„๋ฅผ ๊ฐ€์šฐ์Šค ํšŒ๊ท€ ๊ธฐ๋ฒ• (Gaussian process regression, GPR)์„ ์ด์šฉํ•˜์—ฌ ์ˆ˜์‹์ ์œผ๋กœ ํ‘œํ˜„ํ•œ๋‹ค. ์ œ์•ˆ๋œ ๊ธฐ๋ฒ•์€ ๋˜ํ•œ ์ตœ์  ์‹œ์—ฐ๋ฅผ ํ•™์Šตํ•˜๋Š” ๋ฐฉ์‹์„ ํ†ตํ•ด ๊ฐ•๋ ฅํ•œ ์ตœ์  ์‹ค์‹œ๊ฐ„ ๊ฒฝ๋กœ ๊ณ„ํš ๊ธฐ๋ฒ•์œผ๋กœ๋„ ์‘์šฉ๋  ์ˆ˜ ์žˆ๋‹ค. ๋ณธ ๋…ผ๋ฌธ์—์„œ๋Š” ๋˜ํ•œ ๋กœ๋ด‡์˜ ๊ตฌ๋™ ์•ˆ์ „์„ฑ๋„ ๊ณ ๋ คํ•œ๋‹ค. ๊ธฐ์กด ์—ฐ๊ตฌ๋“ค์—์„œ ๋‹ค๋ฃจ์–ด์ง„ ์‹œ์—ฐ ๊ด€๋ฆฌ ๊ธฐ์ˆ ์ด ๋กœ๋ด‡์˜ ๊ตฌ๋™ ํšจ์œจ์„ฑ์„ ๊ฐœ์„ ํ•˜๋Š” ๋ฐฉํ–ฅ์œผ๋กœ ์ œ์‹œ๋œ ๊ฒƒ๊ณผ ๋‹ฌ๋ฆฌ, ์ด ์—ฐ๊ตฌ๋Š” ๊ฐ•ํ•œ ๊ตฌ์†์กฐ๊ฑด์œผ๋กœ ๋กœ๋ด‡์˜ ๊ตฌ๋™ ์•ˆ์ „์„ฑ์„ ํ™•๋ณดํ•˜๋Š” ์‹œ์—ฐ ๊ด€๋ฆฌ ๊ธฐ์ˆ ์„ ํ†ตํ•ด ์•ˆ์ •์„ฑ์„ ๊ณ ๋ คํ•˜๋Š” ์ƒˆ๋กœ์šด ๋ฐฉ์‹์„ ์ œ์‹œํ•œ๋‹ค. ์ œ์•ˆ๋œ ๋ฐฉ์‹์€ ์Šคํƒ€์ผ ํŒŒ๋ผ๋ฏธํ„ฐ ๊ฐ’ ์ƒ์—์„œ ์•ˆ์ „์„ฑ ๊ธฐ์ค€์„ ๊ณ„์‚ฐํ•˜๋ฉฐ, ์ด ์•ˆ์ „ ๊ธฐ์ค€์„ ํ†ตํ•ด ์‹œ์—ฐ์„ ์ œ๊ฑฐํ•˜๋Š” ์ผ๋ จ์˜ ์ž‘์—…์„ ์ˆ˜ํ–‰ํ•œ๋‹ค. ๋˜ํ•œ, ์ œ๊ฑฐ๋œ ์‹œ์œ„๋ฅผ ์•ˆ์ „ ๊ธฐ์ค€์— ๋”ฐ๋ผ ์ž…์ฆ๋œ ์‹œ์œ„๋กœ ๋Œ€์ฒดํ•˜์—ฌ ์ผ๋ฐ˜ํ™” ์„ฑ๋Šฅ์„ ์ €ํ•˜์‹œํ‚ค์ง€ ์•Š๋„๋ก ์‹œ์œ„๋ฅผ ๊ด€๋ฆฌํ•œ๋‹ค. ์ด๋ฅผ ํ†ตํ•ด ๋‹ค์ˆ˜์˜ ์‹œ์—ฐ ๊ฐ๊ฐ ๊ฐœ๋ณ„ ๋™์ž‘ ์•ˆ์ „์„ฑ ๋ฟ ์•„๋‹ˆ๋ผ ์˜จ๋ผ์ธ ๋™์ž‘์˜ ์•ˆ์ „์„ฑ๊นŒ์ง€ ๊ณ ๋ คํ•  ์ˆ˜ ์žˆ์œผ๋ฉฐ, ์‹ค์‹œ๊ฐ„ ๋กœ๋ด‡ ์กฐ์ž‘๊ธฐ ์šด์šฉ์‹œ ์•ˆ์ „์„ฑ์ด ํ™•๋ณด๋  ์ˆ˜ ์žˆ๋‹ค. ์ œ์•ˆ๋œ ์•ˆ์ •์„ฑ์„ ๊ณ ๋ คํ•œ ์‹œ์—ฐ ๊ด€๋ฆฌ ๊ธฐ์ˆ ์€ ๋˜ํ•œ ํ™˜๊ฒฝ์˜ ์ •์  ์„ค์ •์ด ๋ณ€๊ฒฝ๋˜์–ด ๋ชจ๋“  ์‹œ์—ฐ์„ ๊ต์ฒดํ•ด์•ผ ํ•  ์ˆ˜ ์žˆ๋Š” ์ƒํ™ฉ์—์„œ ์‚ฌ์šฉํ•  ์ˆ˜ ์žˆ๋Š” ์‹œ์—ฐ๋“ค์„ ํŒ๋ณ„ํ•˜๊ณ , ํšจ์œจ์ ์œผ๋กœ ์žฌ์‚ฌ์šฉํ•˜๋Š” ๋ฐ ์‘์šฉํ•  ์ˆ˜ ์žˆ๋‹ค. ๋˜ํ•œ ๋ณธ ๋…ผ๋ฌธ์€ ๋ณต์žกํ•œ ์ž„๋ฌด์—์„œ ์ ์šฉ๋  ์ˆ˜ ์žˆ๋Š” PDMPs์˜ ํ™•์žฅ ๊ธฐ๋ฒ•์ธ seg-PDMPs๋ฅผ ์ œ์‹œํ•œ๋‹ค. ์ด ์ ‘๊ทผ๋ฐฉ์‹์€ ๋ณต์žกํ•œ ์ž„๋ฌด๊ฐ€ ์ผ๋ฐ˜์ ์œผ๋กœ ๋ณต์ˆ˜๊ฐœ์˜ ๊ฐ„๋‹จํ•œ ํ•˜์œ„ ์ž‘์—…์œผ๋กœ ๊ตฌ์„ฑ๋œ๋‹ค๊ณ  ๊ฐ€์ •ํ•œ๋‹ค. ๊ธฐ์กด PDMPs์™€ ๋‹ฌ๋ฆฌ seg-PDMPs๋Š” ์ „์ฒด ๊ถค์ ์„ ํ•˜์œ„ ์ž‘์—…์„ ๋‚˜ํƒ€๋‚ด๋Š” ์—ฌ๋Ÿฌ ๊ฐœ์˜ ๋‹จ์œ„ ๋™์ž‘์œผ๋กœ ๋ถ„ํ• ํ•˜๊ณ , ๊ฐ ๋‹จ์œ„๋™์ž‘์— ๋Œ€ํ•ด ์—ฌ๋Ÿฌ๊ฐœ์˜ PDMPs๋ฅผ ๊ตฌ์„ฑํ•œ๋‹ค. ๊ฐ ๋‹จ์œ„ ๋™์ž‘ ๋ณ„๋กœ ์ƒ์„ฑ๋œ PDMPs๋Š” ํ†ตํ•ฉ๋œ ํ”„๋ ˆ์ž„์›Œํฌ๋‚ด์—์„œ ๋‹จ๊ณ„ ๊ฒฐ์ • ํ”„๋กœ์„ธ์Šค๋ฅผ ํ†ตํ•ด ์ž๋™์ ์œผ๋กœ ํ˜ธ์ถœ๋œ๋‹ค. ๊ฐ ๋‹จ๊ณ„ ๋ณ„๋กœ ๋‹จ์œ„ ๋™์ž‘์„ ์ˆ˜ํ–‰ํ•˜๊ธฐ ์œ„ํ•œ ์‹œ๊ฐ„ ๋ฐ ํ•˜์œ„ ๋ชฉํ‘œ์ ์€ ๊ฐ€์šฐ์Šค ๊ณต์ • ํšŒ๊ท€(GPR)๋ฅผ ์ด์šฉํ•œ ํ™˜๊ฒฝ๋ณ€์ˆ˜์™€์˜์˜ ๊ด€๊ณ„์‹์„ ํ†ตํ•ด ์–ป๋Š”๋‹ค. ๊ฒฐ๊ณผ์ ์œผ๋กœ, ์ด ์—ฐ๊ตฌ๋Š” ์ „์ฒด์ ์œผ๋กœ ์š”๊ตฌ๋˜๋Š” ์‹œ์—ฐ์˜ ์ˆ˜๋ฅผ ํšจ๊ณผ์ ์œผ๋กœ ์ค„์ผ ๋ฟ ์•„๋‹ˆ๋ผ, ๊ฐ ๋‹จ์œ„๋™์ž‘์˜ ํ‘œํ˜„ ์„ฑ๋Šฅ์„ ๊ฐœ์„ ํ•œ๋‹ค. ์ œ์•ˆ๋œ ์•Œ๊ณ ๋ฆฌ์ฆ˜์€ ํ˜‘๋™ ๋ชจ๋ฐ”์ผ ๋กœ๋ด‡ ์กฐ์ž‘๊ธฐ ์‹คํ—˜์„ ํ†ตํ•˜์—ฌ ๊ฒ€์ฆ๋œ๋‹ค. ์„ธ ๊ฐ€์ง€์˜ ์‹œ๋‚˜๋ฆฌ์˜ค๊ฐ€ ๋ณธ ๋…ผ๋ฌธ์—์„œ ๋‹ค๋ฃจ์–ด์ง€๋ฉฐ, ํ•ญ๊ณต ์šด์†ก๊ณผ ๊ด€๋ จ๋œ ์ฒซ ๋‘ ๊ฐ€์ง€ ์‹œ๋‚˜๋ฆฌ์˜ค๋Š” PDMPs ๊ธฐ๋ฒ•์ด ๋กœ๋ด‡ ์กฐ์ž‘๊ธฐ์—์„œ ๋น ๋ฅธ ์ ์‘์„ฑ, ์ž„๋ฌด ํšจ์œจ์„ฑ๊ณผ ์•ˆ์ „์„ฑ ๋ชจ๋‘ ๋งŒ์กฑํ•˜๋Š” ๊ฒƒ์„ ์ž…์ฆํ•œ๋‹ค. ๋งˆ์ง€๋ง‰ ์‹œ๋‚˜๋ฆฌ์˜ค๋Š” ์ง€์ƒ ์ฐจ๋Ÿ‰์„ ์ด์šฉํ•œ ๋‘ ๊ฐœ์˜ ๋กœ๋ด‡ ์กฐ์ž‘๊ธฐ์— ๋Œ€ํ•œ ์‹คํ—˜์œผ๋กœ ๋ณต์žกํ•œ ์ž„๋ฌด ์ˆ˜ํ–‰์„ ํ•˜๊ธฐ ์œ„ํ•ด ํ™•์žฅ๋œ ๊ธฐ๋ฒ•์ธ seg-PDMPs๊ฐ€ ํšจ๊ณผ์ ์œผ๋กœ ๋ณ€ํ™”ํ•˜๋Š” ํ™˜๊ฒฝ์—์„œ ์ผ๋ฐ˜ํ™”๋œ ๋™์ž‘์„ ์ƒ์„ฑํ•จ์„ ๊ฒ€์ฆํ•œ๋‹ค.1 Introduction 1 1.1 Motivations 1 1.2 Literature Survey 3 1.2.1 Conventional Motion Planning in Mobile Manipulations 3 1.2.2 Motion Representation Algorithms 5 1.2.3 Safety-guaranteed Motion Representation Algorithms 7 1.3 Research Objectives and Contributions 7 1.3.1 Motion Generalization in Motion Representation Algorithm 9 1.3.2 Motion Generalization with Safety Guarantee 9 1.3.3 Motion Generalization for Complex Missions 10 1.4 Thesis Organization 11 2 Background 12 2.1 DMPs 12 2.2 Mobile Manipulation Systems 13 2.2.1 Single Mobile Manipulation 14 2.2.2 Cooperative Mobile Manipulations 14 2.3 Experimental Setup 17 2.3.1 Test-beds for Aerial Manipulators 17 2.3.2 Test-beds for Robot Manipulators with Ground Vehicles 17 3 Motion Generalization in Motion Representation Algorithm 22 3.1 Parametric Dynamic Movement Primitives 22 3.2 Generalization Process in PDMPs 26 3.2.1 Environmental Parameters 26 3.2.2 Mapping Function 26 3.3 Simulation Results 29 3.3.1 Two-dimensional Hurdling Motion 29 3.3.2 Cooperative Aerial Transportation 30 4 Motion Generalization with Safety Guarantee 36 4.1 Safety Criterion in Style Parameter 36 4.2 Demonstration Management 39 4.3 Simulation Validation 42 4.3.1 Two-dimensional Hurdling Motion 46 4.3.2 Cooperative Aerial Transportation 47 5 Motion Generalization for Complex Missions 51 5.1 Overall Structure of Seg-PDMPs 51 5.2 Motion Segments 53 5.3 Phase-decision Process 54 5.4 Seg-PDMPs for Single Phase 54 5.5 Simulation Results 55 5.5.1 Initial/terminal Offsets 56 5.5.2 Style Generalization 59 5.5.3 Recombination 61 6 Experimental Validation and Results 63 6.1 Cooperative Aerial Transportation 63 6.2 Cooperative Mobile Hang-dry Mission 70 6.2.1 Demonstrations 70 6.2.2 Simulation Validation 72 6.2.3 Experimental Results 78 7 Conclusions 82 Abstract (in Korean) 93Docto

    Autonomous 3D Exploration of Large Structures Using an UAV Equipped with a 2D LIDAR

    Get PDF
    This paper addressed the challenge of exploring large, unknown, and unstructured industrial environments with an unmanned aerial vehicle (UAV). The resulting system combined well-known components and techniques with a new manoeuvre to use a low-cost 2D laser to measure a 3D structure. Our approach combined frontier-based exploration, the Lazy Theta* path planner, and a flyby sampling manoeuvre to create a 3D map of large scenarios. One of the novelties of our system is that all the algorithms relied on the multi-resolution of the octomap for the world representation. We used a Hardware-in-the-Loop (HitL) simulation environment to collect accurate measurements of the capability of the open-source system to run online and on-board the UAV in real-time. Our approach is compared to different reference heuristics under this simulation environment showing better performance in regards to the amount of explored space. With the proposed approach, the UAV is able to explore 93% of the search space under 30 min, generating a path without repetition that adjusts to the occupied space covering indoor locations, irregular structures, and suspended obstaclesUniรณn Europea Marie Sklodowska-Curie 64215Uniรณn Europea MULTIDRONE (H2020-ICT-731667)Uniiรณn Europea HYFLIERS (H2020-ICT-779411

    ๋ฏธ์ง€ ํ™˜๊ฒฝ์—์„œ์˜ ์•ˆ์ „ ๋น„ํ–‰ ์šด์†ก์„ ์œ„ํ•œ ํ˜‘์—…์ œ์–ด ๋ฐ ๊ฒฝ๋กœ์ƒ์„ฑ ๊ธฐ๋ฒ•

    Get PDF
    ํ•™์œ„๋…ผ๋ฌธ (๋ฐ•์‚ฌ)-- ์„œ์šธ๋Œ€ํ•™๊ต ๋Œ€ํ•™์› ๊ณต๊ณผ๋Œ€ํ•™ ๊ธฐ๊ณ„ํ•ญ๊ณต๊ณตํ•™๋ถ€, 2017. 8. ๊น€ํ˜„์ง„.Recently, aerial manipulators using unmanned aerial vehicles (UAVs) are receiving attention due to their superior mobility in three-dimensional space. It can be applied to a wide range of applications such as inspection of hard-to-reach structure or aerial transportation. This dissertation presents a viable approach to safe aerial transportation in unknown environments by using multiple aerial manipulators. Unlike existing approaches for cooperative manipulation based on force decomposition or impedance-based control that often requ- ire heavy or expensive force/torque sensors, this dissertation suggests a method without such sensors, by exploiting the decoupled dynamics to develop estimation and control alg- orithms. With the decoupled dynamics and the assumption of rigid grasp, an online estimator is designed initially to estimate the mass and inertial properties of an unknown payload using the states of the aerial manipulator only. Stable adaptive controller based on the online estimated parameter is then designed using Lyapunov methods. Through simulations, the performance of the proposed controller is compared with conventional passivity-based adaptive algorithms. This dissertation also proposes a motion generation algorithm for cooperative manipulators to transport a payload safely. If the payload is excessively heavy in comparison with the transportation ability of an aerial robot, an aerial robot may crash because of actuation limits on the motors. As a first step, the allowable flight envelope is analyzed with respect to the position of the end-effector. In order to keep the end-effector in the allowable fight region, kinematic coordination between a payload and cooperative aerial manipulators is first studied. A two-layer framework, in which the first layer computes the motion reference of the end-effectors and the second layer calculates the joint motion of the corresponding manipulator, is then developed in a task-prioritized fashion. When generating aerial manipulator trajectories, the desired trajectory is calculated to satisfy the unilateral constraints obtained by the allowable flight envelope. This work also considers the obstacle avoidance of cooperative aerial manipulators in unknown environments. Using the relative distance between an aerial robot and an obstacle as measured by an RGB-D camera and point cloud library (PCL), dynamic movement primitives (DMPs) modify the desired trajectory. By having the leader robot detect an obstacle and the follower robots maintain a given relative distance with the leader, improved efficiency of obstacle avoidance for cooperative robots can be achieved. Finally, the proposed synthesis of estimation, control, and planning algorithms are validated with experiments using custom-made aerial manipulators combined with a two-DOF (Degree Of Freedom) robotic arm. The proposed method is validated with trajectory tracking using two types of payloads. Cooperative aerial transportation in unknown environments is also performed with an unknown obstacle. Both experimental results suggest that the proposed approach can be utilized for safe cooperative aerial transportation.1 Introduction 1 1.1 Background and Motivations 1 1.2 Literature Survey 4 1.2.1 Cooperative Manipulation 4 1.2.2 Handling an Unknown Object 7 1.2.3 Obstacle Avoidance for Cooperative Robots 8 1.3 Research Objectives and Contributions 9 1.3.1 Estimation and Control Algorithm 10 1.3.2 Motion Planning within the Allowable Flight Envelope 11 1.3.3 Real-time Obstacle Avoidance using an RGB-D Camera 11 1.4 Thesis Organization 12 2 Background 14 2.1 Dynamics for Cooperative Aerial Manipulator 14 2.1.1 Rigid Body Statics 15 2.1.2 Dynamics for Single Aerial Manipulator 16 2.1.3 Decoupled Dynamics 19 2.2 Task Priority 22 2.3 DMPs 24 3 Estimator and Controller Design 26 3.1 Payload Mass and Inertia Parameter Estimation 28 3.1.1 System Parametrization 28 3.1.2 On-line Parameter Estimator 29 3.1.3 Robust Analysis for Measurement Noise 32 3.2 Controller Design 34 3.3 Simulation Results 40 4 Path Planning 45 4.1 Allowable Payload for Each Aerial Manipulator 45 4.2 Trajectory Generation with Unilateral Constraints 49 4.2.1 End-eector Trajectory Generation 49 4.2.2 Inverse Kinematics with Null Space Approach 49 4.2.3 Task Prioritization with Unilateral Constraints 56 5 Obstacle Avoidance in Unknown Environments 60 5.1 Obstacle Detection 60 5.2 Movement Primitives for Cooperative Aerial Manipulators 64 6 Experimental Validation and Results 71 6.1 Simulation Validation for Moving Obstacle 71 6.2 Experimental Setup 74 6.3 Experiment for Cooperative Aerial Transportation 77 6.3.1 Path Following with Two Types of Payloads 77 6.3.2 Aerial Transportations in Unknown Environments 78 7 Conclusions 93 Abstract (in Korean) 105Docto

    A review of aerial manipulation of small-scale rotorcraft unmanned robotic systems

    Get PDF
    Small-scale rotorcraft unmanned robotic systems (SRURSs) are a kind of unmanned rotorcraft with manipulating devices. This review aims to provide an overview on aerial manipulation of SRURSs nowadays and promote relative research in the future. In the past decade, aerial manipulation of SRURSs has attracted the interest of researchers globally. This paper provides a literature review of the last 10 years (2008โ€“2017) on SRURSs, and details achievements and challenges. Firstly, the definition, current state, development, classification, and challenges of SRURSs are introduced. Then, related papers are organized into two topical categories: mechanical structure design, and modeling and control. Following this, research groups involved in SRURS research and their major achievements are summarized and classified in the form of tables. The research groups are introduced in detail from seven parts. Finally, trends and challenges are compiled and presented to serve as a resource for researchers interested in aerial manipulation of SRURSs. The problem, trends, and challenges are described from three aspects. Conclusions of the paper are presented, and the future of SRURSs is discussed to enable further research interests

    Introduction to the Special Issue on Aerial Manipulation

    Get PDF
    The papers in this special section focus on aerial manipulation which is intended as grasping, positioning, assembling and disassembling of mechanical parts, measurement instruments and any other kind of objects, performed by a flying robot equipped with arms and grippers. Aerial manipulators can be helpful in those industrial and service applications that are considered very dangerous for a human operator. For instance, think of tasks like the inspection of a bridge, the inspection and the fixing-up of high-voltage electric lines, the repairing of rotor blades and so on. These tasks are both very unsafe and expensive because they require the performance of professional climbers and/or specialists in the field. A drone with manipulation capabilities can instead assist the human operator in these jobs or, at least, in the most hazardous and critical situations. As a matter of fact, such devices can indeed operate in dangerous tasks like reaching the bottom of the deck of a bridge or the highest places of a plant or a building; they can avoid dangerous work at height; aerial platforms can increase the total number of inspections of a plant, monitoring the wear of the components. Without doubts, aerial manipulation will improve the quality of the job of many workers

    Beyond Reynolds: A Constraint-Driven Approach to Cluster Flocking

    Full text link
    In this paper, we present an original set of flocking rules using an ecologically-inspired paradigm for control of multi-robot systems. We translate these rules into a constraint-driven optimal control problem where the agents minimize energy consumption subject to safety and task constraints. We prove several properties about the feasible space of the optimal control problem and show that velocity consensus is an optimal solution. We also motivate the inclusion of slack variables in constraint-driven problems when the global state is only partially observable by each agent. Finally, we analyze the case where the communication topology is fixed and connected, and prove that our proposed flocking rules achieve velocity consensus.Comment: 6 page

    A constrained DMPs framework for robot skills learning and generalization from human demonstrations

    Get PDF
    Dynamical movement primitives (DMPs) model is a useful tool for efficiently robotic learning manipulation skills from human demonstrations and then generalizing these skills to fulfill new tasks. It is improved and applied for the cases with multiple constraints such as having obstacles or relative distance limitation for multi-agent formation. However, the improved DMPs should change additional terms according to the specified constraints of different tasks. In this paper, we will propose a novel DMPs framework facing the constrained conditions for robotic skills generalization. First, we conclude the common characteristics of previous modified DMPs with constraints and propose a general DMPs framework with various classified constraints. Inspired by barrier Lyapunov functions (BLFs), an additional acceleration term of the general model is deduced to compensate tracking errors between the real and desired trajectories with constraints. Furthermore, we prove convergence of the generated path and makes a discussion about advantages of the proposed method compared with existing literature. Finally, we instantiate the novel framework through three experiments: obstacle avoidance in the static and dynamic environment and human-like cooperative manipulation, to certify its effectiveness
    • โ€ฆ
    corecore