共查询到20条相似文献,搜索用时 31 毫秒
1.
Planning graphs have been shown to be a rich source of heuristic information for many kinds of planners. In many cases, planners must compute a planning graph for each element of a set of states, and the naive technique enumerates the graphs individually. This is equivalent to solving a multiple-source shortest path problem by iterating a single-source algorithm over each source.We introduce a data-structure, the state agnostic planning graph, that directly solves the multiple-source problem for the relaxation introduced by planning graphs. The technique can also be characterized as exploiting the overlap present in sets of planning graphs. For the purpose of exposition, we first present the technique in deterministic (classical) planning to capture a set of planning graphs used in forward chaining search. A more prominent application of this technique is in conformant and conditional planning (i.e., search in belief state space), where each search node utilizes a set of planning graphs; an optimization to exploit state overlap between belief states collapses the set of sets of planning graphs to a single set. We describe another extension in conformant probabilistic planning that reuses planning graph samples of probabilistic action outcomes across search nodes to otherwise curb the inherent prediction cost associated with handling probabilistic actions. Finally, we show how to extract a state agnostic relaxed plan that implicitly solves the relaxed planning problem in each of the planning graphs represented by the state agnostic planning graph and reduces each heuristic evaluation to counting the relevant actions in the state agnostic relaxed plan. Our experimental evaluation (using many existing International Planning Competition problems from classical and non-deterministic conformant tracks) quantifies each of these performance boosts, and demonstrates that heuristic belief state space progression planning using our technique is competitive with the state of the art. 相似文献
2.
In contingent planning problems, agents have partial information about their state and use sensing actions to learn the value of some variables. When sensing and actuation are separated, plans for such problems can often be viewed as a tree of sensing actions, separated by conformant plans consisting of non-sensing actions that enable the execution of the next sensing action. We propose a heuristic, online method for contingent planning which focuses on identifying the next useful sensing action. We select the next sensing action based on a landmark heuristic, adapted from classical planning. We discuss landmarks for plan trees, providing several alternative definitions and discussing their merits. The key part of our planner is the novel landmarks-based heuristic, together with a projection method that uses classical planning to solve the intermediate conformant planning problems. The resulting heuristic contingent planner solves many more problems than state-of-the-art, translation-based online contingent planners, and in most cases, much faster, up to 3 times faster on simple problems, and 200 times faster on non-simple domains. 相似文献
3.
The goal of this paper is to investigate the application of parallel programming techniques to boost the performance of heuristic search‐based planning systems in various aspects. It shows that an appropriate parallelization of a sequential planning system often brings gain in performance and/or scalability. We start by describing general schemes for parallelizing the construction of a plan. We then discuss the applications of these techniques to two domain‐independent heuristic search‐based planners—a competitive conformant planner (CP A) and a state‐of‐the‐art classical planner (FF). We present experimental results—on both shared memory and distributed memory platforms—which show that the performance improvements and scalability are obtained in both cases. Finally, we discuss the issues that should be taken into consideration when designing a parallel planning system and relate our work to the existing literature. Copyright © 2009 John Wiley & Sons, Ltd. 相似文献
4.
Most of the great success of heuristic search as an approach to AI Planning is due to the right design of domain-independent heuristics. Although many heuristic planners perform reasonably well, the computational cost of computing the heuristic function in every search node is very high, causing the planner to scale poorly when increasing the size of the planning tasks. For tackling this problem, planners can incorporate additional domain-dependent heuristics in order to improve their performance. Learning-based planners try to automatically acquire these domain-dependent heuristics using previous solved problems. In this work, we present a case-based reasoning approach that learns abstracted state transitions that serve as domain control knowledge for improving the planning process. The recommendations from the retrieved cases are used as guidance for pruning or ordering nodes in different heuristic search algorithms applied to planning tasks. We show that the CBR guidance is appropriate for a considerable number of planning benchmarks. 相似文献
5.
Declarative problem solving, such as planning, poses interesting challenges for Genetic Programming (GP). There have been recent attempts to apply GP to planning that fit two approaches: (a) using GP to search in plan space or (b) to evolve a planner. In this article, we propose to evolve only the heuristics to make a particular planner more efficient. This approach is more feasible than (b) because it does not have to build a planner from scratch but can take advantage of already existing planning systems. It is also more efficient than (a) because once the heuristics have been evolved, they can be used to solve a whole class of different planning problems in a planning domain, instead of running GP for every new planning problem. Empirical results show that our approach (EvoCK) is able to evolve heuristics in two planning domains (the blocks world and the logistics domain) that improve PRODIGY4.0 performance. Additionally, we experiment with a new genetic operator --Instance-Based Crossover--that is able to use traces of the base planner as raw genetic material to be injected into the evolving population. 相似文献
6.
Many of today’s most successful planners perform a forward heuristic search. The accuracy of the heuristic estimates and the cost of their computation determine the performance of the planner. Thanks to the efforts of researchers in the area of heuristic search planning, modern algorithms are able to generate high-quality estimates. In this paper we propose to learn heuristic functions using artificial neural networks and support vector machines. This approach can be used to learn standalone heuristic functions but also to improve standard planning heuristics. One of the most famous and successful variants for heuristic search planning is used by the Fast-Forward (FF) planner. We analyze the performance of standalone learned heuristics based on nature-inspired machine learning techniques and employ a comparison to the standard FF heuristic and other heuristic learning approaches. In the conducted experiments artificial neural networks and support vector machines were able to produce standalone heuristics of superior accuracy. Also, the resulting heuristics are computationally much more performant than related ones. 相似文献
7.
The dynamic space allocation problem (DSAP) presented in this paper considers the task of assigning items (resources) to locations during a multi-period planning horizon such that the cost of rearranging the items is minimized. Three tabu search heuristics are presented for this problem. The first heuristic is a simple basic tabu search heuristic. The second heuristic adds diversification and intensification strategies to the first, and the third heuristic is a probabilistic tabu search heuristic. To test the performances of the heuristics, a set of test problems from the literature is used in the analysis. The results show that the tabu search heuristics are efficient techniques for solving the DSAP. More importantly, the proposed tabu search heuristic with diversification/intensification strategies found new best solutions using less computation time for one-half of all the test problems. 相似文献
8.
Conformant planning is the task of generating plans given uncertainty about the initial state and action effects, and without any sensing capabilities during plan execution. The plan should be successful regardless of which particular initial world we start from. It is well known that conformant planning can be transformed into a search problem in belief space, the space whose elements are sets of possible worlds. We introduce a new representation of that search space, replacing the need to store sets of possible worlds with a need to reason about the effects of action sequences. The reasoning is done by implication tests on propositional formulas in conjunctive normal form (CNF) that capture the action sequence semantics. Based on this approach, we extend the classical heuristic forward-search planning system FF to the conformant setting. The key to this extension is an appropriate extension of the relaxation that underlies FF's heuristic function, and of FF's machinery for solving relaxed planning problems: the extended machinery includes a stronger form of the CNF implication tests that we use to reason about the effects of action sequences. Our experimental evaluation shows the resulting planning system to be superior to the state-of-the-art conformant planners MBP, KACMBP, and GPT in a variety of benchmark domains. 相似文献
9.
Graphplan-style of planning can be formulated as an incremental propositional CSP where the (boolean) variables correspond to operator instantiations (actions) that are or are not scheduled at certain time steps. In this paper we present a framework for solving this class of propositional CSPs using local search in planning graphs. The search space consists of particular subgraphs of a planning graph corresponding to (complete) variable assignments, and representing partial plans. The operators for moving from one search state to the next one are graph modifications corresponding to revisions of the current variable assignment (partial plan), or to an extension of the represented CSP.Our techniques are implemented in a planner called LPG using various types of heuristics based on a parametrized objective function, where the parameters weight different constraint violations, and are dynamically evaluated using Lagrange multipliers. LPG's basic heuristic was inspired by Walksat, which in Kautz and Selman's Blackbox can be used to solve the SAT-encoding of a planning graph. An advantage of LPG is that its heuristics exploit the structure of the planning graph, while Blackbox relies on general heuristics for SAT-problems, and requires the translation of the planning graph into propositional clauses. Another major difference is that LPG can handle action execution costs to produce good quality plans. This is achieved by an anytime process minimizing an objective function based on the number of constraint violations in a plan and on its overall cost. Experimental results illustrate the efficiency of our approach, showing, in particular, that LPG is significantly faster than Blackbox and other planners based on planning graphs. 相似文献
10.
Problem abstractions based on (either completely or partially) ignoring delete effects of the actions provide the basis for
some seminal classical planning heuristics. However, the palette of the conceptual tools exploited by these heuristics remains
rather limited. We study a framework for approximating the optimal cost solutions for problems with no delete effects that
bridges between certain works on heuristic-search classical planning and on probabilistic reasoning. Our analysis results
in developing a novel heuristic function that combines “informed” set-structured cost estimates and “conservative” action
cost sharing. Our empirical comparative evaluation provides a clear evidence for the attractiveness of this heuristic estimate.
In addition, we examine a (suggested before in the context of probabilistic reasoning) admissible heuristic based on a stronger
variant of action cost sharing. We show that what is good for “typical” problems of probabilistic reasoning turns out not
to be so for “typical” problems of classical planning, and provide a formal account for that difference. 相似文献
11.
As search spaces become larger and as problems scale up, an efficient way to speed up the search is to use a more accurate
heuristic function. A better heuristic function might be obtained by the following general idea. Many problems can be divided
into a set of subproblems and subgoals that should be achieved. Interactions and conflicts between unsolved subgoals of the
problem might provide useful knowledge which could be used to construct an informed heuristic function. In this paper we demonstrate
this idea on the graph partitioning problem (GPP). We first show how to format GPP as a search problem and then introduce
a sequence of admissible heuristic functions estimating the size of the optimal partition by looking into different interactions
between vertices of the graph. We then optimally solve GPP with these heuristics. Experimental results show that our advanced
heuristics achieve a speedup of up to a number of orders of magnitude. Finally, we experimentally compare our approach to
other states of the art graph partitioning optimal solvers on a number of classes of graphs. The results obtained show that
our algorithm outperforms them in many cases. 相似文献
12.
In this paper, the distribution planning model for the multi-level supply chain network is studied. Products which are manufactured at factory are delivered to customers through warehouses and distribution centers for the given customer demands. The objective function of suggested model is to minimize logistic costs such as replenishment cost, inventory holding cost and transportation cost. A mixed integer programming formulation and heuristics for practical use are suggested. Heuristics are composed of two steps: decomposition and post improving process. In the decomposition heuristics, the problems are solved optimally only considering the transportation route first by the minimum cost flow problem, and the replenishment plan is generated by applying the cost-saving heuristic which was originally suggested in the manufacturing assembly line operation, and integrating with the transportation plan. Another heuristic, in which the original model is segmented due to the time periods, and run on a rolling horizon based method, is suggested. With the post-improving process using tabu search method, the performances are evaluated, and it was shown that solutions can be computed within a reasonable computation time by the gap of about 10% in average from the lower bound of the optimal solutions. 相似文献
13.
The ability to find strong solutions to fully observable nondeterministic (FOND) planning problems, if they exist, is desirable because unlike weak and strong-cyclic solutions, strong solutions are guaranteed to achieve the goal. However, only limited work has been done on FOND planning with strong solutions. In this paper, we present a sound and complete strong planning algorithm and incorporate it into our planner, FIP, which has achieved outstanding performance on strong cyclic planning problems. This new strong planning approach enables FIP to first search for strong solutions, and then search for strong-cyclic solutions only if strong solutions do not exist. We conduct extensive experiments to evaluate the new strong planning approach to (1) find a strong solution if one exists and (2) determine the non-existence of a strong solution. Experimental results demonstrate the superior performance of our planner to Gamer and MBP, the two best-known planners capable of solving strong FOND planning problems, on a variety of benchmark problems. Not only is our planner on average three orders of magnitude faster than Gamer and MBP, but it also scales up to larger problems. 相似文献
14.
Dealing with numerical information is practically important in many real-world planning domains where the executability of an action can depend on certain numerical conditions, and the action effects can consume or renew some critical continuous resources, which in pddl can be represented by numerical fluents. When a planning problem involves numerical fluents, the quality of the solutions can be expressed by an objective function that can take different plan quality criteria into account.We propose an incremental approach to automated planning with numerical fluents and multi-criteria objective functions for pddl numerical planning problems. The techniques in this paper significantly extend the framework of planning with action graphs and local search implemented in the lpg planner. We define the numerical action graph (NA-graph) representation for numerical plans and we propose some new local search techniques using this representation, including a heuristic search neighborhood for NA-graphs, a heuristic evaluation function based on relaxed numerical plans, and an incremental method for plan quality optimization based on particular search restarts. Moreover, we analyze our approach through an extensive experimental study aimed at evaluating the importance of some specific techniques for the performance of the approach, and at analyzing its effectiveness in terms of fast computation of a valid plan and quality of the best plan that can be generated within a given CPU-time limit. Overall, the results show that our planner performs quite well compared to other state-of-the-art planners handling numerical fluents. 相似文献
15.
To solve a real‐world planning problem with interfering subgoals, it is essential to perform early detection of subgoal dependencies and achieve the subgoals in the correct order. This is also the case for planning problems with forced goal‐ordering (FGO) constraints. In automated planning, forward search with FGO constraints has been proposed many times over the years, but there are still major difficulties in realizing these FGOs in plan generation. Many existing methods such as goal agenda manager and ordered landmarks cannot detect the FGOs accurately, and thus, the undiscovered ordering relationship may cause the forward search to suffer from deadlocks. In this article, we put forward an approach via an effective search heuristic to constrain a planner to satisfy the FGOs. We make use of an atomic goal‐achievement graph in a look‐ahead search under the FGO constraints. This allows a forward search strategy to plan forward efficiently in multiple steps toward a goal state along a search path. Experimental results illustrate that, by avoiding deadlocks, we can solve more benchmark planning problems more efficiently than previous approaches. We also prove several formal properties for search that are related to FGO detection. 相似文献
16.
The ability to express derived predicates in the formalization of a planning domain is both practically and theoretically important. In this paper, we propose an approach to planning with derived predicates where the search space consists of ??Rule-Action Graphs??, particular graphs of actions and rules representing derived predicates. We propose some techniques for representing such rules and reasoning with them, which are integrated into a framework for planning through local search and rule-action graphs. We also present some heuristics for guiding the search of a rule-action graph representing a valid plan. Finally, we analyze our approach through an extensive experimental study aimed at evaluating the importance of some specific techniques for the performance of the approach. The results of our experiments also show that our planner performs quite well compared to other state-of-the-art planners handling derived predicates. 相似文献
17.
Reconfigurable mobile planetary rovers are versatile platforms that may safely traverse cluttered environments by morphing their physical geometry. Planning paths for these adaptive robots is challenging due to their many degrees of freedom, and the need to consider potentially continuous platform reconfiguration along the length of the path. We propose a novel hierarchical structure for asymptotically optimal (AO) sampling‐based planners and specifically apply it to the state‐of‐the‐art Fast Marching Tree (FMT*) AO planner. Our algorithm assumes a decomposition of the full configuration space into multiple subspaces, and begins by rapidly finding a set of paths through one such subspace. This set of solutions is used to generate a biased sampling distribution, which is then explored to find a solution in the full configuration space. This technique provides a novel way to incorporate prior knowledge of subspaces to efficiently bias search within existing AO sampling‐based planners. Importantly, probabilistic completeness and asymptotic optimality are preserved. Experimental results in simulation are provided that benchmark the algorithm against state‐of‐the‐art sampling‐based planners without the hierarchical variation. Additional experimental results performed with a physical wheel‐on‐leg platform demonstrate application to planetary rover mobility and showcase how constraints such as actuator failures and sensor pointing may be easily incorporated into the planning problem. In minimizing an energy objective that combines an approximation of the mechanical work required for platform locomotion with that required for reconfiguration, the planner produces intuitive behaviors where the robot dynamically adjusts its footprint, varies its height, and clambers over obstacles using legged locomotion. These results illustrate the generality of the planner in exploiting the platform's mechanical ability to fluidly transition between various physical geometric configurations, and wheeled/legged locomotion modes, without the need for predefined configurations. 相似文献
18.
Despite the proven advantages of sampling-based motion planning algorithms, their inability to handle online navigation tasks and providing low-cost solutions make them less efficient in practice. In this paper, a novel sampling-based algorithm is proposed which is able to plan in an unknown environment and provides solutions with lower cost in terms of path length, runtime and stability of the results. First, a fuzzy controller is designed which incorporates the heuristic rules of Tabu search to enable the planner for solving online navigation tasks. Then, an adaptive neuro-fuzzy inference system (ANFIS) is proposed such that it constructs and optimizes the fuzzy controller based on a set of given input/output data. Furthermore, a heuristic dataset generator is implemented to provide enough data for the ANFIS using a randomized procedure. The performance of the proposed algorithm is evaluated through simulation in different motion planning queries. Finally, the proposed planner is compared to some of the similar motion planning algorithms to support the claim of superiority of its performance. 相似文献
19.
Planning with preferences involves not only finding a plan that achieves the goal, it requires finding a preferred plan that achieves the goal, where preferences over plans are specified as part of the planner's input. In this paper we provide a technique for accomplishing this objective. Our technique can deal with a rich class of preferences, including so-called temporally extended preferences (TEPs). Unlike simple preferences which express desired properties of the final state achieved by a plan, TEPs can express desired properties of the entire sequence of states traversed by a plan, allowing the user to express a much richer set of preferences. Our technique involves converting a planning problem with TEPs into an equivalent planning problem containing only simple preferences. This conversion is accomplished by augmenting the inputed planning domain with a new set of predicates and actions for updating these predicates. We then provide a collection of new heuristics and a specialized search algorithm that can guide the planner towards preferred plans. Under some fairly general conditions our method is able to find a most preferred plan—i.e., an optimal plan. It can accomplish this without having to resort to admissible heuristics, which often perform poorly in practice. Nor does our technique require an assumption of restricted plan length or make-span. We have implemented our approach in the HPlan-P planning system and used it to compete in the 5th International Planning Competition, where it achieved distinguished performance in the Qualitative Preferences track. 相似文献
20.
针对一致性规划的高度求解复杂度,分析主流一致性规划器的求解策略,给出影响一致性规划器性能的主要因素:启发信息的有效性,信念状态表示方法的紧凑性和最终问题求解机制的效率。分析信念状态的表示方法和相应的求解机制,并比较不同表示方法在不同条件下的优劣。讨论一致性规划的未来研究方向和发展趋势。 相似文献
|