Proceedings - IEEE International Conference on Robotics and Automation/Proceedings

A Quantum Annealing Approach to Target Tracking

Michel Barbeau, Farrokh Janabi‐Sharifi, Houman Masnavi

Published May 19, 2025• 0 citations

Abstract

This paper delves into the fusion of quantum computing and robotics, focusing on motion planning in cluttered environments. Traditional algorithms struggle with complex problems where many constraints need to be satisfied. Hence, optimization-based approaches such as Constrained Quadratic Models (CQM) have become increasingly popular. Our work presents a 3D tracking algorithm based on CQM uniquely adapted for quantum computers to address computational challenges. With their parallel processing capabilities, Quantum computers offer a groundbreaking approach to optimizing complex problems. We formulate the CQM problem for efficient resolution on the D-Wave quantum computer, showcasing its superiority over classical counterparts. Our application centers on real-time planning in a target-chaser tracking scenario, highlighting the quantum advantage in handling the computation complexity of constrained problems. This paper bridges the quantum-robotics gap and sets the stage for future research in quantum-enhanced robotic motion planning.

DOI: 10.1109/icra55743.2025.11128357

Related papers

Quantum-Enhanced Constraint Propagation for Robotics

Jincheng Zhang

This paper explores the application of quantum computing to enhance constraint propagation within robotics. Conventional constraint propagation algorithms struggle with complex environments, often requiring extensive simulations. We propose a novel quantum-enhanced technique that leverages quantum algorithms to efficiently explore potential trajectories and constraints, resulting in improved motion planning and robustness. The core mechanism involves utilizing quantum annealing to accelerate the search for optimal solutions, leading to more efficient and robust motion planning. The research focuses on the potential of quantum computing to overcome the limitations of existing constraint propagation methods, specifically addressing challenges in dynamic environments and high-dimensional constraints. We present a preliminary analysis demonstrating improvements in planning efficiency and robustness compared to classical methods.

Sep 3, 20260 citations

Quantum-Driven Constraint Optimization for Complex Robotics

Jincheng Zhang

This paper investigates the potential of quantum computing to revolutionize complex robotics, specifically focusing on optimization of robot control and movement. Traditional robotic control systems often struggle with complex environments and constraints, limiting the ability to achieve optimal performance. We propose a novel quantum algorithm designed to address these challenges by leveraging a dynamic, quantum-based simulation of the physical environment to generate constraints. This approach aims to enable robots to navigate and manipulate objects with unprecedented precision and adaptability. The core mechanism centers on utilizing a quantum solver to efficiently explore the search space of possible robot motions, guided by the simulation's feedback. This contrasts with traditional methods, which often struggle with the high dimensionality and complexity of robot dynamics. The research demonstrates the feasibility of this quantum-driven approach through simulations and preliminary experiments, showcasing potential improvements in robot control and movement.

Sep 3, 20260 citations

Quantum-Driven Constraint Optimization for Robotics

Jincheng Zhang

This paper investigates the application of quantum-enhanced constraint optimization to robotics, specifically focusing on dynamic adjustment of robot control parameters to maximize task performance. Traditional optimization methods often struggle with complex, dynamic environments, and quantum computing offers the potential for significant speed-ups in solving optimization problems. We propose a novel algorithm leveraging a quantum-inspired optimization technique – specifically, a modified version of Grover's algorithm – to rapidly identify optimal control parameters. The core claim is that this algorithm can dramatically improve the efficiency and responsiveness of robotic systems, particularly in tasks requiring real-time adaptation. This work demonstrates the feasibility of using quantum mechanics principles to accelerate optimization processes, ultimately enabling more sophisticated and adaptable robotic control.

Sep 6, 20260 citations

Quantum-Enhanced Constraint Programming for Robotics

Jincheng Zhang

Quantum-enhanced constraint programming (QCP) offers a promising avenue for enhancing the efficiency and robustness of robot control algorithms. This paper investigates the application of quantum algorithms to constraint programming, focusing on improvements to solution space exploration and optimization. We introduce a novel quantum-enhanced constraint programming framework, leveraging quantum superposition and entanglement to accelerate search and potentially identify optimal solutions. The core mechanism involves employing quantum annealing for the search phase and quantum optimization for the constraint satisfaction process. We demonstrate the potential benefits of this approach, particularly in complex robot control scenarios, through theoretical analysis and preliminary simulations. The research explores the impact of quantum enhancements on problem-solving time and the likelihood of finding valid solutions. This work represents an advancement toward utilizing quantum computation to address challenges in robotic control.

Aug 31, 20260 citations

Quantum annealing algorithm-driven industrial robot dynamic path planning and collision avoidance system

Yan Wang

Industrial robots play a pivotal role in modern manufacturing, yet achieving real-time path planning and reliable collision avoidance in dynamic environments remains a major challenge. Traditional algorithms often fail to balance efficiency, adaptability, and safety. This paper presents a quantum annealing (QA)-based approach to optimize robot navigation by minimizing travel time, energy consumption, and collision risk under operational constraints. By integrating QA with real-time sensor data and robot kinematics, the system dynamically replans trajectories in response to environmental changes. Comparative simulations demonstrate that the QA method outperforms classical algorithms such as Particle Swarm Optimization (PSO) and A-Star (A*) in both computational speed and path quality. These results highlight the potential of quantum annealing as a powerful tool for intelligent robotic navigation in complex industrial settings.

IET conference proceedings.Jan 1, 20260 citations

Robot localization aided by quantum algorithms

Unai Antero, Basilio Sierra, Jon Oñativia +2 more

Localization is a critical aspect of mobile robotics, enabling robots to navigate their environment efficiently and avoid obstacles. Current probabilistic localization methods, such as the Adaptive-Monte Carlo localization (AMCL) algorithm, are computationally intensive and may struggle with large maps or high-resolution sensor data. This paper explores the application of quantum computing in robotics, focusing on the use of Grover's search algorithm to improve the efficiency of localization in mobile robots. We propose a novel approach to utilize Grover's algorithm in a 2D map, enabling faster and more efficient localization. Despite the limitations of current physical quantum computers, our experimental results demonstrate a significant speedup over classical methods, highlighting the potential of quantum computing to improve robotic localization. This work bridges the gap between quantum computing and robotics, providing a practical solution for robotic localization and paving the way for future research in quantum robotics.

arXiv:2502.00077Jan 31, 20250 citations