Fast ResNet-DQN trajectory planning algorithm for dynamic grid environments
Year: 2026
Type: article
Abstract: Under a fully observable 40 × 40 occupancy-grid model, dynamic obstacles are represented as time-varying occupied cells that are refreshed before each decision. The agent then acts in a four-neighbour discrete action space. This paper proposes a lightweight residual deep Q-network (ResNet-DQN) for fast trajectory planning in this setting. Two-dimensional normalized coordinates and a six-channel compact map representation are used as state inputs. The training protocol combines planner-labelled behavioural pretraining and decaying training-only guidance with Double DQN targets, validity-gated action selection, reward shaping, Huber loss, gradient clipping and hybrid soft-hard target-network updates. Under a matched five-seed protocol using seeds 11, 37, 71, 101 and 102, ResNet-DQN achieved a mean success rate of 94.8% and a complete decision latency of 0.912 ms on an NVIDIA GeForce RTX 4090 D. The present model is limited to four-direction discrete motion and does not represent continuous robot kinematics or predict obstacle trajectories.
Source: Discover Applied Sciences
Author: Fengkai Gan
Institution: South China University of Technology
Language: English
Subfield: Artificial Intelligence
Field: Computer Science
Domain: Physical Sciences
Open Access status: diamond
OpenAlex ID: W7235152066
