Measuring the efficiency of real businesses is not a simple task, because a real business may involve several processes and sub-processes, forming a very complicated dynamic network of interactions. In this paper, a customized dynamic network data envelopment analysis (NDEA) model is proposed to measure the efficiency of the sub-processes in a real business. The proposed dynamic NDEA model is f...

Optimal distribution substation placement is one of the major components of optimal distribution system planning projects. In this paper optimal substation placement problem is solved using Imperialist Competitive Algorithm (ICA) as a new developed heuristic optimization algorithm. This procedure gives the optimal size, site and installation time of medium voltage substation, using their relate...

| This paper addresses Dynamic Trajectory Planning, which is deened as Motion Planning for a robot A moving in a dynamic workspace W, i.e. with moving obstacles. Besides A is subject both to kinematic constraints and dynamic constraints. We consider the case of a car-like robot A with bounded velocity and acceleration, moving in a dynamic workspace W = IR 2. Our approach is an extension to the ...

this research uses a comprehensive method to solve a combinatorial problem of distribution network expansion planning (dnep) problem. the proposed multi-objective scheme aims to improve power system's accountability and system performance parameters, simultaneously, in the lowest possible costs. the dynamic programming approach is implemented in order to find the optimal sizing, siting and...

| This paper addresses trajectory planning in a dynamic workspace, i.e. motion planning for a robot subject to dynamic constraints and moving in a workspace with moving obstacles. First is introduced the novel concept of state-time space, i.e. the state space of the robot augmented of the time dimension. Like connguration space which is a tool to formulate path planning problems, state-time spa...

| This paper addresses trajectory planning in dynamic workspaces, i.e. trajectory planning for a robot subject to dynamic constraints and moving in a workspace with moving obstacles. First is introduced the novel concept of state-time space, i.e. the state space of the robot augmented of the time dimension. Like the concept of connguration space which is a tool to formulate path planning proble...

Unmanned Aerial Vehicle (UAV) path planning is divided into off-line static path planning and real-time dynamic path planning. The former one is applied to the ideal situation that the terrain has been clear, and there is no unexpected situation in flight. Actually, however, the flight situation is very complex, we have to adopt real-time path planning based on off-line static path planning. To...

| This paper addresses dynamic trajectory planning, which is deened as motion planning for a robot A moving in a dynamic workspace W, i.e. a workspace cluttered up with stationary and moving obstacles. Besides A is subject both to kinematic constraints, i.e. constraints involving the connguration parameters of A and their derivatives, and dynamic constraints, i.e. constraints on the forces, the...

This paper proposes a path and motion planning algorithm for a tree climbing problem. This problem is challenging as the shape of tree is complex and irregular. To our best knowledge, this is the first paper dealing with the path planning problem on natural tree environment. Different from conventional motion planning approach that requires constructing a complex configuration space, this paper...