Sciweavers

13 search results - page 1 / 3
» On Reformulating Planning as Dynamic Constraint Satisfaction
Sort
View
SARA
2000
Springer
13 years 8 months ago
On Reformulating Planning as Dynamic Constraint Satisfaction
Jeremy Frank, Ari K. Jónsson, Paul H. Morri...
FLAIRS
2008
13 years 7 months ago
Reformulating Constraint Models for Classical Planning
Constraint satisfaction techniques are commonly used for solving scheduling problems, still they are rare in AI planning. Although there are several attempts to apply constraint s...
Roman Barták, Daniel Toropila
CP
2005
Springer
13 years 10 months ago
Encoding HTN Planning as a Dynamic CSP
Abstract. Constraint satisfaction problems provide strong formalism for modeling variety of real life problems. This paper presents a work currently in progress of which the goal i...
Pavel Surynek, Roman Barták
JCP
2008
117views more  JCP 2008»
13 years 4 months ago
Selfish Constraint Satisfaction Genetic Algorithm for Planning a Long-distance Transportation Network
To build a cooperative logistics network covering multiple enterprises, a planning method that can build a long-distance transportation network is required. Many strict constraints...
Takashi Onoyama, Takuya Maekawa, Yoshitaka Sakurai...
CP
2005
Springer
13 years 10 months ago
Conditional Symmetry Breaking
Conditional symmetry arises in a sub-problem of a constraint satisfaction problem, where the sub-problem satisfies some condition under which additional symetries hold. Typically...
Ian P. Gent, Tom Kelsey, Steve Linton, Iain McDona...