Convex Optimization Approach To Optimal Trajectory Planning For Robotic Manipulators PDF Download

Are you looking for read ebook online? Search for your book and save it on your Kindle device, PC, phones or tablets. Download Convex Optimization Approach To Optimal Trajectory Planning For Robotic Manipulators PDF full book. Access full book title Convex Optimization Approach To Optimal Trajectory Planning For Robotic Manipulators.

Exploiting Direct Optimal Control for Motion Planning in Unstructured Environments

Exploiting Direct Optimal Control for Motion Planning in Unstructured Environments
Author: Kristoffer Bergman
Publisher: Linköping University Electronic Press
Total Pages: 60
Release: 2021-03-16
Genre: Electronic books
ISBN: 9179296777

Download Exploiting Direct Optimal Control for Motion Planning in Unstructured Environments Book in PDF, ePub and Kindle

During the last decades, motion planning for autonomous systems has become an important area of research. The high interest is not the least due to the development of systems such as self-driving cars, unmanned aerial vehicles and robotic manipulators. The objective in optimal motion planning problems is to find feasible motion plans that also optimize a performance measure. From a control perspective, the problem is an instance of an optimal control problem. This thesis addresses optimal motion planning problems for complex dynamical systems that operate in unstructured environments, where no prior reference such as road-lane information is available. Some example scenarios are autonomous docking of vessels in harbors and autonomous parking of self-driving tractor-trailer vehicles at loading sites. The focus is to develop optimal motion planning algorithms that can reliably be applied to these types of problems. This is achieved by combining recent ideas from automatic control, numerical optimization and robotics. The first contribution is a systematic approach for computing local solutions to motion planning problems in challenging unstructured environments. The solutions are computed by combining homotopy methods and direct optimal control techniques. The general principle is to define a homotopy that transforms, or preferably relaxes, the original problem to an easily solved problem. The approach is demonstrated in motion planning problems in 2D and 3D environments, where the presented method outperforms a state-of-the-art asymptotically optimal motion planner based on random sampling. The second contribution is an optimization-based framework for automatic generation of motion primitives for lattice-based motion planners. Given a family of systems, the user only needs to specify which principle types of motions that are relevant for the considered system family. Based on the selected principle motions and a selected system instance, the framework computes a library of motion primitives by simultaneously optimizing the motions and the terminal states. The final contribution of this thesis is a motion planning framework that combines the strengths of sampling-based planners with direct optimal control in a novel way. The sampling-based planner is applied to the problem in a first step using a discretized search space, where the system dynamics and objective function are chosen to coincide with those used in a second step based on optimal control. This combination ensures that the sampling-based motion planner provides a feasible motion plan which is highly suitable as warm-start to the optimal control step. Furthermore, the second step is modified such that it also can be applied in a receding-horizon fashion, where the proposed combination of methods is used to provide theoretical guarantees in terms of recursive feasibility, worst-case objective function value and convergence to the terminal state. The proposed motion planning framework is successfully applied to several problems in challenging unstructured environments for tractor-trailer vehicles. The framework is also applied and tailored for maritime navigation for vessels in archipelagos and harbors, where it is able to compute energy-efficient trajectories which complies with the international regulations for preventing collisions at sea.


Primal-dual Interior-Point Methods

Primal-dual Interior-Point Methods
Author: Stephen J. Wright
Publisher: SIAM
Total Pages: 309
Release: 1997-01-01
Genre: Interior-point methods
ISBN: 9781611971453

Download Primal-dual Interior-Point Methods Book in PDF, ePub and Kindle

In the past decade, primal-dual algorithms have emerged as the most important and useful algorithms from the interior-point class. This book presents the major primal-dual algorithms for linear programming in straightforward terms. A thorough description of the theoretical properties of these methods is given, as are a discussion of practical and computational aspects and a summary of current software. This is an excellent, timely, and well-written work. The major primal-dual algorithms covered in this book are path-following algorithms (short- and long-step, predictor-corrector), potential-reduction algorithms, and infeasible-interior-point algorithms. A unified treatment of superlinear convergence, finite termination, and detection of infeasible problems is presented. Issues relevant to practical implementation are also discussed, including sparse linear algebra and a complete specification of Mehrotra's predictor-corrector algorithm. Also treated are extensions of primal-dual algorithms to more general problems such as monotone complementarity, semidefinite programming, and general convex programming problems.


