An official website of the United States government
Multisection continuum arms are bio-inspired manipulators that combine compliance, payload, dexterity, and safety to serve as co-robots in human-robot collaborative domains. Their hyper redundancy and complex kinematics, however, pose many challenges when performing path planning, especially in dynamic environments. In this paper, we present a W-Space based Rapidly Exploring Random Trees * path planner for multisection continuum arm robots in dynamic environments. The proposed planner improves the existing state-of-art planners in terms of computation time and the success rate, while removing the need for offline computation. On average, the computation time of our approach is below 2 seconds, and its average success rate is around 70 %. The computation time of the proposed planner significantly improves that of the state-of-the-art planner by roughly a factor of 20, making the former suitable for real-time applications. Moreover, for application domains where the obstacle motion is not very predictable (e.g., human obstacles), the proposed planner significantly improves the success rate of state-of-the-art planners by nearly 50 %. Lastly, we demonstrate the feasibility of several generated trajectories by replicating the motion on a physical prototype arm.
more »
« less
Smooth Path Planning for Continuum Arms
Continuum arms, with their mix of compliance, payload, safety, and manipulability, are perfectly suited to serve as co-robots, and their applications range from industry and manufacturing to human healthcare. Their hyper-redundancy serves as their most significant challenge for path planning and path planning approaches commonly used with rigid-link robots, such as inverse kinematics, that fail to provide reliable trajectories for continuum arms. We propose an Inverse Kinematics-based approach to address the limitations of previously-proposed Kinematics-based approaches. Using this new approach, we are able to efficiently generate very rich sets of configurations, which, in turn, lead to smooth path planning for such continuum manipulators. To validate the smoothness of the paths generated by our approach, we apply dynamics constraints to the generated trajectories. We show that, when tracked by a controller, the paths that are generated using the proposed approach are much smoother than previously-proposed Kinematics-based approaches: The proposed approach allows the continuum arm to traverse the trajectories very accurately and in time less than half of that taken by previous (reliable) path planning approaches.
more »
« less
- PAR ID:
- 10388855
- Date Published:
- Journal Name:
- IEEE International Conference on Robotics and Automation (ICRA)
- Page Range / eLocation ID:
- 7809 to 7814
- Format(s):
- Medium: X
- Sponsoring Org:
- National Science Foundation
More Like this
-
-
We study the path planning problem for continuum-arm robots, in which we are given a starting and an end point, and we need to compute a path for the tip of the continuum arm between the two points. We consider both cases where obstacles are present and where they are not. We demonstrate how to leverage the continuum arm features to introduce a new model that enables a path planning approach based on the configurations graph, for a continuum arm consisting of three sections, each consisting of three muscle actuators. The algorithm we apply to the configurations graph allows us to exploit parallelism in the computation to obtain efficient implementation. We conducted extensive tests, and the obtained results show the completeness of the proposed algorithm under the considered discretizations, in both cases where obstacles are present and where they are not. We compared our approach to the standard inverse kinematics approach. While the inverse kinematics approach is much faster when successful, our algorithm always succeeds in finding a path or reporting that no path exists, compared to a roughly 70% success rate of the inverse kinematics approach (when a path exists).more » « less
-
Continuum arms are more adaptable to their environments and inherently human-friendly compared to their rigid counterparts. Path planning of continuum arms is an active research area with many challenges. The hyper-redundancy of continuum arms, which renders them highly versatile, is their curse in path planning. This problem becomes even more challenging in dynamic environments in the presence of mobile obstacles. In this paper, we propose an anticipatory path planning approach for continuum arms in dynamic environments. Our approach is based on obstacle prediction coupled with temporal graphs to model the dynamic environment. We evaluate the proposed approach’s performance and compare it to prevailing path planning approaches for continuum arms in dynamic environments.more » « less
-
We present a discrete-optimization technique for finding feasible robot arm trajectories that pass through provided 6-DOF Cartesian-space end-effector paths with high accuracy, a problem called pathwise-inverse kinematics. The output from our method consists of a path function of joint-angles that best follows the provided end-effector path function, given some definition of ``best''. Our method, called Stampede, casts the robot motion translation problem as a discrete-space graph-search problem where the nodes in the graph are individually solved for using non-linear optimization; framing the problem in such a way gives rise to a well-structured graph that affords an effective best path calculation using an efficient dynamic-programming algorithm. We present techniques for sampling configuration space, such as diversity sampling and adaptive sampling, to construct the search-space in the graph. Through an evaluation, we show that our approach performs well in finding smooth, feasible, collision-free robot motions that match the input end-effector trace with very high accuracy, while alternative approaches, such as a state-of-the-art per-frame inverse kinematics solver and a global non-linear trajectory-optimization approach, performed unfavorably.more » « less
-
Safe path planning is critical for bipedal robots to operate in safety-critical environments. Common path planning algorithms, such as RRT or RRT*, typically use geometric or kinematic collision check algorithms to ensure collision-free paths toward the target position. However, such approaches may generate non-smooth paths that do not comply with the dynamics constraints of walking robots. It has been shown that the control barrier function (CBF) can be integrated with RRT/RRT* to synthesize dynamically feasible collision-free paths. Yet, existing work has been limited to simple circular or elliptical shape obstacles due to the challenging nature of constructing appropriate barrier functions to represent irregularly shaped obstacles. In this paper, we present a CBF-based RRT* algorithm for bipedal robots to generate a collision-free path through space with multiple polynomial-shaped obstacles. In particular, we used logistic regression to construct polynomial barrier functions from a grid map of the environment to represent irregularly shaped obstacles. Moreover, we developed a multi-step CBF steering controller to ensure the efficiency of free space exploration. The proposed approach was first validated in simulation for a differential drive model, and then experimentally evaluated with a 3D humanoid robot, Digit, in a lab setting with randomly placed obstacles.more » « less
- Free Publicly Accessible Full Text
-
Accepted Manuscript1.0
- Conference Paper:
- https://doi.org/10.1109/ICRA48506.2021.9560982
