Admissible velocity propagation: Beyond quasi-static path planning for high-dimensional robots

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Admissible velocity propagation: Beyond quasi-static path planning for high-dimensional robots

Path-velocity decomposition is an intuitive yet powerful approach to address the complexity of kinodynamic motion planning. The difficult trajectory planning problem is solved in two separate and simpler steps : first, find a path in the configuration space that satisfies the geometric constraints (path planning), and second, find a time-parameterization of that path satisfying the kinodynamic ...

متن کامل

Obstacle-avoiding Path Planning for High Velocity Wheeled Mobile Robots

This paper presents a new motion planning algorithm for wheeled mobile robots in presence of known static obstacles, especially well-suited for high velocity situations. It takes into account several conditions traditionally attached to smooth path planning, i.e. paths with continuous derivative and upper-bounded curvature. It makes use of a global path planner which exploits polynomial G curve...

متن کامل

Kinodynamic Planning in the Configuration Space via Admissible Velocity Propagation

We propose a method that enables kinodynamic planning in the configuration space (of dimension n) instead of the state space (of dimension 2n), thereby potentially cutting down the complexity of usual kinodynamic planning algorithms by an exponential factor. At the heart of this method is a new technique – called Admissible Velocity Propagation (AVP) – which, given a path in the configuration s...

متن کامل

Time-Optimal Velocity Planning Along Predefined Path for Static Formations of Mobile Robots

This paper is concerned with the problem of finding a time-optimal velocity profile along the predefined path for static formations of mobile robots in order to traverse the path in shortest time and to satisfy, for each mobile robot in the formation, velocity, acceleration, tip over and wheel slip prevention constraints. Time-optimal velocity planning is achieved using so called bang-bang cont...

متن کامل

PSO-Based Path Planning Algorithm for Humanoid Robots Considering Safety

In this paper we introduce an improvement in the path planning algorithm for the humanoid soccer playing robot which uses Ferguson splines and PSO (Particle Swarm Optimization). The objective of the algorithm is to find a path through other playing robots to the ball, which should be as short as possible and also safe enough. Ferguson splines create preliminary paths using random generated para...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: The International Journal of Robotics Research

سال: 2016

ISSN: 0278-3649,1741-3176

DOI: 10.1177/0278364916675419