Altagiuri, Rawad E. H.Zaghloul, Omar H. A.Do, Brian H.Stroppa, Fabio2025-01-152025-01-15202502377-3766https://doi.org/10.1109/LRA.2024.3511405https://hdl.handle.net/20.500.12469/7116Soft growing robots have the potential to be useful for complex manipulation tasks and navigation for inspection or search and rescue. They are designed with plant-like properties, allowing them to evert and steer multiple links and explore cluttered environments. However, this variety of operations results in multiple paths, which is one of the biggest challenges faced by classic pathfinders. In this letter, we propose a motion planner based on A$<^>*$ search specifically designed for soft growing manipulators operating on predetermined static tasks. Furthermore, we implemented a stochastic data structure to reduce the algorithm's complexity as it explores alternative paths. This allows the planner to retrieve optimal solutions over different tasks. We ran demonstrations on a set of three tasks, observing that this stochastic process does not compromise path optimality.eninfo:eu-repo/semantics/closedAccessRobotsManipulatorsRobot KinematicsKinematicsSoft RoboticsNavigationRobot Sensing SystemsPlanningEnd EffectorsStochastic ProcessesConstrained Motion PlanningMotion And Path PlanningSoft Robot ApplicationsArticle516523110WOS:00137576380001610.1109/LRA.2024.35114052-s2.0-85211479103Q2Q1