The Control and Dynamical Systems (CD) group at MERL is seeking a highly motivated intern to conduct research on planning and control by formal methods, in particular temporal logics specifications and their synthesis by mixed-integer inequalities. The ideal candidate is enrolled in a PhD program in Electrical, Mechanical, Aerospace Engineering, Computer Science or related program, with focus on Control Theory. The ideal candidate will have experience in (one or more of) formal methods, particularly temporal logics and signal temporal logics, reachability analysis, abstractions of dynamical systems, hybrid predictive control, and mixed integer programming. Good programming skills in Matlab (or alternatively Python) are required, working knowledge of C/C++ is a plus. The expected duration of the internship is 3-6 months with flexible start date after April 1st, 2020.

The Control and Dynamical Systems (CD) group at MERL is seeking highly motivated interns at different levels of expertise to conduct research on planning and control for autonomous vehicles. The research domain includes algorithms for path planning, vehicle control, high level decision making, sensor-based navigation, driver-vehicle interaction. PhD students will be considered for algorithm development and analysis, and property proving. Master students will be considered for development and implementation in a scaled robotic test bench for autonomous vehicles. For algorithm development and analysis it is highly desirable to have deep background in one or more among: sampling-based planning methods, particle filtering, model predictive control, reachability methods, formal methods and abstractions of dynamical systems, and experience with their implementation in Matlab/Python/C++. For algorithm implementation, it is required to have working knowledge of Matlab, C++, and ROS, and it is a plus to have background in some of the above mentioned methods. The expected duration of the internship is 3-6 months with flexible start date after April 1st, 2020.

MERL is looking for a highly motivated individual to work on automatic, compiler based techniques for optimizing linear algebra kernels. The ideal candidate is a Ph.D. student in computer science with extensive experience in compiler design and source code optimization techniques. In particular, the successful candidate will have a strong working knowledge of polyhedral optimization techniques, the LLVM compiler, and Polly. Strong C/C++ skills and knowledge of LLVM at the source level are required. Publication of results in conference proceedings and journals is expected. The expected duration of the internship is 3 months and the start date is flexible.