CS Events

PhD Defense Tabletop Object Rearrangement: Structure, Complexity, and Efficient Combinatorial Search-Based Solutions
Export Event Save iCal Send to Google Calendar Send to Yahoo Calendar Send to Outlook Live Send to Microsoft Outlook Save iCal Preserve formatting in description (only supported in some calendar applications) Close Thursday, December 12, 2024, 01:00pm - 02:30pm

Speaker: Kai Gao

Location : SPR-402, 1 Spring St, New Brunswick

Committee: 

Professor Jingjin Yu

Professor Kostas Bekris

Associate Professor Abdeslam Boularias

Associate Professor Kaiyu Hang (external)

Event Type: PhD Defense

Abstract: This thesis provides an in-depth structural analysis and efficient algorithmic solutions for tabletop object rearrangement with overhand grasps (TORO), a foundational task in advancing intelligent robotic manipulation. Rearranging multiple objects in a confined workspace presents two primary challenges: sequencing actions to minimize pick-and-place operations—an NP-hard problem in TORO—and determining temporary object placements (“buffer poses”) within a cluttered environment, which is essential yet highly complex. For TORO with available external free space, this work investigates the minimum buffer space, or “running buffer size,” required for temporary relocations, presenting both theoretical insights and exact algorithms. For TORO without external free space, the concept of lazy buffer verification is introduced, with its efficiency evaluated across various manipulator configurations, including single-arm, dual-arm, and mobile manipulators.

: 

Contact  Associate Professor Jingjin Yu

Zoom Link: https://rutgers.zoom.us/j/94026029767?pwd=7ejWTILZFPgNZdWQYdacFt1lOl2USp.1