AI planning research has traditionally focused on offline planning for static single-agent environments. In environments where an agent needs to plan its interactions with other autonomous agents, planning is much more complicated, because the actions of the other agents can induce a combinatorial explosion in the number of contingencies that the planner will need to consider. This paper discus...

presence of distributed generation (dg) in electric distribution systems provides an attractive new alternative in capacity expansion planning of these systems. in this paper a new model is developed for solving simultaneous placement of hv/mv substations and dg units as a static planning tool. this model aims to minimize fixed and variable costs of planning. constraints related to dgs, substat...

Since the clinical implementation of novel rotational forms of intensity-modulated radiotherapy, a variety of planning studies have been published that reinforce the major selling points of the technique. Namely, comparable or even improved dose distributions with a reduction in both monitor units and treatment times, when compared with static gantry intensity-modulated radiotherapy. Although t...

Abstract A-star algorithm is a kind of simple path planning without solving the calculus, which has high application. However, compared with other algorithms, it occupies large memory space. To solve this problem, paper proposes three new concepts such as bidirectional search, guide line and list key points. optimized rasterize on indoor environment modeling method, finally through MATLAB simul...

Global path planners for autonomous mobile robots have been demonstrated to map optimal routes in structured environments. The search for the optimum path from a given starting point to a destination is usually formulated as a graph search problem. Over the years, much progress has been made in efficient methods for global motion planning in static environments. A number of both exact and appro...