Learning Optimal Baggage Routing from Expert Demonstrations

Efficient baggage transportation within baggage handling systems (BHS) is crucial to modern airport logistics, impacting operational efficiency and passenger satisfaction. Optimizing baggage routing is vital to ensure timely delivery. Although reinforcement learning (RL) has shown promise in enhancing baggage routing, it faces significant limitations, including the difficulty of designing suitable reward functions and the risk for suboptimal exploration during training. To overcome these challenges, this study proposes an approach that employs variational Bayesian inverse reinforcement learning (VBIRL) to derive optimal baggage routing policies from expert demonstrations, thereby eliminating the need for manual reward function specification and inefficient exploration in training. A key innovation of our method is the generation of demonstrations using route planning techniques, effectively addressing the lack of expert demonstration data in BHS. Experimental results indicate that our proposed method outperforms conventional RL methods, leading to faster baggage delivery and reduced collision rate, especially in complex BHS.

Authors

Institutions

Publication Details

Published
2025-08-17
DOI
https://doi.org/10.1109/case58245.2025.11163851
Primary Topic
Expert finding and Q&A systems
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Learning Optimal Baggage Routing from Expert Demonstrations

Tian Kang, Li Zeng
Expert finding and Q&A systems
article

Learning Optimal Baggage Routing from Expert Demonstrations

Tian Kang, Li Zeng
article en

Abstract

Efficient baggage transportation within baggage handling systems (BHS) is crucial to modern airport logistics, impacting operational efficiency and passenger satisfaction. Optimizing baggage routing is vital to ensure timely delivery. Although reinforcement learning (RL) has shown promise in enhancing baggage routing, it faces significant limitations, including the difficulty of designing suitable reward functions and the risk for suboptimal exploration during training. To overcome these challenges, this study proposes an approach that employs variational Bayesian inverse reinforcement learning (VBIRL) to derive optimal baggage routing policies from expert demonstrations, thereby eliminating the need for manual reward function specification and inefficient exploration in training. A key innovation of our method is the generation of demonstrations using route planning techniques, effectively addressing the lack of expert demonstration data in BHS. Experimental results indicate that our proposed method outperforms conventional RL methods, leading to faster baggage delivery and reduced collision rate, especially in complex BHS.

City University of Hong Kong (HK)
Openalex Percentile: Top 62%
Expert finding and Q&A systems
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.