Efficient Multi-Query Bi-Objective Search via Contraction Hierarchies

Han Zhang, Oren Salzman, Ariel Felner, T. K.Satish Kumar, Carlos Hernández Ulloa, Sven Koenig

نتاج البحث: نشر في مجلةمقالة من مؤنمرمراجعة النظراء


Contraction Hierarchies (CHs) have been successfully used as a preprocessing technique in single-objective graph search for finding shortest paths. However, only a few existing works on utilizing CHs for bi-objective search exist, and none of them uses CHs to compute Pareto frontiers. This paper proposes an CH-based approach capable of efficiently computing Pareto frontiers for bi-objective search along with several speedup techniques. Specifically, we propose a new preprocessing approach that computes CHs with fewer edges than the existing preprocessing approach, which reduces both the preprocessing times (up to 3× in our experiments) and the query times. Furthermore, we propose a partial-expansion technique, which dramatically speeds up the query times. We demonstrate the advantages of our approach on road networks with 1 to 14 million states. The longest preprocessing time is less than 6 hours, and the average speedup in query times is roughly two orders of magnitude compared to BOA*, a state-of-the-art single-query bi-objective search algorithm.

اللغة الأصليةالإنجليزيّة
الصفحات (من إلى)452-461
عدد الصفحات10
دوريةProceedings International Conference on Automated Planning and Scheduling, ICAPS
مستوى الصوت33
رقم الإصدار1
المعرِّفات الرقمية للأشياء
حالة النشرنُشِر - 1 يناير 2023
الحدث33rd International Conference on Automated Planning and Scheduling, ICAPS 2023 - Prague, التشيك
المدة: ٨ يوليو ٢٠٢٣١٣ يوليو ٢٠٢٣

All Science Journal Classification (ASJC) codes

  • !!Artificial Intelligence
  • !!Computer Science Applications
  • !!Information Systems and Management


أدرس بدقة موضوعات البحث “Efficient Multi-Query Bi-Objective Search via Contraction Hierarchies'. فهما يشكلان معًا بصمة فريدة.

قم بذكر هذا