Long-distance mutual exclusion for planning
type: Item
instance of: scholarly article
title: Long-distance mutual exclusion for planning
zbMATH Open document ID: 1192.68639
author: Yixin Chen
author: R. Huang
author: Zhao Xing
author: Weixiong Zhang
published in: Artificial Intelligence
publication date: 2009-08-31T00:00:00Z
Mathematics Subject Classification ID: 68T20
zbMATH DE Number: 5600141
zbMATH Keywords: planning
zbMATH Keywords: mutual exclusion
zbMATH Keywords: constraint propagation
zbMATH Keywords: satisfiability
describes a project that uses: MiniSat
describes a project that uses: Walksat
describes a project that uses: CPlan
describes a project that uses: Graphplan
describes a project that uses: PDDL
MaRDI profile type: Publication
full work available at URL: j.artint.2008.11.004
OpenAlex ID: W2053990123
cites work: Fast planning through planning graph analysis
cites work: Planning as heuristic search
cites work: Q4230719
cites work: Q4449295
cites work: Q4449304
cites work: Q3624014
cites work: State-variable planning under structural restrictions: algorithms and complexity
cites work: Engineering and compiling planning domain models to promote validity and efficiency
cites work: Planning as satisfiability: parallel plans and algorithms for plan search
cites work: Q3624116
cites work: Branching and pruning: An optimal temporal POCL planner based on constraint programming
DOI: 10.1016/J.ARTINT.2008.11.004
Recommended article: Q4028284
Recommended article: Distributed Computing – IWDC 2005
Recommended article: A Distributed Algorithm for Mutual Exclusion in an Arbitrary Network
Recommended article: Mutual exclusion scheduling
Recommended article: Adaptive and efficient mutual exclusion
Recommended article: Q4361583
Recommended article: Q4244236
Recommended article: Q4540940
description: scientific article; zbMATH DE number 5600141