분산된 로터로 구동되는 비행 스켈레톤 시스템의 디자인 상태추정 및 제어

학위논문(박사)--서울대학교 대학원 :공과대학 기계항공공학부,2020. 2. 이동준.In this thesis, we present key theoretical components for realizing flying aerial skeleton system called LASDRA (large-size aerial skeleton with distributed rotor actuation). Aerial skeletons are articulated aerial robots actuated by distributed rotors including both ground connected type and flying type. These systems have recently attracted interest and are being actively researched in several research groups, with the expectation of applying those for aerial manipulation in distant/narrow places, or for the performance with entertaining purpose such as drone shows. Among the aerial skeleton systems, LASDRA system, proposed by our group has some significant advantages over the other skeleton systems that it is capable of free SE(3) motion by omni-directional wrench generation of each link, and also the system can be operated with wide range of configuration because of the 3DOF (degrees of freedom) inter-link rotation enabled by cable connection among the link modules. To realize this LASDRA system, following three components are crucial: 1) a link module that can produce omni-directional force and torque and enough feasible wrench space; 2) pose and posture estimation algorithm for an articulated system with high degrees of freedom; and 3) a motion generation framework that can provide seemingly natural motion while being able to generate desired motion (e.g., linear and angular velocity) for the entire body. The main contributions of this thesis is theoretically developing these three components, and verifying these through outdoor flight experiment with a real LASDRA system. First of all, a link module for the LASDRA system is designed with proposed constrained optimization problem, maximizing the guaranteed feasible force and torque for any direction while also incorporating some constraints (e.g., avoiding inter-rotor air-flow interference) to directly obtain feasible solution. Also, an issue of ESC-induced (electronic speed control) singularity is first introduced in the literature which is inevitably caused by bi-directional thrust generation with sensorless actuators, and handled with a novel control allocation called selective mapping. Then for the state estimation of the entire LASDRA system, constrained Kalman filter based estimation algorithm is proposed that can provide estimation result satisfying kinematic constraint of the system, also along with a semi-distributed version of the algorithm to endow with system scalability. Lastly, CPG-based motion generation framework is presented that can generate natural biomimetic motion, and by exploiting the inverse CPG model obtained with machine learning method, it becomes possible to generate certain desired motion while still making CPG generated natural motion.본 논문에서는 비행 스켈레톤 시스템 LASDRA (large-size aerial skeleton with distributed rotor actuation) 의 구현을 위해 요구되는 핵심 기법들을 제안하며, 이를 실제 LASDRA 시스템의 실외 비행을 통해 검증한다. 제안된 기법은 1) 전방향으로 힘과 토크를 낼 수 있고 충분한 가용 렌치공간을 가진 링크 모듈, 2) 높은 자유도의 다관절구조 시스템을 위한 위치 및 자세 추정 알고리즘, 3) 자연스러운 움직임을 내는 동시에 전체 시스템이 속도, 각속도 등 원하는 움직임을 내도록 할 수 있는 모션 생성 프레임워크로 구성된다. 본 논문에서는 우선 링크 모듈의 디자인을 위해 전방향으로 보장되는 힘과 토크의 크기를 최대화하는 구속 최적화를 사용하고, 실제 적용가능한 해를 얻기 위해 몇가지 구속조건(로터 간 공기 흐름 간섭의 회피 등)을 고려한다. 또한 센서가 없는 액츄에이터로 양방향 추력을 내는 것에서 야기되는 ESC 유발 특이점 (ESC-induced singularity) 이라는 문제를 처음으로 소개하고, 이를 해결하기 위해 선택적 맵핑 (selective mapping) 이라는 기법을 제시한다. 전체 LASDRA 시스템의 상태추정을 위해 시스템의 기구학적 구속조건을 만족하는 결과를 얻을 수 있도록 구속 칼만 필터 기반의 상태추정 기법을 제시하고, 시스템 확장성을 고려하여 반 분산 (semi-distributed) 개념의 알고리즘을 함께 제시한다. 마지막으로 본 논문에서는 자연스러운 움직임의 생성을 위하여 CPG 기반의 모션 생성 프레임워크를 제안하며, 기계 학습 방법을 통해 CPG 역연산 모델을 얻음으로써 전체 시스템이 원하는 움직임을 낼 수 있도록 한다.1 Introduction 1 1.1 Motivation and Background 1 1.2 Research Problems and Approach 3 1.3 Preview of Contributions 5 2 Omni-Directional Aerial Robot 7 2.1 Introduction 7 2.2 Mechanical Design 12 2.2.1 Design Description 12 2.2.2 Wrench-Maximizing Design Optimization 13 2.3 System Modeling and Control Design 20 2.3.1 System Modeling 20 2.3.2 Pose Trajectory Tracking Control 22 2.3.3 Hybrid Pose/Wrench Control 22 2.3.4 PSPM-Based Teleoperation 24 2.4 Control Allocation with Selective Mapping 27 2.4.1 Infinity-Norm Minimization 27 2.4.2 ESC-Induced Singularity and Selective Mapping 29 2.5 Experiment 38 2.5.1 System Setup 38 2.5.2 Experiment Results 41 2.6 Conclusion 49 3 Pose and Posture Estimation of an Aerial Skeleton System 51 3.1 Introduction 51 3.2 Preliminary 53 3.3 Pose and Posture Estimation 55 3.3.1 Estimation Algorithm via SCKF 55 3.3.2 Semi-Distributed Version of Algorithm 59 3.4 Simulation 62 3.5 Experiment 65 3.5.1 System Setup 65 3.5.2 Experiment of SCKF-Based Estimation Algorithm 66 3.6 Conclusion 69 4 CPG-Based Motion Generation 71 4.1 Introduction 71 4.2 Description of Entire Framework 75 4.2.1 LASDRA System 75 4.2.2 Snake-Like Robot & Pivotboard 77 4.3 CPG Model 79 4.3.1 LASDRA System 79 4.3.2 Snake-Like Robot 80 4.3.3 Pivotboard 83 4.4 Target Pose Calculation with Expected Physics 84 4.5 Inverse Model Learning 86 4.5.1 LASDRA System 86 4.5.2 Snake-Like Robot 89 4.5.3 Pivotboard 90 4.6 CPG Parameter Adaptation 93 4.7 Simulation 94 4.7.1 LASDRA System 94 4.7.2 Snake-Like Robot & Pivotboard 97 4.8 Conclusion 101 5 Outdoor Flight Experiment of the F-LASDRA System 103 5.1 System Setup 103 5.2 Experiment Results 104 6 Conclusion 111 6.1 Summary 111 6.2 Future Works 112Docto

