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:20220313T070000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
TZNAME:EST
DTSTART:20221106T060000
END:STANDARD
BEGIN:DAYLIGHT
TZOFFSETFROM:-0500
TZOFFSETTO:-0400
TZNAME:EDT
DTSTART:20230312T070000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
TZNAME:EST
DTSTART:20231105T060000
END:STANDARD
BEGIN:DAYLIGHT
TZOFFSETFROM:-0500
TZOFFSETTO:-0400
TZNAME:EDT
DTSTART:20240310T070000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
TZNAME:EST
DTSTART:20241103T060000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTART;TZID=America/New_York:20230816T140000
DTEND;TZID=America/New_York:20230816T150000
DTSTAMP:20260404T050300
CREATED:20230807T183827Z
LAST-MODIFIED:20230807T183827Z
UID:9412-1692194400-1692198000@seasevents.nmsdev7.com
SUMMARY:MEAM Ph.D. Thesis Defense: "Exploiting Flows for Orienteering and Planning Problems"
DESCRIPTION:Task and path planning algorithms for robots in the presence of flows confront a fundamental dichotomy between the continuous and the discrete: task planning algorithms discretize the world and their goals\, whereas flows are continuous in nature. This contrast is exemplified in many robotic applications where environmental forces impact navigation and exploiting those flows is critical for the quality of results. In this work\, we address methods for connecting continuous models of the environment with planning methods for robot motion in high-level task planning with low-level path planning.\nFirst\, we examine a problem that focuses on the high level problem of task planning\, but abstracts away the environment and assumes that the low-level path planning is solved independently. This helps simplify the problem\, but neglects to include environmental information which is often fundamentally linked to the vehicle motion. Next\, we address this limitation by exploring path planning algorithms in environments that are represented by an external flow field\, such as static and time-varying ocean currents. While we cannot control the external currents\, our planning method considers the trade-offs between energy efficiency\, reward collection\, and time budget based on the interplay of the chosen routes\, paths\, and environment. Lastly\, we expand our analysis to the joint problem of both designing the environmental flows and path planning within the designed flow fields. We explore this problem in the context of controlling magnetically driven milli-robots. We show how we can circumvent the need to solve the inverse dynamics problem with complete knowledge of the global field by extracting key features from the generated fields. These features enable us to take a topological approach to discretize the search space and design advantageous paths.
URL:https://seasevents.nmsdev7.com/event/meam-ph-d-thesis-defense-exploiting-flows-for-orienteering-and-planning-problems/
LOCATION:Towne 337
CATEGORIES:Doctoral,Dissertation or Thesis Defense
ORGANIZER;CN="Mechanical Engineering and Applied Mechanics":MAILTO:meam@seas.upenn.edu
END:VEVENT
END:VCALENDAR