Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

IEEE International Symposium on Intelligent Systems and Informatics (SISY)

Optimization of Collision Path Reduction for Mobile Robots Using Quantum Computing

Jakub Kołota

Published Sep 1, 2026• 0 citations
Publisher

Abstract

In this work, a quantum computing approach is proposed to solve a path optimization problem involving a group of mobile robots. These robots are tasked with delivering packages to many containers, and their paths may collide, leading to inefficiencies. The problem is modeled as a graph where nodes represent robots, and the edges’ weights correspond to the number of potential collisions between the robots. The objective is to divide the robots into two groups in such a way that the number of collision paths, weighted by the severity of the collisions, is minimized. The QAOA-inspired implementation was applied to this problem. The results were presented graphically, showcasing the potential advantages of quantum computing in addressing complex combinatorial optimization problems. This study highlights the promise of quantum algorithms in robotics and multi-agent systems, offering new insights into optimizing robot collaboration in dynamic environments.

DOI
10.1109/sisy71351.2026.11738465

Related papers

Collision-free Path Planning in Multi-vehicle Deployments – A Quantum Approach

Poojith U Rao, Balwinder Sodhi

A crucial factor that can severely limit the success and performance of Multi-Robot Systems (MRS) is the possibility of collisions among the robots in a deployment. The MRS deployment in real-world applications has increased almost exponentially in recent years. Thus, finding efficient and fast methods to identify collision-free paths for MRS environments becomes very important.A common objective in such applications is to generate a collision-free path for all the vehicles between two points and minimize the total distance covered while reaching the destination. Since these problems are known to be NP-hard (i.e., no classical algorithm can solve the problem in polynomial time), a heuristics-based approach is usually applied to obtain an acceptable solution.We derive a novel Quantum Alternating Operator Ansatz (QAOA) construction for collision-free path planning in MRS deployment. A heuristic approach such as the QAOA is well suited for combinatorial optimization problems that need to satisfy multiple hard constraints. We also derive the approximate resource estimates in terms of universal quantum gates for our QAOA constructions.

IEEE International Conference on Quantum Computing and Engineering (QCE)•Sep 1, 2022•1 citation

USING QUANTUM COMPUTINGS DURING COLLABORATIVE MOBILE ROBOT TRAJECTORY CONSTRUCTING

Vladyslav Yevsieiev, S. Maksymova, М. Г. Стародубцев +1 more

The article considers a method for constructing a trajectory of a collaborative mobile robot using quantum computing in combination with classical optimization algorithms.The purpose of the study is to develop a mathematical model and numerical simulation of a quantum-oriented approach to constructing a trajectory of a collaborative robot, which allows minimizing energy costs in motion planning and ensuring obstacle avoidance in a dynamic environment.The scientific novelty of the work lies in the application of quantum optimization methods for multivariate planning, which allows avoiding local minima and guaranteeing the search for globally optimal solutions even in the case of complex configuration spaces.During the numerical simulation, it was demonstrated that the formed trajectories ensure successful obstacle avoidance and reaching the target point without deviations from the grid.Conclusions: analysis of the results showed stabilization of the energy function at the level of -350…-420, which confirms the effectiveness of optimization and convergence to the best solutions after 100-150 iterations.The constructed graphs confirmed that the robot's movement is consistent with the calculated quantum plans, and the deviation between the predicted and executed trajectories is minimized.The use of the energy efficiency criterion allowed us to evaluate different route construction scenarios, where the best plans stabilized with a margin of optimality relative to the worst options by 15-20%.Qualitative analysis of the constructed trajectories confirmed the consistency between the predicted and executed paths, and quantitative results proved a reduction in the number of steps when reaching the target point.The results obtained prove that the proposed method is promising for constructing reliable and energy-optimal trajectories in collaborative robotic systems Industry 5.0.

Scientific notes of Taurida National V I Vernadsky University Series Technical Sciences•Jan 1, 2025•0 citations

A Novel Hybrid Quantum Architecture for Path Planning in Quantum-Enabled Autonomous Mobile Robots

Mayukh Sarkar, Jitesh Pradhan, Anil Kumar Singh +1 more

