A Hill-Climbing Approach for Planning with Temporal Uncertainty
نویسندگان
چکیده
We present a hill-climbing algorithm to solve planning problems with temporal uncertainty. First an optimistic plan that is valid when all actions complete quickly is found. Then temporal reasoning techniques are used to determine when the plan may fail. At time points that cause an unsafe situation, contingency branches are inserted. We describe our planner PHOCUS-HC, give preliminary results, and discuss future work.
منابع مشابه
Risk Minimization of Disjunctive Temporal Problem with Uncertainty
The Disjunctive Temporal Problem with Uncertainty (DTPU) is a fundamental problem that expresses temporal reasoning with both disjunctive constraints and contingency. A recent work (Peintner et al, 2007) develops a complete algorithm for determining Strong Controllability of a DTPU. Such a notion that guarantees 100% confidence of execution may be too conservative in practice. In this paper, fo...
متن کاملA Proposed Improved Hybrid Hill Climbing Algorithm with the Capability of Local Search for Solving the Nonlinear Economic Load Dispatch Problem
This paper introduces a new hybrid hill-climbing algorithm (HHC) for solving the Economic Dispatch (ED) problem. This algorithm solves the ED problems with a systematic search structure with a global search. It improves the results obtained from an evolutionary algorithm with local search and converges to the best possible solution that grabs the accuracy of the problem. The most important goal...
متن کاملAn Initial Investigation into Searching to Satisfy Soft Temporal Constraints
When using Simple Temporal Networks, it may be that not all constraints must be met, rather that they should be met if possible with some degree of preference. To express this, a utility value is added to represent the importance of some temporal constraints. Various search procedures are looked at to try to maximise the total utility whilst still maintaining consistency. It is found that a gre...
متن کاملImproving Relaxed Planning Graph Heuristics for Metric Optimization
Currently a standard technique to compute the heuristic in heuristic planning is to expand a planning graph on the relaxed problem. This paper presents a new approach to expand the planning graph, such that heuristic estimations are more accurate when an optimization metric criteria is given. Additionally, a new kind of Hill-Climbing search that combines two heuristics is proposed to deal with ...
متن کاملHeuristic search by guided enforced hill climbing in fast forward automated planning
Enforced hill climbing (EHC), a heuristicaa search method, has been frequently used in a number of AI planning systems. This paper presents a new form of EHC, guided enforced hill climbing (GEHC), to enhance EHC efficiency. Main feature in GEHC is an adaptive ordering function. GEHC has shown a significant improvement in EHC efficiency, especially when applied to larger problems.
متن کامل