More Web Proxy on the site http://driver.im/

article

Review:

Authors:

Gérard Verfaillie,

Cédric Pralet,

Michel LemaîtreAuthors Info & Claims

The Knowledge Engineering Review, Volume 25, Issue 3

Pages 319 - 336

https://doi.org/10.1017/S0269888910000172

Published: 01 September 2010 Publication History

Abstract

The CNT framework (Constraint Network on Timelines) has been designed to model discrete event dynamic systems and the properties one knows, one wants to verify, or one wants to enforce on them. In this article, after a reminder about the CNT framework, we show its modeling power and its ability to support various modeling styles, coming from the planning, scheduling, and constraint programming communities. We do that by producing and comparing various models of two mission management problems in the aerospace domain: management of a team of unmanned air vehicles and of an Earth observing satellite.

References

[1]

Baptiste, P., Pape, C.L. & Nuijten, W. 2001. Constraint-based Scheduling: Applying Constraint Programming to Scheduling Problems. Kluwer Academic Publishers.

[2]

Barták, R. 2002. Visopt ShopFloor: on the edge of planning and scheduling. Proceedings of the International Conference on Principles and Practice of Constraint Programming (CP), Lecture Notes in Computer Science 2470, 587-602.

[3]

Benveniste, A., Caspi, P., Edwards, P., Halbwachs, N., Guernic, P.L. & de Simone, R. 2003. The synchronous languages twelve years later. Proceedings of the IEEE 91(1), 64-83.

[4]

Cesta, A. & Oddi, A. 1996. DDL.1: a formal description of a constraint representation language for physical domains. In New Directions in AI Planning, Ghallab, M. & Milani A. (eds). IOS Press.

[5]

Do, M. & Kambhampati, S. 2001. Planning as constraint satisfaction: solving the planning-graph by compiling it into CSP. Artificial Intelligence 132(2), 151-182.

Digital Library

[6]

Fox, M. & Long, D. 2003. PDDL2.1: an extension to PDDL for expressing temporal planning domains. Journal of Artificial Intelligence Research 20, 61-124.

[7]

Frank, J. & Jónsson, A. 2003. Constraint-based attribute and interval planning. Constraints 8(4), 339-364.

Digital Library

[8]

Fratini, S., Pecora, F. & Cesta, A. 2008. Unifying planning and scheduling as timelines in a component-based perspective. Archives of Control Sciences 18(2), 5-45.

[9]

Ghallab, M. & Laruelle, H. 1994. Representation and control in IxTeT: a temporal planner. In Proceedings of the International Conference on Artificial Intelligence Planning and Scheduling (AIPS), AAAI Press, 61-67.

[10]

Ghallab, M., Nau, D. & Traverso, P. 2004. Automated Planning: Theory and Practice. Morgan Kaufmann.

Digital Library

[11]

Jónsson, A., Morris, P., Muscettola, N., Rajan, K. & Smith, B. 2000. Planning in interplanetary space: theory and practice. In Proceedings of the International Conference on Artificial Intelligence Planning and Scheduling (AIPS), AAAI Press, 177-186.

[12]

Kautz, H. & Selman, B. 1992. Planning as satisfiability. In Proceedings of the European Conference on Artificial Intelligence (ECAI), John Wiley & Sons, 359-363.

[13]

Mittal, S. & Falkenhainer, B. 1990. Dynamic constraint satisfaction problems. In Proceedings of the National Conference on Artificial Intelligence (AAAI), AAAI Press, 25-32.

[14]

Muscettola, N. 1994. HSTS: integrating planning and scheduling. In Intelligent Scheduling, Zweden, M. & Fox, M. (eds). Morgan Kaufmann, 169-212.

[15]

Nareyek, A., Freuder, E., Fourer, R., Giunchiglia, E., Goldman, R., Kautz, H., Rintanen, J. & Tate, A. 2005. Constraints and AI planning. IEEE Intelligent Systems 20(2), 62-72.

Digital Library

[16]

Pralet, C. & Verfaillie, G. 2008a. Decision upon observations and data downloads by an autonomous earth surveillance satellite. In Proceedings of the International Symposium on Artificial Intelligence, Robotics, and Automation for Space (iSAIRAS), AAAI Press.

[17]

Pralet, C. & Verfaillie, G. 2008b. Using constraint networks on timelines to model and solve planning and scheduling problems. In Proceedings of the International Conference on Artificial Intelligence Planning and Scheduling (ICAPS), 272-279.

[18]

Pralet, C., Verfaillie, G. & Schiex, T. 2007. An algebraic graphical model for decision with uncertainties, feasibilities, and utilities. Journal of Artificial Intelligence Research 29, 421-489.

Digital Library

[19]

Puterman, M. 1994. Markov Decision Processes, Discrete Stochastic Dynamic Programming. John Wiley & Sons.

[20]

Rossi, R., Beek, P.V. & Walsh, T. (eds) 2006. Handbook of Constraint Programming. Elsevier.

[21]

Schiex, T., Fargier, H. & Verfaillie, G. 1995. Valued constraint satisfaction problems: hard and easy problems. In Proceedings of the International Joint Conference on Artificial Intelligence (IJCAI), Morgan Kaufman, 631-637.

[22]

Smith, D., Frank, J. & Cushing, W. 2008. The ANML Language. In Proceedings of the International Conference on Artificial Intelligence Planning and Scheduling (ICAPS), AAAI Press.

[23]

