The paper describes an experiment of answer set planning in biochemical pathway planning. The focus is on large planning problem instances. It is shown that well-known planning techniques, such as planning graph analysis, landmarks recognition, and planning using landmarks are useful in answer set planning and can be easily incorporated in an answer set planning system.

Research on distributed task planning model for multi-autonomous underwater vehicle (MAUV). A scroll time domain quantum artificial bee colony (STDQABC) optimization algorithm is proposed to solve the multi-AUV optimal task planning scheme. In the uncertain marine environment, the rolling time domain control technique is used to realize a numerical optimization in a narrowed time range. Rolling...

This paper presents a method of solving planning problems that involve actions whose effects change according to the situations in which they are performed. The approach is an extension of the conventional planning methodology in which plans are constructed iteratively by scanning for goals that are not yet satisfied, inserting actions to achieve them, and introducing additional subgoals to be ...

Contemporary process planners for sheet metal bending solve the process planning problem for individual parts. Quite often, many di erent parts can be produced on shared setups. However, plans generated by current process planning systems fail to exploit this commonality between setups and try to generate optimal setups for individual parts. In this paper, we present an algorithm for multi-part...

We describe a ‘How was your day?’ (HWYD) Companion whose purpose is to establish a comforting and supportive relationship with a user via a conversation on a variety of work-related topics. The system has several fairly novel features aimed at increasing the naturalness of the interaction: a rapid ‘short loop’ response primed by the results of acoustic emotion analysis, and an ‘interruption man...

This paper describes COLLAGE, a planner that utilizes a variety of non-traditional methods for plan construction within a partitioned or localized reasoning framework. The COLLAGE domain representation and plan construction methods are based on the use of action-based constraints. Not only do such constraints yield highly natural domain encodings, but they are also associated with cost-effectiv...

Material requirements planning (MRP) systems became a prominent approach to managing the flow of raw material and components on the factory floor in the late 20th century. Its adoption was not an over night phenomenon, but was a slow progression over many decades. This article chronicles many developments and events during the formative years of MRP, highlighting changes in computer technology ...

We present an empirical study of mathematical proofs by diagonalization, the aim is their mechanization based on proof planning techniques. We show that these proofs can be constructed according to a strategy that (i) nds an indexing relation, (ii) constructs a diagonal element, and (iii) makes the implicit contradiction of the diagonal element explicit. Moreover we suggest how diagonal element...

Herein, a methodology for analysing an area’s broad tourism product is presented. In particular, after theoretically approaching the issue of Destination Management, and the issues of marketing and planning geographical sections, the use of a Destination Card is proposed for applications relevant to areas’ strategic analyses. The aforementioned card is a result of the combination of tools for l...

Systematic conservation planning (SCP) is a field of conservation biology concerned with delivering on-the-ground actions that achieve conservation goals. It describes a set of operational models that cover both design and implementation of conservation, with a strong focus on mobilising the collective action typically required to implement conservation. SCP, as it was originally described, was...