qRobot: A Quantum Computing Approach in Mobile Robot Order Picking and Batching Problem Solver Optimization

被引:26
作者
Atchade-Adelomou, Parfait [1 ,2 ]
Alonso-Linaje, Guillermo [3 ]
Albo-Canals, Jordi [2 ]
Casado-Fauli, Daniel [1 ]
机构
[1] Univ Ramon Llull, Res Grp Data Sci Digital Soc, Carrer St Joan La Salle 42, La Salle 08022, Spain
[2] Lighthouse Disrupt Innovat Grp LLC, 7 Broadway Terrace,Apt 1, Cambridge, MA 02139 USA
[3] Univ Valladolid, Fac Ciencias, Campus Miguel Delibes,C Plaza Santa Cruz 8, Valladolid 47002, Spain
关键词
quantum computing; machine learning; picking problem; batching problem; quantum robotics; Raspberry PI4; docplex; VEHICLE-ROUTING PROBLEM; TIME;
D O I
10.3390/a14070194
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
This article aims to bring quantum computing to robotics. A quantum algorithm is developed to minimize the distance traveled in warehouses and distribution centers where order picking is applied. For this, a proof of concept is proposed through a Raspberry Pi 4, generating a quantum combinatorial optimization algorithm that saves the distance travelled and the batch of orders to be made. In case of computational need, the robot will be able to parallelize part of the operations in hybrid computing (quantum + classical), accessing CPUs and QPUs distributed in a public or private cloud. We developed a stable environment (ARM64) inside the robot (Raspberry) to run gradient operations and other quantum algorithms on IBMQ, Amazon Braket (D-Wave), and Pennylane locally or remotely. The proof of concept, when run in the above stated quantum environments, showed the execution time of our algorithm with different public access simulators on the market, computational results of our picking and batching algorithm, and analyze the quantum real-time execution. Our findings are that the behavior of the Amazon Braket D-Wave is better than Gate-based Quantum Computing over 20 qubits, and that AWS-Braket has better time performance than Qiskit or Pennylane.
引用
收藏
页数:27
相关论文
共 81 条
[1]  
Adelomou P., 2020, J COMPUT COMMUN, V11, P44, DOI [10.4236/jcc.2020.811004, DOI 10.4236/JCC.2020.811004]
[2]  
Agostinelli S., 2020, ARXIV2020200100804
[3]   The multi-period incremental service facility location problem [J].
Albareda-Sambola, Maria ;
Fernandez, Elena ;
Hinojosa, Yolanda ;
Puerto, Justo .
COMPUTERS & OPERATIONS RESEARCH, 2009, 36 (05) :1356-1375
[4]  
Amazon Braket Developer Team, AM BRAK PYTH SCHEM, P2021
[5]  
Angeleanu A., 2015, International Journal of Economic Practices Theories, V5, P413
[6]  
[Anonymous], 2014, Foundations of Constraint Satisfaction: The Classic Text
[7]  
[Anonymous], 2014, Synthesis Lectures on Quantum Computing, DOI [10.2200/S00585ED1V01Y201407QMC008, 10.1007/978-3-031-02518-1, DOI 10.2200/S00585ED1V01Y201407QMC008]
[8]  
[Anonymous], 2016, Rebooting Computing
[9]  
Anuradha Mahasinghe Michael J., 2019, P AUSTR COMP SCI WEE
[10]   Bethe ansatz for quantum strings [J].
Arutyunov, G ;
Frolov, S ;
Staudacher, M .
JOURNAL OF HIGH ENERGY PHYSICS, 2004, (10) :295-315