BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Penn Engineering Events - ECPv6.15.18//NONSGML v1.0//EN
CALSCALE:GREGORIAN
METHOD:PUBLISH
X-WR-CALNAME:Penn Engineering Events
X-ORIGINAL-URL:https://seasevents.nmsdev7.com
X-WR-CALDESC:Events for Penn Engineering Events
REFRESH-INTERVAL;VALUE=DURATION:PT1H
X-Robots-Tag:noindex
X-PUBLISHED-TTL:PT1H
BEGIN:VTIMEZONE
TZID:America/New_York
BEGIN:DAYLIGHT
TZOFFSETFROM:-0500
TZOFFSETTO:-0400
TZNAME:EDT
DTSTART:20200308T070000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
TZNAME:EST
DTSTART:20201101T060000
END:STANDARD
BEGIN:DAYLIGHT
TZOFFSETFROM:-0500
TZOFFSETTO:-0400
TZNAME:EDT
DTSTART:20210314T070000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
TZNAME:EST
DTSTART:20211107T060000
END:STANDARD
BEGIN:DAYLIGHT
TZOFFSETFROM:-0500
TZOFFSETTO:-0400
TZNAME:EDT
DTSTART:20220313T070000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
TZNAME:EST
DTSTART:20221106T060000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTART;TZID=America/New_York:20210624T160000
DTEND;TZID=America/New_York:20210624T170000
DTSTAMP:20260406T204720
CREATED:20210622T181843Z
LAST-MODIFIED:20210622T181843Z
UID:5025-1624550400-1624554000@seasevents.nmsdev7.com
SUMMARY:Doctoral Dissertation Defense: "Machine Learning for Robot Motion Planning"
DESCRIPTION:Robot motion planning is a field that encompasses many different problems and algorithms. From the traditional piano mover’s problem to more complicated kinodynamic planning problems\, motion planning requires a broad breadth of human expertise and time to design well functioning algorithms. A traditional motion planning pipeline consists of modeling a system and then designing a planner and planning heuristics. Each part of this pipeline can incorporate machine learning. Planners and planning heuristics can benefit from machine learned heuristics\, while system modeling can benefit from model learning. Each aspect of the motion planning pipeline comes with tradeoffs between computational effort and human effort. This work explores algorithms that allow motion planning algorithms and frameworks to find a compromise between the two. First\, a framework for learning heuristics for sampling-based planners is presented. The efficacy of the framework depends on human designed features and policy architecture. Next\, a framework for learning system models is presented that incorporates human knowledge as constraints. The amount of human effort can be modulated by the quality of the constraints given. Lastly\, automatic constraint generation is explored to enable a larger range of trade-offs between human expert constraint generation and data driven constraint generation. We apply these techniques and show results in a variety of robotic systems.\n\nEmail dtadros@seas.upenn.edu for Zoom link.
URL:https://seasevents.nmsdev7.com/event/dissertation-defense-machine-learning-for-robot-motion-planning/
CATEGORIES:Dissertation or Thesis Defense
END:VEVENT
END:VCALENDAR