← 返回 2026-06-30

基于FLISP的大规模隧道空地协作:快速LiDAR-IMU同步路径规划器 Large-Scale Tunnel Air-Ground Collaboration With FLISP: Fast LiDAR-IMU Synchronized Path Planner

Fenghe Guo, Runjie Shen, Chenyang Sun, Junrui Zhang, Quanxi Zhan, Yongchun Wang, Junjie Zhang 📅 2026-06-25 👍 4 2026-07-13 08:37
多机器人系统 无地图导航 空地协作 路径规划 隧道检测

提出无地图框架,实现UGV-UAV隧道协同检测,7ms延迟100%成功率

前置知识

SLAM漂移

同时定位与建图(SLAM)算法在特征退化环境(如纹理单一、重复几何的隧道)中,由于缺乏足够的视觉或几何特征点,会导致位姿估计误差随时间累积而发散。这种现象表现为地图错位、轨迹扭曲,最终导致规划失败。论文中LIO-SAM和Fast-LIO2在隧道深处出现地图重叠和停滞现象就是典型漂移表现。

本文的核心动机正是解决SLAM漂移问题,传统方法依赖全局一致地图进行规划,一旦漂移发生,整个系统将失效。理解SLAM漂移的根源(特征退化)和后果(规划失效)有助于理解为什么作者提出无地图范式。

萤火虫算法(Firefly Algorithm, FA)

一种受萤火虫发光吸引行为启发的元启发式优化算法,通过模拟萤火虫的吸引-探索规则搜索最优解。算法中每个解代表一只萤火虫,亮度由目标函数值决定(越亮越好)。萤火虫会被更亮的个体吸引,同时引入随机扰动避免局部最优。论文中将FA改进用于UGV 1D横向避障,搜索空间被约束为隧道截面上的单维度。

论文采用增强型FA进行UGV避障,相比传统RRT等采样方法具有更快的收敛速度。理解FA的工作原理(亮度评价、位置更新、随机衰减)有助于理解作者为什么选择它,以及如何通过动态加权代价函数和约束改进来适应隧道避障需求。

分层多项式拟合

一种几何建模方法,通过拟合不同阶数的多项式曲线来近似隧道中心线。论文中首先通过局部斜率序列方差区分直线和弯道,对直线段使用低阶多项式($\beta_0 + \beta_1 x$),对弯道使用高阶多项式($\sum_{j=0}^{2m} \alpha_j x^j$)。这种方法在稀疏点云数据下仍能推断完整边界,具有天然的抗噪声能力。

这是FLISP的核心技术,替代了昂贵的网格地图。理解多项式拟合如何处理稀疏数据、区分直线弯道、预测缺失点,有助于理解作者如何避免SLAM漂移,同时保证路径平滑性和连续性。

状态估计漂移与地图重叠

在隧道等线性退化环境中,LiDAR-IMU里程计的纵向约束依赖于明显的几何锚点(如闸门、弯道)。当车辆进入特征平直区域,失去锚点后,估计器会出现漂移。表现为地图中同一物理位置被多次映射(重叠),导致虚拟位置停滞或发散。论文中Method III的停滞现象和Method II的地图重叠都是具体表现。

这是传统SLAM方法在隧道中的根本缺陷。理解漂移的触发条件(失去几何锚点)、表现形式(地图重叠/停滞)和后果(规划失效),有助于理解为什么作者提出无地图范式,以及FLISP如何通过长视距几何拟合避免这一陷阱。

配置空间(C-Space)生成

将机器人的尺寸约束转化为障碍物膨胀,在配置空间中机器人可视为质点。对于UGV,需要在隧道点云基础上向外膨胀车辆半径和安全缓冲。传统网格A*方法需要显式构建膨胀后的C-Space,计算开销极大。论文中Method III的Grid Rasterization和C-Space Generation占据总延迟的80%以上。

这是基于地图方法的计算瓶颈。理解C-Space生成的过程和开销,有助于理解为什么作者避免显式构建地图,而是直接在原始点云上进行几何拟合,从而实现数量级的速度提升。

研究动机

