It appears you don't have support to open PDFs in this web browser. To view this file, Open with your PDF reader
Abstract
Background and purpose
The KangDuo Surgical Robot-01 (KD-SR-01) system is a recently introduced robot-assisted endoscopic surgical device originally designed in China. The purpose of this prospective cohort study was to ascertain whether the KD-SR-01 system was substantially equivalent to a comparable robotic device in terms of safety, efficacy and treatment costs during colorectal cancer resection, and evaluate the learning curve of KangDuo robotic surgery.
Method
From October 2022 to May 2023, 50 patients (aged 18–80 years) with colorectal cancer were enrolled and randomly assigned to either the KangDuo group (KD-SR group; 26 patients) or the Da Vinci group (DV group; 24 patients). The primary endpoints were surgical success and conversion rates. In addition, cumulative summation (CUSUM) was used to plot the learning curve of KangDuo robot-assisted colorectal surgery and identify turning point (TP) case.
Results
The two cohorts both successfully completed the procedure without any conversion to open or laparoscopic surgery. Time to first flatus and incidence of perioperative adverse events were equivalent between the KD-SR and DV groups. Additionally, no disparities were observed in pathological outcomes. Duration of operation and console time of the KD-SR group were significantly longer than those of the DV group. However, DV group had higher total hospitalization costs. With CUSUM analysis, TP for docking time, console time and duration of operation of KD-SR group were seen at the 11th case.
Conclusion
Considering the complexity of the procedure, KangDuo robot-assisted colorectal cancer surgery is safe and reproducible for the surgical management of colorectal cancer. In addition, 11 procedures seem to be the number required to reach the learning curve plateau in terms of operative time by the experienced surgeon.
Trial registration
The study was registered at www.chictr.org.cn (Registration number: ChiCTR2200063172, Data of Registration: 2022-09-01).
You have requested "on-the-fly" machine translation of selected content from our databases. This functionality is provided solely for your convenience and is in no way intended to replace human translation. Show full disclaimer
Neither ProQuest nor its licensors make any representations or warranties with respect to the translations. The translations are automatically generated "AS IS" and "AS AVAILABLE" and are not retained in our systems. PROQUEST AND ITS LICENSORS SPECIFICALLY DISCLAIM ANY AND ALL EXPRESS OR IMPLIED WARRANTIES, INCLUDING WITHOUT LIMITATION, ANY WARRANTIES FOR AVAILABILITY, ACCURACY, TIMELINESS, COMPLETENESS, NON-INFRINGMENT, MERCHANTABILITY OR FITNESS FOR A PARTICULAR PURPOSE. Your use of the translations is subject to all use restrictions contained in your Electronic Products License Agreement and by using the translation functionality you agree to forgo any and all claims against ProQuest or its licensors for your use of the translation functionality and any output derived there from. Hide full disclaimer