Learning-Guided Sparsification of Dynamic Graphs in Robotic Exploration
Many robotic exploration algorithms rely on graph structures for frontier-based exploration and dynamic path planning. However, these graphs grow rapidly, accumulating redundant information and impacting performance. We present a hybrid transformer-based framework trained with Proximal Policy Optimization which complements exploration algorithms by pruning these graphs during exploration, limiting their growth and reducing the accumulation of excess information. The framework was evaluated on simulations of a robotic agent using Rapidly-Exploring Random Trees to carry out frontier-based exploration, where the learned policy reduces graph size by up to 96%. We find preliminary evidence that our framework enables effective, generalizable exploration under reduced information density, consistently outperforming the randomly pruned baseline and improving both exploration efficiency and computational efficiency beyond the unpruned baseline for complex long-horizon exploration tasks. To the best of our knowledge, these results are the first suggesting the viability of RL to prune dynamic graphs used in robotic exploration algorithms.
Code (0)
등록된 구현이 없습니다.
Similar Papers 제목 키워드 기반
Finite-Agent Stochastic Differential Games on Large Graphs: II. Graph-Based Architectures
We propose a novel neural network architecture, called Non-Trainable Modification (NTM), for computing Nash equilibria in stochastic differential games (SDGs) on graphs. These games model a broad class of graph-structure…
Computational EfficiencyAlways-Sparse Training by Growing Connections with Guided Stochastic Exploration
The excessive computational requirements of modern artificial neural networks (ANNs) are posing limitations on the machines that can run them. Sparsification of ANNs is often motivated by time, memory and energy savings …
Two Heads Are Better Than One: Boosting Graph Sparse Training via Semantic and Topological Awareness
Graph Neural Networks (GNNs) excel in various graph learning tasks but face computational challenges when applied to large-scale graphs. A promising solution is to remove non-essential edges to reduce the computational o…
Adversarial DefenseGraph LearningSpectral Graph Sparsification Preserves Representation Geometry in Graph Neural Networks
Spectral graph sparsification is a classical tool for reducing graph complexity while preserving Laplacian quadratic forms. In graph neural networks (GNNs), sparsification is often used to accelerate computation while ma…
Where-to-Learn: Analytical Policy Gradient Directed Exploration for On-Policy Robotic Reinforcement Learning
On-policy reinforcement learning (RL) algorithms have demonstrated great potential in robotic control, where effective exploration is crucial for efficient and high-quality policy learning. However, how to encourage the …
Reinforcement Learning