Monotonicity conjecture for the computational capabilities of oblivious robot systems

Let $G$ be a network and let $k\geq 1$. Write $\mathcal F(G,k)$ for the system of $k$ oblivious mobile robots on $G$, and write $\preceq$ for the computational-capability preorder. Monotonicity conjecture. For all networks $G$ and all $k\geq 1$, $\mathcal F(G,k)\preceq \mathcal F(G,k+1)$.

This conjecture asserts that adding robots never decreases the set of computable functions, strengthening the preceding simulation results. The supplied text does not state whether it has been resolved.