A research of the obstacle-avoiding problem using the minimum variation B-spline

MaRDI QIDQ2918281zbMATH OpenFDO

Authors Hui Peng, Bi Zeng

Publication date 5 October 2012

Published in Journal of Guangxi University for Nationalities. Natural Science Edition (Search for Journal in Brave)

zbMATH Keywords

B-splineconvexity propertiesminimum variationplanar curvepolygonal chains

Mathematics Subject Classification ID

Numerical interpolation (65D05) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18) Artificial intelligence for robotics (68T40)

Recommendations

• The derivation of cubic splines with obstacles by methods of optimization and optimal control
• Constrained minimum-time path planning for robot manipulators via virtual knots of the cubic B-spline functions
• Mobile robot path planning for fine‐grained and smooth path spcification
• Dynamic interpolation for obstacle avoidance on Riemannian manifolds
• Solving robot trajectory planning problems with uniform cubic B‐splines

Cited in

(1)

• Mobile robot path planning for fine‐grained and smooth path spcification

This page was built for publication: A research of the obstacle-avoiding problem using the minimum variation B-spline

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