Path Planning of Surgical Robot for Minimally Invasive Surgery on Riemannian Manifold

Abstract Robotic surgery for minimally invasive surgery can reduce the surgeon’s workload by autonomously guiding robotic forceps. Movement of the robot is restricted around a fixed insertion port. The robot often encounters angle limitations during operation. Also, the surface of the abdominal cavity is non-concave, making it computationally expensive to find the desired path. In this work, to solve these problems, we propose a method for path planning in joint space by transforming the position into a Riemannian manifold. An edge cost function is defined to search for a desired path in the joint space and reduce the range of motion of the joints. We found that the organ is mostly non-concave, making it easy to find the optimal path using gradient descent method. Experimental results demonstrated that the proposed method reduces the range of joint angle movement compared to calculations in position space.

Authors

Institutions

Publication Details

Journal
Research Square
Published
2026-10-29
DOI
https://doi.org/10.21203/rs.3.rs-8081251/v1
Primary Topic
Soft Robotics and Applications
Type
preprint
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
preprint

Path Planning of Surgical Robot for Minimally Invasive Surgery on Riemannian Manifold

Maina Sogabe, Y. Yamamoto, Kenji Kawashima, Shunichi Hirahara et al.
1 links
Research Square
Soft Robotics and Applications
preprint

Path Planning of Surgical Robot for Minimally Invasive Surgery on Riemannian Manifold

Maina Sogabe, Y. Yamamoto, Kenji Kawashima, Shunichi Hirahara, Toshiki Kaisaki, Tetsuro Miyazaki
preprint en

Abstract

Abstract Robotic surgery for minimally invasive surgery can reduce the surgeon’s workload by autonomously guiding robotic forceps. Movement of the robot is restricted around a fixed insertion port. The robot often encounters angle limitations during operation. Also, the surface of the abdominal cavity is non-concave, making it computationally expensive to find the desired path. In this work, to solve these problems, we propose a method for path planning in joint space by transforming the position into a Riemannian manifold. An edge cost function is defined to search for a desired path in the joint space and reduce the range of motion of the joints. We found that the organ is mostly non-concave, making it easy to find the optimal path using gradient descent method. Experimental results demonstrated that the proposed method reduces the range of joint angle movement compared to calculations in position space.

Research Square
National Institute of Informatics (JP), The University of Tokyo (JP)
Good health and well-being
Soft Robotics and Applications
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon
Path Planning of Surgical Robot for Minimally Invasive Surgery on Riemannian Manifold — Maina Sogabe, Y. Yamamoto, et al. · Research Square (2026) | TGRS Research Map | TGRS