219 search results - page 8 / 44 » A Hybrid Method for Planning and Scheduling |
ATAL
2009
Springer
14 years 2 months ago
2009
Springer
Hybrid Scheduling Problems (HSPs) combine temporal and finite-domain variables via hybrid constraints that dictate that specific bounds on temporal constraints rely on assignments...
CEC
2010
IEEE
12 years 11 months ago
2010
IEEE
— Efficient vehicle path planning in hostile environment to carry out rescue or tactical logistic missions remains very challenging. Most approaches reported so far relies on key...
IROS
2007
IEEE
14 years 1 months ago
2007
IEEE
Abstract— We present an efficient algorithm for complete motion planning that combines approximate cell decomposition (ACD) with probabilistic roadmaps (PRM). Our approach uses ...
AIPS
2011
12 years 11 months ago
2011
We consider the problem of finding generalized plans for situations where the number of objects may be unknown and unbounded during planning. The input is a domain specification...
EMSOFT
2006
Springer
13 years 11 months ago
2006
Springer
The paper deals with the problem of computing schedules for multi-threaded real-time programs. In [14] we introduced a scheduling method based on the geometrization of PV programs...