비선형 최적화를 이용한 멀티로터 현수 운송의 경로 계획 및 제어 기법

학위논문(박사) -- 서울대학교대학원 : 공과대학 기계항공공학부, 2021.8. 김현진.경로 계획과 제어는 안전하고 안정적으로 멀티로터를 운용하기 위해서 필수적인 요소이다. 충돌을 회피하며 효율적인 경로를 생성하고 이를 실제로 추종하기 위해서는 동역학 모델이 고려되어야 한다. 일반 멀티로터의 동역학 모델은 높은 차원을 가진 비선형식으로 표현되는데, 현수 운송 물체를 추가할 경우 계산이 더욱 복잡해진다. 본 논문은 멀티로터를 이용한 현수 운송에 있어 경로 계획과 제어에 대한 효율적인 기법을 제안한다. 첫 번째로 단일 멀티로터를 이용한 현수 운송을 다룬다. 물체가 별도의 엑츄에이터 없이 운송될 경우 물체는 기체의 움직임에 의해서만 제어가 가능하다. 하지만, 동역학식의 높은 비선형성으로 운용에 어려움이 존재한다. 이를 경감시키기 위해서 회전 동역학식의 비선형성을 줄이고 자세 제어에 존재하는 시간 지연을 고려하여 동역학식을 간소화한다. 경로 계획에 있어서는 충돌 회피를 위해 기체, 케이블, 그리고 운송 물체를 다른 크기와 모양을 가진 타원체들로 감싸며, 효과적이면서도 덜 보수적인 방식으로 충돌 회피 구속조건을 부과한다. Augmented Lagrangian 방법을 이용하여 비선형 구속조건이 부과된 비선형 문제를 실시간 최적화하여 경로를 생성한다. 생성된 경로를 추종하기 위해서 Sequential linear quadratic 솔버를 이용한 모델 예측 제어기로 최적 제어 입력을 계산한다. 제안된 기법은 여러 시뮬레이션과 실험을 통해 검증한다. 다음으로, 다중 멀티로터를 이용한 협업 현수 운송 시스템을 다룬다. 해당 시스템의 상태 변수나 동역학식에서 연결된(coupled) 항의 개수는 기체의 수에 비례하여 증가하기 때문에, 효과적인 기법 없이는 최적화에 많은 시간이 소요된다. 높은 비선형성을 가진 동역학식의 복잡성을 낮추기 위하여 미분 평탄성을 사용한다. 경로 또한 piece-wise Bernstein 다항식을 이용하여 매개변수화하여 최적화 변수의 개수를 줄인다. 최적화 문제를 분해하고 충돌 회피 구속조건들에 대해 볼록화(convexification)를 수행하여 운송 물체의 경로와 장력의 경로에 대한 볼록한(convex) 하위문제들이 만들어진다. 첫 번째 하위문제인 물체 경로 생성에서는, 장애물 회피와 멀티로터의 공간을 확보하기 위하여 안전 비행 통로(safe flight corridor, SFC)와 여유 간격 구속조건을 고려하여 최적화한다. 다음으로, 장력 벡터들의 경로는 장애물 회피와 상호 충돌을 방지하기 위하여 안전 비행 섹터(safe flight sector, SFS)와 상대 안전 비행 섹터(relative safe flight sector, RSFS) 구속조건을 부과하여 최적화한다. 시뮬레이션과 실험으로 복잡한 환경에서 효율적인 경로 계획 기법을 시연하며 검증한다.Trajectory generation and control are fundamental requirements for safe and stable operation of multi-rotors. The dynamic model should be considered to generate efficient and collision-free trajectories with feasibility. While the dynamic model of a bare multi-rotor is expressed non-linearly with high dimensions which results in computational loads, the suspended load increases the complexity further. This dissertation presents efficient algorithms for trajectory generation and control of multi-rotors with a suspended load. A single multi-rotor with a suspended load is addressed first. Since the load is suspended through a cable without any actuator, movement of the load must be controlled via maneuvers of the multi-rotor. However, the highly non-linear dynamics of the system results in difficulties. To relive them, the rotational dynamics is simplified to reduce the non-linearity and consider the delay in attitude control. For trajectory generation, the vehicle, cable, and load are considered as ellipsoids with different sizes and shapes, and collision-free constraints are expressed in an efficient and less-conservative way. The augmented Lagrangian method is applied to solve a nonlinear optimization problem with nonlinear constraints in real-time. Model predictive control with the sequential linear quadratic solver is used to track the generated trajectories. The proposed algorithm is validated with several simulations and experiment. A system with multiple multi-rotors for cooperative transportation of a suspended load is addressed next. As the system has more state variables and coupling terms in the dynamic equation than the system with a single multi-rotor, optimization takes a long time without an efficient method. The differential flatness of the system is used to reduce the complexity of the highly non-linear dynamic equation. The trajectories are also parameterized using piece-wise Bernstein polynomials to decrease the number of optimization variables. By decomposing an optimization problem and performing convexification, convex sub-problems are formulated for the load and the tension trajectories optimization, respectively. In each sub-problem, a light-weight sampling method is used to find a feasible and low-cost trajectory as initialization. In the first sub-problem, the load trajectory is optimized with safe flight corridor (SFC) and clearance constraints for collision avoidance and security of space for the multi-rotors. Then, the tension histories are optimized with safe flight sector (SFS) and relative safe flight sector (RSFS) constraints for obstacle and inter-agent collision avoidance. Simulations and experiments are conducted to demonstrate efficient trajectory generation in a cluttered environment and validate the proposed algorithms.Chapter 1 Introduction 1 1.1 Literature Survey 5 1.2 Contributions 9 1.3 Outline 10 Chapter 2 Single Multi-rotor with a Suspended Load 11 2.1 Dynamics 11 2.2 Trajectory Generation 23 2.3 Optimal Control 31 Chapter 3 Multiple Multi-rotors with a Suspended Load 36 3.1 Problem Setting 36 3.2 Load Trajectory Generation 45 3.3 Tension History Generation 54 Chapter 4 Experimental Validation 68 4.1 Single Multi-rotor with a Suspended Load 68 4.2 Multiple Multi-rotors with a Suspended Load 79 Chapter 5 Conclusion 100 Appendix A Detailed Derivation of Dierential Flatness 102 B Preliminaries of Bernstein Polynomials 108 B.1 Denition of a Bernstein Polynomial 108 B.2 Convex hull property of a Bernstein Polynomial 110 B.3 Representation of a General Polynomial with Bernstein Basis Polynomials 111 B.4 Representation of the Derivative of a Bernstein Polynomial with Bernstein Basis Polynomials 112 References 113 Abstract (in Korean) 119박

