论文标题
积极计划的概率网络拓扑预测:一种自适应算法和应用
Probabilistic network topology prediction for active planning:An adaptive algorithm and application
论文作者
论文摘要
本文解决了积极计划的问题,以在GNSS受限的场景中测量不确定性下实现多机器人系统(MRS)的合作定位。具体而言,我们解决了准确预测配备基于范围的测量设备的两个机器人之间未来连接的概率的问题。由于配备的传感器范围有限,由于机器人相互移动,网络连接拓扑中的边缘将被创建或破坏。因此,鉴于状态估计不完善和嘈杂的致动,准确地预测边缘的未来存在是一项艰巨的任务。自适应功率系列扩展(或APSE)算法是根据当前估计和控制候选者开发的。这种算法在正态分布中应用了二次阳性形式的功率序列扩展公式。有限端近似是为了实现计算障碍。提出了进一步的分析,以表明通过自适应选择功率序列的求和度,理论上可以将有限端近似中的截断误差降低到所需的阈值。几种足够的条件被严格得出作为选择原则。最后,相对于单个和多机器人案例,广泛的仿真结果和比较验证了对未来拓扑的正式计算,因此更准确的概率可以帮助提高不确定性下的积极计划的性能。
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.