The shortest/optimal path generation is essential for the efficient operation of a mobile robot. Recent advances in robotics and machine intelligence have led to the application of modern optimization method such as the genetic algorithm (GA), to solve the path-planning problem. However, the genetic algorithm path planning approach in the previous works requires a preprocessing step that captur...

optimal balancing is a new approach based on optimal control a which modes, controls and the amount of equilibrium scale are calculated simultaneously. this approach has a significant effect on increasing performance of industrial robots which causes maximum decreasing of energy consumption. despite many applications of robotics such as welding and gluing, the path is predefined , but other unk...

Due to the complex constraints, more uncertain factors and critical real-time demand of path planning for unmanned combat aerial vehicle (UCAV), an approach of fast path planning based on Voronoi diagram and pre-evolution genetic algorithm (PEGA) is proposed, which makes use of the principle of hierarchical path planning. First the Voronoi diagram is utilized to generate the initial paths and c...

Planning optimal paths for large numbers of robots is computationally expensive. In this paper, we introduce a new framework for multirobot path planning called subdimensional expansion, which initially plans for each robot individually, and then coordinates motion among the robots as needed. More specifically, subdimensional expansion initially creates a one-dimensional search space embedded i...

This article introduces a novel path planning algorithm, called m, that reduces the problem of robot path planning to optimisation of a probabilistic finite state automaton. The m-algorithm makes use of renormalised measure m of regular languages to plan the optimal path for a specified goal. Although the underlying navigation model is probabilistic, the m-algorithm yields path plans that can b...

The path planning problem is relevant for all applications in which a mobil robot should autonomously navigate. Finding the shortest path in an environment that is only partialy known and changing is a difficult problem. Replaning the entire path when the robot encounters new obstacles is computational inefficient. Starting with an initial path and than modify the path locally does not guarante...

The paper describes a problem of multi-agent path planning in environment with obstacles. Novel approach to multi-agent optimal path planning, using graph representation of environment models is described. When planning the path of each robot, the graph model of environment is dynamically changed for path correction and collision avoidance. New algorithm applies changes of robots’ paths and spe...

planning robot trajectory is a complex task that plays a significant role in design and application of robots in task space. the problem is formulated as a trajectory optimization problem which is fundamentally a constrained nonlinear optimization problem. open-loop optimal control method is proposed as an approach for trajectory optimization of cable parallel manipulator for a given two-end-po...

We consider the problem of generating an optimal aircraft reference trajectory in a horizontal plane, where the objective is to minimize exposure to a spatiotemporally varying scalar field. We consider a special case, where this field is timeinvariant, and we discuss optimal trajectory generation for an aircraft kinematic model based on firstand second-order necessary conditions of optimal cont...