Zoom: https://illinois.zoom.us/j/84149708803?pwd=R3JqMnk3VU0wWUZRbGtMd3o1YjZwdz09&from=addon
Meeting ID: 841 4970 8803
Password: 444347
Abstract:
Can we optimize the coordinated motion of a fleet of robots, when even for two robots we know so little? Can we quickly decide if one object could cage another? Is there an effective way to explain why we failed to find an assembly plan for a new product design? We review these and other challenging problems at the intersection of robotics and computational geometry---let's call this intersection Geobotics. What is common to most of these problems is that the prevalent algorithmic techniques used in robotics do not seem suitable for solving them, or at least do not suggest quality guarantees for the solution. Solving some of them, even partially, can shed light on less well-understood aspects of computation in robotics.
Bio:
Dan Halperin received his Ph.D. in Computer Science from Tel Aviv University, after which he spent three years at the Computer Science Robotics Laboratory at Stanford University. He then joined the Department of Computer Science at Tel Aviv University, where he is currently a full professor and for two years was the department chair. Halperin’s main field of research is Computational Geometry and Its Applications. Application areas he is interested in include robotics, automated manufacturing, algorithmic motion planning, and 3D printing. A major focus of Halperin’s work has been in research and development of robust geometric software, in collaboration with a group of European universities and research institutes: the CGAL project and library, which recently won the SoCG test of time award. Halperin was the program-committee chair/co-chair of several conferences in computational geometry, algorithms and robotics, including SoCG, WAFR, ESA, and ALENEX. Halperin is an ACM Fellow and an IEEE Fellow.