The main contribution of this paper is a novel method for planning globally optimal trajectories dynamical systems subject to polygonal constraints. proposed hybrid trajectory approach, which combines graph search, i.e. discrete roadmap method, with convex optimization, complete path method. Contrary past approaches, have focused on using simple obstacle approximations, or sub-optimal spatial d...

The increasing versatility in order characteristics calls for planning and control systems that are able to evolve in time. Traditional hierarchical systems are usually based on a function-oriented static control structure in which all orders and products are handled similarly. Due to the dynamically changing characteristics of manufacturing environments these static control structures are not ...

This study presents a dynamic way in a DG planning problem instead of the last static or pseudo-dynamic planning point of views. A new way in modeling the DG units’ output power and the load uncertainties based on the probability rules is proposed in this paper. A sensitivity analysis on the stochastic nature of the electricity price and global fuel price is carried out through a proposed model...

Graph theoretic approaches plays important role in the path planning problems. The usefulness of Graph Theoretic approaches mainly the voronoi diagram is provided for the path planning in static and dynamic environment in this paper. Voronoi Diagram plays important role in computing the optimal path between the source & destination in static as well as dynamic environment. So, through the liter...

This paper presents a comprehensive study on monoand multi-objective approaches for electrical distribution network design using particle swarmoptimization (PSO). Specifically, two distribution network design problems, i.e., static and expansion planning, are solved using PSO. The network planning involves optimization of both network topology and branch conductor sizes. Both the planning probl...

A path-planning method based on a combination of the static global and the dynamic local pathplanning methods is proposed for robot path planning under a complex environment. There are known static obstacles and unknown dynamic obstacles in any complex environment. The local-path planner dynamically generates a local path using obstacle-motion prediction and a rolling window for dynamic path pl...

In this paper the Differential Evolution algorithm is deployed to the robotic path planning optimization problem for autonomous mobile vehicles. At this stage, the simulations consider the robot world with level surfaces and static obstacles , in which the optimization is performed off-line. The global objective is to evaluate the differential evolutionary algorithm in solving path planning pro...

We propose a new approach for the reliable 6-dimensional quasi-static manipulation with aerial towedcable systems. The novelty of this approach lies in the combination of results deriving from the static analysis of cable-driven manipulators with a cost-based motion-planning algorithm to solve manipulation queries. Such a combination of methods is able to produce feasible paths that do not appr...

This paper presents an optimal planner for the international probabilistic planning competition at ICAPS-08, IPPC-2008 for short. The planner solves non-deterministic action planning problems with binary decision diagrams. The efficiency of the planning approach is based on a translation of the non-deterministic planning problems into a twoplayer turn-taking game, with a set of actions selected...