Login / Signup
Optimal robot path following for minimal time versus energy loss trade-off using sequential convex programming.
Frederik Debrouwere
Wannes Van Loock
Goele Pipeleers
Dinh Quoc Tran
Moritz Diehl
Joris De Schutter
Jan Swevers
Published in:
ICM (2013)
Keyphrases
</>
convex programming
trade off
obstacle avoidance
semidefinite programming
interior point methods
mobile robot
convex optimization
linear programming
optimal solution
primal dual
dynamic programming
worst case
convex functions
upper bound
computationally intensive