A Cross-Entropy Motion Planning Framework for Hybrid Continuum Robots

The sampling-based motion planners, including the Rapidly-exploring Random Trees (RRT) algorithms, are widely utilized in continuum robots, enabling efficient search for feasible motion plans in constrained environments. In surgical robotics, complex mapping among the high-dimensional kinematics of...

Full description

Saved in:
Bibliographic Details
Published inIEEE robotics and automation letters Vol. 8; no. 12; pp. 8200 - 8207
Main Authors Chen, Jibiao, Yan, Junyan, Qiu, Yufu, Fang, Haiyang, Chen, Jianghua, Cheng, Shing Shin
Format Journal Article
LanguageEnglish
Published Piscataway IEEE 01.12.2023
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subjects
Online AccessGet full text

Cover

Loading…
More Information
Summary:The sampling-based motion planners, including the Rapidly-exploring Random Trees (RRT) algorithms, are widely utilized in continuum robots, enabling efficient search for feasible motion plans in constrained environments. In surgical robotics, complex mapping among the high-dimensional kinematics of continuum robots, trajectory parameterization, and path redundancy may lead to non-optimal motion path, which in turn affects their efficiency and surgical task performance (e.g. path following), and ultimately the patient outcome. In this letter, a cross-entropy (CE) motion planning framework is proposed for continuum robots, wherein the RRT * planner is equipped with a CE estimation method serving as a probabilistic model to sample elite trajectories with optimal computation costs. It can asymptotically optimize the sampling distributions among individuals in terms of either robot states or parameterized trajectories. The presented CE motion planners were implemented on a hybrid continuum robot to enable obstacle avoidance, approximate follow-the-leader (FTL) motion, and navigation in a clinical scenario. They are shown to offer lower sampling cost and higher computational efficiency compared to existing approaches.
ISSN:2377-3766
2377-3766
DOI:10.1109/LRA.2023.3325777