Just one sentence on the omnipresent bot vs belt topic: Please cease any discussion about that, I will ask moderators to delete/move out any such posts.
Main question is: What is the real estimate of the update cost for a bot network? Everybody claims, they scale linear, but that cannot be true, because splitting large robot network definitely has a positive effect. This only makes sense for a cost function c(n) with c(n) > 2c(n/2). Moreover, there are many variables:
A - Area of the network
B - bot number
C - Chest number
R - Roboport number
Is it like O(A+B+C+R) or O(B+C+R)? This would be a separate loop over each of the entities - but this would be linear. Or is it O(B*C*R)? Surely not, as this would be actually cubic (and horrible). I suspect something like O(C log(B) log(R)). This would be one loop (here over all chests) with (log time) access to other datastructures within. Then the big question is: What is the main term, and what are the variables inside logarithms? This makes a big difference concening the optimization objective. Of course, it can be something more complicated.
The type of questions I seek to answer is:
- Should you try to minimize the number of chests (by sharing chests etc.), even at the expense of larger size (and most probably more bots/roboports)?
- Should you try to minimize the number of chests (by sharing chests etc.), even at the expense of larger size (and most probably more bots/roboports)?
- Does it make sense to fine-tune the number of roboports?
- Is one chest requesting 5 types of Items better than 5 chests?
- You could clock your requester chests: Each requester is active only 10% of the time, but requests large amounts of items. Then the activity shifts over to the next one, until it cycles back at the end. Could this be better, than all requesters asking for moderate amounts all the time?
- If you request large amounts of items at once and (S)ource and (D)estination are close to each other, then bots often fly like: (R)oboport-S-D-S-D-S-D ... - R . This indicates, that the roboport should not be inbetween Source and Destination, but somewhere else, to really minimize the S-D distance. However, this only works, if there are not too many bots in the system. If you have enough bots, then the System will send 1000 bots doing one R-S-D-R trip, instead of 100 doing R-(S-D)*10 - R. Even, if the chests are directly adjacent, and the robotports are 100 tiles away. Could it make sense to intentionally starve your system of bots, to get the way more efficient second behavior?
- More simple question: Is constant overflow oder underflow of requested items better? I suspect overflow.
Ok, its a long post again. Please dont hestitate posting any partial answers, I am grateful for any help.