76 research outputs found

    Explanation-based generalization of partially ordered plans

    Get PDF
    Most previous work in analytic generalization of plans dealt with totally ordered plans. These methods cannot be directly applied to generalizing partially ordered plans, since they do not capture all interactions among plan operators for all total orders of such plans. We introduce a new method for generalizing partially ordered plans. This method is based on providing explanation-based generalization (EBG) with explanations which systematically capture the interactions among plan operators for all the total orders of a partially-ordered plan. The explanations are based on the Modal Truth Criterion which states the necessary and sufficient conditions for ensuring the truth of a proposition at any point in a plan, for a class of partially ordered plans. The generalizations obtained by this method guarantee successful and interaction-free execution of any total order of the generalized plan. In addition, the systematic derivation of the generalization algorithms from the Modal Truth Criterion obviates the need for carrying out a separate formal proof of correctness of the EBG algorithms

    On the computational complexity of temporal projection and some related problems

    Get PDF
    One kind of temporal reasoning is temporal projection -the computation of the consequences for a set of events. This problem is related to a number of other temporal reasoning tasks such as story understanding, plan validation, and planning. We show that one particular simple case of temporal projection on partially ordered events turns out to be harder than previously conjectured. However, given the restrictions of this problem, planning and story understanding are easy. Additionally, we show that plan validation, one of the intended applications of temporal projection, is tractable for an even larger class of plans. The incomplete decision procedure for the temporal projection problem that has been proposed by other authors, however, fails to be complete in the case where we have shown plan validation to be tractable

    An analysis of commitment strategies in planning: The details

    Get PDF
    We compare the utility of different commitment strategies in planning. Under a 'least commitment strategy', plans are represented as partial orders and operators are ordered only when interactions are detected. We investigate claims of the inherent advantages of planning with partial orders, as compared to planning with total orders. By focusing our analysis on the issue of operator ordering commitment, we are able to carry out a rigorous comparative analysis of two planners. We show that partial-order planning can be more efficient than total-order planning, but we also show that this is not necessarily so

    Computational Aspects of Reordering Plans

    Full text link
    This article studies the problem of modifying the action ordering of a plan in order to optimise the plan according to various criteria. One of these criteria is to make a plan less constrained and the other is to minimize its parallel execution time. Three candidate definitions are proposed for the first of these criteria, constituting a sequence of increasing optimality guarantees. Two of these are based on deordering plans, which means that ordering relations may only be removed, not added, while the third one uses reordering, where arbitrary modifications to the ordering are allowed. It is shown that only the weakest one of the three criteria is tractable to achieve, the other two being NP-hard and even difficult to approximate. Similarly, optimising the parallel execution time of a plan is studied both for deordering and reordering of plans. In the general case, both of these computations are NP-hard. However, it is shown that optimal deorderings can be computed in polynomial time for a class of planning languages based on the notions of producers, consumers and threats, which includes most of the commonly used planning languages. Computing optimal reorderings can potentially lead to even faster parallel executions, but this problem remains NP-hard and difficult to approximate even under quite severe restrictions

    On the computational complexity of temporal projection and some related problems

    Get PDF
    One kind of temporal reasoning is temporal projection -the computation of the consequences for a set of events. This problem is related to a number of other temporal reasoning tasks such as story understanding, plan validation, and planning. We show that one particular simple case of temporal projection on partially ordered events turns out to be harder than previously conjectured. However, given the restrictions of this problem, planning and story understanding are easy. Additionally, we show that plan validation, one of the intended applications of temporal projection, is tractable for an even larger class of plans. The incomplete decision procedure for the temporal projection problem that has been proposed by other authors, however, fails to be complete in the case where we have shown plan validation to be tractable

    Belief systems for persuasive discourse planning

    Get PDF
    This thesis is concerned with the problem of construction of the logical structure of a persuasive discourse. A persuasive discourse can be defined as a monodirectional form of communication, generated by a speaker in order to convince a hearer about the validity (or fallacy) of a specific belief The construction of the structure of a persuasive discourse is realized, in this work, through the adoption of two basic elements: a belief system and a planning system. The planning system is used as a tool for the automatic generation of the discourse structure (or plan), obtained through the decomposition of the assigned (communicative) goals of persuasion, aimed at producing specific effects on the hearer’s beliefs. The belief system is adopted in order to endow the planning process with a formal language of beliefs for the representation of such goals, and with the mechanisms which govern the propagation of their (expected) effects on the rest of the hearer's belief state. The main results presented consist of the formalization of a paradigm for specification of belief systems, and of a method — whose correctness is formally proved — for their integration with planning systems. The formalization of a belief system for discourse structure representation (defined in accordance with the theoretical paradigm) is also given, together with the description of its implementation and integration with a specific planner, which resulted in the actual completion of a system for the automatic generation of persuasive discourse plans

    Heuristic Model of Accountability Based on Measurement of the Human Potential

    Get PDF
    Elementary Educatio

    Planning for behaviour-based robotic assembly: a logical framework

    Get PDF

    Enroute flight planning: The design of cooperative planning systems

    Get PDF
    Design concepts and principles to guide in the building of cooperative problem solving systems are being developed and evaluated. In particular, the design of cooperative systems for enroute flight planning is being studied. The investigation involves a three stage process, modeling human performance in existing environments, building cognitive artifacts, and studying the performance of people working in collaboration with these artifacts. The most significant design concepts and principles identified thus far are the principle focus
    • …
    corecore