Autonomous mobile robots are being used increasingly as consumer devices around the globe, such as for fetching items and cleaning purposes, to name a few, in households and industries. Such robots are being employed to traverse a set of target locations and provide the necessary services. In a 2-dimensional environment, these robots are required to traverse following a Hamiltonian path to reduce energy consumption and time requirements. This problem can be formulated as a Travelling Salesman Problem (TSP), an NP-hard problem. Moreover, upon urgent requirements, these robots must traverse in real-time, demanding speedy path planning from the TSP instance. Among the well-known optimization techniques for solving the TSP problem, Ant Colony Optimization has a good stronghold in providing good approximate solutions. Moreover, ACO not only provides near-optimal solutions for TSP instances but can also output optimal or near-optimal solutions for many other demanding hard optimization problems. However, most of the implementations of Ant Colony Optimization on quantum or hybrid quantum architecture proposed in the literature require conversion of classical data to qubits before being fed to the algorithm, and cannot be automated. But quantum-enabled mobile robots require automated path formation after receiving the commands from the environment. The novelties of the proposed work are many-fold. Firstly, the proposed work allows ACO to be applied as its classical counterparts, allowing automation in path formation in quantum-enabled mobile robots. Secondly, this allows a new way of incorporating quantum processing unit in the research of quantum-enabled mobile robots. Researchers around the globe have been trying to incorporate quantum computing in autonomous mobile robots, and true to the best of authors’ knowledge, no work in path planning for multiple targets in quantum-enabled mobile robots have been found in literature. Thirdly, quantum processing unit has been applied at exactly that point where it will be most useful, as in NISQ era quantum computer is not reliable for arithmetic processing. Simulation results of the proposed Hybrid Quantum Ant Colony Optimization algorithm on several TSP instances have shown promising results with average error percentage from optimumresults of only 6.985%. Hence, it is expected that the proposed work to be important in future research of fusing the two rising domains of quantum computing and autonomous mobile robots.

IEEE Transactions on Consumer Electronics•Jul 4, 2024•18 citations

HYBRID QUANTUM ALGORITHMS FOR AUTONOMOUS VEHICLE NAVIGATION: DIRECTED PATH PLANNING WITH GROVER-QAOA

IDRIS KAGAN DEMIR, Seda Nur Gungor, Mehmet Karaköse

Path planning in complex and obstacle-constrained environments remains a challenging combinatorial optimization problem due to the exponential growth of the solution space and the limitations of classical algorithms in dynamic decision-making scenarios. Traditional approaches such as Dijkstra or A* may experience high computational costs and susceptibility to local optima when dealing with large-scale directed graphs containing obstacles. This study proposes a hybrid quantum computing approach that integrates the Grover Search Algorithm and the Quantum Approximate Optimization Algorithm (QAOA) to address optimal path planning on obstacle-oriented directed graphs. The Grover algorithm is first employed as an oracle-based filtering mechanism to detect and eliminate obstacle-containing edges, thereby generating a valid subgraph of feasible paths. Following this preprocessing step, QAOA is applied to the filtered graph within a nonlinear optimization framework to determine the minimum-cost path between source and destination nodes. The optimization model represents the graph as G=(V,E), where binary decision variables indicate whether an edge is included in the selected route while satisfying flow conservation constraints. By narrowing the solution space through Grover-based obstacle detection and performing optimization only on valid edges, the proposed method significantly reduces computational complexity compared to conventional approaches. Experimental analysis demonstrates that the hybrid quantum model effectively identifies optimal routes and adapts to different obstacle configurations while maintaining efficient convergence behavior. The results highlight the potential of integrating quantum search and quantum optimization techniques for solving combinatorial graph problems. This work contributes to the growing body of research on quantum-assisted optimization and demonstrates the feasibility of applying hybrid quantum algorithms to directed path planning problems relevant to autonomous navigation systems.

Quantum Journal of Engineering Science and Technology•Mar 31, 2026•1 citation

Quantum Computing for Construction Robots: Challenges and Opportunities

Ci‐Jyun Liang, Logan Norton-Lapsley, Zhaofeng Hu

Construction robotics play a crucial role in the architecture, engineering, and construction (AEC) industry, but they face significant computational challenges due to dynamic environments, multi-agent coordination, and largescale combinatorial optimization problems.Quantum computing (QC) offers potential advantages for large-scale search and combinatorial tasks, but its relevance to construction robotics remains unclear.This paper presents a scoping review of QC in robotics.We first collect literature using keyword search from Scopus and Web of Science databases, and then screen through data and include related literature following PRISMA-ScR (Preferred Reporting Items for Systematic reviews and Meta-Analyses extension for Scoping Reviews).We analyze the 96 included studies using bibliometric and thematic analyses to identify research trends and challenges for construction robotics.Results show growing interest in QC robotics since 2020, with dominant applications in path planning, kinematics and control, multi-robot coordination, and decision-making.We identify key barriers to applying QC in construction robotics, including current hardware limitations, simulation-to-real gaps, stringent safety and explainability requirements, and suggest future research directions, including hybrid quantum-classical approaches, QC robotics benchmarks, and explainable QC.

International Symposium on Automation and Robotics in Construction (ISARC)•Jun 22, 2026•0 citations

A Quantum Computing Approach for Multi-robot Coverage Path Planning

Poojith U Rao, Florian Speelman, Balwinder Sodhi +1 more

