Welcome to the InfoSci Platform
Reference Hub3
Planning with Concurrency, Time and Resources: A CSP-Based Approach

Planning with Concurrency, Time and Resources: A CSP-Based Approach

Amedeo Cesta, Simone Fratini, Angelo Oddi
Copyright: © 2005 |Pages: 37
ISBN13: 9781591404507|ISBN10: 1591404509|ISBN13 Softcover: 9781591404514|EISBN13: 9781591404521
DOI: 10.4018/978-1-59140-450-7.ch008
Cite Chapter Cite Chapter

MLA

Cesta, Amedeo, et al. "Planning with Concurrency, Time and Resources: A CSP-Based Approach." Intelligent Techniques for Planning, edited by Ioannis Vlahavas and Dimitris Vrakas, IGI Global, 2005, pp. 259-295. https://doi.org/10.4018/978-1-59140-450-7.ch008

APA

Cesta, A., Fratini, S., & Oddi, A. (2005). Planning with Concurrency, Time and Resources: A CSP-Based Approach. In I. Vlahavas & D. Vrakas (Eds.), Intelligent Techniques for Planning (pp. 259-295). IGI Global. https://doi.org/10.4018/978-1-59140-450-7.ch008

Chicago

Cesta, Amedeo, Simone Fratini, and Angelo Oddi. "Planning with Concurrency, Time and Resources: A CSP-Based Approach." In Intelligent Techniques for Planning, edited by Ioannis Vlahavas and Dimitris Vrakas, 259-295. Hershey, PA: IGI Global, 2005. https://doi.org/10.4018/978-1-59140-450-7.ch008

Export Reference

Mendeley
Favorite

Abstract

This chapter proposes to model a planning problem (e.g., the control of a satellite system) by identifying a set of relevant components in the domain (e.g., communication channels, on-board memory or batteries), which need to be controlled to obtain a desired temporal behavior. The domain model is enriched with the description of relevant constraints with respect to possible concurrency, temporal limits and scarce resource availability. The paper proposes a planning framework based on this view that relies on a formalization of the problem as a Constraint Satisfaction Problem (CSP) and defines an algorithmic template in which the integration of planning and scheduling is a fundamental feature. In addition, the paper describes the current implementation of a constraint-based planner called OMP that is grounded on these ideas and shows the role constraints have in this planner, both at domain description level and as a guide for problem solving.

Request Access

You do not own this content. Please login to recommend this title to your institution's librarian or purchase it from the IGI Global bookstore.