On some equivalent transformations of electrical network signal-flow graphs and related first-order transfer function sensitivities

2002 ◽  
Author(s):  
G.A. Nenov
Keyword(s):  
Transfer Function ◽  
Electrical Network ◽  
Signal Flow ◽  
First Order ◽  
Signal Flow Graphs ◽  
Flow Graphs

Kinematics, Dynamics, and Control of Tendon-Driven Mechanisms Using Signal Flow Graphs

1998 ◽  
Author(s):  
Meng-Sang Chew ◽  
Theeraphong Wongratanaphisan
Keyword(s):  
Control System ◽  
Transfer Function ◽  
Closed Loop ◽  
Transfer Functions ◽  
Signal Flow ◽  
Signal Flow Graphs ◽  
Loop Transfer Function ◽  
Dynamics And Control ◽  
Flow Graphs ◽  
And Control

Abstract This paper presents the analysis of the kinematics, dynamics and controls of tendon-driven mechanism under the framework of signal flow graphs. For decades, the signal flow graphs have been applied in many areas, particularly in controls, for determining the closed-loop transfer function of a control system. The tendon-driven mechanism considered here consists of several subsystems including actuator-controller dynamics, mechanism kinematics and mechanism dynamics. Each subsystem will be derived and represented by signal flow graphs. The representation of the whole system can be carried out by connecting the graphs of subsystems at the corresponding nodes. Transfer functions can then be obtained by using Mason’s rules. A 3-DOF robot finger utilizing tendon-driven mechanism is used as an illustrative example.

Direct Application of the Loop Rule to Bond Graphs

1972 ◽  
Vol 94 (3) ◽  
pp. 253-261 ◽  
Author(s):  
F. T. Brown
Keyword(s):  
Transfer Function ◽  
Direct Reduction ◽  
Direct Application ◽  
Constant Parameter ◽  
Signal Flow Graph ◽  
Bond Graphs ◽  
Flow Graph ◽  
Signal Flow ◽  
Signal Flow Graphs ◽  
Flow Graphs

The Shannon-Mason loop rule permits direct reduction of a linear constant-parameter signal flow graph to a transfer function. Signal flow graphs can be constructed from bond graphs or sets of equations. Application of the loop rule to the parent bond graphs, however, with the aid of certain rules, is shown to be quicker and less prone to error. Also, four invariant classes of bond graph meshes are distinguished, with implications in physical analogies and in computation.

Signal-Flow Graphs and Random Signals

1957 ◽  
Vol 45 (1) ◽  
pp. 74-86 ◽  
Author(s):  
William Huggins
Keyword(s):  
Signal Flow ◽  
Signal Flow Graphs ◽  
Random Signals ◽  
Flow Graphs
Sign in / Sign up

Export Citation Format

Share Document