Random finite set filters for superpositional sensors

The multi–object filtering problem is a generalization of the well–known single– object filtering problem. In essence, multi–object filtering is concerned with the joint estimation of the unknown and time–varying number of objects and the state of each of these objects. The filtering problem becomes particular challenging when the number of objects cannot be inferred from the collected observations and when no association between an observation and an object is possible. A rather new and promising approach to multi–object filtering is based on the principles of finite set statistics (FISST). FISST is a methodology, originally proposed by R. Mahler, that allows the formulation of the multi–object filtering problem in a mathematical rigorous way. One of the main building blocks of this methodology are random finite sets (RFSs), which are essentially finite set (FS) – valued random variables (RVs). Hence, a RFS is a RV which is not only random in the values of each element but also random in the number of elements of the FS. Under the premise that the observations are generated by detection–type sensors, many practical and efficient multi–object filters have been proposed. In general, detection–type sensors are assumed to generate observations that either originate from a single object or are false alarms. While this is a reasonable assumption in many multi–object filtering scenarios, this is not always the case. Central to this thesis is another type of sensors, the superposition (SPS)–type sensors. Those types of sensors are assumed to generate only one single observation that encapsulates the information about all the objects in the monitored area. More specifically, a single SPS observation is comprised out of the additive contribution of all the observations which would be generated by each object individually. In this thesis multi–object filters for SPS–type sensors are derived in a formal mathematical manner using the methodology of FISST. The first key contribution is a formulation of a SPS sensor model that, alongside errors like sensor noise, accounts for the fact that an object might not be visible to a sensor due to being outside of the sensor’s restricted field of view (FOV) or because it is occluded by obstacles. The second key contribution is the derivation of multi–object Bayes filter for SPS sensors that incorporates the aforementioned SPS sensor model. The third key contribution is the formulation of a filter variant that incorporates a multi–object multi–Bernoulli distribution as underlying multi–object state distribution, thus providing a multi–object multi–Bernoulli (MeMBer) filter variant for SPS–type sensors. As the stated variant turns out not to be conjugate, two approximations to the exact solution are given. The fourth key contribution is the derivation of computationally tractable implementations of the SPS MeMBer filters