On Motion Planning Using Numerical Optimal Control

On Motion Planning Using Numerical Optimal Control
Author: Kristoffer Bergman
Publisher: Linköping University Electronic Press
Total Pages: 91
Release: 2019-05-28
Genre:
ISBN: 9176850579

Download On Motion Planning Using Numerical Optimal Control Book in PDF, ePub and Kindle

During the last decades, motion planning for autonomous systems has become an important area of research. The high interest is not the least due to the development of systems such as self-driving cars, unmanned aerial vehicles and robotic manipulators. In this thesis, the objective is not only to find feasible solutions to a motion planning problem, but solutions that also optimize some kind of performance measure. From a control perspective, the resulting problem is an instance of an optimal control problem. In this thesis, the focus is to further develop optimal control algorithms such that they be can used to obtain improved solutions to motion planning problems. This is achieved by combining ideas from automatic control, numerical optimization and robotics. First, a systematic approach for computing local solutions to motion planning problems in challenging environments is presented. The solutions are computed by combining homotopy methods and numerical optimal control techniques. The general principle is to define a homotopy that transforms, or preferably relaxes, the original problem to an easily solved problem. The approach is demonstrated in motion planning problems in 2D and 3D environments, where the presented method outperforms both a state-of-the-art numerical optimal control method based on standard initialization strategies and a state-of-the-art optimizing sampling-based planner based on random sampling. Second, a framework for automatically generating motion primitives for lattice-based motion planners is proposed. Given a family of systems, the user only needs to specify which principle types of motions that are relevant for the considered system family. Based on the selected principle motions and a selected system instance, the algorithm not only automatically optimizes the motions connecting pre-defined boundary conditions, but also simultaneously optimizes the terminal state constraints as well. In addition to handling static a priori known system parameters such as platform dimensions, the framework also allows for fast automatic re-optimization of motion primitives if the system parameters change while the system is in use. Furthermore, the proposed framework is extended to also allow for an optimization of discretization parameters, that are are used by the lattice-based motion planner to define a state-space discretization. This enables an optimized selection of these parameters for a specific system instance. Finally, a unified optimization-based path planning approach to efficiently compute locally optimal solutions to advanced path planning problems is presented. The main idea is to combine the strengths of sampling-based path planners and numerical optimal control. The lattice-based path planner is applied to the problem in a first step using a discretized search space, where system dynamics and objective function are chosen to coincide with those used in a second numerical optimal control step. This novel tight combination of a sampling-based path planner and numerical optimal control makes, in a structured way, benefit of the former method’s ability to solve combinatorial parts of the problem and the latter method’s ability to obtain locally optimal solutions not constrained to a discretized search space. The proposed approach is shown in several practically relevant path planning problems to provide improvements in terms of computation time, numerical reliability, and objective function value.


On the Time-optimal Trajectory Planning Along Predetermined Geometric Paths and Optimal Control Synthesis for Trajectory Tracking of Robot Manipulators

On the Time-optimal Trajectory Planning Along Predetermined Geometric Paths and Optimal Control Synthesis for Trajectory Tracking of Robot Manipulators
Author: Pedro Reynoso Mora
Publisher:
Total Pages: 115
Release: 2013
Genre:
ISBN:

Download On the Time-optimal Trajectory Planning Along Predetermined Geometric Paths and Optimal Control Synthesis for Trajectory Tracking of Robot Manipulators Book in PDF, ePub and Kindle

