Skip to content

A Method for Manipulator Motion Planning Based on Constructing Graphs of Convex Sets via Gaussian Mixture Models

2026 · IEEE Transactions on Automation Science and Engineering · Vol 23, pp. 13549-13560 · 0 citations · 56 references
Computer Science

Abstract

Motion planning for redundant manipulators in high-dimensional configuration spaces, while simultaneously handling complex obstacles and multiple motion performance constraints, remains a challenge. In this article, a motion planning method for manipulators based on a Graphs of Convex Sets constructed via Gaussian Mixture Models (GMM-GCS) is proposed. The free configuration space is approximated by multiple convex sets represented by Gaussian components. These convex sets are further optimized through convex set selection and adjustment, and the remaining convex sets together with their intersection regions are used to construct the Graphs of Convex Sets (GCS). A comprehensive performance index is introduced during the training of Gaussian Mixture Models (GMM) to incorporate motion performance into the GMM-GCS model. A projection-based method is developed to reliably identify both direct and wormhole connections between convex sets in high-dimensional spaces. Motion planning is then performed on the constructed GCS using Dijkstra’s algorithm, followed by path optimization based on the joint probability density of the GMM. Simulation and real-world experiments on 3-DOF, 7-DOF, and 12-DOF manipulators show that the proposed method achieves improved planning efficiency and motion performance over other methods in complex scenarios. Note to Practitioners—This article addresses a practical problem of motion planning for redundant manipulators operated in complex obstacle scenarios, where high-dimensional configuration spaces and multiple motion performance requirements make planning computationally demanding. In real-world applications such as assembly and material handling, planners must not only generate collision-free paths but also ensure desirable motion quality, including smoothness and kinematic feasibility. Traditional methods often struggle to balance efficiency and performance in such scenarios. The proposed GMM-GCS framework approximates the free configuration space using convex sets and organizes them into a GCS for efficient global planning. By incorporating a comprehensive performance index into the modeling process, motion quality is directly considered during space construction. This makes the approach suitable for manipulators with different degrees of freedom in structured scenarios. However, the method relies on prior modeling of the workspace and may require additional updates in highly dynamic settings. Future improvements could focus on adaptive model refinement for changing scenarios.

View source

Similar papers

Nov 2026

Unified Global Formation Path Planning Strategy for Multi-Agent Systems Using Graph of Convex Sets

To enhance the quality and scalability of global formation path planning in multi-agent systems, this letter proposes a unified strategy based on the Graph of Convex Sets (GCS) framework. The formation path planning problem is formulated as a shortest path problem within the GCS framework. The translation-only rigid (T...

Ming-Yu Shen, Qing-Yang Gao, Zhi-Xin Yang et al. · 0 citations
Preprint Aug 2026

Accelerating Optimization over Graphs of Convex Sets via Neural Network Approximations

Motion planning problems such as collision-free navigation and contact-rich manipulation can be naturally formulated as optimization problems that couple discrete decisions with continuous trajectories. The Graphs of Convex Sets (GCS) framework offers a practical solution to these problems. It represents discrete decis...

Ananya Trivedi, Sarvesh Prajapati, Zhe-Xin Xu et al. · 0 citations
Preprint Aug 2026

GCS-Bridging: Restoring Connectivity of Disconnected Convex Sets for Graph-of-Convex-Sets Motion Planning

Graph-of-Convex-Sets (GCS)-based trajectory optimization represents collision-free regions in configuration space as a finite collection of convex sets and directly performs collision-free trajectory planning over these sets, substantially simplifying the planning process. However, existing GCS-based trajectory plannin...

Xiao-Kai Zhou, Bao-Shi Cao, Yang Liu et al. · 0 citations
Preprint Open access Sep 2026

Path Planning with Motion Primitives in Dynamic Environments: SIPP on Lattices

Autonomous navigation in dynamic environments is a critical challenge, particularly when spaces are shared with other mobile agents whose future trajectories are known. While traditional grid-based planners efficiently find collision-free paths, their reliance on stop-and-turn mechanics over $2^k$-connected grids produ...

Marat Agranovskiy · 1 citation
Nov 2026

Distributed Safety-Aware Motion Planning for Dual-Arm Systems via Gaussian Belief Propagation With Application to Catenary Dropper Assembly

With the increasing deployment of dual-arm robots in compact and shared workspaces, generating safety-aware and efficient motion plans for such high-degree-of-freedom (DoF) collaborative systems remains a challenge. Centralized planners suffer from severe computational bottlenecks, while existing distributed optimizati...

Zhao Jin, Feng-Yi Dai, Yi-Xuan Liang et al. · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.