this article addresses an efficient and novel method for singularity-free path planning and obstacle avoidance of parallel manipulator based on neural networks. a modified 4-5-6-7 interpolating polynomial is used to plan a trajectory for a spherical parallel manipulator. the polynomial function which is smooth and continuous in displacement, velocity, acceleration and jerk is used to find a pat...

| This paper addresses dynamic trajectory planning which is deened as trajectory planning for a robot subject to dynamic constraints and moving in a dynamic workspace, i.e. with moving obstacles. To begin with, we propose the novel concept of state-time space as a tool to formulate dynamic trajectory planning problems. The state-time space of a robot is its state space augmented of the time dim...

Flexible needle insertion for percutaneous therapies is formulated in this paper as a trajectory planning problem of a linear beam, supported by virtual springs. Using this simplified model, the forward and inverse kinematics of the needle is solved analytically, providing a way for simulation and path planning in real-time. Using the inverse kinematics, the required needle basis trajectory can...

Trajectory planning is an essential part of systems controlling autonomous entities such as vehicles or robots. It requires not only finding spatial curves but also that dynamic properties of the vehicles (such as speed limits for certain maneuvers) must be followed. In this paper, we present an approach for augmenting existing path planning methods to support basic dynamic constraints, concret...

Optimal motion planning is critical for the successful operation of an autonomous mobile robot. Many proposed approaches use either fuzzy logic or genetic algorithms (GAs), however, most approaches offer only path planning or only trajectory planning, but not both. In addition, few approaches attempt to address the impact of varying terrain conditions on the optimal path. This paper presents a ...

This paper proposes a novel solution to the problem of computing a set of topologically inequivalent paths between two points in a space given a set of samples drawn from that space. Specifically, these paths are homotopy inequivalent where homotopy is a topological equivalence relation. This is achieved by computing a basis for the group of homology inequivalent loops in the space. An addition...

Trajectory (path) planning is a well known and thoroughly studied field of automated planning. It is usually used in computer games, robotics or autonomous agent simulations. Grids are often used for regular discretization of continuous space. Many methods exist for trajectory (path) planning on grids, we address the well known A* algorithm and the state-of-the-art Theta* algorithm. Theta* algo...

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

This paper presents a smooth path planning method considering physical limits for twowheeled mobile robots (TMRs). A Bezier curve is utilized to make an S-curve path. A convolution operator is used to generate the center velocity trajectory to travel the distance of the planned path while considering the physical limits. The trajectory gained through convolution does not consider the direction ...

Optimal motion planning is critical for the successful operation of an autonomous mobile robot. Many proposed approaches use either fuzzy logic or genetic algorithms (GAs), however, most approaches offer only path planning or only trajectory planning, but not both. In addition, few approaches attempt to address the impact of varying terrain conditions on the optimal path. This paper presents a ...