2018 IEEE Conference on Control Technology and Applications (CCTA) 2018
DOI: 10.1109/ccta.2018.8511584
|View full text |Cite
|
Sign up to set email alerts
|

A Primal-Dual Method for Optimal Control and Trajectory Generation in High-Dimensional Systems

Abstract: Presented is a method for efficient computation of the Hamilton-Jacobi (HJ) equation for time-optimal control problems using the generalized Hopf formula. Typically, numerical methods to solve the HJ equation rely on a discrete grid of the solution space and exhibit exponential scaling with dimension. The generalized Hopf formula avoids the use of grids and numerical gradients by formulating an unconstrained convex optimization problem. The solution at each point is completely independent, and allows a massive… Show more

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
17
0

Year Published

2019
2019
2023
2023

Publication Types

Select...
5
2

Relationship

3
4

Authors

Journals

citations
Cited by 12 publications
(17 citation statements)
references
References 27 publications
0
17
0
Order By: Relevance
“…A closed-form solution for the optimal control exists in a wide variety of OC problems. Importantly, the PMP can also be applied efficiently when (16) does not admit a closed-form solution but can be computed efficiently.…”
Section: The Pontryagin Maximum Principlementioning
confidence: 99%
“…A closed-form solution for the optimal control exists in a wide variety of OC problems. Importantly, the PMP can also be applied efficiently when (16) does not admit a closed-form solution but can be computed efficiently.…”
Section: The Pontryagin Maximum Principlementioning
confidence: 99%
“…Penalizers prove helpful in problems similar to (12) [14], [15], [16], [24]. These penalizers improve the training convergence (Sec.…”
Section: B Adding Hjb Penalizersmentioning
confidence: 99%
“…These penalizers improve the training convergence (Sec. III-C) without altering the solution of (12).…”
Section: B Adding Hjb Penalizersmentioning
confidence: 99%
See 1 more Smart Citation
“…Note that if the goal is a point in R n , then we can represent this by choosing Ω as a ball with arbitrarily small radius. As noted in Kirchner et al (2018a) we solve for the minimum time to reach the set Ω by constructing a newton iteration, starting from an initial guess, t 0 , with…”
Section: Time-optimal Control To a Goal Setmentioning
confidence: 99%