Optimization of Robot Trajectory Planning with Nature-Inspired and Hybrid Quantum Algorithms

  title={Optimization of Robot Trajectory Planning with Nature-Inspired and Hybrid Quantum Algorithms},
  author={Martin J. A. Schuetz and J. Kyle Brubaker and Henry Montagu and Yannick van Dijk and Johannes Klepsch and Philipp Ross and Andr{\'e} Luckow and Mauricio G. C. Resende and Helmut G. Katzgraber},
We solve robot trajectory planning problems at industry-relevant scales. Our end-to-end solution integrates highly versatile random-key algorithms with model stacking and ensemble techniques, as well as path relinking for solution refinement. The core optimization module consists of a biased random-key genetic algorithm. Through a distinct separation of problem-independent and problem-dependent modules, we achieve an efficient problem representation, with a native encoding of constraints. We show… 
2 Citations

Figures and Tables from this paper

When could NISQ algorithms start to create value in discrete manufacturing ?

Are quantum advantages in discrete manufacturing achievable in the near term? As manufacturing-relevant NISQ algorithms, we identified Quantum Annealing (QA) and the Quantum Approximate Optimization

Classification of Hybrid Quantum-Classical Computing

There are two classes of hybrid quantum-classical computing: vertical and horizontal, which are application- agnostic and concerns using quantum computers and running an algorithm.



QUARK: A Framework for Quantum Computing Application Benchmarking

This paper proposes an application-centric benchmark method and the open-source QUARK framework for designing, implementing, executing, and analyzing benchmarks, and provides multiple reference implementations for these two reference problems based on different known, and where needed, extended, classical and quantum algorithmic approaches.

Scatter Search and Path-Relinking: Fundamentals, Advances, and Applications

This work describes the hybridization of path-relinking with genetic algorithms to implement a progressive crossover operator, and describes the mechanics, implementation issues, randomization, and use of pools of high-quality solutions to hybridize path- Relinking with other heuristic methods.

Readiness of Quantum Optimization Machines for Industrial Applications

Although the results show that transverse-field quantum annealing is outperformed by state-of-the-art classical optimization algorithms, these benchmark instances are hard and small in the size of the input, therefore representing the first industrial application ideally suited for testing near-term Quantum annealers and other quantum algorithmic strategies for optimization problems.

Generalized Simulated Annealing for Global Optimization: The GenSA Package

A brief introduction to the GenSA R package is provided and its utility is demonstrated by solving a non-convex portfolio optimization problem in finance and the Thomson problem in physics.

Quantum annealing in the transverse Ising model

We introduce quantum fluctuations into the simulated annealing process of optimization problems, aiming at faster convergence to the optimal state. Quantum fluctuations cause transitions between

Finding multiple roots of a box-constrained system of nonlinear equations with a biased random-key genetic algorithm

This paper addresses the problem of finding all roots of a system of equations by making use of a biased random-key genetic algorithm (BRKGA), and constructs a corresponding optimization problem, which it is shown can be solved multiple times.

Perspectives of quantum annealing: methods and implementations

This perspectives article first gives a brief introduction to the concept of quantum annealing, and then highlights new pathways that may clear the way towards feasible and large scale quantumAnnealing.

Quantum annealing with manufactured spins

This programmable artificial spin network bridges the gap between the theoretical study of ideal isolated spin networks and the experimental investigation of bulk magnetic samples, and may provide a practical physical means to implement a quantum algorithm, possibly allowing more-effective approaches to solving certain classes of hard combinatorial optimization problems.

Viewing vanilla quantum annealing through spin glasses

Quantum annealing promises to solve complex combinatorial optimization problems faster than current transistor-based computer technologies. Although to date only one commercially-available quantum