Convex Trajectory Optimization
Convex Trajectory Optimization is a trajectory optimization method in which the optimization problem is formulated as a convex program, leveraging convexity to guarantee globally optimal solutions and efficient computation via established numerical solvers.
84
Publications
6.2K
Citations
258
Authors
116
Institutions
Publications per year
2017–2026
71
Parents
84
1–5 of 84
258
4
h-index
4
h-index
4
h-index
3
h-index
3
h-index
1–5 of 258
116
Tsinghua University
Beijing, China
5 h-index
13 publications
277 citations

Southeast University
Nanjing, China
4 h-index
9 publications
2.8K citations
University of Washington
Seattle, United States
4 h-index
12 publications
938 citations

Xidian University
Xi'an, China
4 h-index
9 publications
464 citations

Harbin Institute of Technology
Harbin, China
4 h-index
14 publications
439 citations
National University of Singapore
Singapore, Singapore
3 h-index
4 publications
3K citations
Beijing Aerospace Flight Control Center
Beijing, China
3 h-index
4 publications
153 citations

Beijing Institute of Technology
Beijing, China
3 h-index
11 publications
534 citations
1–8 of 116
AST · 9 publications · 495 citations
9
h-index
7 publications · 2.7K citations
7
h-index
5 publications · 331 citations
5
h-index
3 publications · 106 citations
3
h-index
2 publications · 135 citations
2
h-index
1–5