现有方法在水电隧道检测中面临三个核心问题:一是依赖SLAM的全局地图在特征退化环境(如单一纹理、重复几何的隧道深处)中容易出现漂移,导致地图错位、规划失效,实验中LIO-SAM在弯道处出现地图重叠、Fast-LIO2出现纵向停滞;二是基于地图的方法(如网格A*)需要栅格化和配置空间生成,计算开销巨大(Method III占80%延迟),难以满足实时控制需求;三是采样方法(如RRT*)在非凸盲弯中收敛慢、路径质量差,Method II的平均规划频率仅0.16 Hz,导致系统在大部分时间处于开环状态,存在安全隐患。此外,空地协作的异构约束(UGV的曲率地板约束、UAV的通信安全约束)使得传统统一规划难以兼顾,现有研究缺乏针对线性退化基础设施的专用框架。

本文的目标是本文的目标是设计一个轻量级的无地图路径规划框架,用于UGV-UAV空地协作的水电隧道自动化检测。核心目标包括:实现100%的路径生成成功率、将规划延迟控制在10 ms以内以满足实时控制需求、避免SLAM漂移对规划的影响、同时满足UGV的曲率地板防翻滚约束和UAV的通信安全约束,并在真实1.2公里水电隧道中验证系统的鲁棒性和效率。

与已有工作不同的是,本文的独特切入角度是提出UGV主导的异构协作无地图规划范式。与传统方法不同,FLISP不依赖全局SLAM地图,而是直接利用UGV搭载的单一LiDAR-IMU套件,通过分层多项式拟合提取长视距隧道几何(50米前瞻),为UGV生成平滑路径,再基于此路径为UAV生成满足通信安全约束的飞行轨迹。这种架构在三个维度上实现了突破:一是将路径生成的计算复杂度从$O(N \cdot M)$(网格方法)降低到$O(1)$(几何拟合),延迟从50 ms降至7 ms;二是通过长视距几何拟合避免SLAM漂移,在特征退化环境中仍保持100%成功率;三是通过层次化依赖确保UGV和UAV的空间同步,避免了异构视距矛盾。此外,作者针对隧道场景定制了平台特定的求解器(UGV用增强型FA、UAV用动态迭代优化),相比通用RRT*和A*在效率和质量上都有显著提升。

核心方法

FLISP采用UGV中心化的异构协作架构,整体流程分为感知层、规划层和控制层。感知层由UGV搭载的64线LiDAR-IMU提供点云和姿态数据,不构建全局地图,而是直接提取局部几何特征。规划层分为UGV路径规划器和UAV路径规划器,前者基于点云通过分层多项式拟合生成50米前瞻的平滑路径,遇到障碍物时用增强型萤火虫算法进行1D横向避障;后者以UGV路径为参考,在通信安全约束下生成UAV的三维飞行路径,并通过动态采样迭代优化提升平滑性和避障性能。控制层采用标准的PD控制器跟踪规划轨迹,UGV使用最小加加速度轨迹生成,UAV使用非均匀B样条并引入曲率感知时间分配机制确保急转弯时的安全。整个系统在UGV工业计算机上运行,CPU负载仅1.37%,内存占用39.7 MB,远低于基于地图的基线方法。

FLISP的核心创新点是提出UGV主导的无地图异构协作范式,与传统方法的本质区别在于:首先,不依赖全局SLAM地图,而是直接在原始点云上进行几何拟合,避免了SLAM漂移和地图维护开销;其次,采用层次化依赖结构,UAV路径由UGV路径导出,确保了空间同步并解决了异构视距矛盾;再次,使用平台特定的求解器(UGV的增强型FA、UAV的动态迭代优化)而非通用RRT*或A*,在效率和质量上都有显著提升;最后,通过长视距(50米)多项式拟合为慢响应UGV提供前瞻性yaw梯度,避免了局部盲点导致的死锁和翻滚风险。这些创新共同实现了7 ms延迟、100%成功率的实时规划性能。

方法步骤详情

