A graph-based algorithm for automatically enumerating switch state sequences for maypole braiding machines

Jan Elmar Krauskopf

doi:10.1016/j.rineng.2026.112110

A graph-based algorithm for automatically enumerating switch state sequences for maypole braiding machines

2026-07-25

0

OA

AI

J

Jan Elmar Krauskopf *

DOI：10.1016/j.rineng.2026.112110

Original

Original request for help

Save

Abstract

En 中文

• Algorithm for identifying sets of collision-free paths. • Systematic, solution-preserving filtering of path trees. • Generation of pruned path trees. • Simplifying path trees in the carrier collision space.

Keywords:

Maypole braiding

Collision free transformation

Path syntheses braiding program

Graph theory

Bifurcation

A graph-based algorithm for automatically enumerating switch state sequences for maypole braiding machines

Abstract

Journal

Organization