EUVIMEDEUVIMED entdecken
Crossref

Guaranteed Global Optimal Path Planning Through Convex Segmentation and Homotopy Guidance

Wenshan Yan, Xiangrong Xu

IEEE Robotics and Automation Letters · 2026-05 · 11 (5) · 6432-6439

DOI: 10.1109/lra.2026.3669766 ↗

Kurz gefasst

Fachartikel in der Zeitschrift IEEE Robotics and Automation Letters, 2026-05. Verfasst von Wenshan Yan und 1 weiteren Autor:innen. Die Arbeit wurde bisher 1-mal zitiert (Crossref) und nennt 27 Literaturangaben.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

Trajectory planning and optimization in three-dimensional space remains fundamental challenges in high-dimensional motion planning. This paper presents ConvexSegTopoChainOpt (Csto), a trajectory optimization framework that integrates convex decomposition and topological guidance. The proposed method partitions obstacle space into a sequence of connected, collision-free convex polyhedral via geometric decomposition. Homotopy vectors are introduced to enforce topological consistency, ensuring that the trajectory traverses a continuous chain of convex regions. A global convex optimization problem is formulated using an auxiliary variable relaxation strategy, enabling efficient computation of the op-timal trajectory. Csto has been implemented and validated on the Kinova Jaco2 robotic platform, demonstrating its effectiveness in physically realistic experimental settings.

Zitieren

APA

Yan, W., & Xu, X. (2026). Guaranteed Global Optimal Path Planning Through Convex Segmentation and Homotopy Guidance. IEEE Robotics and Automation Letters, 11(5), 6432-6439. https://doi.org/10.1109/lra.2026.3669766

Vancouver

Yan W, Xu X. Guaranteed Global Optimal Path Planning Through Convex Segmentation and Homotopy Guidance. IEEE Robotics and Automation Letters. 2026;11(5):6432-6439. doi:10.1109/lra.2026.3669766

BibTeX
@article{Yan2026,
  author = {Yan, Wenshan and Xu, Xiangrong},
  title = {Guaranteed Global Optimal Path Planning Through Convex Segmentation and Homotopy Guidance},
  journal = {IEEE Robotics and Automation Letters},
  year = {2026},
  volume = {11},
  number = {5},
  pages = {6432--6439},
  doi = {10.1109/lra.2026.3669766}
}
Kostenlos starten →