Anytime heuristic search for partial satisfaction planning
type: Item
instance of: scholarly article
title: Anytime heuristic search for partial satisfaction planning
zbMATH Open document ID: 1192.68635
author: N. E. Zubov
published in: Artificial Intelligence
publication date: 2009-08-31T00:00:00Z
Mathematics Subject Classification ID: 68T20
zbMATH DE Number: 5600148
zbMATH Keywords: planning
zbMATH Keywords: heuristics
zbMATH Keywords: partial satisfaction
zbMATH Keywords: search
describes a project that uses: Yochan
describes a project that uses: SAPA
MaRDI profile type: Publication
full work available at URL: j.artint.2008.11.010
OpenAlex ID: W2050635891
cites work: An LP-Based Heuristic for Optimal Planning
cites work: Heuristics for planning with penalties and rewards formulated in logic and computed through circuits
cites work: Q4256521
cites work: Q4449302
cites work: Q4449304
cites work: Introducing Preferences in Planning as Satisfiability
cites work: Q3624053
cites work: Q3624014
cites work: The FF planning system: Fast plan generation through heuristic search
cites work: Planning graph as the basis for deriving heuristics for plan synthesis by state space and CSP search
cites work: Q4449303
cites work: Planning with preferences using logic programming
cites work: Q3624116
DOI: 10.1016/J.ARTINT.2008.11.010
description: scientific article; zbMATH DE number 5600148