🤖 AI Summary
To address the challenges of trajectory planning failure and suboptimal optimization for mobile robots in narrow, cluttered environments, this paper proposes an adaptive trajectory optimization method. The approach features three key contributions: (1) recursive path segmentation coupled with conservative collision checking to enhance robustness against obstacles; (2) a pose correction mechanism guided by intrusion direction, ensuring safety while preserving motion continuity; and (3) integration of line-search-based optimization to balance trajectory smoothness and real-time performance. Simulation results demonstrate a 1.69× improvement in narrow-passage traversal success rate and a 73.6% reduction in average planning time—equivalent to a 3.79× speedup. Real-robot experiments further validate the algorithm’s capability to achieve rapid, safe navigation in complex, dynamic scenarios.
📝 Abstract
Trajectory planning for mobile robots in cluttered environments remains a major challenge due to narrow passages, where conventional methods often fail or generate suboptimal paths. To address this issue, we propose the adaptive trajectory refinement algorithm, which consists of two main stages. First, to ensure safety at the path-segment level, a segment-wise conservative collision test is applied, where risk-prone trajectory path segments are recursively subdivided until collision risks are eliminated. Second, to guarantee pose-level safety, pose correction based on penetration direction and line search is applied, ensuring that each pose in the trajectory is collision-free and maximally clear from obstacles. Simulation results demonstrate that the proposed method achieves up to 1.69x higher success rates and up to 3.79x faster planning times than state-of-the-art approaches. Furthermore, real-world experiments confirm that the robot can safely pass through narrow passages while maintaining rapid planning performance.