van Beek, P. & Chen, X. 1999. CPlan: a constraint programming approach to planning. In Proceedings of the National Conference on Artificial Intelligence (AAAI), AAAI Press, 585-590.

[24]

Verfaillie, G., Pralet, C. & Lemaiître, M. 2008. Constraint-based modeling of discrete event dynamic systems. Journal of Intelligent Manufacturing, Special Issue on "Planning, Scheduling, and Constraint Satisfaction". Published online.

[25]

Vidal, V. & Geffner, H. 2006. Branching and pruning: an optimal temporal POCL planner based on constraint programming. Artificial Intelligence 170, 298-335.

Cited By

De Benedictis RBeraldo GCesta ACortellessa G(2022)Incremental Timeline-Based Planning for Efficient Plan Execution and AdaptationAIxIA 2022 – Advances in Artificial Intelligence10.1007/978-3-031-27181-6_16(225-240)Online publication date: 28-Nov-2022
https://dl.acm.org/doi/10.1007/978-3-031-27181-6_16
Monmousseau P(2021)Scheduling of a Constellation of Satellites: Creating a Mixed-Integer Linear ModelJournal of Optimization Theory and Applications10.1007/s10957-021-01875-2191:2-3(846-873)Online publication date: 1-Dec-2021
https://dl.acm.org/doi/10.1007/s10957-021-01875-2
Ghooshchi NNamazi MNewton MSattar A(2017)Encoding domain transitions for constraint-based planningJournal of Artificial Intelligence Research10.5555/3176764.317678758:1(905-966)Online publication date: 1-Jan-2017
https://dl.acm.org/doi/10.5555/3176764.3176787
Show More Cited By

Recommendations

Kindle Fire Review: Kindle Fire Accessories, Covers, Sleeves, Extended Warranty, Earphones, Screen Protectors, and Skins User Guide
Echo Dot 2nd Generation User Guide and Product Review: The Complete Amazon Echo Dot User Guide for 2018
An evaluative review of the VTOL technologies for unmanned and manned aerial vehicles
Abstract
VTOL (Vertical Take-Off and Landing) capabilities are desired features of both UAVs (Unmanned Aerial Vehicles) and MAVs (Manned Aerial Vehicles) on condition that a comparable flight performance is achieved. VTOL is not only a very ...

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

cover image The Knowledge Engineering Review

The Knowledge Engineering Review Volume 25, Issue 3

September 2010

120 pages

ISSN:0269-8889

Issue’s Table of Contents

Publisher

Cambridge University Press

United States

Publication History

Published: 01 September 2010

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

9
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 19 Dec 2024

Other Metrics

View Author Metrics

Citations

Cited By

De Benedictis RBeraldo GCesta ACortellessa G(2022)Incremental Timeline-Based Planning for Efficient Plan Execution and AdaptationAIxIA 2022 – Advances in Artificial Intelligence10.1007/978-3-031-27181-6_16(225-240)Online publication date: 28-Nov-2022
https://dl.acm.org/doi/10.1007/978-3-031-27181-6_16
Monmousseau P(2021)Scheduling of a Constellation of Satellites: Creating a Mixed-Integer Linear ModelJournal of Optimization Theory and Applications10.1007/s10957-021-01875-2191:2-3(846-873)Online publication date: 1-Dec-2021
https://dl.acm.org/doi/10.1007/s10957-021-01875-2
Ghooshchi NNamazi MNewton MSattar A(2017)Encoding domain transitions for constraint-based planningJournal of Artificial Intelligence Research10.5555/3176764.317678758:1(905-966)Online publication date: 1-Jan-2017
https://dl.acm.org/doi/10.5555/3176764.3176787
Barták RMaillard AVanhoof WPientka B(2017)Attribute grammars with set attributes and global constraints as a unifying framework for planning domain modelsProceedings of the 19th International Symposium on Principles and Practice of Declarative Programming10.1145/3131851.3131858(39-48)Online publication date: 9-Oct-2017
https://dl.acm.org/doi/10.1145/3131851.3131858
Ghooshchi NNamazi MNewton MSattar A(2015)Transition constraints for parallel planningProceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence10.5555/2888116.2888171(3268-3274)Online publication date: 25-Jan-2015
https://dl.acm.org/doi/10.5555/2888116.2888171
Spangelo SCutler JGilson KCohn A(2015)Optimization-based scheduling for the single-satellite, multi-ground station communication problemComputers and Operations Research10.1016/j.cor.2014.11.00457:C(1-16)Online publication date: 1-May-2015
https://dl.acm.org/doi/10.1016/j.cor.2014.11.004
Cimatti AMicheli ARoveri M(2013)Timelines with temporal uncertaintyProceedings of the Twenty-Seventh AAAI Conference on Artificial Intelligence10.5555/2891460.2891488(195-201)Online publication date: 14-Jul-2013
https://dl.acm.org/doi/10.5555/2891460.2891488
Wang ZWang HQi CWang J(2013)A resource enhanced HTN planning approach for emergency decision-makingApplied Intelligence10.1007/s10489-012-0367-738:2(226-238)Online publication date: 1-Mar-2013
https://dl.acm.org/doi/10.1007/s10489-012-0367-7
Pralet CVerfaillie G(2012)Combining static and dynamic models for boosting forward planningProceedings of the 9th international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems10.1007/978-3-642-29828-8_21(322-338)Online publication date: 28-May-2012
https://dl.acm.org/doi/10.1007/978-3-642-29828-8_21

View Options

View options

Media

Figures

Other

Tables

View Issue’s Table of Contents