Algorithmically-designed reward shaping for multiagent reinforcement learning in navigation

The practical applicability of multiagent reinforcement learning is hindered by its low sample efficiency and slow learning speed. While reward shaping and expert guidance can partially mitigate these challenges, their efficiency is offset by the need for substantial manual effort. To address these constraints, we introduce Multiagent Environment-aware semi-Automated Guide (MEAG), a novel framework that leverages widely known, highly efficient, and low-resolution single-agent pathfinding algorithms for shaping rewards to guide multiagent reinforcement learning agents. MEAG uses these single-agent solvers over a coarse-grid surrogate that requires minimal manual intervention, and guides agents away from random exploration in a manner that significantly reduces computational costs. When tested across a range of densely and sparsely connected multiagent navigation environments, MEAG consistently outperforms state-of-the-art algorithms, achieving up to faster convergence and higher rewards. These improvements enable the consideration of MARL for more complex real-world pathfinding applications ranging from warehouse automation to search and rescue operations, and swarm robotics. • A new approach that uses well-known single-agent pathfinding for semi-automated MARL reward shaping, reducing manual effort. • Tested in diverse navigation environments, proving versatility and robustness. • Trains up to faster than state-of-the-art, reducing training time and computational costs. • Achieves up to higher rewards than state-of-the-art, demonstrating its ability to deliver more optimised solutions. • Makes MARL more accessible to non-domain experts and scalable for complex multiagent systems.

Authors

Institutions

Publication Details

Journal
Neurocomputing
Published
2025-09-27
DOI
https://doi.org/10.1016/j.neucom.2025.131654
Citations
3
Primary Topic
Robotic Path Planning Algorithms
Type
article
Field-Weighted Citation Impact
3.83
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Algorithmically-designed reward shaping for multiagent reinforcement learning in navigation

Zainab Zaidi, Tansu Alpcan, Sarah Erfani, Andrew C. Cullen et al.
3 citations
Neurocomputing
Robotic Path Planning Algorithms
3.83
article

Algorithmically-designed reward shaping for multiagent reinforcement learning in navigation

Zainab Zaidi, Tansu Alpcan, Sarah Erfani, Andrew C. Cullen, Ifrah Saeed
article en
3 citations

Abstract

The practical applicability of multiagent reinforcement learning is hindered by its low sample efficiency and slow learning speed. While reward shaping and expert guidance can partially mitigate these challenges, their efficiency is offset by the need for substantial manual effort. To address these constraints, we introduce Multiagent Environment-aware semi-Automated Guide (MEAG), a novel framework that leverages widely known, highly efficient, and low-resolution single-agent pathfinding algorithms for shaping rewards to guide multiagent reinforcement learning agents. MEAG uses these single-agent solvers over a coarse-grid surrogate that requires minimal manual intervention, and guides agents away from random exploration in a manner that significantly reduces computational costs. When tested across a range of densely and sparsely connected multiagent navigation environments, MEAG consistently outperforms state-of-the-art algorithms, achieving up to faster convergence and higher rewards. These improvements enable the consideration of MARL for more complex real-world pathfinding applications ranging from warehouse automation to search and rescue operations, and swarm robotics. • A new approach that uses well-known single-agent pathfinding for semi-automated MARL reward shaping, reducing manual effort. • Tested in diverse navigation environments, proving versatility and robustness. • Trains up to faster than state-of-the-art, reducing training time and computational costs. • Achieves up to higher rewards than state-of-the-art, demonstrating its ability to deliver more optimised solutions. • Makes MARL more accessible to non-domain experts and scalable for complex multiagent systems.

NeurocomputingVol. 658
The University of Melbourne (AU)
Openalex Percentile: Top 6%
Robotic Path Planning Algorithms
3.83
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.