Sciweavers

405 search results - page 21 / 81
» AI planning: solutions for real world problems
Sort
View
ISAAC
2004
Springer
88views Algorithms» more  ISAAC 2004»
14 years 28 days ago
On the Range Maximum-Sum Segment Query Problem
The range minimum query problem, RMQ for short, is to preprocess a sequence of real numbers A[1 . . . n] for subsequent queries of the form: “Given indices i, j, what is the ind...
Kuan-Yu Chen, Kun-Mao Chao
ICRA
2010
IEEE
157views Robotics» more  ICRA 2010»
13 years 6 months ago
Sampling-Based Motion and Symbolic Action Planning with geometric and differential constraints
Abstract— To compute collision-free and dynamicallyfeasibile trajectories that satisfy high-level specifications given in a planning-domain definition language, this paper prop...
Erion Plaku, Gregory D. Hager
ECAI
2004
Springer
14 years 28 days ago
IPSS: A Hybrid Reasoner for Planning and Scheduling
In this paper we describe IPSS (Integrated Planning and Scheduling System), a domain independent solver that integrates an AI heuristic planner, that synthesizes courses of actions...
María Dolores Rodríguez-Moreno, Ange...
ENDM
2000
116views more  ENDM 2000»
13 years 7 months ago
Conceptual Models for Combined Planning and Scheduling
Planning and scheduling attracts an unceasing attention of computer science community. Several research areas like Artificial Intelligence, Operations Research and Constraint Prog...
Roman Barták
SEAL
1998
Springer
13 years 11 months ago
A Hybrid Tabu Search Algorithm for the Nurse Rostering Problem
Abstract. This paper deals with the problem of nurse rostering in Belgian hospitals. This is a highly constrained real world problem that was (until the results of this research we...
Edmund K. Burke, Patrick De Causmaecker, Greet Van...