IRMA-International.org: Creator of Knowledge
Information Resources Management Association
Advancing the Concepts & Practices of Information Resources Management in Modern Organizations

Extending Classical Planning for Time: Research Trends in Optimal and Suboptimal Temporal Planning

Extending Classical Planning for Time: Research Trends in Optimal and Suboptimal Temporal Planning
View Sample PDF
Author(s): Antonio Garrido (Universidad Politécnica de Valencia, Spain)and Eva Onaindia (Universidad Politécnica de Valencia, Spain)
Copyright: 2008
Pages: 40
Source title: Artificial Intelligence for Advanced Problem Solving Techniques
Source Author(s)/Editor(s): Ioannis Vlahavas (Aristotle University, Greece)and Dimitris Vrakas (Aristotle University, Greece)
DOI: 10.4018/978-1-59904-705-8.ch002

Purchase

View Extending Classical Planning for Time: Research Trends in Optimal and Suboptimal Temporal Planning on the publisher's website for pricing and purchasing information.

Abstract

The recent advances in AI automated planning algorithms have allowed to tackle with more realistic problems that involve complex features such as explicit management of time and temporal plans (durative actions and temporal constraints), more expressive models of actions to better describe real-world problems (conservative models of actions vs. non-conservative models), utilisation of heuristic techniques to improve performance (strategies to calculate estimations and guide the search), etc. In this chapter we focus on these features, and present a review of the most successful techniques for temporal planning. First, we start with the optimal planning-graph-based approach, we do a thorough review of the general methods, algorithms and planners and finish with heuristic state-based approaches, both optimal and suboptimal. Second, we discuss the inclusion of time features into a Partial Order Causal Link (POCL) approach. In such an approach, we analyse the possibility of mixing planning with Constraint Satisfaction Problems (CSPs), formulating the planning problem as a CSP and leaving the temporal features to a CSP solver. The ultimate objective here is to come up with an advanced, combined model of planning and scheduling. Third, we outline some techniques used in hybrid approaches that combine different techniques. Finally, we provide a synthesis of many well-known temporal planners and present their main techniques.

Related Content

Kamel Mouloudj, Vu Lan Oanh LE, Achouak Bouarar, Ahmed Chemseddine Bouarar, Dachel Martínez Asanza, Mayuri Srivastava. © 2024. 20 pages.
José Eduardo Aleixo, José Luís Reis, Sandrina Francisca Teixeira, Ana Pinto de Lima. © 2024. 52 pages.
Jorge Figueiredo, Isabel Oliveira, Sérgio Silva, Margarida Pocinho, António Cardoso, Manuel Pereira. © 2024. 24 pages.
Fatih Pinarbasi. © 2024. 20 pages.
Stavros Kaperonis. © 2024. 25 pages.
Thomas Rui Mendes, Ana Cristina Antunes. © 2024. 24 pages.
Nuno Geada. © 2024. 12 pages.
Body Bottom