A Comparison of Several Speed Computation Methods for the Safe Shortest Path Problem - Université Clermont Auvergne Access content directly
Proceedings Proceedings of the 12th International Conference on Operations Research and Enterprise Systems (ICORES 2023) Year : 2023

A Comparison of Several Speed Computation Methods for the Safe Shortest Path Problem

Abstract

This paper is based on (Mombelli et al., 2022). In their article, they dealt with a fleet of autonomous vehicles which is required to perform internal logistics tasks in some protected areas. This fleet is supposed to be ruled by a hierarchical supervision architecture which, at the top level, distributes and schedules Pick up and Delivery tasks, and, at the lowest level, ensures safety at the crossroads and controls the trajectories. They presented the problem of finding a shortest path under risk constraints and proposed a way to compute speed functions along the path. In this paper, we present some theoretical results and focus on the fixed path problem. We propose several new ways of computing speed functions including a couple with reinforcement learning.
Fichier principal
Vignette du fichier
SSPP_2_ICORES.pdf (276.96 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-04152104 , version 1 (05-07-2023)

Licence

Attribution - NonCommercial - NoDerivatives

Identifiers

Cite

Aurélien Mombelli, Alain Quilliot, Mourad Baiou. A Comparison of Several Speed Computation Methods for the Safe Shortest Path Problem. Proceedings of the 12th International Conference on Operations Research and Enterprise Systems (ICORES 2023), SCITEPRESS - Science and Technology Publications, pp.15-26, 2023, 978-989-758-627-9. ⟨10.5220/0011618600003396⟩. ⟨hal-04152104⟩
18 View
11 Download

Altmetric

Share

Gmail Facebook X LinkedIn More