BEGIN:VCALENDAR VERSION:2.0 PRODID:Linklings LLC BEGIN:VTIMEZONE TZID:Asia/Seoul X-LIC-LOCATION:Asia/Seoul BEGIN:STANDARD TZOFFSETFROM:+0900 TZOFFSETTO:+0900 TZNAME:KST DTSTART:18871231T000000 DTSTART:19881009T020000 END:STANDARD END:VTIMEZONE BEGIN:VEVENT DTSTAMP:20230103T035309Z LOCATION:Room 325-AB\, Level 3\, West Wing DTSTART;TZID=Asia/Seoul:20221207T170000 DTEND;TZID=Asia/Seoul:20221207T183000 UID:siggraphasia_SIGGRAPH Asia 2022_sess179_papers_580@linklings.com SUMMARY:Assemble Them All: Physics-Based Planning for Generalizable Assemb ly by Disassembly DESCRIPTION:Technical Communications, Technical Papers, TOG\n\nAssemble Th em All: Physics-Based Planning for Generalizable Assembly by Disassembly\n \nTian, Xu, Li, Luo, Sueda...\n\nAssembly planning is the core of automati ng product assembly, maintenance, and recycling for modern industrial manu facturing. Despite its importance and long history of research, planning f or mechanical assemblies when given the final assembled state remains a ch allenging problem. This is due to the complexity of dealing with arbitrary 3D shapes and the highly constrained motion required for real-world assem blies. In this work, we propose a novel method to efficiently plan physica lly plausible assembly motion and sequences for real-world assemblies. Our method leverages the assembly-by-disassembly principle and physics-based simulation to efficiently explore a reduced search space. To evaluate the generality of our method, we define a large-scale dataset consisting of th ousands of physically valid industrial assemblies with a variety of assemb ly motions required. Our experiments on this new benchmark demonstrate we achieve a state-of-the-art success rate and the highest computational effi ciency compared to other baseline algorithms. Our method also generalizes to rotational assemblies (e.g., screws and puzzles) and solves 80-part ass emblies within several minutes.\n\nRegistration Category: FULL ACCESS, ON- DEMAND ACCESS\n\nLanguage: ENGLISH\n\nFormat: IN-PERSON, ON-DEMAND URL:https://sa2022.siggraph.org/en/full-program/?id=papers_580&sess=sess17 9 END:VEVENT END:VCALENDAR