FLISP的完整流程包含五个主要步骤。步骤1:UGV基础走廊生成。首先通过点云采样估计隧道壁法向量$\vec{v}$,计算偏航角偏差$\theta = \pi - \arccos([1\ 0\ 0] \cdot \vec{v})$,融合到姿态四元数$q_d = q_b \otimes [\cos(\theta/2), 0, 0, \sin(\theta/2)]$实现完整状态估计。然后根据yaw角$\theta$动态调整步长$\Delta s$,将点云分箱$B_j = \{(x_i, y_i, z_i) \in P | (j-1)\Delta s \leq x_i < j\Delta s\}$,提取每个箱的左右边界点$p_{Lj} = \arg\min_{y} (x,y,z) \in B_j$和$p_{Rj} = \arg\max_{y} (x,y,z) \in B_j$。通过分析局部斜率序列$K = \{k_i | k_i = \frac{y_{i+\delta}-y_i}{x_{i+\delta}-x_i}, i=1,2,...,n-\delta\}$的方差$\sigma_K^2$区分直线和弯道,应用多级拟合模型推断完整边界:$y = \begin{cases} \beta_0 + \beta_1 x, & \sigma_K^2 \leq \tau_{\text{curve}} \\ \sum_{j=0}^{2m} \alpha_j x^j, & \sigma_K^2 > \tau_{\text{curve}} \end{cases}$。初始路径为$P_{\text{initial}} = \frac{p_{Li} + p_{Ri}}{2}$。步骤2:路径鲁棒化和细化。对每个点$p_i$,基于邻居构造前向预测$\hat{y}_{i,\text{prev}} = y_{i-1} + \frac{y_{i-1}-y_{i-2}}{x_{i-1}-x_{i-2}}(x_i-x_{i-1})$和后向预测$\hat{y}_{i,\text{next}} = y_{i+1} + \frac{y_{i+1}-y_{i+2}}{x_{i+1}-x_{i+2}}(x_i-x_{i+1})$,合并为$\hat{y}_i = \frac{\hat{y}_{i,\text{prev}} + \hat{y}_{i,\text{next}}}{2}$。计算测量误差$\varepsilon_i = y_i - \hat{y}_i$,建模为高斯分布:$p(\varepsilon_i|S_n) = \frac{1}{\sigma_n\sqrt{2\pi}}e^{-\frac{\varepsilon_i^2}{2\sigma_n^2}}$(正常点)和$p(\varepsilon_i|S_o) = \frac{1}{\sigma_o\sqrt{2\pi}}e^{-\frac{\varepsilon_i^2}{2\sigma_o^2}}$(离群点)。根据贝叶斯定理计算后验概率$P(S_o|\varepsilon_i) = \frac{p(\varepsilon_i|S_o)P(S_o)}{p(\varepsilon_i|S_n)P(S_n) + p(\varepsilon_i|S_o)P(S_o)}$,超过阈值则修正点$p_i \leftarrow (x_i, \hat{y}_i)$。步骤3:动态安全和避障。沿路径构建安全走廊,检测盒$B_i = \{p | R_i^T(p-c_i) \in D_i\}$定义为旋转后的轴对齐边界框$D_i = [-L_i, L_i] \times [-r, r] \times [z_{\min}, z_{\max}]$,其中$L_i$为段长、$r$为横向安全半径、$[z_{\min}, z_{\max}]$为垂直限制。使用空间分区策略将检测域离散化为路径对齐的1D网格,通过快速整数索引($O(1)$)将点映射到单元,仅对路径占据单元中的点进行精确几何包含检查(窄相),避免暴力迭代($O(N \cdot M)$)的延迟。检测到障碍物后,用增强型FA优化局部避障路径,约束在隧道物理边界内:$y_{\min} = -R_{\text{pipe}} + \frac{W_v}{2} + M_s$、$y_{\max} = R_{\text{pipe}} - \frac{W_v}{2} - M_s$($R_{\text{pipe}}$为隧道半径、$W_v$为车辆宽度、$M_s$为安全缓冲),并施加最大倾角约束$\frac{|y|}{R_{\text{pipe}}} \leq \theta_{\max}$防止翻滚。路径点质量由亮度$I(y) = d_{\text{obstacle}} - w_{\text{tilt}} \cdot \frac{|y|}{R_{\text{pipe}}} - w_{\text{center}} \cdot |y|$评价,萤火虫位置更新为$y_i^{(t+1)} = y_i^{(t)} + \beta_0 e^{-\gamma r_{ij}^2}(y_j^{(t)} - y_i^{(t)}) + \alpha(t) \cdot \text{rand}(-0.5, 0.5) \cdot (y_{\max} - y_{\min})$,随机参数$\alpha(t)$几何衰减$\alpha(t+1) = 0.95\alpha(t)$。步骤4:最终路径平滑和姿态校正。为减轻翻滚风险,应用姿态校正机制,首先用收缩因子衰减测量角度$\theta_{\text{adjusted}} = \theta_{\text{original}} \cdot f_{\text{shrink}}$。自适应计算过渡点数量$n_{\text{transition}} = \min\left(n_{\text{total}}, \frac{n_{\text{total}}}{1+e^{-|\theta_{\text{yaw}}|}}\right)$,车辆姿态在这些点上线性插值$\theta_{\text{yaw,roll}}(i) = \theta_{\text{yaw,roll}}\left(1 - \frac{i}{n_{\text{transition}}}\right)$,最终变换使用四元数$\vec{p}_{\text{global}}(i) = \begin{cases} q_{\theta(i)} \otimes \vec{p}_{\text{local}}(i), & i < n_{\text{transition}} \\ q_0 \otimes \vec{p}_{\text{local}}(i), & \text{otherwise} \end{cases}$得到可执行UGV路径$\phi$。步骤5:UAV路径规划。以精炼的UGV路径$\phi$为参考,首先生成最低安全高度路径$P_{\text{lowest}}$和期望高度路径$P_h$(从隧道中心线投影),在每个$P_{\text{lowest}}$点上构建通信安全约束,初始UAV路径$\Gamma_{\text{initial}}$确保$P_h$中每个点$\phi_i$满足约束:$\gamma_i = \begin{cases} \phi_i, & \|\phi_i - p_{li}\| \leq r \\ p_{li} + r \cdot \frac{\phi_i - p_{li}}{\|\phi_i - p_{li}\|}, & \text{otherwise} \end{cases}$。初始路径需要优化平滑性和避障,使用动态采样迭代方法。对每个路点,在其邻域内用极坐标策略生成候选点$\zeta_i$:$\zeta_i = \zeta_0 + r_{sp} \begin{bmatrix} \cos \theta_i \\ \sin \theta_i \\ 0 \end{bmatrix}$。用多目标代价函数评价每个候选:$J(\zeta) = \alpha J_1(\zeta) + \beta J_2(\zeta) - \eta J_3(\zeta) + \delta J_4(\zeta)$,其中$J_1$为安全代价(对圆柱安全走廊内的障碍施加二次惩罚)、$J_2$为平滑代价(惩罚偏离直线)、$J_3$为前进奖励(奖励向目标前进)、$J_4$为高度一致性代价(惩罚不必要的高度变化)。求解优化问题$\zeta^* = \arg\min_{\zeta \in Z} J(\zeta)$得到最优点,最终优化UAV路径$\epsilon = \{\zeta^*_0, \zeta^*_1, ..., \zeta^*_n\}$。

