Visibility Optimizations

Richard Tsai
Princeton University

In this talk, we present our ideas for the search of a path in R2 or R3 that maximizes certain optimality conditions involving visibility. The visiblity is defined as the solution of a watered down high frequency wave propagation problem in the presence of occluders with complicated geometry. Related applications include certain types of path-planning and pursuer-evader problems. This framework uses a function that encodes visibility information in a
continuous way. This continuity allows for powerful techniques to be used in the discrete setting for interpolation, integration,
differentiation, and set operations. Using these tools, we are able to limit the scope of search and produce locally optimized solutions. We will also discuss the related control and game formulations.

This is joint work with LT Cheng, C.Y. Kao, C. Navasca, and S. Osher


Presentation (PDF File)
Video of Talk (RealPlayer File)

Back to Graduate Summer School: Intelligent Extraction of Information from Graphs and High Dimensional Data