This paper devotes to the combinatorial analysis of kinematic building blocks. Two categories, unrepeated and repeated combinations, of the enumeration issue are classified. Based on graph theory, a systematic approach valid for both two categories is presented for enumerating all possible and feasible combined configurations from the given power source and specific kinematic building blocks. Through the labeled arborescence representations for the combined configurations, the enumeration process is developed by adopting the algorithm of tree enumeration. Two examples are provided to illustrate the proposed approach for the unrepeated and repeated combinations respectively. Furthermore, the enumeration process is computerized to enumerate the results automatically.
|頁（從 - 到）||1240-1257|
|期刊||Mechanism and Machine Theory|
|出版狀態||Published - 2005 十一月|
All Science Journal Classification (ASJC) codes