Symbolic perimeter abstraction heuristics for cost-optimal planning
type: Item
instance of: scholarly article
title: Symbolic perimeter abstraction heuristics for cost-optimal planning
zbMATH Open document ID: 1445.68199
author: Álvaro Á. Torralba
author: Carlos Linares López
author: Daniel Borrajo
published in: Artificial Intelligence
publication date: 2018-06-26T00:00:00Z
Mathematics Subject Classification ID: 68T20
Mathematics Subject Classification ID: 68Q60
zbMATH DE Number: 6894611
zbMATH Keywords: automated planning
zbMATH Keywords: cost-optimal planning
zbMATH Keywords: planning systems
zbMATH Keywords: symbolic search
zbMATH Keywords: abstraction heuristics
describes a project that uses: CUDD
MaRDI profile type: Publication
full work available at URL: j.artint.2018.02.002
OpenAlex ID: W2792999547
cites work: Planning as heuristic search
cites work: Merge-and-Shrink Abstraction
cites work: Graph-Based Algorithms for Boolean Function Manipulation
cites work: Efficient symbolic search for cost-optimal planning
cites work: Automatic construction of optimal static sequential portfolios for AI planning and beyond
cites work: Symbolic model checking: \(10^{20}\) states and beyond
cites work: Q3141897
cites work: Q5715685
cites work: Optimal admissible composition of abstraction heuristics
cites work: Automated Creation of Pattern Database Search Heuristics
cites work: Model Checking Software
cites work: \(\text{BIDA}^*\): An improved perimeter search algorithm
cites work: Depth-first iterative-deepening: An optimal admissible tree search
cites work: Q4386972
cites work: Q3624014
cites work: Automatically generating abstractions for planning
cites work: Q4411159
cites work: Q5283006
cites work: Q2769592
Wikidata QID: Q130097726
DOI: 10.1016/J.ARTINT.2018.02.002
description: scientific article; zbMATH DE number 6894611