2018
DOI: 10.48550/arxiv.1812.04755
|View full text |Cite
Preprint
|
Sign up to set email alerts
|

Aerial navigation in obstructed environments with embedded nonlinear model predictive control

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

2022
2022
2022
2022

Publication Types

Select...
1

Relationship

0
1

Authors

Journals

citations
Cited by 1 publication
(2 citation statements)
references
References 0 publications
0
2
0
Order By: Relevance
“…PANOC is a quasi-Newton-accelerated first-order method, which -despite its simple, inexpensive iterations -enjoys locally superlinear convergence, without requiring the manipulation of large Jacobian or Hessian matrices. Applying ALM and penaltybased methods combined with PANOC has recently proven successful within several applications in NMPC [5], [6] and the Optimization Engine (OPEN) software [7], which shares some of its algorithmic foundations with the present work, although it is tailored more heavily towards embedded systems applications.…”
Section: A Background and Motivationmentioning
confidence: 97%
See 1 more Smart Citation
“…PANOC is a quasi-Newton-accelerated first-order method, which -despite its simple, inexpensive iterations -enjoys locally superlinear convergence, without requiring the manipulation of large Jacobian or Hessian matrices. Applying ALM and penaltybased methods combined with PANOC has recently proven successful within several applications in NMPC [5], [6] and the Optimization Engine (OPEN) software [7], which shares some of its algorithmic foundations with the present work, although it is tailored more heavily towards embedded systems applications.…”
Section: A Background and Motivationmentioning
confidence: 97%
“…This phenomenon does not affect the global convergence of the algorithm. However, in the interest of practical performance, it is beneficial to reject these low-quality L-BFGS steps, as two problems arise when such steps are accepted: (1) it is likely that the next iterate will be (much) farther away from the optimum than before; and (2) the local curvature of ψ might be much larger at x k+1 , demanding a significant reduction of the step size γ in the next iteration in order to satisfy equation (6). The combined effect of ending up far away from the optimum and having to advance with small steps is detrimental for performance.…”
Section: Improved Line Searchmentioning
confidence: 99%