Path Signatures for Diversity in Probabilistic Trajectory Optimisation

• URL: http://arxiv.org/abs/2308.04071v1
• Date: Tue, 8 Aug 2023 06:10:53 GMT
• Title: Path Signatures for Diversity in Probabilistic Trajectory Optimisation
• Authors: Lucas Barcelos, Tin Lai, Rafael Oliveira, Paulo Borges and Fabio Ramos
• Abstract summary: Motion planning can be cast as a trajectory optimisation problem where a cost is minimised as a function of the trajectory being generated. Recent advancements in computing hardware allow for parallel trajectory optimisation where multiple solutions are obtained simultaneously. We propose an algorithm for parallel trajectory optimisation that promotes diversity over the range of solutions, therefore avoiding mode collapses.
• Score: 24.101232487591094
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Motion planning can be cast as a trajectory optimisation problem where a cost is minimised as a function of the trajectory being generated. In complex environments with several obstacles and complicated geometry, this optimisation problem is usually difficult to solve and prone to local minima. However, recent advancements in computing hardware allow for parallel trajectory optimisation where multiple solutions are obtained simultaneously, each initialised from a different starting point. Unfortunately, without a strategy preventing two solutions to collapse on each other, naive parallel optimisation can suffer from mode collapse diminishing the efficiency of the approach and the likelihood of finding a global solution. In this paper we leverage on recent advances in the theory of rough paths to devise an algorithm for parallel trajectory optimisation that promotes diversity over the range of solutions, therefore avoiding mode collapses and achieving better global properties. Our approach builds on path signatures and Hilbert space representations of trajectories, and connects parallel variational inference for trajectory estimation with diversity promoting kernels. We empirically demonstrate that this strategy achieves lower average costs than competing alternatives on a range of problems, from 2D navigation to robotic manipulators operating in cluttered environments.

Related papers

• SPGD: Steepest Perturbed Gradient Descent Optimization [0.0]
  This paper presents the Steepest Perturbed Gradient Descent (SPGD) algorithm. It is designed to generate a set of candidate solutions and select the one exhibiting the steepest loss difference. Preliminary results show a substantial improvement over four established methods.
  arXiv  Detail & Related papers  (2024-11-07T18:23:30Z)
• Analyzing and Enhancing the Backward-Pass Convergence of Unrolled Optimization [50.38518771642365]
  The integration of constrained optimization models as components in deep networks has led to promising advances on many specialized learning tasks. A central challenge in this setting is backpropagation through the solution of an optimization problem, which often lacks a closed form. This paper provides theoretical insights into the backward pass of unrolled optimization, showing that it is equivalent to the solution of a linear system by a particular iterative method. A system called Folded Optimization is proposed to construct more efficient backpropagation rules from unrolled solver implementations.
  arXiv  Detail & Related papers  (2023-12-28T23:15:18Z)
• Federated Multi-Level Optimization over Decentralized Networks [55.776919718214224]
  We study the problem of distributed multi-level optimization over a network, where agents can only communicate with their immediate neighbors. We propose a novel gossip-based distributed multi-level optimization algorithm that enables networked agents to solve optimization problems at different levels in a single timescale. Our algorithm achieves optimal sample complexity, scaling linearly with the network size, and demonstrates state-of-the-art performance on various applications.
  arXiv  Detail & Related papers  (2023-10-10T00:21:10Z)
• ProGO: Probabilistic Global Optimizer [9.772380490791635]
  In this paper we develop an algorithm that converges to the global optima under some mild conditions. We show that the proposed algorithm outperforms, by order of magnitude, many existing state-of-the-art methods.
  arXiv  Detail & Related papers  (2023-10-04T22:23:40Z)
• Constrained Stein Variational Trajectory Optimization [5.317624228510749]
  We present CSVTO, an algorithm for performing trajectory optimization with constraints on a set of trajectories in parallel. By explicitly generating diverse sets of trajectories, CSVTO is better able to avoid poor local minima. We demonstrate that CSVTO outperforms baselines in challenging highly-constrained tasks.
  arXiv  Detail & Related papers  (2023-08-23T12:58:40Z)
• Monte Carlo Policy Gradient Method for Binary Optimization [3.742634130733923]
  We develop a novel probabilistic model to sample the binary solution according to a parameterized policy distribution. For coherent exploration in discrete spaces, parallel Markov Chain Monte Carlo (MCMC) methods are employed. Convergence to stationary points in expectation of the policy gradient method is established.
  arXiv  Detail & Related papers  (2023-07-03T07:01:42Z)
• Optimization on manifolds: A symplectic approach [127.54402681305629]
  We propose a dissipative extension of Dirac's theory of constrained Hamiltonian systems as a general framework for solving optimization problems. Our class of (accelerated) algorithms are not only simple and efficient but also applicable to a broad range of contexts.
  arXiv  Detail & Related papers  (2021-07-23T13:43:34Z)
• On Constraints in First-Order Optimization: A View from Non-Smooth Dynamical Systems [99.59934203759754]
  We introduce a class of first-order methods for smooth constrained optimization. Two distinctive features of our approach are that projections or optimizations over the entire feasible set are avoided. The resulting algorithmic procedure is simple to implement even when constraints are nonlinear.
  arXiv  Detail & Related papers  (2021-07-17T11:45:13Z)
• Motion Planning by Learning the Solution Manifold in Trajectory Optimization [6.127237810365965]
  We present an optimization method that learns to generate an infinite set of solutions for motion planning problems. Results indicate that the experimental model represents an infinite set of homotopic solutions for motion planning problems.
  arXiv  Detail & Related papers  (2021-07-13T04:47:47Z)
• Follow the bisector: a simple method for multi-objective optimization [65.83318707752385]
  We consider optimization problems, where multiple differentiable losses have to be minimized. The presented method computes descent direction in every iteration to guarantee equal relative decrease of objective functions.
  arXiv  Detail & Related papers  (2020-07-14T09:50:33Z)
• EOS: a Parallel, Self-Adaptive, Multi-Population Evolutionary Algorithm for Constrained Global Optimization [68.8204255655161]
  EOS is a global optimization algorithm for constrained and unconstrained problems of real-valued variables. It implements a number of improvements to the well-known Differential Evolution (DE) algorithm. Results prove that EOSis capable of achieving increased performance compared to state-of-the-art single-population self-adaptive DE algorithms.
  arXiv  Detail & Related papers  (2020-07-09T10:19:22Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.