技术新颖性

FLISP的技术新颖性体现在四个方面:一是首次提出UGV主导的异构协作无地图规划范式,将路径生成的计算复杂度从$O(N \cdot M)$降低到$O(1)$,实现了三个数量级的速度提升(Method II延迟6492.61 ms → FLISP 7.05 ms);二是通过分层多项式拟合和贝叶斯离群点检测,在稀疏点云下仍能推断完整边界,具有天然抗噪声能力,避免了SLAM漂移;三是针对隧道场景定制的平台特定求解器,UGV的增强型FA引入动态加权代价函数($w_{\text{tilt}}$非线性增长)、UAV的动态迭代优化采用多目标代价函数($\alpha, \beta, \eta, \delta$权重调节),相比通用RRT*和A*在效率和质量上都有显著提升;四是通过长视距几何拟合(50米前瞻)避免局部盲点导致的死锁和翻滚风险,实验中成功避免了TEB局部规划器的屋顶阴影陷阱和拓扑死锁。此外,论文还揭示了基于地图方法的计算瓶颈(80%延迟用于网格栅格化和C-Space生成),以及采样方法在非凸盲弯中的收敛问题,为后续研究提供了重要见解。

Operational workflow of the UAV-UGV collaborative system. The architecture comprises three principal modules: (1) Hardware initialization, (2) Cooperative path planning, and (3) Motion control with feedback mechanisms.
Figure 2: Operational workflow of the UAV-UGV collaborative system. The architecture comprises three principal modules: (1) Hardware initialization, (2) Cooperative path planning, and (3) Motion control with feedback mechanisms.
Overview of FLISP. Starting from the LiDAR with the IMU, the initial path of the UGV is planned and optimized, and then the UAV path is planned and optimized based on the communication safety constraint established by the UGV path.
Figure 5: Overview of FLISP. Starting from the LiDAR with the IMU, the initial path of the UGV is planned and optimized, and then the UAV path is planned and optimized based on the communication safety constraint established by the UGV path.
Yaw angle estimation in tunnel environments. (a) Straight section with surface normal detection. (b) Curved section with wall normal extraction.
Figure 6: Yaw angle estimation in tunnel environments. (a) Straight section with surface normal detection. (b) Curved section with wall normal extraction.
Initial path planning visualization. (a) Straight tunnel with uniform step size. (b) Yaw angle presence resulting in finer path resolution with additional transition points.
Figure 7: Initial path planning visualization. (a) Straight tunnel with uniform step size. (b) Yaw angle presence resulting in finer path resolution with additional transition points.
Curved tunnel path planning. (a) Occluded point clouds generating inaccurate pseudo-paths. (b) Corrected path through model-based fitting and inference.
Figure 8: Curved tunnel path planning. (a) Occluded point clouds generating inaccurate pseudo-paths. (b) Corrected path through model-based fitting and inference.
FLISP's path-centric obstacle detection strategy. A safety corridor is constructed around the planned path. The corridor's shape is tailored to each platform: rectangular volumes for the UGV and cylindrical volumes for the UAV.
Figure 10: FLISP's path-centric obstacle detection strategy. A safety corridor is constructed around the planned path. The corridor's shape is tailored to each platform: rectangular volumes for the UGV and cylindrical volumes for the UAV.
Illustration of UAV initial path planning, ensuring points remain within the communication safety constraint relative to the UGV path.
Figure 11: Illustration of UAV initial path planning, ensuring points remain within the communication safety constraint relative to the UGV path.
Overview of the iterative optimization process for the UAV path.
Figure 12: Overview of the iterative optimization process for the UAV path.

