Bidirectional Q-Learning for recycling path planning of used appliances under strong and weak constraints

The Layered Bidirectional Q-Learning (LBQ) algorithm is designed for path planning, tackling the complexities inherent in multilayer path planning during the recycling process. This approach incorporates a bidirectional update mechanism that minimizes the unpredictability associated with initial exploration phases. Additionally, the algorithm employs a hierarchical reinforcement learning strategy, which breaks down intricate tasks into more manageable subtasks. Through the strategic design of reward functions that address various constraints, the LBQ algorithm successfully optimizes paths under multiple conditions.