アドホックロボットネットワークのトポロジ復元可能性予測:データ駆動型耐故障アプローチ
Topology Recoverability Prediction for Ad-Hoc Robot Networks: A Data-Driven Fault-Tolerant Approach
アドホックロボットネットワークの故障後のトポロジ復元可能性を、故障前後の二経路のベイズガウス混合モデルで二値分類予測する手法を提案した。
著者: Matin Macktoobian, Zhan Shu, Qing Zhao
分類: cs.RO, cs.AI, cs.LG, cs.MA
原文アブストラクト
Faults occurring in ad-hoc robot networks may fatally perturb their topologies leading to disconnection of subsets of those networks. Optimal topology synthesis is generally resource-intensive and time-consuming to be done in real time for large ad-hoc robot networks. One should only perform topology re-computations if the probability of topology recoverability after the occurrence of any fault surpasses that of its irrecoverability. We formulate this problem as a binary classification problem. Then, we develop a two-pathway data-driven model based on Bayesian Gaussian mixture models that predicts the solution to a typical problem by two different pre-fault and post-fault prediction pathways. The results, obtained by the integration of the predictions of those pathways, clearly indicate the success of our model in solving the topology (ir)recoverability prediction problem compared to the best of current strategies found in the literature.
