CCO
2001
Springer
13 years 12 months ago
2001
Springer
Abstract. We study in this lecture the literature on mixed integer programming models and formulations for a specific problem class, namely deterministic production planning probl...
ICTAI
2003
IEEE
2003
IEEE
Partitioning of Temporal Planning Problems in Mixed Space Using the Theory of Extended Saddle Points
14 years 21 days ago
We study the partitioning of temporal planning problems formulated as mixed-integer nonlinear programming problems, develop methods to reduce the search space of partitioned subpr...
LPNMR
2004
Springer
14 years 24 days ago
2004
Springer
Abstract. We present a declarative language, PP, for the specification of preferences between possible solutions (or trajectories) of a planning problem. This novel language allow...
AI
2005
Springer
14 years 29 days ago
2005
Springer
The AAAI Mobile Robot Challenge requires robots to start from the entrance of the conference site, find their own way to the registration desk, socially interact with people and p...
ICTAI
2008
IEEE
14 years 1 months ago
2008
IEEE
We present a fast iterative planner (FIP) that aims to handle planning problems involving nondeterministic actions. In contrast to existing iterative planners, FIP is built upon G...
SARA
2009
Springer
14 years 1 months ago
2009
Springer
Constraint Programming is an attractive approach for solving AI planning problems by modelling them as Constraint Satisfaction Problems (CSPs). However, formulating effective cons...