MULTI-AGENT UNMANNED UNDERWATER VEHICLE VALIDATION VIA ROLLING-HORIZON ROBUST GAMES

Autonomy in unmanned underwater vehicle (UUV) navigation is critical for most applications due to inability of human operators to control, monitor or intervene in underwater environments. To ensure safe autonomous navigation, verification and validation (V&V) procedures are needed for various applications. This thesis proposes a game theory-based benchmark validation technique for trajectory optimization for non-cooperative UUVs. A quadratically constrained nonlinear program formulation is presented, and a "perfect-information reality" validation framework is derived by finding a Nash equilibrium to various two-player pursuit-evasion games (PEG). A Karush-Kuhn-Tucker (KKT) point to such a game represents a best-case local optimum, given perfect information available to non-cooperative agents. Rolling-horizon foresight with robust obstacles are incorporated to demonstrate incomplete information and stochastic environmental conditions. A MATLAB-GAMS interface is developed to model the rolling-horizon game, and is solved via a mixed complementarity problem (MCP), and illustrative examples show how equilibrium trajectories can serve as benchmarks for more practical real-time path planners

Fast generation of chance-constrained flight trajectory for unmanned vehicles

In this work, a fast chance-constrained trajectory generation strategy incorporating convex optimization and convex approximation of chance constraints is designed so as to solve the unmanned vehicle path planning problem. A pathlength- optimal unmanned vehicle trajectory optimization model is constructed with the consideration of the pitch angle constraint, the curvature radius constraint, the probabilistic control actuation constraint, and the probabilistic collision avoidance constraint. Subsequently, convexification technique is introduced to convert the nonlinear problem formulation into a convex form. To deal with the probabilistic constraints in the optimization model, convex approximation techniques are introduced such that the probabilistic constraints are replaced by deterministic ones, while simultaneously preserving the convexity of the optimization model. Numerical results, obtained from a number of case studies, validate the effectiveness and reliability of the proposed approach. A number of comparative studies were also performed. The results confirm that the proposed design is able to produce more optimal flight paths and achieve enhanced computational performance than other chance-constrained optimization approaches investigated in this paper

A Partially Randomized Approach to Trajectory Planning and Optimization for Mobile Robots with Flat Dynamics

