Searching for a Safe Shortest Path in a Warehouse

3Citations
Citations of this article
7Readers
Mendeley users who have this article in their library.
Get full text

Abstract

In this paper, we deal with a fleet of autonomous vehicles which is required to perform internal logistics tasks inside 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. We focus here on the top level and deals with the problem which consist in inserting an additional vehicle into the current fleet and routing it while introducing a time dependent estimation of the risk induced by the traversal of any arc at a given time. We propose a model and design a bi-level heuristic and an A*-like heuristic which both rely on a reinforcement learning scheme in order to route and schedule this vehicles according to a well-fitted compromise between speed and risk.

Cite

CITATION STYLE

APA

Mombelli, A., Quilliot, A., & Baiou, M. (2022). Searching for a Safe Shortest Path in a Warehouse. In International Conference on Operations Research and Enterprise Systems (pp. 115–122). Science and Technology Publications, Lda. https://doi.org/10.5220/0010780700003117

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free