Showing 941 - 960 results of 4,823 for search '(( algorithm within function ) OR ((( algorithm python function ) OR ( algorithm a function ))))', query time: 0.51s Refine Results
  1. 941
  2. 942
  3. 943
  4. 944

    Bootstrap results (N = 368). by Linsha Liu (20378293)

    Published 2024
    “…Since the inherent flaws of virtual social networking cannot be eliminated solely through algorithm matching, a potential solution is to introduce more offline to online social functions for strangers. …”
  5. 945

    Analysis of confirmatory factors (N = 368). by Linsha Liu (20378293)

    Published 2024
    “…Since the inherent flaws of virtual social networking cannot be eliminated solely through algorithm matching, a potential solution is to introduce more offline to online social functions for strangers. …”
  6. 946

    The relevant data file for this article. by Linsha Liu (20378293)

    Published 2024
    “…Since the inherent flaws of virtual social networking cannot be eliminated solely through algorithm matching, a potential solution is to introduce more offline to online social functions for strangers. …”
  7. 947

    Results of common fit indexes for SEM (N = 368). by Linsha Liu (20378293)

    Published 2024
    “…Since the inherent flaws of virtual social networking cannot be eliminated solely through algorithm matching, a potential solution is to introduce more offline to online social functions for strangers. …”
  8. 948

    Final path. by Zhenggang Wang (1753657)

    Published 2025
    “…<div><p>In response to the widely used RRT-Connect path planning algorithm in the field of robotic arms, which has problems such as long search time, random node growth, multiple and unsmooth path turns, a path planning algorithm combining dynamic step size and artificial potential field is proposed. …”
  9. 949

    Expansion procedure. by Zhenggang Wang (1753657)

    Published 2025
    “…<div><p>In response to the widely used RRT-Connect path planning algorithm in the field of robotic arms, which has problems such as long search time, random node growth, multiple and unsmooth path turns, a path planning algorithm combining dynamic step size and artificial potential field is proposed. …”
  10. 950

    Artificial potential field method. by Zhenggang Wang (1753657)

    Published 2025
    “…<div><p>In response to the widely used RRT-Connect path planning algorithm in the field of robotic arms, which has problems such as long search time, random node growth, multiple and unsmooth path turns, a path planning algorithm combining dynamic step size and artificial potential field is proposed. …”
  11. 951

    Modified D-H parameters. by Zhenggang Wang (1753657)

    Published 2025
    “…<div><p>In response to the widely used RRT-Connect path planning algorithm in the field of robotic arms, which has problems such as long search time, random node growth, multiple and unsmooth path turns, a path planning algorithm combining dynamic step size and artificial potential field is proposed. …”
  12. 952

    Path comparison before and after smoothing. by Zhenggang Wang (1753657)

    Published 2025
    “…<div><p>In response to the widely used RRT-Connect path planning algorithm in the field of robotic arms, which has problems such as long search time, random node growth, multiple and unsmooth path turns, a path planning algorithm combining dynamic step size and artificial potential field is proposed. …”
  13. 953

    Schematic diagram of dynamic step size expansion. by Zhenggang Wang (1753657)

    Published 2025
    “…<div><p>In response to the widely used RRT-Connect path planning algorithm in the field of robotic arms, which has problems such as long search time, random node growth, multiple and unsmooth path turns, a path planning algorithm combining dynamic step size and artificial potential field is proposed. …”
  14. 954

    Mirobot six-axis robot arm. by Zhenggang Wang (1753657)

    Published 2025
    “…<div><p>In response to the widely used RRT-Connect path planning algorithm in the field of robotic arms, which has problems such as long search time, random node growth, multiple and unsmooth path turns, a path planning algorithm combining dynamic step size and artificial potential field is proposed. …”
  15. 955

    Comparison before and after path pruning. by Zhenggang Wang (1753657)

    Published 2025
    “…<div><p>In response to the widely used RRT-Connect path planning algorithm in the field of robotic arms, which has problems such as long search time, random node growth, multiple and unsmooth path turns, a path planning algorithm combining dynamic step size and artificial potential field is proposed. …”
  16. 956

    Time and path length of 30 simulation planning. by Zhenggang Wang (1753657)

    Published 2025
    “…<div><p>In response to the widely used RRT-Connect path planning algorithm in the field of robotic arms, which has problems such as long search time, random node growth, multiple and unsmooth path turns, a path planning algorithm combining dynamic step size and artificial potential field is proposed. …”
  17. 957

    Joint coordinate system. by Zhenggang Wang (1753657)

    Published 2025
    “…<div><p>In response to the widely used RRT-Connect path planning algorithm in the field of robotic arms, which has problems such as long search time, random node growth, multiple and unsmooth path turns, a path planning algorithm combining dynamic step size and artificial potential field is proposed. …”
  18. 958

    Schematic diagram of path pruning process. by Zhenggang Wang (1753657)

    Published 2025
    “…<div><p>In response to the widely used RRT-Connect path planning algorithm in the field of robotic arms, which has problems such as long search time, random node growth, multiple and unsmooth path turns, a path planning algorithm combining dynamic step size and artificial potential field is proposed. …”
  19. 959

    Mirobot robot arm model. by Zhenggang Wang (1753657)

    Published 2025
    “…<div><p>In response to the widely used RRT-Connect path planning algorithm in the field of robotic arms, which has problems such as long search time, random node growth, multiple and unsmooth path turns, a path planning algorithm combining dynamic step size and artificial potential field is proposed. …”
  20. 960