Plan Repair for Resource Constrained Tasks via Numeric Macro Actions
نویسنده
چکیده
The paper addresses the problem of plan repair for tasks involving mandatory constraints on consumable and continuous resources, modeled as numeric fluents. The approach starts by proposing a new notion of numeric macro actions allowing to handle as an extension to the classical macro action formulation conditions and operations not only on the propositional fragment, but also on the numeric one. By reasoning directly on the current plan, the paper shows two techniques for selecting useful macro actions. Such macro actions, toghether with the original actions model, are then used by an offthe-shelf numeric planner for a faster plan repair task. To evaluate the techniques and the contribution of numeric macro actions, we experimented the approach on several numeric planning domains using Metric-FF as off-the-shelf planner. Results show that both strategies enhance the performance of the same planning system without macro actions. Even, one of the strategies turns out to be very competitive also with the specialized plan repair system LPG-ADAPT, both in terms of cpu-time, and stability of the repaired plan.
منابع مشابه
Deordering and Numeric Macro Actions for Plan Repair
The paper faces the problem of plan repair in presence of numeric information, by providing a new method for the intelligent selection of numeric macro actions. The method relies on a generalization of deordering, extended with new conditions accounting for dependencies and threats implied by the numeric components. The deordering is used as a means to infer (hopefully) minimal ordering constra...
متن کاملAn Optimization via Simulation approach for the preemptive and non-preemptive multi-mode resource-constrained project scheduling problems
In this paper a novel modelling and solving method has been developed to address the so-called resource constrained project scheduling problem (RCPSP) where project tasks have multiple modes and also the preemption of activities are allowed. To solve this NP-hard problem, a new general optimization via simulation (OvS) approach has been developed which is the main contribution of the current re...
متن کاملThe Combinatorial Multi-Mode Resource Constrained Multi-Project Scheduling Problem
This paper presents the formulation and solution of the Combinatorial Multi-Mode Resource Constrained Multi-Project Scheduling Problem. The focus of the proposed method is not on finding a single optimal solution, instead on presenting multiple feasible solutions, with cost and duration information to the project manager. The motivation for developing such an approach is due in part to practica...
متن کاملConstrained Renewable Resource Allocation in Fuzzy Metagraphs via Min-Slack
This paper discusses that the fuzzy metagraphs can be used as a tool for scheduling and control of fuzzy projects. Often, available resources for executing projects may be limited. It is assumed the resources required to accomplish each activity of project (metagraph edges) is renewable. One of the common methods for scheduling projects is using the min-slack. So, first, the forward and bac...
متن کاملConstrained consumable resource allocation in alternative stochastic networks via multi-objective decision making
Many real projects complete through the realization of one and only one path of various possible network paths. Here, these networks are called alternative stochastic networks (ASNs). It is supposed that the nodes of considered network are probabilistic with exclusive-or receiver and exclusive-or emitter. First, an analytical approach is proposed to simplify the structure of t...
متن کامل