Abstract

The use of origami in engineering has significantly expanded in recent years, spanning deployable structures across scales, folding robotics and mechanical metamaterials. However, finding foldable paths can be a formidable task as the kinematics are determined by a nonlinear system of equations, often with several degrees of freedom. In this article, we leverage a Lagrangian approach to derive reduced-order compatibility conditions for rigid-facet origami vertices with reflection and rotational symmetries. Then, using the reduced-order conditions, we derive exact, multi-degree of freedom solutions for degree 6 and degree 8 vertices with prescribed symmetries. The exact kinematic solutions allow us to efficiently investigate the topology of allowable kinematics, including the consideration of a self-contact constraint, and then visually interpret the role of geometric design parameters on these admissible fold paths by monitoring the change in the kinematic topology. We then introduce a procedure to construct lower-symmetry kinematic solutions by breaking symmetry of higher-order kinematic solutions in a systematic way that preserves compatibility. The multi-degree of freedom solutions discovered here should assist with building intuition of the kinematic feasibility of higher-degree origami vertices and also facilitate the development of new algorithmic procedures for origami-engineering design.This article is part of the theme issue 'Origami/Kirigami-inspired structures: from fundamentals to applications'.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.