MultiZenoTravel: a Tunable Benchmark for Multi-Objective Planning with Known Pareto Front - Archive ouverte HAL Accéder directement au contenu
Pré-Publication, Document De Travail Année : 2023

MultiZenoTravel: a Tunable Benchmark for Multi-Objective Planning with Known Pareto Front

Résumé

Multi-objective AI planning suffers from a lack of benchmarks exhibiting known Pareto Fronts. In this work, we propose a tunable benchmark generator, together with a dedicated solver that provably computes the true Pareto front of the resulting instances. First, we prove a proposition allowing us to characterize the optimal plans for a constrained version of the problem, and then show how to reduce the general problem to the constrained one. Second, we provide a constructive way to find all the Pareto-optimal plans and discuss the complexity of the algorithm. We provide an implementation that allows the solver to handle realistic instances in a reasonable time. Finally, as a practical demonstration, we used this solver to find all Pareto-optimal plans between the two largest airports in the world, considering the routes between the 50 largest airports, spherical distances between airports and a made-up risk.
Fichier principal
Vignette du fichier
2304.14659.pdf (1.55 Mo) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Licence : CC BY - Paternité

Dates et versions

hal-04129698 , version 1 (24-07-2023)

Licence

Paternité

Identifiants

Citer

Alexandre Quemy, Marc Schoenauer, Johann Dreo. MultiZenoTravel: a Tunable Benchmark for Multi-Objective Planning with Known Pareto Front. 2023. ⟨hal-04129698⟩
40 Consultations
14 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More