4 ms·
I guess in the same way you orchestrate any cluster of bots: you give each an ID, design your structure on your server and then and then pass those instructions
by hnlmorg 5y ago
I guess in the same way you orchestrate any cluster of bots: you give each an ID, design your structure on your server and then and then pass those instructions to the bots.
They wouldn't be aware of each other in any "smart" way but you'd want to keep the logic as low as possible on the nodes so you have less compute power to miniaturise.
- TeMPOraL 5y agoI feel that's not robust enough - what if some of your bots are missing? When we're talking millions of microscopic robots, I think we need to assume that many will break down, get misplaced, or be in a position disadvantageous for it to fulfill a designated role. A robust system cannot rely on all the robots in a predetermined ID range/set to be there - it needs to work with what's actually available. Ideally, I imagine being able to point at a random pile of robots and make that pile do something, without knowing any of the IDs or health of individual cells up front. So I wonder, is there a way to design the system in such a way that individual robots don't need to be micromanaged, but instead they self-assign to the appropriate role/place, without having full knowledge of the shared goal? Imagine those experiments in making shapes from sand with standing audio waves, e.g. [0]. The grains of sand have no identity and no awareness. The person setting up the experiment doesn't care about what any individual grain of sand does. They just set up a pattern, encode it in a standing wave, and the sand moves to conform to it. I'm wondering if this kind of approach is possible, except with the robots moving on their own instead of being moved by air. And, as a next step, with a pattern being persisted in the pile of robots, instead of being supplied externally. -- [0] - https://www.youtube.com/watch?v=wvJAgrUBF4w https://www.youtube.com/watch?v=wvJAgrUBF4w
- hnlmorg 5y ago> I feel that's not robust enough - what if some of your bots are missing? When we're talking millions of microscopic robots, I think we need to assume that many will break down, get misplaced, or be in a position disadvantageous for it to fulfill a designated role. A robust system cannot rely on all the robots in a predetermined ID range/set to be there - it needs to work with what's actually available. Nothing about what I posted assumes that. I'm just saying it's the server that would orchestrate them rather than them orchestrating each other. The server would obviously poll them for positional data (relative to neighbour), health status, etc. > The person setting up the experiment doesn't care about what any individual grain of sand does. They just set up a pattern, encode it in a standing wave, and the sand moves to conform to it. I didn't suggest that someone manually plots each grain either. Clearly you'd just set up a design in a CAD and then let the server define the algorithm and orchestration required. Much like how when you manage nodes currently, you don't manually assign which node to scale up or down. You define rules and let the system manage the nodes itself. Given the problems of miniaturisation and decentralised computing, this feels like a problem easier solved in a centralised system that then hands out instructions (and your requirements clearly stated there was a control system that you used to instruct the grains of sand when you said "press enter on my laptop").
- Wildgoose 5y agoSimilar to "flocking" behaviour in birds that only requires notice to be taken of immediate neighbours in the flock.
- TeMPOraL 5y agoYes, something like that - and I'm wondering if there's a way to imprint a pattern on such flock of birds, so that they then flock into appropriate shape from whatever starting configuration they were in, and maintain the shape over time, even in the face of strong winds or some of the flock members dying. Here's one idea I'm thinking about: flocking-like equations in "boids" simulations are local, a pure function of (the observed state of) the neighbors. In a typical implementation, they just compute velocity/acceleration vectors out of position/velocity/acceleration/class of the neighbors[0]. And the result are pretty, fluid, and uniform in steady-state flocks. But what if we added more observable state and equations to this? Imagine each boid having a "color", a value that is a function of not just the color of the neighbors, but also of their position/velocity/acceleration/class. And then, the equations computing velocity/acceleration take this color into account too, e.g. by offsetting the result by some function of the neighbors' colors. Could we then design the f([colors]) -> v/a offset and f([everything]) -> color functions so that they end up forcing the flock into an arbitrary uniform shape? I believe we could, but I'm not sure how to define these functions for any particular shape. (Or, in short: I'm looking for a method to turn an arbitrary picture into an error term for boids rules that makes the flock assume the shape of the picture, instead of an uniform blob.) I'm sure there must be some pre-existing theoretical work behind finding such functions - this problem feels like a cousin of the "find a formula that draws a target picture on X/Y plot". I just don't know the right keywords to look this up. But this is kind of the idea on the back of my head - encoding desired group behavior in a function that is common to every member of the group and is entirely local (only a function of the immediate observed environment), but that forces the system to settle in a desired configuration. -- [0] - "class" being e.g. member of same species, a predator, or a prey.
- Wildgoose 5y agoYes. Imagine that the "boids" change colour as well as alter their X, Y, Z position. That supplies additional "guiding" information to provide purpose and also alter behaviour, in much the same way that hormones act on a growing foetus. And this reminds me of those audience experiments with people holding up blue and red cards and using this "vote" to successfully steer a vehicle.