提出可无限递归的ArUco标记,支持无人机群精准降落
Recursive ArUco Markers: A Scalable Fiducial Marker Design for Unmanned Aerial Vehicle Landing Pads

- 通过修改比特采样策略,在父标记黑白区域嵌入完整子标记
- 实现无限制递归深度,部分遮挡下仍能稳定检测
- 单标识符支持多机并行降落,适配大规模无人机集群
无人飞行器(UAV)日益依赖视觉标记实现自主导航与精准着陆。现有标准标记存在探测距离受限问题,当摄像头过远或过近时无法识别。尽管已有递归与分形标记方案,但现有方法或要求标记中心始终可见(易受遮挡),或递归深度和布局受限。本文提出新型递归ArUco标记设计,可将任意标准标记转换为任意深度的递归标记。通过改进的比特采样策略,将完整子标记嵌入父标记的黑/白比特中。该方法确保无限递归深度,且无需依赖中心可见,具备强抗遮挡能力。同时,所有层级共享单一唯一标识,构建了丰富的唯一着陆点字典,支持多架无人机同时在不同位置着陆——这是现有分形与Harco标记因结构与字典限制所无法实现的功能。
原文摘要 · Abstract (English)
Unmanned Aerial Vehicles (UAVs) increasingly rely on visual fiducial markers for autonomous navigation and precision landing. However, standard markers suffer from limited operational ranges, becoming undetectable when the camera is either too far or too close. While recursive and fractal markers have been proposed to address this issue, existing approaches either require the marker's center to remain visible, making them vulnerable to occlusion, or are limited in their recursion depth and placement. We propose a novel Recursive ArUco marker design. Our method allows any standard fiducial marker to be transformed into a recursive marker with an arbitrary depth. By employing a modified bit-sampling strategy during detection, we embed complete markers within both the black and white bits of the parent marker. This approach guarantees unlimited recursion depth and robust detection even with partial occlusion, as it does not rely on the marker's center being visible. Furthermore, by maintaining a single, unique identifier across all recursive scales, our proposal provides an extensive dictionary of multiple unique landing pads. This capability allows fleets of UAVs to operate simultaneously, with each drone landing at its designated location -- a feature not supported by existing Fractal and Harco markers due to their structural and dictionary constraints.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。