实验结果

FLISP在仿真和实地实验中表现出卓越性能。在100次独立试验的仿真实验中,九种场景下的平均规划延迟均低于10 ms(UGV 3.50-8.75 ms、UAV 0.10-1.54 ms),路径平滑度S仅0.016弧度(Method II为9.638 rad、Method III为6.068 rad),路径曲折度τ为1.03(接近最优的1.0)。在1.2公里真实水电隧道实地实验中,系统成功自主行驶1.0公里(最后200米因淤泥超过机械 clearance排除),在八种代表性场景下实现了100%的路径生成成功率,平均延迟保持在7 ms以内(UGV 5.16-7.04 ms、UAV 0.44-4.22 ms),CPU负载仅1.37%、内存占用39.7 MB(Method III需1037.3 MB)。对比实验中,FLISP在1.2公里隧道数据集上实现了100%成功率(Method II为98.5%、Method III为99.6%),系统延迟7.05 ms相比Method III的49.93 ms实现7倍提升,相比Method II的6492.61 ms实现三个数量级提升。资源消耗方面,FLISP的CPU负载(1.37%)和内存占用(39.7 MB)远低于基线方法(Method II 11.18%、760.5 MB;Method III 8.72%、1037.3 MB),在资源受限平台上为感知和控制留出充足余量。定性分析显示,基线方法在隧道深处出现地图重叠(Method II)和停滞(Method III)现象,而FLISP保持稳定;基线路径存在锯齿(Method III)和不规则(Method II)导致控制震荡和翻滚风险,FLISP路径平滑可执行。实验还验证了系统对环境干扰的鲁棒性:UGV在不平地面的振动传输到LiDAR导致微弱点云误分类和步丢失现象(路径长度缩短2-3米),但高重规划频率和后退视距特性确保有效前瞻(>45米)持续更新,维持无缝导航;空气中的水分、滴水、灰尘环境下,Ouster OS1-64 LiDAR表现良好无显著数据退化;手持LiDAR模拟的严重抖动场景中,系统仍能恢复有效路径,Yaw估计模块通过平均多个隧道表面的法向量成功过滤高频扰动。

