Optimal admissible composition of abstraction heuristics
type: Item
instance of: scholarly article
title: Optimal admissible composition of abstraction heuristics
zbMATH Open document ID: 1205.68376
author: J. Martínez
published in: Artificial Intelligence
publication date: 2010-09-02T00:00:00Z
Mathematics Subject Classification ID: 68T20
zbMATH DE Number: 5777571
zbMATH Keywords: heuristic search
zbMATH Keywords: planning
zbMATH Keywords: admissible heuristics
zbMATH Keywords: additive heuristics
zbMATH Keywords: abstractions
describes a project that uses: Mosek
MaRDI profile type: Publication
full work available at URL: j.artint.2010.04.021
OpenAlex ID: W2081726708
cites work: Planning as heuristic search
cites work: The computational complexity of propositional STRIPS planning
cites work: An interior-point approach for primal block-angular problems
cites work: Friends or Foes? On Planning as Satisfiability and Abstract CNF Encodings
cites work: Model Checking Software
cites work: Automated Creation of Pattern Database Search Heuristics
cites work: Q5715685
cites work: Q3624014
cites work: Q3624132
cites work: Implicit Abstraction Heuristics
cites work: Q4221106
cites work: An LP-Based Heuristic for Optimal Planning
cites work: Q3624143
DOI: 10.1016/J.ARTINT.2010.04.021
description: scientific article; zbMATH DE number 5777571