The More the Merrier?! Evaluating the Effect of Landmark Extraction Algorithms on Landmark-Based Goal Recognition

• URL: http://arxiv.org/abs/2005.02986v1
• Date: Wed, 6 May 2020 17:41:19 GMT
• Title: The More the Merrier?! Evaluating the Effect of Landmark Extraction Algorithms on Landmark-Based Goal Recognition
• Authors: Kin Max Piamolini Gusm\~ao, Ramon Fraga Pereira, Felipe Meneguzzi
• Abstract summary: Recent approaches to goal and plan recognition using classical planning domains have achieved state of the art results in terms of both recognition time and accuracy. To achieve such fast recognition time these approaches use efficient, but incomplete, algorithms to extract only a subset of landmarks for planning domains and problems. In this paper, we investigate the impact and effect of using various landmark extraction algorithms capable of extracting a larger proportion of the landmarks for each given planning problem.
• Score: 25.6019435583572
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Recent approaches to goal and plan recognition using classical planning domains have achieved state of the art results in terms of both recognition time and accuracy by using heuristics based on planning landmarks. To achieve such fast recognition time these approaches use efficient, but incomplete, algorithms to extract only a subset of landmarks for planning domains and problems, at the cost of some accuracy. In this paper, we investigate the impact and effect of using various landmark extraction algorithms capable of extracting a larger proportion of the landmarks for each given planning problem, up to exhaustive landmark extraction. We perform an extensive empirical evaluation of various landmark-based heuristics when using different percentages of the full set of landmarks. Results show that having more landmarks does not necessarily mean achieving higher accuracy and lower spread, as the additional extracted landmarks may not necessarily increase be helpful towards the goal recognition task.

Related papers

• Relevance Score: A Landmark-Like Heuristic for Planning [9.912614726055129]
  We define a novel "relevance score" that helps identify facts or actions that appear in most but not all plans to achieve any given goal. We experimentally compare the performance of our approach with that of a state of the art landmark-based planning approach using benchmark planning problems.
  arXiv  Detail & Related papers  (2024-03-12T10:45:45Z)
• Planning Landmark Based Goal Recognition Revisited: Does Using Initial State Landmarks Make Sense? [9.107782510356989]
  In this paper, we show that it does not provide any benefit to use landmarks that are part of the initial state in a planning landmark based goal recognition approach. The empirical results show that omitting initial state landmarks for goal recognition improves goal recognition performance.
  arXiv  Detail & Related papers  (2023-06-27T10:20:28Z)
• DIR-AS: Decoupling Individual Identification and Temporal Reasoning for Action Segmentation [84.78383981697377]
  Fully supervised action segmentation works on frame-wise action recognition with dense annotations and often suffers from the over-segmentation issue. We develop a novel local-global attention mechanism with temporal pyramid dilation and temporal pyramid pooling for efficient multi-scale attention. We achieve state-of-the-art accuracy, eg, 82.8% (+2.6%) on GTEA and 74.7% (+1.2%) on Breakfast, which demonstrates the effectiveness of our proposed method.
  arXiv  Detail & Related papers  (2023-04-04T20:27:18Z)
• Leveraging Planning Landmarks for Hybrid Online Goal Recognition [7.690707525070737]
  We propose a hybrid method for online goal recognition that combines a symbolic planning landmark based approach and a data-driven goal recognition approach. The proposed method is significantly more efficient in terms of computation time than the state-of-the-art but also improves goal recognition performance.
  arXiv  Detail & Related papers  (2023-01-25T13:21:30Z)
• k-Means Maximum Entropy Exploration [55.81894038654918]
  Exploration in continuous spaces with sparse rewards is an open problem in reinforcement learning. We introduce an artificial curiosity algorithm based on lower bounding an approximation to the entropy of the state visitation distribution. We show that our approach is both computationally efficient and competitive on benchmarks for exploration in high-dimensional, continuous spaces.
  arXiv  Detail & Related papers  (2022-05-31T09:05:58Z)
• Class agnostic moving target detection by color and location prediction of moving area [11.326363150470204]
  Moving target detection plays an important role in computer vision. Recent algorithms such as deep learning-based convolutional neural networks have achieved high accuracy and real-time performance. We propose a model free moving target detection algorithm.
  arXiv  Detail & Related papers  (2021-06-24T12:34:58Z)
• Learn Fine-grained Adaptive Loss for Multiple Anatomical Landmark Detection in Medical Images [15.7026400415269]
  We propose a novel learning-to-learn framework for landmark detection. Our proposed framework is general and shows the potential to improve the efficiency of anatomical landmark detection.
  arXiv  Detail & Related papers  (2021-05-19T13:39:18Z)
• Deep Multi-Task Learning for Joint Localization, Perception, and Prediction [68.50217234419922]
  This paper investigates the issues that arise in state-of-the-art autonomy stacks under localization error. We design a system that jointly performs perception, prediction, and localization. Our architecture is able to reuse computation between both tasks, and is thus able to correct localization errors efficiently.
  arXiv  Detail & Related papers  (2021-01-17T17:20:31Z)
• Deep Structured Prediction for Facial Landmark Detection [59.60946775628646]
  This paper proposes a method for deep structured facial landmark detection based on combining a deep Convolutional Network with a Conditional Random Field. We demonstrate its superior performance to existing state-of-the-art techniques in facial landmark detection.
  arXiv  Detail & Related papers  (2020-10-18T17:09:24Z)
• Structured Landmark Detection via Topology-Adapting Deep Graph Learning [75.20602712947016]
  We present a new topology-adapting deep graph learning approach for accurate anatomical facial and medical landmark detection. The proposed method constructs graph signals leveraging both local image features and global shape features. Experiments are conducted on three public facial image datasets (WFLW, 300W, and COFW-68) as well as three real-world X-ray medical datasets (Cephalometric (public), Hand and Pelvis)
  arXiv  Detail & Related papers  (2020-04-17T11:55:03Z)
• Refined Plane Segmentation for Cuboid-Shaped Objects by Leveraging Edge Detection [63.942632088208505]
  We propose a post-processing algorithm to align the segmented plane masks with edges detected in the image. This allows us to increase the accuracy of state-of-the-art approaches, while limiting ourselves to cuboid-shaped objects.
  arXiv  Detail & Related papers  (2020-03-28T18:51:43Z)

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.