İçeriğe geç
akaturk Akademik ölçüm

Makale detayı · 2026 · article

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

Dergi Quantum Journal of Engineering, Science and Technology
ISSN2716-6341
YÖKSİS OpenAlex Açık erişim · diamond Üst %10
Yıl2026
Atıf1OpenAlex
Yüzdelik%94,7
FWCI5,431,00 = dünya ortalaması

Veri kaynağı ayrımı

  • YÖKSİSYÖKSİS makale kaydı
  • YÖKSİS dergi adıQuantum Journal of Engineering, Science and Technology
  • OpenAlexOpenAlex zenginleştirmesi (özet, atıf, konular)

Özet

OpenAlex İngilizce

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.

Konular

Atıflar

OpenAlex cited_by_count. WoS veya Scopus atıf sayısı değildir; o kaynaklar için ayrı kolon yoktur.

1atıfOpenAlex · cited_by_count (önbellek / veritabanı)

Yerel katalogda bu makaleye atıf yapan 1 yayın (OpenAlex referans eşleşmesi; tam dünya listesi değildir).

  1. 2026 Hybrid Quantum-Classical Solutions for NP-Complete Graph Problems in Scalable Cloud Microservice EnvironmentsAtıf 0 · OpenAlex

Yazarlar

3
  1. İdris Kağan Demir 1
  2. SEDA NUR GÜNGÖR FIRAT ÜNİVERSİTESİ 2
  3. MEHMET KARAKÖSE FIRAT ÜNİVERSİTESİ 3