Login / Signup

A double-worst-case formulation for improving the robustness of an MPC-based obstacle avoidance algorithm to parametric uncertainty.

Jiechao LiuParamsothy JayakumarJeffrey L. SteinTulga Ersal
Published in: ACC (2017)
Keyphrases
  • worst case
  • obstacle avoidance
  • path planning
  • computational complexity
  • optimization algorithm
  • average case
  • mobile robot
  • lower bound
  • np hard