Shortest path planning for a tethered robot

DOI10.1016/j.comgeo.2015.06.004zbMath1371.70004OpenAlexW2205533919MaRDI QIDQ904114

Peter Brass, Ivo Vigan, Ning Xu

Publication date: 15 January 2016

Published in: Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.comgeo.2015.06.004

zbMATH Keywords

shortest path planningtethered robots

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Kinematics of mechanisms and robots (70B15) Robot dynamics and control of rigid bodies (70E60)

Related Items

General variable neighborhood search for the minimum stretch spanning tree problem

Cites Work

• Unnamed Item
• Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons
• Computing minimum length paths of a given homotopy class
• An efficient algorithm for Euclidean shortest paths among polygonal obstacles in the plane
• Optimal shortest path queries in a simple polygon
• Homotopic Path Planning on Manifolds for Cabled Mobile Robots
• Euclidean shortest paths in the presence of rectilinear barriers
• Fast triangulation of the plane with respect to simple polygons
• An Optimal Algorithm for Euclidean Shortest Paths in the Plane
• Optimal Shortest Path and Minimum-Link Path Queries between Two Convex Polygons inside a Simple Polygonal Obstacle
• Computing homotopic shortest paths in the plane
• SHORTEST PATHS AMONG OBSTACLES IN THE PLANE