This paper presents a method for robot motion planning in dynamic environments. It consists of selecting avoidance maneuvers to avoid static and moving obstacles in the velocity space, based on the… Expand

A simple and efficient approach to the computation of avoidance maneuvers among moving obstacles is presented, and the method is applied to an example of a 3-D avoidance maneuver.Expand

A method for planning the motions of autonomous vehicles moving on general terrains is presented that obtains the geometric path and vehicle speeds that minimize motion time considering vehicle… Expand

The nonlinear velocity obstacle is introduced, which takes into account the shape, velocity and path curvature of the moving obstacle, which elevates the planning strategy to a second order method, compared to the first order avoidance using the linear v-obstacle.Expand

A method is presented for optimizing the motions of articulated systems along specified paths, minimizing a time-energy cost function, and the optimal control obtained is smooth, as opposed to the typically discontinuous time optimal control.Expand

This paper presents a real-time motion planning approach, based on the concept of the Non-LinearVobst (NLVO), and presents the iterative planner, which is applied to vehicle navigation and demonstrated in a complex traffic scenario.Expand

This paper addresses the issue of collision avoidance using lane-change maneuvers. Of particular interest is to determine the minimum distance beyond which an obstacle cannot be avoided at a given… Expand

A method for computing the time-optimal motions of robotic manipulators is presented that considers the nonlinear manipulator dynamics, actuator constraints, joint limits, and obstacles and is demonstrated in several examples for two- and six-degree-of-freedom manipulators with obstacles.Expand

An algorithm is presented for the computation of path-constrained time-optimal motions of robotic manipulators exploring the nature of so-called critical points and critical arcs, which makes this algorithm robust near the switching points, which are potential points of failure in the other methods.Expand