Branching and pruning: An optimal temporal POCL planner based on constraint programming

V Vidal, H Geffner - Artificial Intelligence, 2006 - Elsevier
A key feature of modern optimal planners such as graphplan and blackbox is their ability to
prune large parts of the search space. Previous Partial Order Causal Link (POCL) planners …

On-line planning and scheduling: An application to controlling modular printers

W Ruml, MB Do, R Zhou, MPJ Fromherz - Journal of Artificial Intelligence …, 2011 - jair.org
We present a case study of artificial intelligence techniques applied to the control of
production printing equipment. Like many other real-world applications, this complex …

[PDF][PDF] On-line Planning and Scheduling for High-speed Manufacturing.

W Ruml, MB Do, MPJ Fromherz - ICAPS, 2005 - cdn.aaai.org
We describe a real manufacturing problem that lies between job shop scheduling and
temporal planning. The setting is online in the sense that new jobs arrive asynchronously …

[PDF][PDF] On-line planning and scheduling in a high-speed manufacturing domain

W Ruml, MPJ Fromherz - Integrating Planning into Scheduling, 2005 - Citeseer
We describe a simple manufacturing domain that requires integrated planning and
scheduling and report on our experience adapting existing techniques to this domain. The …

[PDF][PDF] Un planificateur temporel optimal basé sur la programmation par contraintes

V Vidal, H Geffner - Actes des Dixièmes Journées Nationales sur …, 2004 - researchgate.net
Résumé Une des principales caractéristiques des planificateurs optimaux modernes tels
Graphplan et Blackbox est leur capacité d'élaguer de larges parts de l'espace de recherche …

[DOC][DOC] de la maîtrise en INFORmatique

N Xia - labunix.uqam.ca
RÉSUMé L'administration du Département d'Informatique d'UQAM doit convenablement
assigner des sections disponibles à leurs professeurs basés sur leurs préférences et …

[PDF][PDF] R utcor Research R eport

A Branch - Citeseer
Let Ω⊂{0, 1} n be a set of binary vectors, and let us associate to each vector ω∈ Ω a real
weight. Consider now the problem of finding a conjunction C such that the sum of the …

[引用][C] Modelling Unmanned Vehicles Mission Planning problems as Constraint Satisfaction Problems

COR Atencia - 2014