Events & News
Colloquium
| Category | Lecture |
| Date | Tuesday, April 7, 2009 |
| Time | 11:00 am |
| Location | GS 906 |
| Details | Light refreshments will be served in the 9th floor Atrium at 10:45AM |
| Speaker | Valentin Polishchuk |
Routing Air Traffic Flows: From Continuous to Discrete and Back
Global growth of air transportation brings up an algorithmic challenge
of accommodating the increased traffic flow within the limits imposed
by safety standards and existing airport capacities. This gives rise
to a realm of computational-geometry problems dealing with motion
planning for multiple objects (airplanes) amidst dynamic and
stochastic obstacles (hazardous weather cells). Similar problems arise
in robotics, when planning non-conflicting trajectories for a
multitude of robots in a dynamic environment.
As part of a NASA-funded project for designing the next generation air
transportation system (NGATS), we designed and implemented
route-planning algorithms that employ geometric counterparts of
classical graph-theoretic concepts. I will describe some of these
developments, from the continuous Dijkstra paradigm to continuous
versions of the MaxFlow-MinCut, Flow Decomposition, and Menger's
theorems. We present the output of the implementations of our
algorithms on real and synthetic data.
Biography
Valentin Polishchuk received his PhD in Applied Math and Statistics
from Stony Brook University in 2007. Valentin's specialization is path
planning in polygonal domains with applications in air traffic
management, sensor networks, robotics. Currently, he is a postdoctoral
researcher in Helsinki Institute for Information Technology.