Data-Driven Convergence Prediction of Astrobots Swarms
Matin Macktoobian, Francesco Basciani, Denis Gillet, Jean-Paul Kneib

TL;DR
This paper introduces a machine learning approach, specifically a weighted k-NN algorithm, to predict the convergence of astrobots swarms used in astrophysical observations, addressing the lack of formal verification methods.
Contribution
It proposes a novel data-driven convergence prediction method for astrobots swarms using a weighted k-NN algorithm based on initial swarm status and observational targets.
Findings
Up to 80% accuracy in predicting successful swarm coordination
Effective convergence prediction for swarms with 116 and 487 astrobots
Demonstrates the potential of machine learning for swarm coordination verification
Abstract
Astrobots are robotic artifacts whose swarms are used in astrophysical studies to generate the map of the observable universe. These swarms have to be coordinated with respect to various desired observations. Such coordination are so complicated that distributed swarm controllers cannot always coordinate enough astrobots to fulfill the minimum data desired to be obtained in the course of observations. Thus, a convergence verification is necessary to check the suitability of a coordination before its execution. However, a formal verification method does not exist for this purpose. In this paper, we instead use machine learning to predict the convergence of astrobots swarm. In particular, we propose a weighted -NN-based algorithm which requires the initial status of a swarm as well as its observational targets to predict its convergence. Our algorithm learns to predict based on the…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
