Construct the truth table for the robot interlock system in Example 9.1Example 9.1Example...

Construct the truth table for the robot interlock system in Example 9.1

Example 9.1

Example 9.1 Robot Machine Loading

The robotic machine loading example described at the beginning of Section 9.1.1 required three conditions to be satisfied before the loading sequence was initiated. Determine the Boolean algebra expression and the logic network diagram for this interlock system.

Solution: Let X1 = whether the raw work part is present at the conveyor stopping point (X1 = 1 for part present, X1 = 0 for part not present). Let X2 = whether the press cycle for the previous part has completed (X2 = 1 for completed, X2 = 0 for not completed). Let X3 = whether the previous part has been removed from the die (X3 = 1 for removed, X3 = 0 for not removed). Finally, let Y = whether the loading sequence can be started (Y = 1 for begin, Y = 0 for wait). All three conditions must be satisfied, so the logical AND function is used. All of the inputs X1, X2, and X3 must have values of 1 before Y = 1, initiating the start of the loading sequence. The logic network diagram for this interlock condition is presented in Figure 9.3. The Boolean algebra expression is Y = X1 · X2 • X3.

Figure 9.3 Logic network diagram for the robotic machine loading system in Example 9.1.