In this paper, we present a method to initialize at a feasible point and unfailingly solve a non-convex optimization problem in which a set-point motion is planned for a multi-link manipulator under state and control constraints. We construct an initial feasible solution by analyzing the final time effect for feasibility problems of flatness based motion planning problems. More specifically, we first find a feasible time-optimal trajectory under state constraints without a control constraint by solving a linear programming problem. Then, we find a feasible trajectory under control constraints by scaling the trajectory. To evaluate the practical applicability of the proposed method, we did numerical experiments to solve a multi-link manipulator motion planning problem by combining the method with recursive inverse dynamics algorithms.
The differential flatness concept was proposed by @cite_11 . Flatness has been studied from the viewpoint of motion planning problems @cite_18 . @cite_8 developed a convex programming algorithm for a motion planning problem under semi-infinite inequality constraints by approximating a feasible region to a convex polytope. Van @cite_7 developed a method to approximate polynomial semi-infinite inequality constraints by using the convex hull property of B-splines @cite_15 . Furthermore, they applied the methods to a flexible robot arm planning problem @cite_9 . We follow this line of research further and tackle more practical problem settings on the basis of more complex dynamics.
@cite_18 @cite_7 @cite_8 @cite_9 @cite_15 @cite_11
2098022952 1508155872 1553106265 2065297540
Flat systems, an important subclass of nonlinear control systems introduced via differential-algebraic methods, are defined in a differential geometric framework. We utilize the infinite dimensional geometry developed by Vinogradov and coworkers: a control system is a diffiety, or more precisely, an ordinary diffiety, i.e. a smooth infinite-dimensional manifold equipped with a privileged vector field. After recalling the definition of a Lie-Backlund mapping, we say that two systems are equivalent if they are related by a Lie-Backlund isomorphism. Flat systems are those systems which are equivalent to a controllable linear one. The interest of such an abstract setting relies mainly on the fact that the above system equivalence is interpreted in terms of endogenous dynamic feedback. The presentation is as elementary as possible and illustrated by the VTOL aircraft. This research deals with the computation of optimal trajectories considering state and input constraints for linear and nonlinear systems that admit a polynomial representation through differential flatness. Based on a polynomial spline parameterization of the flat output an optimization problem in terms of the B-spline coefficients is derived that guarantees constraint satisfaction over the entire time horizon whereas classical approaches in the literature only impose the constraints on a finite time grid. As the proposed constraints are only sufficient conditions, a novel method is presented that effectively reduces their conservatism. Two numerical examples, a linear benchmark tracking problem and an optimal quadrotor maneuver, illustrate the efficiency and practicality of the presented method. Abstract. When optimizing the performance of constrained robotic system, the motion trajectory plays a crucial role. In this research the motion planning problem for systems that admit a polynomial description of the system dynamics through differential flatness is tackled by parameterizing the system's so-called flat output as a polynomial spline. Using basic properties of B-splines, sufficient conditions on the spline coefficients are derived ensuring satisfaction of the operating constraints over the entire time horizon. Furthermore, an intuitive relaxation is proposed to tackle conservatism and a supporting software package is released. Finally, to illustrate the overall approach and potential, a numerical benchmark of a flexible link manipulator is discussed. We introduce flat systems, which are equivalent to linear ones via a special type of feedback called endogenous. Their physical properties are subsumed by a linearizing output and they might be regarded as providing another nonlinear extension of Kalman's controllability. The distance to flatness is measured by a non-negative integer, the defect. We utilize differential algebra where flatness- and defect are best defined without distinguishing between input, state, output and other variables. Many realistic classes of examples are flat. We treat two popular ones: the crane and the car with n trailers, the motion planning of which is obtained via elementary properties of plane curves. The three non-flat examples, the simple, double and variable length pendulums, are borrowed from non-linear physics. A high frequency control strategy is proposed such that the averaged systems become flat.