Grass Valley VM 3000 System Controllers v.7.4 - Manual (Page 415)

Configurator Path Finding
5−205 VM 3000 Installation and Operating Manual
Non−Sequential Path Finding
Figure 5−177. Non−Sequential Path Finding data table (example).
1
Non−Sequential Path Finding
Path Finding
GROUP1
Line
3
Physical
83
Physical
87
2 GROUP1 4 84 88
3 GROUP2 3 83 87
4 GROUP2 4 84 88
5 GROUP3 3 83 87
6 GROUP3 4 84 88
7 GROUP4 3 83 87
8 GROUP4 4 84 88
9 GROUP5 2 82 20
10 GROUP6 2 82 20
11 GROUP7 2 82 20
12 GROUP8 2 82 20
Number Output Input Group Name
Password 5−17
Network Description 5−22
Serial Protocol 5−25
Switcher Description 5−31
Switcher Input 5−44
Switcher Output 5−51
Control Panel Sets
Level set 5−55
Input set 5−58
Output set 5−76
Override set 5−98
Sequence set 5−101
Category set 5−103
MPK Devices 5−109
Machines 5−140
Protocol Dependent 5−143
Machine Control 5−146
Delegation Groups 5−159
TCS−1 Device Codes 5−166
Party Line 5−167
Status Display Header 5−170
VGA Status Display 5−171
Tally 5−172
Path Finding
Exclusion 5−208
Y Line 5−209
The path finding software option has already been described in detail, starting on page 5−194.
The Non−Sequential Path Finding table must be used if the tie lines joining the switchers are not wired sequentially, i.e., not
wired as blocks. Basically, the table is designed to enter “exceptions” to the Sequential table. For example, a new tie line that
falls outside the original sequence can be defined on the Non−sequential table; the only change then needed on the Sequential
table would be to increment the “Count” number for the group by 1. (Alternatively, you may prefer to use the Non−sequential
table to define all tie lines individually.)
An example system is shown on page 5−206, with corresponding tables shown on page 5−207. Notice that the Path Finding Data
table, and the Switcher Input tables, must still be used as described in the previous section.