810 search results - page 100 / 162 » Solving Time-Dependent Planning Problems |
IROS
2006
IEEE
14 years 2 months ago
2006
IEEE
— Navigation is one of the fundamental tasks for a mobile robot. The majority of path planning approaches has been designed to entirely solve the given problem from scratch given...
CP
1998
Springer
14 years 7 days ago
1998
Springer
The constraint paradigm provides powerful concepts to represent and solve different kinds of planning problems, e. g. factory scheduling. Factory scheduling is a demanding optimiz...
ICCBR
2005
Springer
14 years 1 months ago
2005
Springer
We use case-injected genetic algorithms for learning how to competently play computer strategy games. Case-injected genetic algorithms combine genetic algorithm search with a case-...
FLAIRS
2007
13 years 10 months ago
2007
Temporal Networks play an important role in solving planning problems and they are also used, though not as frequently, when solving scheduling problems. In this paper we propose ...
ICRA
2007
IEEE
14 years 2 months ago
2007
IEEE
Abstract— We provide a method for planning under uncertainty for robotic manipulation by partitioning the configuration space into a set of regions that are closed under complia...