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:20230103T035306Z LOCATION:Auditorium\, Level 5\, West Wing DTSTART;TZID=Asia/Seoul:20221206T100000 DTEND;TZID=Asia/Seoul:20221206T120000 UID:siggraphasia_SIGGRAPH Asia 2022_sess153_papers_580@linklings.com SUMMARY:Assemble Them All: Physics-Based Planning for Generalizable Assemb ly by Disassembly DESCRIPTION:Technical Papers\n\nAssemble Them All: Physics-Based Planning for Generalizable Assembly by Disassembly\n\nTian, Xu, Li, Luo, Sueda...\n \nAssembly planning is the core of automating product assembly, maintenanc e, and recycling for modern industrial manufacturing. Despite its importan ce and long history of research, planning for mechanical assemblies when g iven the final assembled state remains a challenging problem. This is due to the complexity of dealing with arbitrary 3D shapes and the highly const rained motion required for real-world assemblies. In this work, we propose a novel method to efficiently plan physically plausible assembly motion a nd sequences for real-world assemblies. Our method leverages the assembly- by-disassembly principle and physics-based simulation to efficiently explo re a reduced search space. To evaluate the generality of our method, we de fine a large-scale dataset consisting of thousands of physically valid ind ustrial assemblies with a variety of assembly motions required. Our experi ments on this new benchmark demonstrate we achieve a state-of-the-art succ ess rate and the highest computational efficiency compared to other baseli ne algorithms. Our method also generalizes to rotational assemblies (e.g., screws and puzzles) and solves 80-part assemblies within several minutes. \n\nRegistration Category: FULL ACCESS, EXPERIENCE PLUS ACCESS, EXPERIENCE ACCESS, TRADE EXHIBITOR\n\nLanguage: ENGLISH\n\nFormat: IN-PERSON URL:https://sa2022.siggraph.org/en/full-program/?id=papers_580&sess=sess15 3 END:VEVENT END:VCALENDAR