Path planning with obstacle avoidance for soft robots based on improved particle swarm optimization algorithm

Hongwei Liu, Yang Jiang, Manlu Liu, Xinbin Zhang, Jianwen Huo, Haoxiang SuIntelligence 2023 · DOI

Soft robots are the "contortionists" of the robotics world. Their inherent flexibility and high degrees of freedom make them ideal for navigating the cramped, unpredictable environments found in search-and-rescue missions or minimally invasive surgeries. However, that same flexibility is a mathematical nightmare. Controlling a soft robot often involves solving complex inverse kinematics (IK) where solutions are computationally expensive or simply non-existent.

A new paper published in Intelligence & Robotics proposes a clever workaround: stop trying to control the whole robot at once and start treating it like a growing vine.

TL;DR

Researchers have developed a path-planning framework for soft robots that combines an Adaptive Weighted Particle Swarm Optimization (AWPSO) algorithm with a bio-inspired "tip self-growth" control strategy. By focusing control on the robot's tip and allowing the body to follow its trail, they achieved obstacle avoidance with significantly higher computational efficiency than traditional numerical methods.

What Problem Does This Paper Address?

Traditional "rigid" robots have fixed joints and links, making their movement predictable. Soft robots, however, suffer from kinematic coupling—moving one segment inevitably affects the others.

When a soft robot needs to navigate a forest of obstacles, engineers usually rely on Inverse Kinematics (IK) to determine exactly how every part of the robot should bend. But for soft materials, IK equations are highly non-linear and prone to "singularities" (mathematical dead ends). Standard path-planning algorithms often get stuck in local optima (finding a "good" path that isn't the best path) or take too long to calculate, making real-time obstacle avoidance nearly impossible.

Methods

The authors attacked this problem from three angles:

  1. Kinematic Modeling: They used the Piecewise Constant Curvature (PCC) assumption, which treats each segment of the soft robot as a perfect arc. This simplifies the math while maintaining enough accuracy for motion planning.
  2. AWPSO Path Planning: To find the optimal path through a 3D space, they improved the standard Particle Swarm Optimization (PSO) algorithm. Their version, Adaptive Weighted PSO (AWPSO), dynamically adjusts the "inertia weight" of particles. If a particle is far from the goal, it moves faster to explore; as it gets closer, it slows down to fine-tune the path.
  3. Tip Self-Growth Algorithm: This is the "aha" moment. Inspired by how vines grow, the algorithm only calculates the necessary movement for the robot's tip to follow the planned path. The subsequent segments then simply move to the position the tip occupied in the previous time step. This effectively "decouples" the segments, bypassing the need for complex, whole-body IK solvers.
  4. Bubble Film Modeling: To ensure safety, they modeled obstacles with a "bubble film"—a safety buffer that accounts for the robot's physical width and potential deflections during movement.

Datasets

The study was conducted entirely within a simulated 3D environment created in MATLAB. The authors generated a constrained workspace (100cm x 100cm x 200cm) populated with random peaks and "bubble-wrapped" obstacles to test the robot's ability to navigate tight spaces. No external real-world datasets were used.

Key Insights and Ideas

  • Decoupling via "Growth": The most significant insight is that you don't need to solve the entire robot's state simultaneously. By treating the motion as a "growth" process along a pre-calculated path, the computational load drops from a complex multi-variable problem to a series of simple point-tracking steps.
  • Safety Buffers Matter: Soft robots are "squishy" and prone to vibration or gravity-induced sagging. The "bubble film" approach is a practical engineering solution to ensure that even if the robot wobbles, it won't strike an obstacle.
  • Adaptive Optimization: Standard PSO is notorious for getting stuck in local minima. The adaptive weighting in AWPSO proved much more robust at finding the global shortest path in complex 3D environments.

Key Results

The simulation results demonstrated clear advantages over existing methods:

  • Efficiency: The "tip self-growth" method took only 10ms to execute. For comparison, the traditional weighted Jacobi matrix generalized inverse method took 761ms. That is a 76x speedup, moving the technology much closer to real-time application.
  • Convergence: The AWPSO algorithm reached the optimal path in just 16 iterations, compared to 26 iterations for standard PSO.
  • Stability: The AWPSO showed much lower variance in its results (39.6 vs 60.5 for PSO), meaning it consistently finds a high-quality path regardless of the initial random setup.

Limitations and Future Work

While the results are promising, the authors acknowledge several hurdles:

  • Simulation vs. Reality: The study is currently limited to a MATLAB simulation. Real-world materials have friction, non-linear elasticity, and environmental resistance that PCC models might not fully capture.
  • Open-Loop Control: The current system doesn't use sensors to "see" if the robot has actually reached the target. Future work will involve building a physical prototype and implementing a closed-loop control system with feedback.
  • Dynamics: The paper focuses on kinematics (geometry) rather than dynamics (forces). Future research will need to account for the weight of the robot and the payload it might carry.

For engineers working on continuum mechanics or soft robotics, this "vine-growth" strategy offers a compelling blueprint for making these flexible machines actually usable in the real world.

Summary updated

Abstract

Soft-bodied robots have the advantages of high flexibility and multiple degrees of freedom and have promising applications in exploring complex unstructured environments. Kinematic coupling exists for the soft robot in a problematic space environment for motion planning between the soft robot arm segments. In solving the soft robot inverse kinematics, there are only solutions or even no solutions, and soft robot obstacle avoidance control is tough to exist, as other problems. In this paper, we use the segmental constant curvature assumption to derive the positive and negative kinematic relationships and design the tip self-growth algorithm to reduce the difficulty of solving the parameters in the inverse kinematics of the soft robot to avoid kinematic coupling. Finally, by combining the improved particle swarm algorithm to optimize the paths, the convergence speed and reconciliation accuracy of the algorithm are further accelerated. The simulation results prove that the method can successfully move the soft robot in complex space with high computational efficiency and high accuracy, which verifies the effectiveness of the research.
BibTeX
@inproceedings{liu2023path,
  author = {Hongwei Liu and Yang Jiang and Manlu Liu and Xinbin Zhang and Jianwen Huo and Haoxiang Su},
  title = {{Path planning with obstacle avoidance for soft robots based on improved particle swarm optimization algorithm}},
  booktitle = {Intelligence},
  year = {2023},
  doi = {10.20517/ir.2023.31},
}
Figure