We present an algorithm that quickly finds optimal plans for unforeseen agent preferences within graph-based planning domains where actions have deterministic outcomes and action costs are linearly parameterized by preference parameters. We focus on vehicle route planning for drivers with personal trade-offs for different types of roads, and specifically on settings where these preferences are ...

background: the dosimetric performance of eclipse 6.5 three dimensional treatment planning system (3dtps) is evaluated by comparing the calculated and measured dose in two dimensions following the guide lines of american association for physicists in medicine task group 53. materials and methods: the calculations were performed by the 3dtps for symmetric as well as asymmetric fields for standar...

strategic environmental assessment can be viewed as a process to integrate the concept ofsustainable development into planning. in this context, sea can be regarded as a method that regulates theplanning process to a state of sustainable development. however, to reach that goal it is necessary to achieve full integration of planning and the sea process.therefore this paper considers the integra...

background: lesson planning has a distinct role in enhancing education quality, as well as maintaining the friendly and dynamic atmosphere of the academic environment and increasing student's initiatives for achieving better educational attainments. lesson planning is a process for defining the goals, understanding the needs, and specifying available tools and possible limitations. lesson plann...

Simulations are recognized as an efficient and effective way of teaching and learning complex, dynamic systems. A new concept of simulation-based teaching with a built-in learning history is introduced in several simulation-based teaching tools. The user of these systems obtains access to past states and decisions and to the consequences of these decisions. To date, there has been very little r...

This paper is a report on research towards the development of an abstraction-based framework for decision-theoretic planning. We make use of two planning approaches in the context of probabilistic planning: planning by abstraction and planning graphs. To create abstraction hierarchies our planner uses an adapted version of a hierarchical planner under uncertainty, and to search for plans, we pr...

Motivated by a path planning problem we consider the following procedure. Assume that we have two points s and t in the plane and take K = ∅. At each step we add to K a compact convex set that does not contain s nor t. The procedure terminates when the sets in K separate s and t. We show how to add one set to K in O(1 + kα(n)) amortized time plus the time needed to find all sets of K intersecti...

Given a map in which each position is associated with a travcrsability cost, the path planning problem is to find a minimum-cost path from a source position to every other position in the map. The paper proposes a dynamic programming algorithm to solve the problem, and analyzes the exact number of operations that the algorithm takes. The algorithm accesses the map in a highly regular way, so it...

Trajectory planning is an essential part of systems controlling autonomous entities such as vehicles or robots. It requires not only finding spatial curves but also that dynamic properties of the vehicles (such as speed limits for certain maneuvers) must be followed. In this paper, we present an approach for augmenting existing path planning methods to support basic dynamic constraints, concret...

Despite major progress in AI planning over the last few years, many interesting domains remain challenging for current planners. This paper presents component abstraction, an automatic and generic technique that can reduce the complexity of an important class of planning problems. Component abstraction uses static facts in a problem definition to decompose the problem into linked abstract compo...