From domain-landmark graph learning to problem-landmark graph generation

• URL: http://arxiv.org/abs/2509.17062v1
• Date: Sun, 21 Sep 2025 12:41:56 GMT
• Title: From domain-landmark graph learning to problem-landmark graph generation
• Authors: Cristian Pérez-Corral, Antonio Garrido, Laura Sebastia,
• Abstract summary: We propose a novel approach that learns landmark relationships from multiple planning tasks of a planning domain.<n>We evaluate the precision and recallof the information found by our approach over well-known planning domains.
• Score: 0.5199765487172326
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Landmarks have long played a pivotal role in automated planning, serving as crucial elements for improving the planning algorithms. The main limitation of classical landmark extraction methods is their sensitivity to specific planning tasks. This results in landmarks fully tailored to individual instances, thereby limiting their applicability across other instances of the same planning domain. We propose a novel approach that learns landmark relationships from multiple planning tasks of a planning domain. This leads to the creation of a \textit{probabilistic lifted ordering graph}, as a structure that captures weighted abstractions of relationships between parameterized landmarks. Although these orderings are not 100\% true (they are probabilistic), they can still be very useful in planning. Next, given a new planning task for that domain, we instantiate the relationships from that graph to this particular instance. This instantiation operates in two phases. First, it generates two graphs: the former instantiating information from the initial state and the latter from the goal state. Second, it combines these two graphs into one unified graph by searching equivalences to extract landmark orderings. We evaluate the precision and recallof the information found by our approach over well-known planning domains.

Related papers

• Towards Unsupervised Open-Set Graph Domain Adaptation via Dual Reprogramming [38.28291648575204]
  We investigate the problem of unsupervised open-set graph domain adaptation.<n>We propose a novel framework called GraphRTA, which conducts reprogramming on both the graph and model sides.<n>Our proposed model can achieve satisfied performance compared with recent state-of-the-art baselines.
  arXiv  Detail & Related papers  (2025-10-21T07:34:58Z)
• Revisiting Landmarks: Learning from Previous Plans to Generalize over Problem Instances [4.6071451559137175]
  We propose a new framework for discovering landmarks that automatically generalize across a domain.<n>Generalized landmarks capture domain information that is interpretable and useful to an automated planner.
  arXiv  Detail & Related papers  (2025-08-29T12:21:44Z)
• Plan-over-Graph: Towards Parallelable LLM Agent Schedule [53.834646147919436]
  Large Language Models (LLMs) have demonstrated exceptional abilities in reasoning for task planning.<n>This paper introduces a novel paradigm, plan-over-graph, in which the model first decomposes a real-life textual task into executable subtasks and constructs an abstract task graph.<n>The model then understands this task graph as input and generates a plan for parallel execution.
  arXiv  Detail & Related papers  (2025-02-20T13:47:51Z)
• AutoG: Towards automatic graph construction from tabular data [60.877867570524884]
  We aim to formalize the graph construction problem and propose an effective solution.<n>Existing automatic construction methods can only be applied to some specific cases.<n>We present a set of datasets to formalize and evaluate graph construction methods.<n>Second, we propose an LLM-based solution, AutoG, automatically generating high-quality graph schemas.
  arXiv  Detail & Related papers  (2025-01-25T17:31:56Z)
• Graph Learning for Numeric Planning [2.969582361376132]
  We propose data-efficient and interpretable machine learning models for learning to solve numeric planning tasks.<n>This involves constructing a new graph kernel for graphs with both continuous and categorical attributes.<n>Experiments show that our graph kernels are vastly more efficient and generalise better than graph neural networks for numeric planning.
  arXiv  Detail & Related papers  (2024-10-31T16:16:51Z)
• A Schema-aware Logic Reformulation for Graph Reachability [1.360022695699485]
  We propose a strategy to automatically exclude and sort certain graph paths by exploiting the higher-level conceptualization of instances.<n>The aim is to obtain a new first-order logic reformulation of the graph reachability scenario, capable of improving the traditional algorithms in terms of time, space requirements, and number of backtracks.
  arXiv  Detail & Related papers  (2024-10-03T14:39:49Z)
• One for All: Towards Training One Graph Model for All Classification Tasks [61.656962278497225]
  A unified model for various graph tasks remains underexplored, primarily due to the challenges unique to the graph learning domain. We propose textbfOne for All (OFA), the first general framework that can use a single graph model to address the above challenges. OFA performs well across different tasks, making it the first general-purpose across-domains classification model on graphs.
  arXiv  Detail & Related papers  (2023-09-29T21:15:26Z)
• Location-Free Scene Graph Generation [45.366540803729386]
  Scene Graph Generation (SGG) is a visual understanding task, aiming to describe a scene as a graph of entities and their relationships with each other.<n>Existing works rely on location labels in form of bounding boxes or segmentation masks, increasing annotation costs and limiting dataset expansion.<n>We break this dependency and introduce location-free scene graph generation (LF-SGG)<n>This new task aims at predicting instances of entities, as well as their relationships, without the explicit calculation of their spatial localization.
  arXiv  Detail & Related papers  (2023-03-20T08:57:45Z)
• Sequential Manipulation Planning on Scene Graph [90.28117916077073]
  We devise a 3D scene graph representation, contact graph+ (cg+), for efficient sequential task planning. Goal configurations, naturally specified on contact graphs, can be produced by a genetic algorithm with an optimization method. A task plan is then succinct by computing the Graph Editing Distance (GED) between the initial contact graphs and the goal configurations, which generates graph edit operations corresponding to possible robot actions.
  arXiv  Detail & Related papers  (2022-07-10T02:01:33Z)
• Learnable Graph Matching: Incorporating Graph Partitioning with Deep Feature Learning for Multiple Object Tracking [58.30147362745852]
  Data association across frames is at the core of Multiple Object Tracking (MOT) task. Existing methods mostly ignore the context information among tracklets and intra-frame detections. We propose a novel learnable graph matching method to address these issues.
  arXiv  Detail & Related papers  (2021-03-30T08:58:45Z)
• Hallucinative Topological Memory for Zero-Shot Visual Planning [86.20780756832502]
  In visual planning (VP), an agent learns to plan goal-directed behavior from observations of a dynamical system obtained offline. Most previous works on VP approached the problem by planning in a learned latent space, resulting in low-quality visual plans. Here, we propose a simple VP method that plans directly in image space and displays competitive performance.
  arXiv  Detail & Related papers  (2020-02-27T18:54:42Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.