Skip to content
Open access

TMG-MADRL: a transformer-based meta-graph multi-agent deep reinforcement learning framework for robot path planning in dynamic environments

Sep 2026 · Journal of engineering and applied sciences · Vol 73 · 0 citations · 38 references

TL;DR

A novel Transformer-guided Meta-learning and Graph-enhanced Multi-Agent Deep Reinforcement Learning (TMG-MADRL) framework for intelligent robot navigation to achieve robust path optimization, adaptive decision-making, and proactive collision avoidance in dynamic scenarios.

Abstract

Robot path planning in dynamic environments is a critical research domain in autonomous robotics, focusing on safe and efficient navigation under uncertain and continuously changing conditions. The presence of moving obstacles, unpredictable environmental variations, and real-time decision-making constraints makes traditional path planning methods less effective. To address these challenges, this study proposes a novel Transformer-guided Meta-learning and Graph-enhanced Multi-Agent Deep Reinforcement Learning (TMG-MADRL) framework for intelligent robot navigation. The framework integrates Vision Transformer (ViT) for extracting global environmental and obstacle features, Graph Attention Network (GAT) for spatial relationship modelling, Model-Agnostic Meta-Learning (MAML) for rapid adaptation to unseen environments, Multi-Agent Proximal Policy Optimization (MAPPO) and Soft Actor-Critic (SAC) for cooperative policy optimization, and Temporal Graph Transformer Network (TGTN) for future obstacle trajectory prediction. The work aims to achieve robust path optimization, adaptive decision-making, and proactive collision avoidance in dynamic scenarios. The framework is trained and evaluated using the Robot Path Planning Navigation Dataset, where navigation states are classified into Collision and Safe categories. Experimental results achieved 98.24% accuracy, 98.17% precision, 98.42% recall, 98.06% specificity, and 97.91% MCC, validating superior navigation efficiency and collision classification performance.

Read PDF

Similar papers

Open access Aug 2026

SkyAgent: A lightweight LLM-driven reinforcement learning framework for adaptive cooperative path planning of two UAVs

This work provides a feasible technical pathway and reproducible evaluation benchmark for the collaborative deployment of lightweight LLM planner, sub-goal guidance, sensor observations, cooperative reward, and reward shaping components and quantifies the indispensability of the LLM planner.

Yuting Cao, Zheng Zhao, Jiekai Wu et al. · 0 citations
Preprint Sep 2026

Graph-Based Safe Reinforcement Learning for Multi-Agent Systems with Time-Varying Topology

A graph-based safe multi-agent reinforcement learning (MARL) framework for cooperative navigation with time-varying topology is presented, integrating a attention-based actor and a Graph Attention Network (GAT) centralized critic, enabling scale-insensitive policy learning under time-varying communication topologies.

Sizhe Xiao, Li-Jing Dong, Rui-Ting Bai et al. · 0 citations

Physics-prior-driven distributed deep reinforcement learning for multi-UAV path planning

A physics-prior-driven decentralized deep reinforcement learning (DRL) framework Functioning as a scalable distributed computing paradigm via decentralized training with decentralized execution (DTDE), the framework mitigates the curse of dimensionality.

Jian-Hua Liu, Hai-Tao Zhou, Jia-Jia Liu et al. · 0 citations
Conference Open access 2026

Technology for Dynamic Path Planning of Autonomous Mobile Robots Based on Deep Learning and Multi-Sensor Fusion

The core of the approach is the application of deep reinforcement learning models DQN and PPO to build a natural, tight-coupled closed-loop system for perception, decision-making, and execution, hence achieving real-time optimal obstacle avoidance and path planning.

Tian-Lin Guo · 0 citations
Oct 2026

FoM: Field-of-View-Aware Graph Neural Learning for Min–Max Multi-Robot Patrol Path Planning

Multi-robot patrol path planning is conventionally formulated as the min-max multiple traveling salesman problem (min-max mTSP). Existing formulations typically assume robots must physically visit each target, overlooking their visual perception capabilities. However, in many scenarios, targets are considered covered o...

Bin-Bin Zuo, Xue-Yi Liu, Zi-Jie Zhao et al. · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.