This paper tackles the multi-vehicle Coverage Path Planning (CPP) problem, crucial for applications like search and rescue or environmental monitoring. Due to its NP-hard nature, finding optimal solutions becomes infeasible with larger problem sizes. This motivates the development of heuristic approaches that enhance efficiency even marginally. We propose a novel approach for exploring paths in a 2D grid, specifically designed for easy integration with the Quantum Alternating Operator Ansatz (QAOA), a powerful quantum heuristic. Our contribution includes: 1) An objective function tailored to solve the multi-vehicle CPP using QAOA. 2) Theoretical proofs guaranteeing the validity of the proposed approach. 3) Efficient construction of QAOA operators for practical implementation. 4) Resource estimation to assess the feasibility of QAOA execution. 5) Performance comparison against established algorithms like the Depth First Search. This work paves the way for leveraging quantum computing in optimizing multi-vehicle path planning, potentially leading to real-world advancements in various applications.

arXiv:2407.08767•Jul 11, 2024•4 citations
In this work, a quantum computing approach is proposed to solve a path optimization problem involving a group of mobile robots. These robots are tasked with delivering packages to many containers, and their paths may collide, leading to inefficiencies. The problem is modeled as a graph where nodes represent robots, and the edges’ weights correspond to the number of potential collisions between the robots. The objective is to divide the robots into two groups in such a way that the number of collision paths, weighted by the severity of the collisions, is minimized. The QAOA-inspired implementation was applied to this problem. The results were presented graphically, showcasing the potential advantages of quantum computing in addressing complex combinatorial optimization problems. This study highlights the promise of quantum algorithms in robotics and multi-agent systems, offering new insights into optimizing robot collaboration in dynamic environments.
A crucial factor that can severely limit the success and performance of Multi-Robot Systems (MRS) is the possibility of collisions among the robots in a deployment. The MRS deployment in real-world applications has increased almost exponentially in recent years. Thus, finding efficient and fast methods to identify collision-free paths for MRS environments becomes very important.A common objective in such applications is to generate a collision-free path for all the vehicles between two points and minimize the total distance covered while reaching the destination. Since these problems are known to be NP-hard (i.e., no classical algorithm can solve the problem in polynomial time), a heuristics-based approach is usually applied to obtain an acceptable solution.We derive a novel Quantum Alternating Operator Ansatz (QAOA) construction for collision-free path planning in MRS deployment. A heuristic approach such as the QAOA is well suited for combinatorial optimization problems that need to satisfy multiple hard constraints. We also derive the approximate resource estimates in terms of universal quantum gates for our QAOA constructions.
The article considers a method for constructing a trajectory of a collaborative mobile robot using quantum computing in combination with classical optimization algorithms.The purpose of the study is to develop a mathematical model and numerical simulation of a quantum-oriented approach to constructing a trajectory of a collaborative robot, which allows minimizing energy costs in motion planning and ensuring obstacle avoidance in a dynamic environment.The scientific novelty of the work lies in the application of quantum optimization methods for multivariate planning, which allows avoiding local minima and guaranteeing the search for globally optimal solutions even in the case of complex configuration spaces.During the numerical simulation, it was demonstrated that the formed trajectories ensure successful obstacle avoidance and reaching the target point without deviations from the grid.Conclusions: analysis of the results showed stabilization of the energy function at the level of -350…-420, which confirms the effectiveness of optimization and convergence to the best solutions after 100-150 iterations.The constructed graphs confirmed that the robot's movement is consistent with the calculated quantum plans, and the deviation between the predicted and executed trajectories is minimized.The use of the energy efficiency criterion allowed us to evaluate different route construction scenarios, where the best plans stabilized with a margin of optimality relative to the worst options by 15-20%.Qualitative analysis of the constructed trajectories confirmed the consistency between the predicted and executed paths, and quantitative results proved a reduction in the number of steps when reaching the target point.The results obtained prove that the proposed method is promising for constructing reliable and energy-optimal trajectories in collaborative robotic systems Industry 5.0.
Autonomous mobile robots are being used increasingly as consumer devices around the globe, such as for fetching items and cleaning purposes, to name a few, in households and industries. Such robots are being employed to traverse a set of target locations and provide the necessary services. In a 2-dimensional environment, these robots are required to traverse following a Hamiltonian path to reduce energy consumption and time requirements. This problem can be formulated as a Travelling Salesman Problem (TSP), an NP-hard problem. Moreover, upon urgent requirements, these robots must traverse in real-time, demanding speedy path planning from the TSP instance. Among the well-known optimization techniques for solving the TSP problem, Ant Colony Optimization has a good stronghold in providing good approximate solutions. Moreover, ACO not only provides near-optimal solutions for TSP instances but can also output optimal or near-optimal solutions for many other demanding hard optimization problems. However, most of the implementations of Ant Colony Optimization on quantum or hybrid quantum architecture proposed in the literature require conversion of classical data to qubits before being fed to the algorithm, and cannot be automated. But quantum-enabled mobile robots require automated path formation after receiving the commands from the environment. The novelties of the proposed work are many-fold. Firstly, the proposed work allows ACO to be applied as its classical counterparts, allowing automation in path formation in quantum-enabled mobile robots. Secondly, this allows a new way of incorporating quantum processing unit in the research of quantum-enabled mobile robots. Researchers around the globe have been trying to incorporate quantum computing in autonomous mobile robots, and true to the best of authors’ knowledge, no work in path planning for multiple targets in quantum-enabled mobile robots have been found in literature. Thirdly, quantum processing unit has been applied at exactly that point where it will be most useful, as in NISQ era quantum computer is not reliable for arithmetic processing. Simulation results of the proposed Hybrid Quantum Ant Colony Optimization algorithm on several TSP instances have shown promising results with average error percentage from optimumresults of only 6.985%. Hence, it is expected that the proposed work to be important in future research of fusing the two rising domains of quantum computing and autonomous mobile robots.
Path planning in complex and obstacle-constrained environments remains a challenging combinatorial optimization problem due to the exponential growth of the solution space and the limitations of classical algorithms in dynamic decision-making scenarios. Traditional approaches such as Dijkstra or A* may experience high computational costs and susceptibility to local optima when dealing with large-scale directed graphs containing obstacles. This study proposes a hybrid quantum computing approach that integrates the Grover Search Algorithm and the Quantum Approximate Optimization Algorithm (QAOA) to address optimal path planning on obstacle-oriented directed graphs. The Grover algorithm is first employed as an oracle-based filtering mechanism to detect and eliminate obstacle-containing edges, thereby generating a valid subgraph of feasible paths. Following this preprocessing step, QAOA is applied to the filtered graph within a nonlinear optimization framework to determine the minimum-cost path between source and destination nodes. The optimization model represents the graph as G=(V,E), where binary decision variables indicate whether an edge is included in the selected route while satisfying flow conservation constraints. By narrowing the solution space through Grover-based obstacle detection and performing optimization only on valid edges, the proposed method significantly reduces computational complexity compared to conventional approaches. Experimental analysis demonstrates that the hybrid quantum model effectively identifies optimal routes and adapts to different obstacle configurations while maintaining efficient convergence behavior. The results highlight the potential of integrating quantum search and quantum optimization techniques for solving combinatorial graph problems. This work contributes to the growing body of research on quantum-assisted optimization and demonstrates the feasibility of applying hybrid quantum algorithms to directed path planning problems relevant to autonomous navigation systems.
Construction robotics play a crucial role in the architecture, engineering, and construction (AEC) industry, but they face significant computational challenges due to dynamic environments, multi-agent coordination, and largescale combinatorial optimization problems.Quantum computing (QC) offers potential advantages for large-scale search and combinatorial tasks, but its relevance to construction robotics remains unclear.This paper presents a scoping review of QC in robotics.We first collect literature using keyword search from Scopus and Web of Science databases, and then screen through data and include related literature following PRISMA-ScR (Preferred Reporting Items for Systematic reviews and Meta-Analyses extension for Scoping Reviews).We analyze the 96 included studies using bibliometric and thematic analyses to identify research trends and challenges for construction robotics.Results show growing interest in QC robotics since 2020, with dominant applications in path planning, kinematics and control, multi-robot coordination, and decision-making.We identify key barriers to applying QC in construction robotics, including current hardware limitations, simulation-to-real gaps, stringent safety and explainability requirements, and suggest future research directions, including hybrid quantum-classical approaches, QC robotics benchmarks, and explainable QC.
This paper tackles the multi-vehicle Coverage Path Planning (CPP) problem, crucial for applications like search and rescue or environmental monitoring. Due to its NP-hard nature, finding optimal solutions becomes infeasible with larger problem sizes. This motivates the development of heuristic approaches that enhance efficiency even marginally. We propose a novel approach for exploring paths in a 2D grid, specifically designed for easy integration with the Quantum Alternating Operator Ansatz (QAOA), a powerful quantum heuristic. Our contribution includes: 1) An objective function tailored to solve the multi-vehicle CPP using QAOA. 2) Theoretical proofs guaranteeing the validity of the proposed approach. 3) Efficient construction of QAOA operators for practical implementation. 4) Resource estimation to assess the feasibility of QAOA execution. 5) Performance comparison against established algorithms like the Depth First Search. This work paves the way for leveraging quantum computing in optimizing multi-vehicle path planning, potentially leading to real-world advancements in various applications.