Convex strategies for trajectory optimisation: application to the Polytope Traversal Problem

09/16/2021
by   Steve Tonneau, et al.
0

Non-linear Trajectory Optimisation (TO) methods require good initial guesses to converge to a locally optimal solution. A feasible guess can often be obtained by allocating a large amount of time for the trajectory to complete. However for unstable dynamical systems such as humanoid robots, this quasi-static assumption does not always hold. We propose a conservative formulation of the TO problem that simultaneously computes a feasible path and its time allocation. The problem is solved as an efficient convex optimisation problem guaranteed to converge to a locally optimal solution. The interest of the approach is illustrated with the computation of feasible trajectories that traverse sequentially a sequence of polytopes. We demonstrate that on instances of the problem where the quasi static solutions are not admissible, our approach is able to find a feasible solution with a success rate above 80 % in all the scenarios considered, in less than 10ms for problems involving traversing less than 5 polytopes and less than 1s for problems involving 20 polytopes, thus demonstrating its ability to reliably provide initial guesses to advanced non linear solvers.

READ FULL TEXT
research
05/14/2020

Surrogate Assisted Optimisation for Travelling Thief Problems

The travelling thief problem (TTP) is a multi-component optimisation pro...
research
10/19/2020

Robust Asymptotically Locally Optimal UAV-Trajectory Generation Based on Spline Subdivision

Generating locally optimal UAV-trajectories is challenging due to the no...
research
10/14/2017

Hybrid DDP in Clutter (CHDDP): Trajectory Optimization for Hybrid Dynamical System in Cluttered Environments

We present an algorithm for obtaining an optimal control policy for hybr...
research
04/22/2019

Inducing Multi-Convexity in Path Constrained Trajectory Optimization for Mobile Manipulators

In this paper, we propose a novel trajectory optimization algorithm for ...
research
08/08/2023

Path Signatures for Diversity in Probabilistic Trajectory Optimisation

Motion planning can be cast as a trajectory optimisation problem where a...
research
07/25/2019

GAMA: A Novel Algorithm for Non-Convex Integer Programs

Inspired by the decomposition in the hybrid quantum-classical optimizati...
research
09/27/2021

GPU Accelerated Batch Multi-Convex Trajectory Optimization for a Rectangular Holonomic Mobile Robot

We present a batch trajectory optimizer that can simultaneously solve hu...

Please sign up or login with your details

Forgot password? Click here to reset