The IRMA Community
Newsletters
Research IRM
Click a keyword to search titles using our InfoSci-OnDemand powered search:
|
Planning with Concurrency, Time and Resources: A CSP-Based Approach
|
|
Author(s): Amedeo Cesta (National Research Council Italy, Italy), Simone Fratini (National Research Council Italy, Italy)and Angelo Oddi (National Research Council Italy, Italy)
Copyright: 2005
Pages: 37
Source title:
Intelligent Techniques for Planning
Source Author(s)/Editor(s): Ioannis Vlahavas (Aristotle University, Greece)and Dimitris Vrakas (Aristotle University, Greece)
DOI: 10.4018/978-1-59140-450-7.ch008
Purchase
|
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.
Related Content
|
Muhammad Faisal Sultan, Muhammad Nawaz Tunio, Imamuddin.
© 2026.
10 pages.
|
|
Muhammad Faisal Sultan, Aamir Firoz Shamsi, Kashif Mehmood.
© 2026.
10 pages.
|
|
R. Arunachalam, R. Amudha.
© 2026.
28 pages.
|
|
Muhammad Faisal Sultan, Abdul Kabeer Kazi, Muhammad Asim Rafique.
© 2026.
12 pages.
|
|
Bushra Qamar.
© 2026.
22 pages.
|
|
Rija Anwar.
© 2026.
20 pages.
|
|
Choi-Meng Leong.
© 2026.
20 pages.
|
|
|