scientific article; zbMATH DE number 7685241

MaRDI QIDQ6157950zbMATHFDO

Authors Le Hong Trang, Nguyen Thi Le, Phan Thanh An

Publication date 12 May 2023

Full work available at URL https://arxiv.org/abs/2201.06290

zbMATH Keywords

nonconvex optimizationconvex hullshortest pathgeodesic convexityapproximate algorithmconvex rope

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Nonconvex programming, global optimization (90C26) General topics of discrete mathematics in relation to computer science (68R01) Computational aspects related to convexity (52B55) Convex sets in (2) dimensions (including convex curves) (52A10) Approximation by convex sets (52A27) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18)

Recommendations

• Shortest polygonal paths in space
• Multiple shooting approach for computing approximately shortest paths on convex polytopes
• Publication:4886077
• An algorithm for computing a convex and simple path of bounded curvature in a simple polygon
• Curvature-Constrained Shortest Paths in a Convex Polygon

Cites work

• scientific article; zbMATH DE number 7151640 (Why is no real title available?)
• Blaschke-type theorem and separation of disjoint closed geodesic convex sets
• Direct multiple shooting method for solving approximate shortest path problems
• Euclidean shortest paths in the presence of rectilinear barriers
• Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons
• Multiple shooting approach for computing approximately shortest paths on convex polytopes
• On-line construction of the convex hull of a simple polyline

Cited in

(2)

• scientific article; zbMATH DE number 1877242 (Why is no real title available?)
• Multiple shooting approach for finding approximately shortest paths for autonomous robots in unknown environments in 2D

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6157950)