3-Belt Balancer design challenge
Posted: Sun May 08, 2016 9:43 pm
So, based on the somewhat lengthy investigations I've done on belt balancers as part of this thread:
viewtopic.php?f=5&t=25008
It seems that is difficult (maybe impossible?) to design a 3-belt balancer that is universally throughput unlimited.
By universally throughput unlimited, I mean the following:
Given any integer k between 1 and n (where n=3 in our case), and full throughput on any k of the n input belts (and none from the rest). If only any k of the output belts will accept any throughput (and those that do accept the full belt's worth of throughput), then the balancer will allow for full throughput on all available output belts (all belts are same speed).
Essentially, what the property is articulating precisely is the idea that the balancer will never be a bottleneck if only some of the inputs and outputs are receiving/accepting throughput (assume for simplicity full throughput). It also assumed for simplicity that all belts are the same speed (use basic belts for ease of creating a testing setup).
So...the challenge is: To create a 3-belt balancer that satisfies the universally throughput unlimited condition. Meaning that there is no k in 1 to n and no combination of k input belts and k output belts such that the throughput of the balancer will be less than k saturated belts worth of items.
If you think you have a design that will satisfy the required property, please test it using the method I describe in this post:
viewtopic.php?f=5&t=25008&start=20#p157698
If it checks out, post the design in here asking someone else to test it to confirm that does actually work in all cases (you can reduce cases to check via symmetry to save time, but if it looks to be working, it would be good to try all possible combinations just to be sure).
One last detail about the testing: use only one item type for throughput (apparently multiple item types can change the outcome because of subtleties about splitter behavior).
viewtopic.php?f=5&t=25008
It seems that is difficult (maybe impossible?) to design a 3-belt balancer that is universally throughput unlimited.
By universally throughput unlimited, I mean the following:
Given any integer k between 1 and n (where n=3 in our case), and full throughput on any k of the n input belts (and none from the rest). If only any k of the output belts will accept any throughput (and those that do accept the full belt's worth of throughput), then the balancer will allow for full throughput on all available output belts (all belts are same speed).
Essentially, what the property is articulating precisely is the idea that the balancer will never be a bottleneck if only some of the inputs and outputs are receiving/accepting throughput (assume for simplicity full throughput). It also assumed for simplicity that all belts are the same speed (use basic belts for ease of creating a testing setup).
So...the challenge is: To create a 3-belt balancer that satisfies the universally throughput unlimited condition. Meaning that there is no k in 1 to n and no combination of k input belts and k output belts such that the throughput of the balancer will be less than k saturated belts worth of items.
If you think you have a design that will satisfy the required property, please test it using the method I describe in this post:
viewtopic.php?f=5&t=25008&start=20#p157698
If it checks out, post the design in here asking someone else to test it to confirm that does actually work in all cases (you can reduce cases to check via symmetry to save time, but if it looks to be working, it would be good to try all possible combinations just to be sure).
One last detail about the testing: use only one item type for throughput (apparently multiple item types can change the outcome because of subtleties about splitter behavior).