<p>Automatic path planning in complex three-dimensional environments is a key problem for robots when performing tasks effectively. However, existing path planning methods, especially the traditional particle swarm optimization (PSO), face key challenges when dealing with such problems, such as easily falling into local optimal solutions, lack of diversity, and insufficient precision. These problems limit the performance and reliability of path-planning algorithms in complex environments. To overcome these limitations, this paper proposes a new hybrid path planning algorithm by introducing a state factor-based inertia weight updating scheme and merging the crossover-mutation operator into the multi-objective particle swarm optimization (MOPSO), which is called MOSFCMPSO. Firstly, by setting adaptive tuning parameters in MOPSO, the probability of particles falling into the local optimal solution is reduced. Secondly, crossover and mutation operators are added to increase the diversity of the population to avoid the early precocious phenomenon. Finally, to evaluate the performance of the proposed MOSFCMPSO, comparisons are conducted with several other algorithms: standard MOPSO, linearly decreasing inertia weight MOPSO (LMOPSO), MOPSO based on state factor-based inertia weight updating scheme (MOSFPSO), multi-objective grey wolf optimizer (MOGWO), non-dominated sorting genetic algorithm II (NSGA-II), and K-means clustering based MOPSO (K-MOPSO) across three terrains of varying complexity. The simulation results demonstrate that MOSFCMPSO outperforms all other algorithms regarding search accuracy, population diversity, and optimization results. Specifically, when compared to the most competitive state-of-the-art algorithm, the proposed method achieves a reduction in path length of <InlineEquation ID="IEq1"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="12065_2025_1044_Article_IEq1.gif" Format="GIF" Height="16" Rendition="HTML" Resolution="72" Type="Linedraw" Width="43" /> </InlineMediaObject> <EquationSource Format="TEX">\(3.64\%\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mn>3.64</mn> <mo>%</mo> </mrow> </math></EquationSource> </InlineEquation>, <InlineEquation ID="IEq2"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="12065_2025_1044_Article_IEq2.gif" Format="GIF" Height="16" Rendition="HTML" Resolution="72" Type="Linedraw" Width="43" /> </InlineMediaObject> <EquationSource Format="TEX">\(2.26\%\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mn>2.26</mn> <mo>%</mo> </mrow> </math></EquationSource> </InlineEquation>, and <InlineEquation ID="IEq3"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="12065_2025_1044_Article_IEq3.gif" Format="GIF" Height="16" Rendition="HTML" Resolution="72" Type="Linedraw" Width="43" /> </InlineMediaObject> <EquationSource Format="TEX">\(5.76\%\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mn>5.76</mn> <mo>%</mo> </mrow> </math></EquationSource> </InlineEquation>, and a decrease in terrain roughness of <InlineEquation ID="IEq4"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="12065_2025_1044_Article_IEq4.gif" Format="GIF" Height="16" Rendition="HTML" Resolution="72" Type="Linedraw" Width="43" /> </InlineMediaObject> <EquationSource Format="TEX">\(7.98\%\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mn>7.98</mn> <mo>%</mo> </mrow> </math></EquationSource> </InlineEquation>, <InlineEquation ID="IEq5"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="12065_2025_1044_Article_IEq5.gif" Format="GIF" Height="16" Rendition="HTML" Resolution="72" Type="Linedraw" Width="43" /> </InlineMediaObject> <EquationSource Format="TEX">\(4.19\%\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mn>4.19</mn> <mo>%</mo> </mrow> </math></EquationSource> </InlineEquation>, and <InlineEquation ID="IEq6"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="12065_2025_1044_Article_IEq6.gif" Format="GIF" Height="16" Rendition="HTML" Resolution="72" Type="Linedraw" Width="43" /> </InlineMediaObject> <EquationSource Format="TEX">\(4.44\%\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mn>4.44</mn> <mo>%</mo> </mrow> </math></EquationSource> </InlineEquation>, in simple, moderately complex, and highly complex terrains, respectively.</p>

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

Robot path planning method in rough terrain based on multi-objective crossover-mutation particle swarm optimization

  • Zhaoxia Duan,
  • Yi Zhang,
  • Ronghao Wang,
  • Zhen Xu,
  • Zhengrong Xiang

摘要

Automatic path planning in complex three-dimensional environments is a key problem for robots when performing tasks effectively. However, existing path planning methods, especially the traditional particle swarm optimization (PSO), face key challenges when dealing with such problems, such as easily falling into local optimal solutions, lack of diversity, and insufficient precision. These problems limit the performance and reliability of path-planning algorithms in complex environments. To overcome these limitations, this paper proposes a new hybrid path planning algorithm by introducing a state factor-based inertia weight updating scheme and merging the crossover-mutation operator into the multi-objective particle swarm optimization (MOPSO), which is called MOSFCMPSO. Firstly, by setting adaptive tuning parameters in MOPSO, the probability of particles falling into the local optimal solution is reduced. Secondly, crossover and mutation operators are added to increase the diversity of the population to avoid the early precocious phenomenon. Finally, to evaluate the performance of the proposed MOSFCMPSO, comparisons are conducted with several other algorithms: standard MOPSO, linearly decreasing inertia weight MOPSO (LMOPSO), MOPSO based on state factor-based inertia weight updating scheme (MOSFPSO), multi-objective grey wolf optimizer (MOGWO), non-dominated sorting genetic algorithm II (NSGA-II), and K-means clustering based MOPSO (K-MOPSO) across three terrains of varying complexity. The simulation results demonstrate that MOSFCMPSO outperforms all other algorithms regarding search accuracy, population diversity, and optimization results. Specifically, when compared to the most competitive state-of-the-art algorithm, the proposed method achieves a reduction in path length of \(3.64\%\) 3.64 % , \(2.26\%\) 2.26 % , and \(5.76\%\) 5.76 % , and a decrease in terrain roughness of \(7.98\%\) 7.98 % , \(4.19\%\) 4.19 % , and \(4.44\%\) 4.44 % , in simple, moderately complex, and highly complex terrains, respectively.