BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//C2SMART Home - ECPv6.15.20//NONSGML v1.0//EN
CALSCALE:GREGORIAN
METHOD:PUBLISH
X-WR-CALNAME:C2SMART Home
X-ORIGINAL-URL:https://c2smart.engineering.nyu.edu
X-WR-CALDESC:Events for C2SMART Home
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: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
BEGIN:DAYLIGHT
TZOFFSETFROM:-0500
TZOFFSETTO:-0400
TZNAME:EDT
DTSTART:20250309T070000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
TZNAME:EST
DTSTART:20251102T060000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTART;TZID=America/New_York:20240214T150000
DTEND;TZID=America/New_York:20240214T160000
DTSTAMP:20260501T053702
CREATED:20240206T162035Z
LAST-MODIFIED:20240212T191828Z
UID:83136-1707922800-1707926400@c2smart.engineering.nyu.edu
SUMMARY:RESCHEDULED: Women in Transportation\, Prof. Lavanya Marla
DESCRIPTION:The confluence of learning and optimization holds great promise for solving dynamic\, online resource allocation problems under uncertainty. In this talk\, I will present brief overviews of two such problems in which tools developed independently in one field have helped solve problems in the complementary field. First\, we focus on the problem of collaborative routing of aircraft and unmanned vehicles\, under non-stationary spatial-temporal correlations. A long unsolved question in air and ground routing has been: “if a subset of traveling vehicles can be used for exploration to update information\, how should vehicles be routed to collect information most useful to minimize costs for the entire fleet”? We expand on recent advances in multi-armed bandit algorithms to solve this problem\, and generate near-optimal policies. We find this could reduce travel time and fuel burn by about 5% for the fleet. Second\, we study how we can improve upon long-used regret bounds in AI/ML\, which are based on omniscient information about the future. Our work builds on Brown\, Smith\, and Sun (2010)\, who present an approach for information-relaxation bounds in dynamic programs. However\, the computation of these penalized information-relaxation bounds (or penalized regret bounds) for large-scale systems has hitherto been discussed by many as intractable. We present tractable methods to achieve bounds for time-space network-based problems and problems modeled as block-diagonal mixed-integer programs. \nLight refreshments will be provided. If you cannot join in person\, register to attend via Zoom
URL:https://c2smart.engineering.nyu.edu/event/rescheduled-women-in-transportation-prof-lavanya-marla/
LOCATION:C2SMART Center Viz Lab\, 6 Metrotech Center\, Room 460\, Brooklyn\, 11201
END:VEVENT
END:VCALENDAR