GABAR: Graph Attention-Based Action Ranking for Relational Policy Learning
We propose a novel approach to learn relational policies for classical planning based on learning to rank actions. We introduce a new graph representation that explicitly captures action information and propose a Graph Neural Network architecture augmented with Gated Recurrent Units (GRUs) to learn action rankings. Our model is trained on small problem instances and generalizes to significantly larger instances where traditional planning becomes computationally expensive. Experimental results across standard planning benchmarks demonstrate that our action-ranking approach achieves generalization to significantly larger problems than those used in training.
Code (0)
등록된 구현이 없습니다.
Tasks
Graph AttentionGraph Neural NetworkLearning-To-RankMethods 이 논문이 사용한 방법론
Similar Papers 제목 키워드 기반
Graph-Based Stock Recommendation by Time-Aware Relational Attention Network
The stock market investors aim at maximizing their investment returns. Stock recommendation task is to recommend stocks with higher return ratios for the investors. Most stock prediction methods study the historical sequ…
RelationStock PredictionHigh throughput screening for LC3/GABARAP binders utilizing fluorescence polarization assay
The characterization of interactions between autophagy modifiers (Atg8-family proteins) and their natural ligands (peptides and proteins) or small molecules is important for a detailed understanding of selective autophag…
hia-gat: A Heterogeneous Interaction-Aware Graph Attention Network For Frame-Level Traffic Conflict Risk Prediction On Freeways
This paper formulates frame-level freeway risk assessment as a multi-agent scene graph-level binary classification problem, where each video or trajectory frame is labeled risky if any TTC- or PET-based conflict violates…
Binary ClassificationHierarchical Attention Models for Multi-Relational Graphs
We present Bi-Level Attention-Based Relational Graph Convolutional Networks (BR-GCN), unique neural network architectures that utilize masked self-attentional layers with relational graph convolutions, to effectively ope…
Graph AttentionLink PredictionNode ClassificationRelationSG-DOR: Learning Scene Graphs with Direction-Conditioned Occlusion Reasoning for Pepper Plants
Robotic harvesting in dense crop canopies requires effective interventions that depend not only on geometry, but also on explicit, direction-conditioned relations identifying which organs obstruct a target fruit. We pres…
Point Clouds