Average analysis metrics over 100 simulated trials.
Table 1: Average analysis metrics over 100 simulated trials.
Average analysis metrics over 100 field trials.
Table 2: Average analysis metrics over 100 field trials.
Experimental Parameters and Constraints
Table 3: Experimental Parameters and Constraints
Quantitative Benchmark Results
Table 4: Quantitative Benchmark Results
Computation Time Comparison of Planning Algorithms
Table 5: Computation Time Comparison of Planning Algorithms
Overview of the simulated tunnel environment. Left: Operational scene with obstacles. Right: Representative point clouds of a straight segment (a), right turn (b), left turn (c), and a sluice gate (d).
Figure 14: Overview of the simulated tunnel environment. Left: Operational scene with obstacles. Right: Representative point clouds of a straight segment (a), right turn (b), left turn (c), and a sluice gate (d).
The path planning results of FLISP in simulated tunnel environment, encompassing scenarios with straight segments (a), left (b) and right turn segments (c), and consecutive curves (d).
Figure 15: The path planning results of FLISP in simulated tunnel environment, encompassing scenarios with straight segments (a), left (b) and right turn segments (c), and consecutive curves (d).
FLISP obstacle avoidance (personnel) in the simulated tunnel. Scenarios include single and multiple obstacles in straight (a, b) and curved (c, d) segments.
Figure 16: FLISP obstacle avoidance (personnel) in the simulated tunnel. Scenarios include single and multiple obstacles in straight (a, b) and curved (c, d) segments.
FLISP gate traversal in the simulated tunnel, demonstrating UAV altitude recovery paths during forward (a) and reverse (b) traversals.
Figure 17: FLISP gate traversal in the simulated tunnel, demonstrating UAV altitude recovery paths during forward (a) and reverse (b) traversals.
Runtime distribution across nine scenarios (N = 100 trials each). Red lines: Mean; White dots: Median.
Figure 18: Runtime distribution across nine scenarios (N = 100 trials each). Red lines: Mean; White dots: Median.
Overview of the 1.2 km field experimental site. The central strip depicts the top-down point cloud projection. Insets (a)-(h) highlight representative scenarios including entrance gates, varying illumination, blind curves, multi-obstacle evasion, and deep silt accumulation at the terminal gate.
Figure 19: Overview of the 1.2 km field experimental site. The central strip depicts the top-down point cloud projection. Insets (a)-(h) highlight representative scenarios including entrance gates, varying illumination, blind curves, multi-obstacle evasion, and deep silt accumulation at the terminal gate.
FLISP path planning during field experiments in straight (a) and slightly curved (b) segments of the flood discharge tunnel.
Figure 20: FLISP path planning during field experiments in straight (a) and slightly curved (b) segments of the flood discharge tunnel.
Obstacle avoidance field tests with personnel (circled). Scenarios include single obstacle in straight (a) and curved (b) segments, and multi-obstacle in straight (c) and curved (d) segments.
Figure 21: Obstacle avoidance field tests with personnel (circled). Scenarios include single obstacle in straight (a) and curved (b) segments, and multi-obstacle in straight (c) and curved (d) segments.
FLISP planning results in gate traversal scenarios: (a) Reverse traversal and (b) Forward traversal.
Figure 22: FLISP planning results in gate traversal scenarios: (a) Reverse traversal and (b) Forward traversal.
Runtime distribution across eight scenarios (N = 100 trials each). Red lines: Mean; White dots: Median.
Figure 23: Runtime distribution across eight scenarios (N = 100 trials each). Red lines: Mean; White dots: Median.
The length change of the paths planned by FLISP for the UGV and UAV across eight scenarios, evaluating the path validity rate.
Figure 24: The length change of the paths planned by FLISP for the UGV and UAV across eight scenarios, evaluating the path validity rate.
Calibration for Method II. (a) Horizon: 25 m is selected as the Pareto optimal (100% success). (b) Threshold: A 10.0 rad cutoff aligns with the statistical upper bound ($\mu + \sigma$), filtering stochastic outliers.
Figure 25: Calibration for Method II. (a) Horizon: 25 m is selected as the Pareto optimal (100% success). (b) Threshold: A 10.0 rad cutoff aligns with the statistical upper bound ($\mu + \sigma$), filtering stochastic outliers.
Calibration for Method III. (a) Horizon: 30 m is identified as the geometric limit due to occlusion. (b) Resolution: 0.1 m balances system latency vs. obstacle dilation artifacts.
Figure 26: Calibration for Method III. (a) Horizon: 30 m is identified as the geometric limit due to occlusion. (b) Resolution: 0.1 m balances system latency vs. obstacle dilation artifacts.
Computational Latency Breakdown (Method III vs. Method I). For the map-based Method III, total latency is dominated by Grid Rasterization (Blue) and C-Space Generation (Teal), acting as expensive prerequisites for the actual A* Search (Green). These map maintenance steps are mandated by the 0.1 m grid resolution for safety. In contrast, FLISP (Burgundy) bypasses dense map updates, operating on sparse geometric features to achieve an order-of-magnitude latency reduction.
Figure 29: Computational Latency Breakdown (Method III vs. Method I). For the map-based Method III, total latency is dominated by Grid Rasterization (Blue) and C-Space Generation (Teal), acting as expensive prerequisites for the actual A* Search (Green). These map maintenance steps are mandated by the 0.1 m grid resolution for safety. In contrast, FLISP (Burgundy) bypasses dense map updates, operating on sparse geometric features to achieve an order-of-magnitude latency reduction.
查看结构化数据
任务指标本文基线提升
隧道路径规划成功率 Success Rate [%] 100.0 98.5 (Method II), 99.6 (Method III) 完全避免SLAM漂移导致的规划失效
路径平滑度 Path Smoothness [rad] 0.016 9.638 (Method II), 6.068 (Method III) 提升375-602倍,避免控制震荡和翻滚风险
系统延迟 Latency (Tlat) [ms] 7.05 ± 4.26 6492.61 ± 2973.8 (Method II), 49.93 ± 8.01 (Method III) 相比Method III提升7倍,相比Method II提升三个数量级
资源消耗 CPU Load [%] / RAM Usage [MB] 1.37 ± 0.41 / 39.7 11.18 ± 3.94 / 760.5 (Method II), 8.72 ± 1.20 / 1037.3 (Method III) CPU负载降低6-8倍,内存占用降低19-26倍
路径曲折度 Path Tortuosity [-] 1.03 1.42 (Method II), 1.02 (Method III) 相比Method II提升28%,与Method III相当但平滑度优378倍

