This paper tackles the problem of active planning to achieve cooperative localization for multi-robot systems (MRS) under measurement uncertainty in GNSS-limited scenarios. Specifically, we address the issue of accurately predicting the probability of a future connection between two robots equipped with range-based measurement devices. Due to the limited range of the equipped sensors, edges in the network connection topology will be created or destroyed as the robots move with respect to one another. Accurately predicting the future existence of an edge, given imperfect state estimation and noisy actuation, is therefore a challenging task. An adaptive power series expansion (or APSE) algorithm is developed based on current estimates and control candidates. Such an algorithm applies the power series expansion formula of the quadratic positive form in a normal distribution. Finite-term approximation is made to realize the computational tractability. Further analyses are presented to show that the truncation error in the finite-term approximation can be theoretically reduced to a desired threshold by adaptively choosing the summation degree of the power series. Several sufficient conditions are rigorously derived as the selection principles. Finally, extensive simulation results and comparisons, with respect to both single and multi-robot cases, validate that a formally computed and therefore more accurate probability of future topology can help improve the performance of active planning under uncertainty.
翻译:本文解决了积极规划的问题,以便在全球导航卫星系统有限假设情况下测量不确定的情况下,实现多机器人系统的合作本地化。具体地说,我们处理的是准确预测配备了以射程为基础的测量装置的两个机器人之间未来连接的概率的问题。由于设备传感器的范围有限,随着机器人相互移动,网络连接表层的边缘将被创建或摧毁。因此,准确预测未来边缘的存在是一项具有挑战性的任务,由于不完善的状态估计和吵闹的启动程度,适应性电力序列的扩展(或APSE)算法是根据目前的估计和控制候选人制定的。这种算法在正常分布中应用二次正式正式电源序列扩展公式。为了实现计算性可移动性,将进行精度期近似度的边缘设定或销毁。进一步的分析表明,由于适应性地选择权力序列的平衡程度,从理论上来说可以降低到一个理想的临界值。根据目前的估计和控制候选者制定了一个适应性电量序列的扩大(或APSE)算法。这种算法在正常分布中应用四边形正式正式正式正式格式的扩展公式公式公式公式公式。最后将采用广泛的模拟结果,从而根据对单一的精确性概率进行最精确的精确的概率和多级的推算。