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

Journal of Artificial Intelligence Research

Volumn 40, Issue , 2011, Pages 415-468

  Ruml, Wheeler ^a   Do, Minh Binh ^b   Zhou, Rong ^b   Fromherz, Markus P J ^b  

^a Univ of New Hampshire   (United States)

^b PALO ALTO RESEARCH CENTER   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

AI PLANNING; ARTIFICIAL INTELLIGENCE TECHNIQUES; HEURISTIC SEARCH; HIGH-SPEED; INDUSTRIAL PARTNERS; MULTIPLE OBJECTIVES; NEW PRODUCT; ON-LINE ALGORITHMS; ON-LINE PLANNING; ON-LINE SETTING; OTHER APPLICATIONS; PRINTING EQUIPMENTS; RE-PLANNING; REAL-WORLD APPLICATION; STATE-SPACE; TEMPORAL PLANNING;

DECISION MAKING; INDUSTRIAL APPLICATIONS; INTELLIGENT SYSTEMS; PRODUCTION;

MULTIOBJECTIVE OPTIMIZATION;

EID: 79956357503     PISSN: None     EISSN: 10769757     Source Type: Journal    
DOI: 10.1613/jair.3184     Document Type: Article

References (53)

1. Baptiste, P., & Pape, C. L. (1995). A theoretical and experimental comparison of constraint propagation techniques for disjunctive scheduling. In Proceedings of IJCAI-95, pp. 600-606.
2. Barták, R. (2002). Visopt shopfloor: On the edge of planning and scheduling. In Proceedings of the Conference on Principles and Practice of Constraint Programming (CP-02), pp. 587-602.
3. Boutilier, C., Dean, T., & Hanks, S. (1999). Decision-theoretic planning: Structural as- sumptions and computational leverage. Journal of Artificial Intelligence Research, 11, 1-91.
4. Cervoni, R., Cesta, A., & Oddi, A. (1994). Managing dynamic temporal constraint networks. In Proceedings of AIPS-94, pp. 13-18.
5. Chen, Y., Hsu, C.-W., & Wah, B. (2006). Temporal planning using subgoal partitioning and resolution in sgplan. Journal of Artificial Intelligence Research, 26, 323-369. (Pubitemid 44452214)
6. Chien, S. A., Knight, R., Stechert, A., Sherwood, R., & Rabideau, G. (1999). Using itera- tive repair to improve the responsiveness of planning and scheduling for autonomous spacecraft. In Proc. of IJCAI.
7. Chleq, N. (1995). Efficient algorithms for networks of quantitative temporal constraints. In Proceedings of Constraints-95, pp. 40-45.
8. Crawford, L., Hindi, H., Zhou, R., & Larner, D. (2009). Synchronized control in a large-scale networked distributed printing system. In Proceedings of 2009 IEEE International Conference on Robotics and Automation (ICRA-06).
9. Culberson, J., & Schaeffer, J. (1998). Pattern databases. Computational Intelligence, 14(3), 318-334.
10. Dechter, R., Meiri, I., & Pearl, J. (1991). Temporal constraint networks. Artificial Intelli- gence, 49, 61-95. (Pubitemid 21679936)
11. desJardins, M. E., Durfee, E. H., Ortiz, Jr., C. L., & Wolverton, M. J. (1999). A survey of research in distributed, continual planning. AI Magazine, 20(4), 13-22. (Pubitemid 30530572)
12. Do, M., Ruml, W., & Zhou, R. (2008). On-line planning and scheduling: An application to controlling modular printers. In Proceedings of AAAI-08.
13. Do, M. B., & Kambhampati, S. (2002). Sapa: A multi-objective metric temporal planer. Journal of Artificial Intelligence Research, 20, 155-194. (Pubitemid 41530525)
14. Do, M. B., & Ruml, W. (2006). Lessons learned in applying domain-independent planning to high-speed manufacturing. In Proceedings of ICAPS-06, pp. 370-373. (Pubitemid 44074234)
15. Do, M. B., Ruml, W., & Zhou, R. (2008). Planning for modular printers: Beyond pro- ductivity. In Proceedings of the Eighteenth International Conference on Automated Planning and Scheduling (ICAPS).
16. Fox, M., Gerevini, A., Long, D., & Serina, I. (2006). Plan stability: Replanning versus plan repair. In Proc. of ICAPS-06, pp. 212-221. (Pubitemid 44074213)
17. Fox, M., & Long, D. (1998). The automatic inference of state invariants in TIM. Journal of Artificial Intelligence Research, 9, 367-421. (Pubitemid 128636208)
18. Fox, M., & Long, D. (2003). PDDL2.1: An extension to PDDL for expressing temporal planning domains. Journal of Artificial Intelligence Research, 20, 61-124. (Pubitemid 41530519)
19. Frank, J., & Jónsson, A. (2003). Constraint-based attribute and interval planning. Con- straints, 8, 339-364.
20. Franklin, G., Powell, J., & Workman, M. (1997). Digital Control of Dynamic Systems. Prentice Hall.
21. Fromherz, M. P. J., Bobrow, D. G., & de Kleer, J. (2003). Model-based computing for design and control of reconfigurable systems. AI Magazine, 24(4), 120-130.
22. Fromherz, M. P. J., Saraswat, V. A., & Bobrow, D. G. (1999). Model-based computing: Developing flexible machine control software. Artificial Intelligence, 114(1-2), 157-202. (Pubitemid 129588324)
23. Gerevini, A., & Long, D. (2006). Preferences and soft constraints in pddl3. In Workshop on Preferences and Soft Constraints in Planning, ICAPS06.
24. Gerevini, A., Saetti, A., & Serina, I. (2003). Planning through stochastic local search and temporal action graphs in lpg. Journal of Artificial Intelligence Research, 20, 239-290. (Pubitemid 41530527)
25. Gerevini, A., Saetti, A., & Serina, I. (2008). An approach to efficient planning with numerical fluents and multi-criteria plan quality. Artificial Intelligence, 172, 899-944.
26. Gerevini, A., & Schuert, L. (1998). Inferring state constraints for domain-independent planning. In Proceedings of the Fifteenth National Conference on Artificial Intelligence (AAAI).
27. Ghallab, M., & Laruelle, H. (1994). Representation and control in IxTeT, a temporal planner. In Proceedings of AIPS-94, pp. 61-67.
28. Ghallab, M., Nau, D., & Traverso, P. (2004). Automated Planning Theory and Practice. Morgan Kaufmann, San Francisco.
29. Ginsberg, M. L., & Harvey, W. D. (1992). Iterative broadening. Artificial Intelligence, 55, 367-383.
30. Green, P. (2002). Colorimetry and colour difference. In Green, P., & MacDonald, L. (Eds.), Color Engineering, pp. 49-77. Wiley.
31. Haslum, P., & Geffner, H. (2000). Admissible heuristics for optimal planning. In Proceedings of AIPS, pp. 140-149.
32. Haslum, P., & Geffner, H. (2001). Heuristic planning with time and resources. In Proceedings of ECP-01.
33. Hindi, H., Crawford, L., & Fromherz, M. (2005). Synchronization of state based control processes with delayed and asynchronous measurements. In Proc. of Decision and Control, 2005 and 2005 European Control Conference. CDC-ECC '05, pp. 6370-6375.
34. Hindi, H., Crawford, L., Zhou, R., & Eldershaw, C. (2008). Efficient waypoint tracking hybrid controllers for double integrators using classical time optimal control. In Proc. of 47th IEEE Conference on Decision and Control, 2008 (CDC 2008).
35. Hoffmann, J., & Nebel, B. (2001). The FF planning system: Fast plan generation through heuristic search. Journal of Artificial Intelligence Research, 14, 253-302.
36. Holte, R., Felner, A., Newton, J., Meshulam, R., & Furcy, D. (2006). Maximizing over multiple pattern databases speeds up heuristic search. Artificial Intelligence, 170(16 - 17), 1123-1136. (Pubitemid 44692655)
37. Koehler, J., & Hoffmann, J. (2000). On reasonable and forced goal orderings and their use in an agenda-driven planning algorithm. Journal of Artificial Intelligence Research, 12, 338-386.
38. Korf, R. E. (1996). Improved limited discrepancy search. In Proceedings of AAAI-96, pp. 286-291. MIT Press.
39. Le, T. C., Baral, C., Zhang, X., & Tran, S. (2004). Regression with respect to sensing actions and partial states. In Proceedings of AAAI-04.
40. Muscettola, N. (1994). HSTS: Integrating planning and scheduling. In Zweben, M., & Fox, M. S. (Eds.), Intelligent Scheduling, chap. 6, pp. 169-212. Morgan Kaufmann.
41. Muscettola, N., Morris, P., & Tsamardinos, I. (1998). Reformulating temporal plans for efficient execution. In Proceedings of the Conference on Principles of Knowledge Rep- resentation and Reasoning (KR-98).
42. Nguyen, X., Kambhampati, S., & Nigenda, R. S. (2002). Planning graph as the basis to derive heuristics for plan synthesis by state space and csp search. Artificial Intelligence, 135(1-2), 73-124.
43. Palacios, H., & Geffner, H. (2002). Planning as branch and bound: A constraint program- ming implementation. In Proceedings of CLEI-02.
44. Policella, N., Cesta, A., Oddi, A., & Smith, S. F. (2007). From precedence constraint posting to partial order schedules. AI Communications, 20(3), 163-180.
45. Pryor, L., & Collins, G. (1996). Planning for contingencies: A decision-based approach. Journal of Artificial Intelligence Research, 4, 287-339. (Pubitemid 126646156)
46. Refanidis, I., & Vlahavas, I. (2003). Multiobjective heuristic state-space planning. Artificial Intelligence, 145, 1-32.
47. Richter, S., Helmert, M., & Westphal, M. (2008). Landmarks revisited. In Proceedings of AAAI-08, pp. 975-982.
48. Rintanen, J. (2000). Incorporation of temporal logic control into plan operators. In Proceed- ings of the Fourteenth European Conference on Artificial Intelligence (ECAI-2000), pp. 526-530.
49. Ruml, W., Do, M. B., & Fromherz, M. P. J. (2005). On-line planning and scheduling for high-speed manufacturing. In Proceedings of ICAPS-05, pp. 30-39.
50. Smith, D. E., & Weld, D. S. (1999). Temporal planning with mutual exclusion reasoning. In Proceedings of IJCAI-99, pp. 326-333.
51. Smith, S. F., & Cheng, C.-C. (1993). Slack-based heuristics for constraint satisfaction scheduling. In Proceedings of AAAI-93, pp. 139-144.
52. Wah, B. W., & Chen, Y. (2003). Partitioning of temporal planning problems in mixed space using the theory of extended saddle points. In IEEE International Conference on Tools with Artificial Intelligence.
53. Yoshizumi, T., Miura, T., & Ishida, T. (2000). A* with partial expansion for large branching factor problems. In Proceedings of AAAI-2000, pp. 923-929.