局限与改进

作者承认的局限性包括:当前框架假设线性隧道结构,未考虑复杂分支或交汇场景,限制了在复杂隧道网络中的应用;系统严格依赖UGV的局部里程计进行短期轨迹跟踪,在极端泥泞或积水环境或车轮对角线驱动导致地面接触丢失时,轮编码器会出现不可避免的滑移导致瞬时局部里程计失效;论文仅提供高层路径规划,低级控制在高度动态约束下无缝执行这些轨迹需要严格的理论保证。我们观察到的额外局限性包括:无地图范式在首次进入未知环境时缺乏全局拓扑信息,可能无法处理死胡同或循环路径;系统依赖LiDAR-IMU传感器,在强反射(水面)或全遮挡(浓烟)环境下性能会下降;UGV的慢响应机械约束限制了急转弯能力,在狭窄连续弯道中可能需要人工干预;UAV的通信安全约束假设UGV路径始终有效,如果UGV避障导致大幅偏离,UAV路径可能需要重新生成;系统未考虑动态障碍物(如移动人员)的预测行为,仅通过重规划响应。

独立分析的弱点

FLISP存在以下具体弱点和改进方向:1) 线性结构假设限制:当前框架无法处理隧道分支、交汇或环路等复杂拓扑。改进方向是引入拓扑决策层(作者已提出),结合全局地图信息进行复杂场景的路径选择和切换。2) 依赖局部里程计:在极端泥泞、积水或车轮打滑时,局部里程计失效可能影响跟踪精度。改进方向是融合视觉里程计或里程计滑移检测机制,在里程计失效时切换到纯LiDAR模式或降低跟踪速度。3) 传感器鲁棒性:强反射(水面)或全遮挡(浓烟)会导致LiDAR数据退化。改进方向是融合多模态传感器(如毫米波雷达、热成像)或在传感器退化时触发安全停止模式。4) UGV机械约束:慢响应底盘无法执行急转弯,在连续窄弯中可能失败。改进方向是优化机械设计(提高转向带宽)或采用分段策略(先前进再倒车调整)。5) 缺乏动态预测:对移动人员等动态障碍仅通过重规划响应,效率较低。改进方向是引入轨迹预测模块(如卡尔曼滤波、社交力模型),预测障碍运动并提前规划。6) 异构协调不足:UAV和UGV之间缺乏任务级协调(如动态分配检测区域)。改进方向是引入任务调度层,根据环境复杂度和传感器覆盖自动调整平台分工。