In this dissertation, we study two important subjects in robotics: (i) time-optimal trajectory planning, and (ii) optimal control synthesis methodologies for trajectory tracking. In the first subject, we concentrate on a rather specific sub-class of problems, the time-optimal trajectory planning along predetermined geometric paths. In this kind of problem, a purely geometric path is already known, and the task is to find out how to move along this path in the shortest time physically possible. In order to generate the true fastest solutions achievable by the actual robot manipulator, the complete nonlinear dynamic model should be incorporated into the problem formulation as a constraint that must be satisfied by the generated trajectories and feedforward torques. This important problem was studied in the 1980s, with many related methods for addressing it based on the so-called velocity limit curve and variational methods. Modern formulations directly discretize the problem and obtain a large-scale mathematical optimization problem, which is a prominent approach to tackle optimal control problems that has gained popularity over variational methods, mainly because it allows to obtain numerical solutions for harder problems. We contribute to the referred problem of time-optimal trajectory planning, by extending and improving the existing mathematical optimization formulations. We successfully incorporate the complete nonlinear dynamic model, including viscous friction because for the fastest motions it becomes even more significant than Coulomb friction; of course, Coulomb friction is likewise accommodated for in our formulation. We develop a framework that guarantees exact dynamic feasibility of the generated time-optimal trajectories and feedforward torques. Our initial formulation is carefully crafted in a rather specific manner, so that it allows to naturally propose a convex relaxation that solves exactly the original problem formulation, which is non-convex and therefore hard to solve. In order to numerically solve the proposed formulation, a discretization scheme is also developed. Unlike traditional and modern formulations, we motivate the incorporation of additional criteria to our original formulation, with simulation and experimental studies of three crucial variables for a 6-axis industrial manipulator. Namely, the resulting applied torques, the readings of a 3-axis accelerometer mounted at the manipulator end-effector, and the detrimental effects on the tracking errors induced by pure time-optimal solutions. We therefore emphasize the significance of penalizing a measure of total jerk and of imposing acceleration constraints. These two criteria are incorporated without destroying convexity. The final formulation generates near time-optimal trajectories and feedforward torques with traveling times that are slightly larger than those of pure time-optimal solutions. Nevertheless, the detrimental effects induced by pure time-optimality are eliminated. Experimental results on a 6-axis industrial manipulator confirm that our formulation generates the fastest solutions that can actually be implemented in the real robot manipulator. Following the work done on near time-optimal trajectories, we explore two controller synthesis methodologies for trajectory tracking, which are more suitable to achieve trajectory-tracking under such fast trajectories. In the first approach, we approximate the discrete-time nonlinear dynamics of robot manipulators, moving along the state-reference trajectory, as an affine time-varying (ATV) dynamical system in discrete-time. Therefore, the problem of trajectory tracking for robot manipulators is posed as a linear quadratic (LQ) optimal control problem for a class of discrete-time ATV dynamical systems. Then, an ATV control law to achieve trajectory tracking on the ATV system is developed, which uses LQ methods for linear time-varying (LTV) systems. Since the ATV dynamical system approximates the nonlinear robot dynamics along the state-reference trajectory, the resulting time-varying control law is suitable to achieve trajectory tracking on the robot manipulator. The ATV control law is implemented in experiments for the 6-axis industrial manipulator, tracking the near time-optimal trajectory. Experimental results verify the better performance achieved with the ATV control law, but also expose its shortcomings. The second approach to address trajectory tracking is related in spirit, but different in crucial aspects, which ultimately endow this approach with its superior features. In this novel approach, the highly nonlinear dynamic model of robot manipulators, moving along a state-reference trajectory, is approximated as a class of piecewise affine (PWA) dynamical systems. We propose a framework to construct the referred PWA system, which consists in: (i) choosing strategic operating points on the state-reference trajectory with their respective (local) linearized system dynamics, (ii) constructing ellipsoidal regions centered at the operating points, whose purpose is to facilitate the scheduling strategy of controller gains designed for each local dynamics. Likewise, in order to switch controller gains as the robot state traverses in the direction of the state-reference trajectory, a simple scheduling strategy is proposed. The controller synthesis near each operating point is an LQR-type that takes into account the local coupled dynamics. The referred PWA control law is implemented in experiments for the 6-axis manipulator tracking the near time-optimal trajectory. The experimental results show the feasibility and superiority of the PWA control law over the typical PID controller and the ATV control law.


