Sciweavers

810 search results - page 71 / 162
» Solving Time-Dependent Planning Problems
Sort
View
ICRA
2000
IEEE
176views Robotics» more  ICRA 2000»
13 years 11 months ago
RRT-Connect: An Efficient Approach to Single-Query Path Planning
A simple and efficient randomized algorithm is presented for solving single-query path planning problems in high-dimensional configuration spaces. The method works by incrementall...
James J. Kuffner Jr., Steven M. LaValle
AAI
2005
117views more  AAI 2005»
13 years 8 months ago
Machine Learning in Hybrid Hierarchical and Partial-Order Planners for Manufacturing Domains
The application of AI planning techniques to manufacturing systems is being widely deployed for all the tasks involved in the process, from product design to production planning an...
Susana Fernández, Ricardo Aler, Daniel Borr...
AIM
2004
13 years 8 months ago
An AI Planning-based Tool for Scheduling Satellite Nominal Operations
Satellite domains are becoming a fashionable area of research within the AI community due to the complexity of the problems that these domains need to solve. With the current US a...
María Dolores Rodríguez-Moreno, Dani...
ICTAI
2005
IEEE
14 years 1 months ago
Planning with POMDPs Using a Compact, Logic-Based Representation
Partially Observable Markov Decision Processes (POMDPs) provide a general framework for AI planning, but they lack the structure for representing real world planning problems in a...
Chenggang Wang, James G. Schmolze
WSC
2008
13 years 10 months ago
Priority mix planning for cycle time-differentiated semiconductor manufacturing services
Semiconductor fabs often offer manufacturing service of multiple priorities in terms of cycle time-based X-factor targets (XFTs) and fab production must be planned accordingly. Th...
Shi-Chung Chang, Shin-Shyu Su, Ke-Ju Chen