69 search results - page 6 / 14 » Temporally-Expressive Planning as Constraint Satisfaction Pr... |
AUSAI
2008
Springer
13 years 9 months ago
2008
Springer
Planning collision-free paths for multiple robots traversing a shared space is a problem that grows combinatorially with the number of robots. The naive centralised approach soon ...
EAAI
2008
13 years 7 months ago
2008
Nowadays, many real problems can be formalized as Distributed CSPs. A distributed constraint satisfaction problem (DisCSP) is a CSP in which variables and constraints are distribu...
KBS
2007
13 years 7 months ago
2007
Restaurant table management can have significant impact on both profitability and the customer experience. The core of the issue is a complex dynamic combinatorial problem. We sho...
NOMS
2000
IEEE
13 years 12 months ago
2000
IEEE
Communication networks are expected to offer a wide range of services to an increasingly large number of users, with a diverse range of quality of service. This calls for efficien...
CCIA
2005
Springer
14 years 1 months ago
2005
Springer
Modern AI planners use different strategies to simplify the complexity of current planning problems and turn them more affordable. In this paper, we present a new approach that div...