Jordan Leung

MERL is seeking a highly motivated intern to research low-complexity (i.e., computationally efficient) formulations of model predictive control (MPC). Candidates should be currently enrolled in a PhD program and have theoretical background in MPC (e.g., an understanding of standard proofs of stability) and relevant concepts in convex optimization (e.g., an understanding of interior-point, active set, and first-order optimization methods). An ideal candidate would have prior research experience related to suboptimal MPC, real-time iterations strategies for MPC, and/or other low-complexity approximation methods for MPC, and convex optimization.

Publication of results produced during the internship is expected. The duration of the internships are 3-6 months, and the start dates are flexible.

Required Specific Experience

• Current enrollment in a PhD program in Aerospace, Mechanical, Electrical Engineering, or a related field
• Understanding of fundamental theoretical concepts in MPC (e.g., proofs of stability, recursive feasibility, etc.)
• Familiarity with optimization algorithms commonly used in MPC (e.g., interior-point, active set, and first-order methods)
• Strong programming skills in MATLAB, Python, and/or C/C++.

Additional Desired Experience

• Prior research experience related to suboptimal MPC and/or other low-complexity approximation methods for MPC.
• Prior research experience related to optimization algorithm development/analysis.