UFO Instruction Graphs Are Machine Knittable
Programming low-level controls for knitting machines is a meticulous, time-consuming task that demands specialized expertise. Recently, there has been a shift towards automatically generating low-level knitting machine programs from high-level knit representations that describe knit objects in a mor...
| Main Authors: | , , , |
|---|---|
| Other Authors: | |
| Format: | Article |
| Language: | English |
| Published: |
ACM
2024
|
| Online Access: | https://hdl.handle.net/1721.1/157853 |
| _version_ | 1824458069730394112 |
|---|---|
| author | Lin, Jenny Ikarashi, Yuka Bernstein, Gilbert McCann, James |
| author2 | Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science |
| author_facet | Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science Lin, Jenny Ikarashi, Yuka Bernstein, Gilbert McCann, James |
| author_sort | Lin, Jenny |
| collection | MIT |
| description | Programming low-level controls for knitting machines is a meticulous, time-consuming task that demands specialized expertise. Recently, there has been a shift towards automatically generating low-level knitting machine programs from high-level knit representations that describe knit objects in a more intuitive, user-friendly way. Current high-level systems trade off
expressivity for ease-of-use, requiring ad-hoc trapdoors to access the full space of machine capabilities, or eschewing completeness in the name of utility. Thus, advanced techniques either require ad-hoc extensions from domain experts, or are entirely unsupported. Furthermore, errors may emerge during the compilation from knit object representations to machine instructions. While the generated program may describe a valid machine control sequence, the fabricated object is topologically different from the specified input, with little recourse for understanding and fixing the issue.
To address these limitations, we introduce instruction graphs, an intermediate representation capable of capturing the full range of machine knitting programs. We define a semantic mapping from instruction graphs to fenced tangles, which make them compatible with the established formal semantics for machine knitting instructions. We establish a semantics-preserving bijection between machine knittable instruction graphs and knit programs that proves three properties – upward, forward, and ordered (UFO) – are both necessary and sufficient to ensure the existence of a machine knitting program that can fabricate the fenced tangle denoted by the graph. As a proof-of-concept, we implement an instruction graph editor and compiler that allows a user to transform an instruction graph into UFO presentation and then compile it to a machine program, all while maintaining semantic equivalence. In addition, we use the UFO properties to more precisely characterize the limitations of existing compilers. This work lays the groundwork for more expressive and reliable automated knitting machine programming systems by providing a formal characterization of machine knittability. |
| first_indexed | 2025-02-19T04:20:02Z |
| format | Article |
| id | mit-1721.1/157853 |
| institution | Massachusetts Institute of Technology |
| language | English |
| last_indexed | 2025-02-19T04:20:02Z |
| publishDate | 2024 |
| publisher | ACM |
| record_format | dspace |
| spelling | mit-1721.1/1578532024-12-29T04:54:54Z UFO Instruction Graphs Are Machine Knittable Lin, Jenny Ikarashi, Yuka Bernstein, Gilbert McCann, James Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science Programming low-level controls for knitting machines is a meticulous, time-consuming task that demands specialized expertise. Recently, there has been a shift towards automatically generating low-level knitting machine programs from high-level knit representations that describe knit objects in a more intuitive, user-friendly way. Current high-level systems trade off expressivity for ease-of-use, requiring ad-hoc trapdoors to access the full space of machine capabilities, or eschewing completeness in the name of utility. Thus, advanced techniques either require ad-hoc extensions from domain experts, or are entirely unsupported. Furthermore, errors may emerge during the compilation from knit object representations to machine instructions. While the generated program may describe a valid machine control sequence, the fabricated object is topologically different from the specified input, with little recourse for understanding and fixing the issue. To address these limitations, we introduce instruction graphs, an intermediate representation capable of capturing the full range of machine knitting programs. We define a semantic mapping from instruction graphs to fenced tangles, which make them compatible with the established formal semantics for machine knitting instructions. We establish a semantics-preserving bijection between machine knittable instruction graphs and knit programs that proves three properties – upward, forward, and ordered (UFO) – are both necessary and sufficient to ensure the existence of a machine knitting program that can fabricate the fenced tangle denoted by the graph. As a proof-of-concept, we implement an instruction graph editor and compiler that allows a user to transform an instruction graph into UFO presentation and then compile it to a machine program, all while maintaining semantic equivalence. In addition, we use the UFO properties to more precisely characterize the limitations of existing compilers. This work lays the groundwork for more expressive and reliable automated knitting machine programming systems by providing a formal characterization of machine knittability. 2024-12-13T22:27:01Z 2024-12-13T22:27:01Z 2024-12-19 2024-12-01T08:52:16Z Article http://purl.org/eprint/type/JournalArticle 0730-0301 https://hdl.handle.net/1721.1/157853 Lin, Jenny, Ikarashi, Yuka, Bernstein, Gilbert and McCann, James. 2024. "UFO Instruction Graphs Are Machine Knittable." ACM Transactions on Graphics, 43 (6). PUBLISHER_CC en https://doi.org/10.1145/3687948 ACM Transactions on Graphics Article is made available in accordance with the publisher's policy and may be subject to US copyright law. Please refer to the publisher's site for terms of use. The author(s) application/pdf ACM Association for Computing Machinery |
| spellingShingle | Lin, Jenny Ikarashi, Yuka Bernstein, Gilbert McCann, James UFO Instruction Graphs Are Machine Knittable |
| title | UFO Instruction Graphs Are Machine Knittable |
| title_full | UFO Instruction Graphs Are Machine Knittable |
| title_fullStr | UFO Instruction Graphs Are Machine Knittable |
| title_full_unstemmed | UFO Instruction Graphs Are Machine Knittable |
| title_short | UFO Instruction Graphs Are Machine Knittable |
| title_sort | ufo instruction graphs are machine knittable |
| url | https://hdl.handle.net/1721.1/157853 |
| work_keys_str_mv | AT linjenny ufoinstructiongraphsaremachineknittable AT ikarashiyuka ufoinstructiongraphsaremachineknittable AT bernsteingilbert ufoinstructiongraphsaremachineknittable AT mccannjames ufoinstructiongraphsaremachineknittable |