Project Info


Learning Robot Motion Ability

Neil Dantam | ndantam@mines.edu

Robots in our homes will need to move through unstructured and even cluttered arrangements of objects. For example, consider a robot retrieving the ketchup from the back of your refrigerator. Can the robot maneuver its arm around the milk and peanut butter in front, or must it first remove those objects to reach its target in the back? The project will explore the ability or feasibility of robots to achieve motions by combining the search for valid paths with machine learning to classify whether the desired goal (e.g., reaching the ketchup) is feasible. The resulting algorithm will return either the valid path or a classification of the problem as infeasible.

For more information:

The Open Motion Planning Library (https://ompl.kavrakilab.org/).

The Task-Motion Kit (http://www.neil.dantam.name/papers/dantam2018tmkit.pdf).

Student Preparation


Qualifications

Student must be familiar with programming and basic data structures. Prior experience with calculus, linear algebra, and machine learning is desirable. Necessary Courses: CSCI-262. Desired Courses: MATH 332, CSCI-470.

Time Commitment

5 hours/week

Skills/Techniques Gained

Student will develop an understanding of robot programming, robot motion planning, and machine learning techniques and libraries. Student will learn various methods and algorithms for learning and optimization in complex spaces.

Mentoring Plan

Weekly individual meetings with the MURF student and faculty member to discuss progress and provide directed guidance. Weekly lab meetings to discuss the overall project and integration. Assigned graduate student mentor for the MURF student.