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:20211118T120000
DTEND;TZID=America/New_York:20211118T133000
DTSTAMP:20260406T105911
CREATED:20211112T212550Z
LAST-MODIFIED:20211112T212550Z
UID:5787-1637236800-1637242200@seasevents.nmsdev7.com
SUMMARY:ESE Ph.D. Thesis Defense: "Graph Convolutions for Teams of Robots"
DESCRIPTION:In many applications in robotics\, there exist teams of robots operating in dynamic environments requiring the design of complex communication and control schemes. The problem is made easier if one assumes the presence of an oracle that has instantaneous access to states of all entities in the environment and can communicate simultaneously without any loss. However\, such an assumption is unrealistic especially when there exist a large number of robots. More specifically\, we are interested in decentralized control policies for teams of robots using only local communication and sensory information to achieve high-level team objectives. We first make the case for using distributed reinforcement learning to learn local behaviors by optimizing for a sparse team-wide reward as opposed to existing model-based methods. A central caveat of learning policies using model-free reinforcement learning is the lack of scalability. To achieve large-scale scalable results\, we introduce a novel paradigm where the policies are parametrized by graph convolutions. Additionally\, we also develop new methodologies to train these policies and derive technical insights into their behaviors. Building upon these\, we design perception-action loops for teams of robots that rely only on noisy visual sensors\, a learned history state\, and local information from nearby robots to achieve complex team wide-objectives. We demonstrate the effectiveness of our methods on several large-scale multi-robot tasks.
URL:https://seasevents.nmsdev7.com/event/ese-ph-d-thesis-defense-graph-convolutions-for-teams-of-robots/
LOCATION:Room 452 C\, 3401 Walnut\, 3401 Walnut Street\, Philadelphia\, PA\, 19104\, United States
ORGANIZER;CN="Electrical and Systems Engineering":MAILTO:eseevents@seas.upenn.edu
END:VEVENT
END:VCALENDAR