Generalized Voronoi Diagram-Guided and Contact-Optimized Motion Planning for Snake Robots

In robot motion planning in a space with obstacles, the goal is to find a collision-free path for robots from the start to the target position. Numerous fundamentally different approaches, and their many variants, address this problem depending on the types of obstacles, the dimensionality of the space and the restrictions on robot movements. We present a hierarchical motion planning framework for snake-like robots navigating cluttered environments. At the global level, a bounded Generalized Voronoi Diagram (GVD) generates a maximal-clearance path through complex terrain. To overcome the limitations of pure avoidance strategies, we incorporate a local trajectory optimization layer that enables Obstacle-Aided Locomotion (OAL). This is realized through a simulation-in-the-loop system in CoppeliaSim, where gait parameters are optimized using Particle Swarm Optimization (PSO) based on contact forces and energy efficiency. By coupling high-level deliberative planning with low-level contact-aware control, our approach enhances both adaptability and locomotion efficiency. Experimental results demonstrate improved motion performance compared to conventional planners that neglect environmental contact.

Authors

Institutions

Publication Details

Journal
Mathematics
Published
2026-01-19
DOI
https://doi.org/10.3390/math14020332
Primary Topic
Robotic Path Planning Algorithms
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Generalized Voronoi Diagram-Guided and Contact-Optimized Motion Planning for Snake Robots

Miloš Šeda, Mhd Ali Shehadeh
Mathematics
Robotic Path Planning Algorithms
article

Generalized Voronoi Diagram-Guided and Contact-Optimized Motion Planning for Snake Robots

Miloš Šeda, Mhd Ali Shehadeh
article en

Abstract

In robot motion planning in a space with obstacles, the goal is to find a collision-free path for robots from the start to the target position. Numerous fundamentally different approaches, and their many variants, address this problem depending on the types of obstacles, the dimensionality of the space and the restrictions on robot movements. We present a hierarchical motion planning framework for snake-like robots navigating cluttered environments. At the global level, a bounded Generalized Voronoi Diagram (GVD) generates a maximal-clearance path through complex terrain. To overcome the limitations of pure avoidance strategies, we incorporate a local trajectory optimization layer that enables Obstacle-Aided Locomotion (OAL). This is realized through a simulation-in-the-loop system in CoppeliaSim, where gait parameters are optimized using Particle Swarm Optimization (PSO) based on contact forces and energy efficiency. By coupling high-level deliberative planning with low-level contact-aware control, our approach enhances both adaptability and locomotion efficiency. Experimental results demonstrate improved motion performance compared to conventional planners that neglect environmental contact.

MathematicsVol. 14(2)
Brno University of Technology (CZ)
Affordable and clean energy
Openalex Percentile: Top 85%
Robotic Path Planning Algorithms
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.

Generalized Voronoi Diagram-Guided and Contact-Optimized Motion Planning for Snake Robots — Miloš Šeda, Mhd Ali Shehadeh · Mathematics (2026) | TGRS Research Map | TGRS