Planning as Satisfiability is an important approach to Propositional Planning. A serious drawback of the method is its limited scalability, as the instances that arise from large planning problems are often too hard for modern SAT solvers. This work tackles this problem by combining two powerful techniques that aim at decomposing a planning problem into smaller subproblems, so that the satisfia...

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.

Robotic motion planning is an ubiquitous field of study, with innumerable applications in science, engineering, and beyond. A majority of research has focused on fully automated strategies, which have led to great progress in confronting a variety of interesting scenarios. At its core, however, motion planning is simply infeasible for most complex problems. Automatic planners lack insight and c...

This paper presents a new method for computing macromolecular motions based on the combination of path planning algorithms, originating from robotics research, and elastic network normal mode analysis. The low-frequency normal modes are regarded as the collective degrees of freedom of the molecule. Geometric path planning algorithms are used to explore these collective degrees of freedom in ord...

In contrast to classical planning, in adversarial planning, the planning agent has to face an adversary trying to prevent him from reaching his goals. In this report, we investigate a forward-chaining approach to adversarial planning based on the AO* algorithm. The exploration of the underlying AND/OR graph is guided by a heuristic evaluation function, inspired by the relaxed planning graph heu...

We describe a programming tutor framework that consists of two configurable components, a guided-planning component and an assisted-coding component that offers task relevant automatically-generated hints on demand to students. We evaluate the effectiveness of the new integrated planning and coding environment by comparing it to three other tutor conditions: planning-only, coding-only, and plan...

Computed tomography-guided percutaneous biopsy is a safe and effective alternative method for evaluating selected intra-orbital lesions where the preoperative diagnosis is important for the therapeutic planning. The authors describe two cases of patients with uncommon primary orbital tumors whose diagnosis was obtained by means of computed tomography-guided core needle biopsy, with emphasis on ...

The goal of assembly planning consists in generating feasible sequences to assemble a product and selecting an efficient assembly sequence from which related constraint factors such as geometric features, assembly time, tools, and machines are considered to arrange a feasible assembly sequence based on planner’s individual heuristics. Suchlike planning may implement genetic algorithms to go tow...

We explore two advantages of interleaving execution with planning. First, the overall planning and execution time can be reduced. Second, information from the environment can be incorporated into the planner’s knowledge of the world. We extend the PRODIGY planner to handle execution as prompted by the user and to incorporate information that results from this execution. Such information can eit...