Volumetric modulated arc therapy (VMAT) and intensity modulated radiation therapy (IMRT) are commonly used treatment techniques for cancer treatment, and both the VMAT and IMRT techniques use the photon beam (mega-voltage X-rays) to deliver radiation dose to the tumor. The capability of modulating radiation beam has increased the ability of delivering more conformal dose distributions to tumor ...

An optimal planning of future wireless networks is fundamental to satisfy rising traffic demands jointly with the utilization of sophisticated techniques, such as OFDMA. Current methods for this task require a static model of the problem. However, uncertainty of data arises frequently in wireless networks, e. g., fluctuating bit rate requirements. In this paper, robust optimization is applied t...

Much of the research in facility layout has focused on static layouts where the material handling flow is assumed to be constant during the planning horizon. But in today’s market-based, dynamic environment, layout rearrangement may be required during the planning horizon to maintain layout effectiveness. A few algorithms have been proposed to solve this problem. They include dynamic programmin...

Mobile robot global path planning in a static environment is an important problem all along. The paper proposes a method of global path planning based on neural network and genetic algorithm. The neural network model of environmental information in the workspace for a robot is constructed. Using this model, the relationship between a collision avoidance path and the output of the model is estab...

Along with innovative ideas for treating non static tumours comes the need of a 4D supporting treatment planning software. The GSI code treatment planning for particles (TRiP) [1;2] has recently been extended to 4D capabilities (TRiP4D) [3]. The status of TRiP4D has proceeded to a level which allows the first four dimensional uncertainty simulations. The sum of all uncertainties present at trea...

The Algorithm2 for a n-link manipulator movement amidst arbitrary unknown static obstacles for a case when a sensor system supplies information about local neighborhoods of different points in the configuration space is presented. The Algorithm2 guarantees the reaching of a target position in a finite number of steps. The Algorithm2 is reduced to a finite number of calls of a subroutine for pla...

An exact algorithm for a n-link manipulator movement amidst arbitrary unknown static obstacles is presented. The algorithm guarantees the reaching of a target configuration of the manipulator in a finite number of steps. The algorithm is reduced to a finite number of calls of a subroutine for planning a trajectory in the presence of known forbidden states. The polynomial approximation algorithm...

. This report looks at a new approach to motion planning known as Probabilistic Cell Decomposition (PCD). This approach combines ideas from Approximate Cell Decomposition (ACD) and Sampling-based motion planning to create a planner that can work in highdimensional static configuration space. This report first gives an overview of PCD and then describes the implementation of the planner along wi...

This abstract discusses work looking into techniques for improving the quality of the search heuristics used to guide forward-chaining planning. The improvements in heuristic quality are made by performing a static analysis of the planning problem to identify commonly occurring ‘generic types’, and providing additional heuristic guidance based on their known properties. In doing so, the heurist...

We extend a static mixed integer disjunctive (MID) transmission expansion planning model so as to deal with circuit contingency criterion. The model simultaneously represents the network constraints for base case and each selected circuit contingency. The MID approach allows a commercial optimization solver to achieve and prove solution optimality. The proposed approach is applied to a regional...