未来方向

作者提出的未来工作方向包括:1) 扩展框架超越线性结构,通过集成拓扑决策层处理复杂分支和交汇;2) 与并行开发的控制势垒函数(CBF)共识跟踪控制器集成,在物理平台上评估组合性能。基于成果可延伸的方向包括:1) 多团队协同:将框架扩展到多UGV-UAV团队,实现更大规模隧道的并行检测;2) 自适应参数调节:根据隧道几何特征(曲率、宽度)动态调整多项式阶数、FA参数和代价函数权重,提升自适应性;3) 在线建图与规划结合:在无地图规划基础上选择性构建关键区域地图(如闸门、弯道),提供长期记忆和重访能力;4) 能量优化:在路径规划中集成UAV续航模型,优化飞行高度和速度以最大化检测范围;5) 故障检测与恢复:引入异常检测机制(如点云密度异常、IMU漂移),在传感器或执行器故障时触发安全模式;6) 人机协同:集成远程操作接口,在自动化系统失效时允许人工接管,同时保留自主规划能力。

复现评估

论文的复现性评估如下:开源情况方面,作者已在GitHub发布源代码(https://github.com/ArchibaldGuo/FLISP.git)和代表性LiDAR-IMU数据集,包含隧道环境中的关键几何退化场景,便于其他研究者复现和对比。数据方面,论文使用真实1.2公里水电隧道数据,包含多种代表性场景(入口闸门、弯道、直道、闸门穿越、淤泥积累等),并详细记录实验参数(表3:物理参数、FLISP规划视距50米、Method II最大规划时间8秒、Method III网格分辨率0.1米等),便于复现。算力方面,系统运行在UGV搭载的工业计算机(Intel i7-12700 CPU、NVIDIA GTX 4060-8G GPU、32 GB RAM),实时性能良好,但GPU未充分利用(规划主要在CPU上),研究者可在更低配置上验证核心算法。难度方面,论文提供详细算法描述(Algorithm 1、Algorithm 2)和参数设置,但部分实现细节(如多项式拟合的阶数选择、FA参数$\beta_0, \gamma$的调节策略、多目标代价函数权重$\alpha, \beta, \eta, \delta$的确定)未完全公开,可能影响精确复现。实地实验依赖特定硬件(Ouster OS1-64 LiDAR、DJI Mavic 3T UAV、自制UGV)和真实隧道环境,完全复现实地实验难度较大,但仿真实验可通过Gazebo环境复现。总体而言,论文在开源和数据共享方面表现良好,核心算法可在中等算力平台上复现,但完全复现实地实验需要特定硬件和环境条件。