UAV trajectory optimization using chance-constrained second-order cone programming

نویسندگان

چکیده

It is challenging to generate optimal trajectories for nonlinear dynamic systems under external disturbances. In this brief, we present a novel approach planning safe of the chance-constrained trajectory optimization problems with nonconvex constraints. First, chance constraints are handled by deterministic ones which show its availability. We derive an iterative convex method solve control problem. Then (CCOCP) problem reformed be programming (NLP) through hp-adaptive pseudospectral method. An successive linearization algorithm detailed NLP one described as second-order cone demonstrate proposed on 3-DoF unmanned aerial vehicle system chance-constrained. The simulation results reliable solutions UAV

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Waveform Design using Second Order Cone Programming in Radar Systems

Transmit waveform design is one of the most important problems in active sensing and communication systems. This problem, due to the complexity and non-convexity, has been always the main topic of many papers for the decades. However, still an optimal solution which guarantees a global minimum for this multi-variable optimization problem is not found. In this paper, we propose an attracting met...

متن کامل

Error bound optimization using second order cone programming

In safety of life applications using satellite navigation, the Protection Level (PL) equation translates what is known about the pseudorange errors into a hard bound on the positioning error (the Protection Level). The current PL equations for Satellite Based Augmentation Systems are based on Gaussian statistics: all errors are characterized by a zero mean Gaussian distribution which is an uppe...

متن کامل

Second-order cone programming

Second-order cone programming (SOCP) problems are convex optimization problems in which a linear function is minimized over the intersection of an affine linear manifold with the Cartesian product of second-order (Lorentz) cones. Linear programs, convex quadratic programs and quadratically constrained convex quadratic programs can all be formulated as SOCP problems, as can many other problems t...

متن کامل

SOME PROPERTIES FOR FUZZY CHANCE CONSTRAINED PROGRAMMING

Convexity theory and duality theory are important issues in math- ematical programming. Within the framework of credibility theory, this paper rst introduces the concept of convex fuzzy variables and some basic criteria. Furthermore, a convexity theorem for fuzzy chance constrained programming is proved by adding some convexity conditions on the objective and constraint functions. Finally,...

متن کامل

Second Order Cone Programming Relaxation of Nonconvex Quadratic Optimization Problems

A disadvantage of the SDP (semidefinite programming) relaxation method for quadratic and/or combinatorial optimization problems lies in its expensive computational cost. This paper proposes a SOCP (second-order-cone programming) relaxation method, which strengthens the lift-and-project LP (linear programming) relaxation method by adding convex quadratic valid inequalities for the positive semid...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Aerospace Science and Technology

سال: 2022

ISSN: ['1626-3219', '1270-9638']

DOI: https://doi.org/10.1016/j.ast.2021.107283