1146 search results - page 17 / 230 » On the Complexity of Domain-Independent Planning |
IJCGA
2010
13 years 6 months ago
2010
This paper is concerned with on-line problems where a mobile robot of size D has to achieve a task in an unknown planar environment whose geometry is acquired by the robot during ...
AIPS
2006
13 years 9 months ago
2006
Classical planning algorithms require that their operators be simple in order for planning to be tractable. However, the complexities of real world domains suggest that, in order ...
ATMOS
2010
13 years 6 months ago
2010
To model and solve optimization problems arising in public transportation, data about the passengers is necessary and has to be included in the models in any phase of the planning...
ALGORITHMICA
2000
13 years 7 months ago
2000
Complexity bounds for algorithms for robotic motion and manipulation can be misleading when they are constructed with pathological `worst-case' scenarios that rarely appear i...
ICANN
2001
Springer
14 years 6 days ago
2001
Springer
