HAFE: Hierarchical Attention-based Frontier Exploration for Multi-Robot Mapping

Autonomous exploration is a critical application of multi-vehicle systems, where a team of networked robots collaboratively explores an unknown environment. This technique is crucial for applications like search and rescue, fault detection, and mapping. Traditional frontier-based methods struggle with cooperative exploration, while multi-agent deep reinforcement learning (MARL) approaches suffer from inefficient task assignments due to shortsighted decision-making and lack of long-term planning. To address these limitations, we propose HAFE (Hierarchical Attention-based Frontier Exploration), a hierarchical reinforcement learning (HRL) framework that integrates temporal decision modeling into multi-robot exploration. The high-level policy, built on an LSTM-Attention network, captures long-term dependencies in exploration history and dynamically allocates goal frontiers for each robot, ensuring structured and non-redundant coverage. The low-level MADDPG policy then executes navigation and obstacle avoidance. Additionally, we introduce frontier utility embedding into the state representation, enabling robots to prioritize unexplored regions more effectively. Experimental results in Gazebo and ROS demonstrate that HAFE significantly outperforms MADDPG, achieving faster coverage, higher rewards, and fewer collisions by leveraging historical information for more informed goal selection.

Authors

Institutions

Publication Details

Published
2025-08-04
DOI
https://doi.org/10.1109/icccn65249.2025.11133753
Citations
1
Primary Topic
Advanced Image and Video Retrieval Techniques
Type
article
Field-Weighted Citation Impact
1.28
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

HAFE: Hierarchical Attention-based Frontier Exploration for Multi-Robot Mapping

Xueyan Yao, Yuji Dong, Matilda Isaac
1 citations
Advanced Image and Video Retrieval Techniques
1.28
article

HAFE: Hierarchical Attention-based Frontier Exploration for Multi-Robot Mapping

Xueyan Yao, Yuji Dong, Matilda Isaac
article en
1 citations

Abstract

Autonomous exploration is a critical application of multi-vehicle systems, where a team of networked robots collaboratively explores an unknown environment. This technique is crucial for applications like search and rescue, fault detection, and mapping. Traditional frontier-based methods struggle with cooperative exploration, while multi-agent deep reinforcement learning (MARL) approaches suffer from inefficient task assignments due to shortsighted decision-making and lack of long-term planning. To address these limitations, we propose HAFE (Hierarchical Attention-based Frontier Exploration), a hierarchical reinforcement learning (HRL) framework that integrates temporal decision modeling into multi-robot exploration. The high-level policy, built on an LSTM-Attention network, captures long-term dependencies in exploration history and dynamically allocates goal frontiers for each robot, ensuring structured and non-redundant coverage. The low-level MADDPG policy then executes navigation and obstacle avoidance. Additionally, we introduce frontier utility embedding into the state representation, enabling robots to prioritize unexplored regions more effectively. Experimental results in Gazebo and ROS demonstrate that HAFE significantly outperforms MADDPG, achieving faster coverage, higher rewards, and fewer collisions by leveraging historical information for more informed goal selection.

Xi’an Jiaotong-Liverpool University (CN)
Openalex Percentile: Top 16%
Advanced Image and Video Retrieval Techniques
1.28
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.