network expansion studies normally offer new power lines, new substations or expansion of existing substations. they are generally proposed based on technical requirements, but financial restrictions are not considered. because of financial restrictions, ranking of network expansion plans is required. in this paper an algorithm for such ranking, based on technical and financial view points and ...

Complexity is one of the most important issues of any production planning. The increase in complexity of production planning can cause inconsistency between a production plan and an actual outcome. The complexity generally can be divided in two categories, the static complexity and the dynamic complexity, which can be computed using the ant ropy formula. The formula considers the probability of...

When producing estimates in software projects, expert opinions are frequently combined. However, it is poorly understood whether, when, and how to combine expert estimates. In order to study the effects of a combination technique called planning poker, the technique was introduced in a software project for half of the tasks. The tasks estimated with planning poker provided: (1) group consensus ...

we design a two-stage scheme to consider trajectory planning problem of two mobile manipulators for cooperative transportation of a rigid body in presence of static obstacles. within the first stage, regarding the static obstacles we develop a method that searches the workspace for the shortest possible path between start and goal configurations by constructing a graph on a portion of the confi...

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...

Path planning is the key task in the field of Robotics. The modelling environment and algorithm to find shortest, collision free path are the basic issues in the path planning problem of the robot motion planning. This paper presents a literature review of different path planning techniques in static as well as dynamic environment. Planning a path in static environment is easy as compared to dy...

Heuristic calculation is an essential method to solve optimisation problems. However, its vast computing requirements limit real-time and online applications, especially in embedded systems with limited resources, such as mobile robots. This paper presents a robot path planning algorithm called DA-APF based on deterministic annealing. It derived from the artificial potential field can effective...