<?xml version="1.0" encoding="UTF-8"?><rdf:RDF xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:dcq="http://purl.org/dc/terms/"><records count="1" morepages="false" start="1" end="1"><record rownumber="1"><dc:product_type>Journal Article</dc:product_type><dc:title>Co-Optimization of Design and Fabrication Plans for Carpentry</dc:title><dc:creator>Zhao, Haisen; Willsey, Max; Zhu, Amy; Nandi, Chandrakana; Tatlock, Zachary; Solomon, Justin; Schulz, Adriana</dc:creator><dc:corporate_author/><dc:editor/><dc:description>Past work on optimizing fabrication plans given a carpentry design can provide Pareto-optimal plans trading off between material waste, fabrication time, precision, and other considerations. However, when developing fabrication plans, experts rarely restrict to a              single design              , instead considering              families of design variations              , sometimes adjusting designs to simplify fabrication. Jointly exploring the design and fabrication plan spaces for each design is intractable using current techniques. We present a new approach to jointly optimize design and fabrication plans for carpentered objects. To make this bi-level optimization tractable, we adapt recent work from program synthesis based on equality graphs (e-graphs), which encode sets of equivalent programs. Our insight is that subproblems within our bi-level problem share significant substructures. By representing both designs and fabrication plans in a new              bag of parts              (BOP) e-graph, we amortize the cost of optimizing design components shared among multiple candidates. Even using BOP e-graphs, the optimization space grows quickly in practice. Hence, we also show how a feedback-guided search strategy dubbed              Iterative Contraction and Expansion on E-graphs              (ICEE) can keep the size of the e-graph manageable and direct the search towards promising candidates. We illustrate the advantages of our pipeline through examples from the carpentry domain.</dc:description><dc:publisher/><dc:date>2022-06-30</dc:date><dc:nsf_par_id>10374108</dc:nsf_par_id><dc:journal_name>ACM Transactions on Graphics</dc:journal_name><dc:journal_volume>41</dc:journal_volume><dc:journal_issue>3</dc:journal_issue><dc:page_range_or_elocation>1 to 13</dc:page_range_or_elocation><dc:issn>0730-0301</dc:issn><dc:isbn/><dc:doi>https://doi.org/10.1145/3508499</dc:doi><dcq:identifierAwardId>2017927</dcq:identifierAwardId><dc:subject/><dc:version_number/><dc:location/><dc:rights/><dc:institution/><dc:sponsoring_org>National Science Foundation</dc:sponsoring_org></record></records></rdf:RDF>