Efficient Transfer Planning for Flat Knitting

swatch knit with control-stretch-expand transfer plan

swatch knit with schoolbus transfer plan

Abstract

Industrial knitting machines form fabric by manipulating loops of yarn held on hundreds of hook-shaped needles. Transfer planning algorithms generate a sequence of machine instructions that move loops between their current needles and given target needles. In this paper we describe how to compute the run-time cost of a transfer plan in terms of machine passes, and compare the plans generated by several existing and new transfer planning algorithms under this metric over a a large benchmarking set of transfer operations taken from example flat lace patterns, along with synthetically generated patterns.

Files

Citation

Jenny Lin, Vidya Narayanan, and James McCann. 2018. Efficient transfer planning for flat knitting. In Proceedings of the 2nd Annual ACM Symposium on Computational Fabrication (SCF '18). Association for Computing Machinery, New York, NY, USA, Article 1, 1–7. https://doi.org/10.1145/3213512.3213515

@inproceedings{lin:2018:transfer-planning,
author = {Lin, Jenny and Narayanan, Vidya and McCann, James},
title = {Efficient Transfer Planning for Flat Knitting},
year = {2018},
isbn = {9781450358545},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
url = {https://doi.org/10.1145/3213512.3213515},
doi = {10.1145/3213512.3213515},
booktitle = {Proceedings of the 2nd ACM Symposium on Computational Fabrication},
articleno = {1},
numpages = {7},
keywords = {transfer planning, knitting, knitting machine},
location = {Cambridge, Massachusetts},
series = {SCF '18},
}