This paper solves the planar navigation problem by recourse to an online reactive scheme that exploits recent advances in SLAM and visual object recognition to recast prior geometric knowledge in terms of an offline catalogue of familiar objects. The resulting vector field planner guarantees convergence to an arbitrarily specified goal, avoiding collisions along the way with fixed but arbitrarily placed instances from the catalogue as well as completely unknown fixed obstacles so long as they are strongly convex and well separated. We illustrate the generic robustness properties of such deterministic reactive planners as well as the relatively modest computational cost of this algorithm by supplementing an extensive numerical study with physical implementation on both a wheeled and legged platform in different settings.
翻译:本文通过采用在线反应计划来解决平面导航问题,利用SLAM和视觉物体识别的最新进展,将先前的几何知识改编成离线的熟悉物体目录。由此形成的矢量实地规划员保证与任意指定的目标趋同,避免与目录中固定但任意放置的事件以及完全未知的固定障碍物相碰撞,只要这些障碍物具有很强的共通性和良好的分离性。我们通过在不同的环境中对轮式和腿式平台进行实际执行来补充一项广泛的数字研究,以此来说明这种确定性被动反应规划者的一般稳健性特性以及这种算法的相对较低的计算成本。