IEEE

Anytime Automatic Algorithm Selection for the Multi-Agent Path Finding Problem

Abstract: In this study, we propose and develop a Machine Learning-based metasolver for the Multi-Agent Path Finding (MAPF) problem, with the aim of selecting the most suitable solver based on the ...
Scientific Research Publishing

The Grover Dilemma and Three Fundamental Barriers to Oracle-Based Quantum Search Algorithms ()

Those that solve artificially simplified problems where quantum advantage is meaningless. Those that provide no genuine quantum advantage when all costs are properly accounted for. This critique is ...
Scientific Research Publishing

Why Oracle-Based Quantum Search Cannot Use Deep Loops: Physical Limits on Sequential Operations ()

Oracle-based quantum algorithms cannot use deep loops because quantum states exist only as mathematical amplitudes in Hilbert space with no physical substrate. Criticall ...
IEEE

Effective NSGA-II Algorithm for a Limited AGV Scheduling Problem in Matrix Manufacturing Workshops with Undirected Material Flow

Abstract: Automatic guided vehicles (AGVs) are extensively employed in manufacturing workshops for their high degree of automation and flexibility. This paper investigates a limited AGV scheduling ...