[{"date_updated":"2023-08-08T13:31:38Z","_id":"9376","type":"journal_article","doi":"10.1145/3453477","article_processing_charge":"No","publisher":"Association for Computing Machinery","quality_controlled":"1","ddc":["000"],"keyword":["multistability","mechanism","computational design","rigidity"],"year":"2021","isi":1,"external_id":{"isi":["000752079300003"]},"ec_funded":1,"date_published":"2021-10-08T00:00:00Z","acknowledgement":"We would like to thank everyone who contributed to this paper, the authors of artworks for all the examples, including @macrovec-tor_official and Wikimedia for the FLAG semaphore, and @pikisuper-star for the FIGURINE. The photos of iconic poses in the teaser were supplied by (from left to right): Mike Hewitt/Olympics Day 8 - Athletics/Gettty Images, Oneinchpunch/Basketball player training on acourt in New york city/Shutterstock, and Andrew Redington/TigerWoods/Getty Images. We also want to express our gratitude to Christian Hafner for insightful discussions, the IST Austria machine shop SSU, all proof-readers, and anonymous reviewers. This project has received funding from the European Union’s Horizon 2020 research and innovation programme, under the Marie Skłodowska-Curie grant agreement No 642841 (DISTRO), and under the European Research Council grant agreement No 715767 (MATERIALIZABLE).","project":[{"_id":"2508E324-B435-11E9-9278-68D0E5697425","grant_number":"642841","name":"Distributed 3D Object Design","call_identifier":"H2020"},{"call_identifier":"H2020","grant_number":"715767","name":"MATERIALIZABLE: Intelligent fabrication-oriented Computational Design and Modeling","_id":"24F9549A-B435-11E9-9278-68D0E5697425"}],"status":"public","publication":"ACM Transactions on Graphics","volume":40,"article_type":"original","date_created":"2021-05-08T17:37:08Z","author":[{"id":"4DDBCEB0-F248-11E8-B48F-1D18A9856A87","full_name":"Zhang, Ran","last_name":"Zhang","orcid":"0000-0002-3808-281X","first_name":"Ran"},{"last_name":"Auzinger","full_name":"Auzinger, Thomas","id":"4718F954-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas","orcid":"0000-0002-1546-3265"},{"first_name":"Bernd","orcid":"0000-0001-6511-9385","full_name":"Bickel, Bernd","id":"49876194-F248-11E8-B48F-1D18A9856A87","last_name":"Bickel"}],"day":"08","oa_version":"Published Version","title":"Computational design of planar multistable compliant structures","publication_status":"published","publication_identifier":{"eissn":["1557-7368"],"issn":["0730-0301"]},"file_date_updated":"2021-12-17T08:13:51Z","has_accepted_license":"1","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","short":"CC BY (4.0)"},"license":"https://creativecommons.org/licenses/by/4.0/","abstract":[{"lang":"eng","text":"This paper presents a method for designing planar multistable compliant structures. Given a sequence of desired stable states and the corresponding poses of the structure, we identify the topology and geometric realization of a mechanism—consisting of bars and joints—that is able to physically reproduce the desired multistable behavior. In order to solve this problem efficiently, we build on insights from minimally rigid graph theory to identify simple but effective topologies for the mechanism. We then optimize its geometric parameters, such as joint positions and bar lengths, to obtain correct transitions between the given poses. Simultaneously, we ensure adequate stability of each pose based on an effective approximate error metric related to the elastic energy Hessian of the bars in the mechanism. As demonstrated by our results, we obtain functional multistable mechanisms of manageable complexity that can be fabricated using 3D printing. Further, we evaluated the effectiveness of our method on a large number of examples in the simulation and fabricated several physical prototypes."}],"intvolume":"        40","acknowledged_ssus":[{"_id":"M-Shop"}],"department":[{"_id":"BeBi"}],"article_number":"186","file":[{"file_name":"Multistable-authorversion.pdf","content_type":"application/pdf","access_level":"open_access","relation":"main_file","checksum":"8564b3118457d4c8939a8ef2b1a2f16c","file_size":18926557,"date_created":"2021-05-08T17:36:59Z","date_updated":"2021-05-08T17:36:59Z","creator":"bbickel","file_id":"9377"},{"access_level":"open_access","content_type":"video/mp4","success":1,"file_name":"multistable-video.mp4","checksum":"3b6e874e30bfa1bfc3ad3498710145a1","relation":"main_file","date_updated":"2021-05-08T17:38:22Z","creator":"bbickel","date_created":"2021-05-08T17:38:22Z","file_size":76542901,"file_id":"9378"},{"relation":"supplementary_material","description":"This document provides additional results and analyzes the robustness and limitations of our approach.","checksum":"20dc3bc42e1a912a5b0247c116772098","file_name":"multistable-supplementary material.pdf","content_type":"application/pdf","access_level":"open_access","title":"Supplementary Material for “Computational Design of Planar Multistable Compliant Structures”","file_id":"10562","date_created":"2021-12-17T08:13:51Z","file_size":3367072,"creator":"bbickel","date_updated":"2021-12-17T08:13:51Z"}],"month":"10","issue":"5","citation":{"ama":"Zhang R, Auzinger T, Bickel B. Computational design of planar multistable compliant structures. <i>ACM Transactions on Graphics</i>. 2021;40(5). doi:<a href=\"https://doi.org/10.1145/3453477\">10.1145/3453477</a>","ieee":"R. Zhang, T. Auzinger, and B. Bickel, “Computational design of planar multistable compliant structures,” <i>ACM Transactions on Graphics</i>, vol. 40, no. 5. Association for Computing Machinery, 2021.","short":"R. Zhang, T. Auzinger, B. Bickel, ACM Transactions on Graphics 40 (2021).","chicago":"Zhang, Ran, Thomas Auzinger, and Bernd Bickel. “Computational Design of Planar Multistable Compliant Structures.” <i>ACM Transactions on Graphics</i>. Association for Computing Machinery, 2021. <a href=\"https://doi.org/10.1145/3453477\">https://doi.org/10.1145/3453477</a>.","ista":"Zhang R, Auzinger T, Bickel B. 2021. Computational design of planar multistable compliant structures. ACM Transactions on Graphics. 40(5), 186.","apa":"Zhang, R., Auzinger, T., &#38; Bickel, B. (2021). Computational design of planar multistable compliant structures. <i>ACM Transactions on Graphics</i>. Association for Computing Machinery. <a href=\"https://doi.org/10.1145/3453477\">https://doi.org/10.1145/3453477</a>","mla":"Zhang, Ran, et al. “Computational Design of Planar Multistable Compliant Structures.” <i>ACM Transactions on Graphics</i>, vol. 40, no. 5, 186, Association for Computing Machinery, 2021, doi:<a href=\"https://doi.org/10.1145/3453477\">10.1145/3453477</a>."},"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","oa":1,"language":[{"iso":"eng"}]},{"article_number":"5","arxiv":1,"month":"05","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","issue":"2","citation":{"ama":"Dütting P, Henzinger MH, Starnberger M. Valuation compressions in VCG-based combinatorial auctions. <i>ACM Transactions on Economics and Computation</i>. 2018;6(2). doi:<a href=\"https://doi.org/10.1145/3232860\">10.1145/3232860</a>","short":"P. Dütting, M.H. Henzinger, M. Starnberger, ACM Transactions on Economics and Computation 6 (2018).","ieee":"P. Dütting, M. H. Henzinger, and M. Starnberger, “Valuation compressions in VCG-based combinatorial auctions,” <i>ACM Transactions on Economics and Computation</i>, vol. 6, no. 2. Association for Computing Machinery, 2018.","chicago":"Dütting, Paul, Monika H Henzinger, and Martin Starnberger. “Valuation Compressions in VCG-Based Combinatorial Auctions.” <i>ACM Transactions on Economics and Computation</i>. Association for Computing Machinery, 2018. <a href=\"https://doi.org/10.1145/3232860\">https://doi.org/10.1145/3232860</a>.","ista":"Dütting P, Henzinger MH, Starnberger M. 2018. Valuation compressions in VCG-based combinatorial auctions. ACM Transactions on Economics and Computation. 6(2), 5.","mla":"Dütting, Paul, et al. “Valuation Compressions in VCG-Based Combinatorial Auctions.” <i>ACM Transactions on Economics and Computation</i>, vol. 6, no. 2, 5, Association for Computing Machinery, 2018, doi:<a href=\"https://doi.org/10.1145/3232860\">10.1145/3232860</a>.","apa":"Dütting, P., Henzinger, M. H., &#38; Starnberger, M. (2018). Valuation compressions in VCG-based combinatorial auctions. <i>ACM Transactions on Economics and Computation</i>. Association for Computing Machinery. <a href=\"https://doi.org/10.1145/3232860\">https://doi.org/10.1145/3232860</a>"},"language":[{"iso":"eng"}],"oa":1,"article_type":"original","date_created":"2022-07-27T11:46:46Z","volume":6,"title":"Valuation compressions in VCG-based combinatorial auctions","oa_version":"Preprint","author":[{"first_name":"Paul","last_name":"Dütting","full_name":"Dütting, Paul"},{"last_name":"Henzinger","id":"540c9bbd-f2de-11ec-812d-d04a5be85630","full_name":"Henzinger, Monika H","orcid":"0000-0002-5008-6530","first_name":"Monika H"},{"full_name":"Starnberger, Martin","last_name":"Starnberger","first_name":"Martin"}],"scopus_import":"1","day":"01","publication_identifier":{"issn":["2167-8375"],"eissn":["2167-8383"]},"publication_status":"published","abstract":[{"lang":"eng","text":"The focus of classic mechanism design has been on truthful direct-revelation mechanisms. In the context of combinatorial auctions, the truthful direct-revelation mechanism that maximizes social welfare is the Vickrey-Clarke-Groves mechanism. For many valuation spaces, computing the allocation and payments of the VCG mechanism, however, is a computationally hard problem. We thus study the performance of the VCG mechanism when bidders are forced to choose bids from a subspace of the valuation space for which the VCG outcome can be computed efficiently. We prove improved upper bounds on the welfare loss for restrictions to additive bids and upper and lower bounds for restrictions to non-additive bids. These bounds show that increased expressiveness can give rise to additional equilibria of poorer efficiency."}],"intvolume":"         6","keyword":["Theory of computation","Algorithmic game theory and mechanism design","Applied computing","Economics","Simplified mechanisms","Combinatorial auctions with item bidding","Price of anarchy"],"external_id":{"arxiv":["1310.3153"]},"year":"2018","date_published":"2018-05-01T00:00:00Z","extern":"1","status":"public","publication":"ACM Transactions on Economics and Computation","type":"journal_article","date_updated":"2022-09-09T12:04:42Z","_id":"11667","publisher":"Association for Computing Machinery","doi":"10.1145/3232860","article_processing_charge":"No","quality_controlled":"1","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1310.3153"}]}]