2018 37th Chinese Control Conference (CCC) 2018
DOI: 10.23919/chicc.2018.8483147
|View full text |Cite
|
Sign up to set email alerts
|

Convex Model Predictive Control for Rocket Vertical Landing

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
5
0

Year Published

2020
2020
2023
2023

Publication Types

Select...
4
1
1

Relationship

1
5

Authors

Journals

citations
Cited by 6 publications
(5 citation statements)
references
References 12 publications
0
5
0
Order By: Relevance
“…Since MPC can handle the constraints of the landing mission, it is widely used in the trajectory of unmanned aerial vehicles (UAVs) [39,40], rockets [41,42] and robots [43,44]. Among them, [44] designed an MPC to solve the problem of point-to-point trajectory planning, thereby controlling the manipulator to catch a thrown tennis ball.…”
Section: Mpc Design For Autonomous Landing Of a Quadrotormentioning
confidence: 99%
“…Since MPC can handle the constraints of the landing mission, it is widely used in the trajectory of unmanned aerial vehicles (UAVs) [39,40], rockets [41,42] and robots [43,44]. Among them, [44] designed an MPC to solve the problem of point-to-point trajectory planning, thereby controlling the manipulator to catch a thrown tennis ball.…”
Section: Mpc Design For Autonomous Landing Of a Quadrotormentioning
confidence: 99%
“…Using t = (t f − t 0 )τ + t 0 , the time is mapped to the interval [0, 1]. Taking τ as a new independent variable and t f as an augmented control variable is an effective way to solve the problem of free terminal time when using the SCP algorithm (Wang C and Song, 2018a). The algorithm is also applicable to the nonlinear equality constraints of the angular velocity and quaternion (Eq.…”
Section: Online Trajectory Planning Based On Convex Optimizationmentioning
confidence: 99%
“…The accuracy and sparsity of the discretization method are also key factors that ensure the accuracy and effectiveness of the algorithm. The discretization methods for differential equations of motion include mainly: (1) the trapezoidal method (TM) (Wang C and Song, 2018a), where the estimation of the state variable differential at each discrete point is related to only the state and control variables of two adjacent discrete points; (2) the state transition method (STM) (Açıkmeşe and Ploen, 2007), where the estimation is related to the state and control variables of all previous discrete points; (3) the pseudospectral method (PM) (Sagliano and Mooij, 2018;Sagliano, 2018aSagliano, , 2018bWenzel et al, 2018;Malyuta et al, 2019), where the estimation is related to the control and state variables at all other discrete points. From the approximation accuracy of the discrete problem to the original problem, more information means higher accuracy, so the sequence is PM > STM > TM.…”
Section: Online Trajectory Planning Based On Convex Optimizationmentioning
confidence: 99%
See 1 more Smart Citation
“…For the online guidance problem of the rocket vertical landing phase, a successive convexification + MPC guidance algorithm is proposed by Ref. [33]. Ref.…”
Section: Introductionmentioning
confidence: 99%