Motion planning problems are characterized by huge search spaces and complex obstacle structures with no concise mathematical expression. The fixed-wing airplane application considered in this thesis adds differential constraints and point-wise bounds, i. e. an infinite number of equality and inequality constraints. An optimal trajectory planning approach is presented, based on the randomized Rapidly-exploring Random Trees framework (RRT*). The local planner relies on differential flatness of the equations of motion to obtain tree branch candidates that automatically satisfy the differential constraints. Flat output trajectories, in this case equivalent to the airplane's flight path, are designed using Bézier curves. Segment feasibility in terms of point-wise inequality constraints is tested by an indicator integral, which is evaluated alongside the segment cost functional. Although the RRT* guarantees optimality in the limit of infinite planning time, it is argued by intuition and experimentation that convergence is not approached at a practically useful rate. Therefore, the randomized planner is augmented by a deterministic variational optimization technique. To this end, the optimal planning task is formulated as a semi-infinite optimization problem, using the intermediate result of the RRT(*) as an initial guess. The proposed optimization algorithm follows the feasible flavor of the primal-dual interior point paradigm. Discretization of functional (infinite) constraints is deferred to the linear subproblems, where it is realized implicitly by numeric quadrature. An inherent numerical ill-conditioning of the method is circumvented by a reduction-like approach, which tracks active constraint locations by introducing new problem variables. Obstacle avoidance is achieved by extending the line search procedure and dynamically adding obstacle-awareness constraints to the problem formulation. Experimental evaluation confirms that the hybrid approach is practically feasible and does indeed outperform RRT*'s built-in optimization mechanism, but the computational burden is still significant.Bewegungsplanungsaufgaben sind typischerweise gekennzeichnet durch umfangreiche Suchräume, deren vollständige Exploration nicht praktikabel ist, sowie durch unstrukturierte Hindernisse, für die nur selten eine geschlossene mathematische Beschreibung existiert. Bei der in dieser Arbeit betrachteten Anwendung auf Flächenflugzeuge kommen differentielle Randbedingungen und beschränkte Systemgrößen erschwerend hinzu. Der vorgestellte Ansatz zur optimalen Trajektorienplanung basiert auf dem Rapidly-exploring Random Trees-Algorithmus (RRT*), welcher die Suchraumkomplexität durch Randomisierung beherrschbar macht. Der spezifische Beitrag ist eine Realisierung des lokalen Planers zur Generierung der Äste des Suchbaums. Dieser erfordert ein flaches Bewegungsmodell, sodass differentielle Randbedingungen automatisch erfüllt sind. Die Trajektorien des flachen Ausgangs, welche im betrachteten Beispiel der Flugbahn entsprechen, werden mittels Bézier-Kurven entworfen. Die Einhaltung der Ungleichungsnebenbedingungen wird durch ein Indikator-Integral überprüft, welches sich mit wenig Zusatzaufwand parallel zum Kostenfunktional berechnen lässt. Zwar konvergiert der RRT*-Algorithmus (im probabilistischen Sinne) zu einer optimalen Lösung, jedoch ist die Konvergenzrate aus praktischer Sicht unbrauchbar langsam. Es ist daher naheliegend, den Planer durch ein gradientenbasiertes lokales Optimierungsverfahren mit besseren Konvergenzeigenschaften zu unterstützen. Hierzu wird die aktuelle Zwischenlösung des Planers als Initialschätzung für ein kompatibles semi-infinites Optimierungsproblem verwendet. Der vorgeschlagene Optimierungsalgorithmus erweitert das verbreitete innere-Punkte-Konzept (primal dual interior point method) auf semi-infinite Probleme. Eine explizite Diskretisierung der funktionalen Ungleichungsnebenbedingungen ist nicht erforderlich, denn diese erfolgt implizit durch eine numerische Integralauswertung im Rahmen der linearen Teilprobleme. Da die Methode an Stellen aktiver Nebenbedingungen nicht wohldefiniert ist, kommt zusätzlich eine Variante des Reduktions-Ansatzes zum Einsatz, bei welcher der Vektor der Optimierungsvariablen um die (endliche) Menge der aktiven Indizes erweitert wird. Weiterhin wurde eine Kollisionsvermeidung integriert, die in den Teilschritt der Liniensuche eingreift und die Problemformulierung dynamisch um Randbedingungen zur lokalen Berücksichtigung von Hindernissen erweitert. Experimentelle Untersuchungen bestätigen, dass die Ergebnisse des hybriden Ansatzes aus RRT(*) und numerischem Optimierungsverfahren der klassischen RRT*-basierten Trajektorienoptimierung überlegen sind. Der erforderliche Rechenaufwand ist zwar beträchtlich, aber unter realistischen Bedingungen praktisch beherrschbar