<p>Path planning is a fundamental challenge in autonomous mobile robotics, where the raw outputs of classical grid-based planners such as <InlineEquation ID="IEq3"><EquationSource Format="TEX">\(A^*\)</EquationSource></InlineEquation> contain sharp turns and redundant waypoints that are unsuitable for direct execution. Tracking such unsmoothed paths with a Model Predictive Controller (MPC) on a <InlineEquation ID="IEq4"><EquationSource Format="TEX">\(100\,\text {m}\)</EquationSource></InlineEquation> grid produces positional errors exceeding <InlineEquation ID="IEq5"><EquationSource Format="TEX">\(10\,\text {m}\)</EquationSource></InlineEquation> and highly oscillatory acceleration commands, confirming the critical need for post-hoc trajectory smoothing. This paper proposes a three-stage hybrid framework: (i) an Improved <InlineEquation ID="IEq6"><EquationSource Format="TEX">\(A^*\)</EquationSource></InlineEquation> search with Dynamic Programming (DP) generates a globally feasible path and prunes redundant waypoints; (ii) an Adaptive Random Search Optimization (ARSO) algorithm adaptively places one control point per waypoint triplet by minimizing the deviation between the smoothed spline arc-length and the original segment length; and (iii) cubic spline interpolation enforces <InlineEquation ID="IEq7"><EquationSource Format="TEX">\(C^2\)</EquationSource></InlineEquation>-continuous trajectories via natural boundary conditions, without requiring gradient computation, convex decomposition, or neural network training. Validated on two benchmark occupancy-grid environments (a <InlineEquation ID="IEq8"><EquationSource Format="TEX">\(100\!\times \!100\)</EquationSource></InlineEquation> cell map at <InlineEquation ID="IEq9"><EquationSource Format="TEX">\(2.5\,\text {m/s}\)</EquationSource></InlineEquation> and a more demanding <InlineEquation ID="IEq10"><EquationSource Format="TEX">\(160\!\times \!160\)</EquationSource></InlineEquation> cell map at <InlineEquation ID="IEq11"><EquationSource Format="TEX">\(3.0\,\text {m/s}\)</EquationSource></InlineEquation>), the smoothed reference reduces MPC tracking error by up to 100-fold: lateral deviation falls from <InlineEquation ID="IEq12"><EquationSource Format="TEX">\(3.0\,\text {m}\)</EquationSource></InlineEquation> on the raw pruned path to <InlineEquation ID="IEq13"><EquationSource Format="TEX">\(1.5\,\text {cm}\)</EquationSource></InlineEquation> on the ARSO-smoothed path, with residual errors converging to near-zero within <InlineEquation ID="IEq14"><EquationSource Format="TEX">\(10\,\text {s}\)</EquationSource></InlineEquation> in both scenarios. The framework is gradient-free, training-free, and directly compatible with standard occupancy-grid navigation stacks, making it practical for autonomous ground robots and aerial vehicles operating in obstacle-dense, real-time environments.</p>

错误:搜索内容不能为空,请输入英文关键词
错误:关键词超出字数限制,请精简
高级检索

Smooth robotic path planning via a hybrid improved \(A^*\) adaptive random search optimization and cubic spline framework

  • Muhammad Aatif,
  • Umar Adeel,
  • Ammar Rashid,
  • Shafiz Affendi Bin Mohd Yusof,
  • Arfan Ghani

摘要

Path planning is a fundamental challenge in autonomous mobile robotics, where the raw outputs of classical grid-based planners such as \(A^*\) contain sharp turns and redundant waypoints that are unsuitable for direct execution. Tracking such unsmoothed paths with a Model Predictive Controller (MPC) on a \(100\,\text {m}\) grid produces positional errors exceeding \(10\,\text {m}\) and highly oscillatory acceleration commands, confirming the critical need for post-hoc trajectory smoothing. This paper proposes a three-stage hybrid framework: (i) an Improved \(A^*\) search with Dynamic Programming (DP) generates a globally feasible path and prunes redundant waypoints; (ii) an Adaptive Random Search Optimization (ARSO) algorithm adaptively places one control point per waypoint triplet by minimizing the deviation between the smoothed spline arc-length and the original segment length; and (iii) cubic spline interpolation enforces \(C^2\)-continuous trajectories via natural boundary conditions, without requiring gradient computation, convex decomposition, or neural network training. Validated on two benchmark occupancy-grid environments (a \(100\!\times \!100\) cell map at \(2.5\,\text {m/s}\) and a more demanding \(160\!\times \!160\) cell map at \(3.0\,\text {m/s}\)), the smoothed reference reduces MPC tracking error by up to 100-fold: lateral deviation falls from \(3.0\,\text {m}\) on the raw pruned path to \(1.5\,\text {cm}\) on the ARSO-smoothed path, with residual errors converging to near-zero within \(10\,\text {s}\) in both scenarios. The framework is gradient-free, training-free, and directly compatible with standard occupancy-grid navigation stacks, making it practical for autonomous ground robots and aerial vehicles operating in obstacle-dense, real-time environments.