From 1997 until 2008 about 440 cancer patients were successfully treated in the ion therapy project at GSI. The patient treatment planning was performed with the software TRiP [1, 2]. A crucial part of the treatment planning is the particle number optimization with the goal to achieve a target dose distribution as close as possible to the prescribed biological dose distribution. The optimizatio...

Due to the widespread deployment of distributed energy resources (DERs) and the liberalization of electricity market, traditional distribution networks are undergoing a transition to active distribution systems (ADSs), and the traditional deterministic planning methods have become unsuitable under the high penetration of DERs. Aiming to develop appropriate models and methodologies for the plann...

Planning and scheduling have an interesting relationship. In informal usage, planning and scheduling are frequently treated almost interchangeably. In contrast, formally, their refined and tightly specified descriptions appear quite different: planning is a PSPACE-hard problem, while scheduling is an archetypal NP-hard problem. The research communities that examine these problems seem, to a lar...

Network location models comprise one of the main categories of location models. These models have various applications in regional and urban planning as well as in transportation, distribution, and energy management. In a network location problem, nodes represent demand points and candidate locations to locate the facilities. If the links network is unchangeably determined, the problem will be ...

We consider the problem of on-line continual planning, in which additional goals may arrive while plans for previous goals are still executing and plan quality may depend on how quickly goals are achieved. Even in domains with deterministic actions, this is a challenging problem. One common and straightforward approach is reactionary planning, in which fresh plans are synthesized when a new goa...

In conformant probabilistic planning (CPP), we are given a set of actions with stochastic effects, a distribution over initial states, a goal condition, and a value 0 < p ≤ 1. Our task is to find a plan π such that the probability that the goal condition holds following the execution of π in the initial state is at least p. In this paper we focus on the problem of CPP with deterministic actions...

The definitions of optimal preventive and corrective maintenance of electric power distribution networks can be seen as a special case of a knapsack problem. This paper proposes a dynamic programming approach to deal with this problem. The approach is developed for one or more years of planning horizon. Case studies compare the optimal dynamic programming approach with an heuristic method.

Alex M. Brooks Doctor of Philosophy The University of Sydney January 2007 Parametric POMDPs for Planning in Continuous State Spaces This thesis is concerned with planning and acting under uncertainty in partially-observable continuous domains. In particular, it focusses on the problem of mobile robot navigation given a known map. The dominant paradigm for robot localisation is to use Bayesian e...