Shortest path planning for a tethered robot
type: Item
instance of: scholarly article
title: Shortest path planning for a tethered robot
zbMATH Open document ID: 1371.70004
author: Peter Brass
author: Ivo Vigan
author: Ning Xu
published in: Computational Geometry
publication date: 2016-01-15T00:00:00Z
Mathematics Subject Classification ID: 70B15
Mathematics Subject Classification ID: 68W30
Mathematics Subject Classification ID: 70E60
zbMATH DE Number: 6531084
zbMATH Keywords: shortest path planning
zbMATH Keywords: tethered robots
MaRDI profile type: Publication
full work available at URL: j.comgeo.2015.06.004
OpenAlex ID: W2205533919
cites work: Computing homotopic shortest paths in the plane
cites work: Q4252291
cites work: Optimal Shortest Path and Minimum-Link Path Queries between Two Convex Polygons inside a Simple Polygonal Obstacle
cites work: Optimal shortest path queries in a simple polygon
cites work: Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons
cites work: Computing minimum length paths of a given homotopy class
cites work: An Optimal Algorithm for Euclidean Shortest Paths in the Plane
cites work: Fast triangulation of the plane with respect to simple polygons
cites work: Homotopic Path Planning on Manifolds for Cabled Mobile Robots
cites work: An efficient algorithm for Euclidean shortest paths among polygonal obstacles in the plane
cites work: Euclidean shortest paths in the presence of rectilinear barriers
cites work: SHORTEST PATHS AMONG OBSTACLES IN THE PLANE
DOI: 10.1016/J.COMGEO.2015.06.004
description: scientific article; zbMATH DE number 6531084