Practical Methods for Optimal Control Using Nonlinear Programming, Third Edition

Practical Methods for Optimal Control Using Nonlinear Programming, Third Edition
Author: John T. Betts
Publisher: SIAM
Total Pages: 748
Release: 2020-07-09
Genre: Mathematics
ISBN: 1611976197

Download Practical Methods for Optimal Control Using Nonlinear Programming, Third Edition Book in PDF, ePub and Kindle

How do you fly an airplane from one point to another as fast as possible? What is the best way to administer a vaccine to fight the harmful effects of disease? What is the most efficient way to produce a chemical substance? This book presents practical methods for solving real optimal control problems such as these. Practical Methods for Optimal Control Using Nonlinear Programming, Third Edition focuses on the direct transcription method for optimal control. It features a summary of relevant material in constrained optimization, including nonlinear programming; discretization techniques appropriate for ordinary differential equations and differential-algebraic equations; and several examples and descriptions of computational algorithm formulations that implement this discretize-then-optimize strategy. The third edition has been thoroughly updated and includes new material on implicit Runge–Kutta discretization techniques, new chapters on partial differential equations and delay equations, and more than 70 test problems and open source FORTRAN code for all of the problems. This book will be valuable for academic and industrial research and development in optimal control theory and applications. It is appropriate as a primary or supplementary text for advanced undergraduate and graduate students.


Time-Optimal Trajectory Planning for Redundant Robots

Time-Optimal Trajectory Planning for Redundant Robots
Author: Alexander Reiter
Publisher: Springer
Total Pages: 100
Release: 2016-03-11
Genre: Technology & Engineering
ISBN: 3658127015

Download Time-Optimal Trajectory Planning for Redundant Robots Book in PDF, ePub and Kindle

This master’s thesis presents a novel approach to finding trajectories with minimal end time for kinematically redundant manipulators. Emphasis is given to a general applicability of the developed method to industrial tasks such as gluing or welding. Minimum-time trajectories may yield economic advantages as a shorter trajectory duration results in a lower task cycle time. Whereas kinematically redundant manipulators possess increased dexterity, compared to conventional non-redundant manipulators, their inverse kinematics is not unique and requires further treatment. In this work a joint space decomposition approach is introduced that takes advantage of the closed form inverse kinematics solution of non-redundant robots. Kinematic redundancy can be fully exploited to achieve minimum-time trajectories for prescribed end-effector paths.


Semi-Infinite Programming

Semi-Infinite Programming
Author: Rembert Reemtsen
Publisher: Springer Science & Business Media
Total Pages: 418
Release: 2013-03-14
Genre: Computers
ISBN: 1475728689

Download Semi-Infinite Programming Book in PDF, ePub and Kindle

Semi-infinite programming (briefly: SIP) is an exciting part of mathematical programming. SIP problems include finitely many variables and, in contrast to finite optimization problems, infinitely many inequality constraints. Prob lems of this type naturally arise in approximation theory, optimal control, and at numerous engineering applications where the model contains at least one inequality constraint for each value of a parameter and the parameter, repre senting time, space, frequency etc., varies in a given domain. The treatment of such problems requires particular theoretical and numerical techniques. The theory in SIP as well as the number of numerical SIP methods and appli cations have expanded very fast during the last years. Therefore, the main goal of this monograph is to provide a collection of tutorial and survey type articles which represent a substantial part of the contemporary body of knowledge in SIP. We are glad that leading researchers have contributed to this volume and that their articles are covering a wide range of important topics in this subject. It is our hope that both experienced students and scientists will be well advised to consult this volume. We got the idea for this volume when we were organizing the semi-infinite pro gramming workshop which was held in Cottbus, Germany, in September 1996.