A GA-guided Trial-based Heuristic Tree Search Approach for Multi-Agent Package Delivery Planning - Archive ouverte HAL Access content directly
Conference Papers Year : 2021

A GA-guided Trial-based Heuristic Tree Search Approach for Multi-Agent Package Delivery Planning

(1) , (1) , (2)
1
2

Abstract

A multitude of planning and scheduling applications have to face constrained time deadlines while proposing appropriate policy solutions under uncertainty. An example of that, is the last mile delivery problem, in which a large fleet of drones needs to be managed in a broad urban area to efficiently deliver packages in response of immediate known requests and future likely requests. This application case can be seen as a sequential decision-making problem under uncertainty asking for a good solution in a constrained time deadline. In this context, this work proposes to approach a delivery policy using a combination of the Trial-based Heuristic Tree Search (THTS) and a Genetic Algorithm (GA). Specifically, during policy search trials, the GA is used as a meta-heuristic function inside the THTS paradigm to suggest the most cost-promising actions concerning drone-request immediate allocation given the current set of requests. Then, the THTS algorithm exploits the GA suggested actions and likely requests arrivals to generate only relevant branches in the tree. It enables to concentrate the search around those actions, breaking-out the inherent combinatorial nature of this planning problem. To evaluate the proposed approach a full size implementation of the aforementioned structure was built for different problem sizes, and compared to a non GA-guided THTS algorithm in order to assess its execution time and expected value performance. The results suggest this simple yet effective approach is a promising venue to fast achieve sub-optimal but reasonable cost solutions.
Fichier principal
Vignette du fichier
Sata_28184.pdf (364.06 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-03336832 , version 1 (07-09-2021)

Identifiers

  • HAL Id : hal-03336832 , version 1
  • OATAO : 28184

Cite

Bernardo Sata, Jérôme Lacan, Caroline Ponzoni Carvalho Chanel. A GA-guided Trial-based Heuristic Tree Search Approach for Multi-Agent Package Delivery Planning. Scheduling and Planning Applications Wokrshop (SPARK) at the 2021 International Conference on Automated Planning and Scheduling (ICAPS 2021), Aug 2021, Guangzhou (Virtual event), China. ⟨hal-03336832⟩

Collections

ANR ANITI
90 View
26 Download

Share

Gmail Facebook Twitter LinkedIn More