Planning Nonlinear Access Paths for Temporal Bone Surgery
Johannes Fauser, Georgios Sakas, Anirban Mukhopadhyay

TL;DR
This paper introduces fast, accurate nonlinear path planning methods for temporal bone surgery, improving safety and outcomes by optimizing trajectories around sensitive structures using advanced motion planning algorithms.
Contribution
The paper presents novel k-RRT-Connect algorithms tailored for nonlinear surgical path planning in SE(3), outperforming existing methods in accuracy and computational efficiency.
Findings
k-RRT-Connect outperforms state-of-the-art methods in real patient data
Algorithms achieve faster planning times suitable for intra-operative use
Demonstrated improved safety margins in simulated surgical trajectories
Abstract
Purpose: Interventions at the otobasis operate in the narrow region of the temporal bone where several highly sensitive organs define obstacles with minimal clearance for surgical instruments. Nonlinear trajectories for potential minimally-invasive interventions can provide larger distances to risk structures and optimized orientations of surgical instruments, thus improving clinical outcomes when compared to existing linear approaches. In this paper, we present fast and accurate planning methods for such nonlinear access paths. Methods: We define a specific motion planning problem in SE(3) = R3 x SO(3) with notable constraints in computation time and goal pose that reflect the requirements of temporal bone surgery.We then present k-RRT-Connect: two suitable motion planners based on bidirectional Rapidly-exploring Random Trees (RRT) to solve this problem efficiently. Results: The…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
