Fast smoothing of manipulator trajectories using optimal bounded-acceleration shortcuts

@article{Hauser2010FastSO,
  title={Fast smoothing of manipulator trajectories using optimal bounded-acceleration shortcuts},
  author={Kris K. Hauser and V. Ng-Thow-Hing},
  journal={2010 IEEE International Conference on Robotics and Automation},
  year={2010},
  pages={2493-2498}
}
This paper considers a shortcutting heuristic to smooth jerky trajectories for many-DOF robot manipulators subject to collision constraints, velocity bounds, and acceleration bounds. The heuristic repeatedly picks two points on the trajectory and attempts to replace the intermediate trajectory with a shorter, collision-free segment. Here, we construct segments that interpolate between endpoints with specified velocity in a time-optimal fashion, while respecting velocity and acceleration bounds… Expand
Trajectory smoothing using jerk bounded shortcuts for service manipulator robots
  • Ran Zhao, D. Sidobre
  • Engineering, Computer Science
  • 2015 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS)
  • 2015
TLDR
Simulation and real-world experimental results on reaching tasks in human environments show that this technique can generate smooth and collision-free motions for a KUKA Light-Weight Robot. Expand
Time-optimal Smoothing of RRT-given Path for Manipulators
TLDR
This paper presents an approach using a timeoptimal trajectory planning algorithm, specifically for robotic manipulators without using inverse kinematics, and always finds a solution successfully if there is a feasible one. Expand
Collision-free and smooth trajectory computation in cluttered environments
TLDR
A novel trajectory computation algorithm to smooth piecewise linear collision-free trajectories computed by sample-based motion planners and a fast and reliable algorithm for collision checking between a robot and the environment along the B-spline trajectories. Expand
Collision-Free and Curvature-Continuous Path Smoothing In Cluttered Environments
TLDR
A novel trajectory computation algorithm to smooth jerky collision-free paths computed by samplebased motion planners using cubic B-splines to generate G or curvature continuous trajectories and a fast and reliable algorithm for collision checking between robot and the environment along the B- Splines. Expand
Planning manipulator trajectories under dynamics constraints using minimum-time shortcuts
Planning minimum-time, dynamically-feasible, collision-free trajectories for robotic manipulators is essential to improve industrial productivity. Yet this difficult problem is still waiting forExpand
A Sampling-Based Algorithm for Planning Smooth Nonholonomic Paths
TLDR
This paper proposes a novel path planning algorithm that is able to produce smooth paths, particularly when considering nonholonomic robot kinematics, like the differential drive kinematic. Expand
Creating Better Collision-Free Trajectory for Robot Motion Planning by Linearly Constrained Quadratic Programming
  • Yizhou Liu, F. Zha, +5 authors Lining Sun
  • Computer Science, Medicine
  • Frontiers in Neurorobotics
  • 2021
Many algorithms in probabilistic sampling-based motion planning have been proposed to create a path for a robot in an environment with obstacles. Due to the randomness of sampling, they canExpand
Optimal trajectory planning for autonomous robots - A review
  • J. Jeevamalar, S. Ramabalan
  • Mathematics
  • IEEE-International Conference On Advances In Engineering, Science And Management (ICAESM -2012)
  • 2012
Optimal Trajectory planning is very important to the operation of robot manipulators. Its main aim is to generate the trajectory from initial to goal that satisfies some objectives, like minimizationExpand
Time-optimal parabolic interpolation with velocity, acceleration, and minimum-switch-time constraints
TLDR
This paper proposes an algorithm for planning parabolic trajectories subject to both physical bounds, i.e. joint velocity and acceleration limits, and the minimum-switch-time constraint, which ensures that the time duration between any two consecutive switch points is always greater than a given minimum value. Expand
Probabilistically complete kinodynamic planning for robot manipulators with acceleration limits
  • Tobias Kunz, M. Stilman
  • Mathematics, Computer Science
  • 2014 IEEE/RSJ International Conference on Intelligent Robots and Systems
  • 2014
TLDR
This work presents a probabilistically complete RRT motion planner that considers joint acceleration limits and potentially non-zero start and goal velocities, and demonstrates both the power and efficiency of this planner using the problem of hitting a nail with a hammer. Expand
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 24 REFERENCES
Global time optimal motions of robotic manipulators in the presence of obstacles
  • Z. Shiller, S. Dubowsky
  • Engineering, Computer Science
  • Proceedings. 1988 IEEE International Conference on Robotics and Automation
  • 1988
A practical method to obtain the global time optimal motions of robotic manipulators is presented. This method takes into account the nonlinear manipulator dynamics, actuator constraints, jointExpand
Optimal robot plant planning using the minimum-time criterion
  • J. Bobrow
  • Mathematics, Computer Science
  • IEEE J. Robotics Autom.
  • 1988
A path planning technique is presented which produces time-optimal manipulator motions in a workspace containing obstacles. The full nonlinear equations of motion are used in conjunction with theExpand
Time optimal trajectory planning for robotic manipulators with obstacle avoidance: A CAD approach
A method is presented which finds the minimum time motions for a manipulator between given end states. The method considers the full nonlinear manipulator dynamics, actuator saturationExpand
Efficient motion planners for nonholonomic mobile robots
TLDR
The authors present a fast and exact planner based upon recursive subdivisions of a collision-free path generated by a lower-level geometric planner which ignores the motion constraints. Expand
Planning collision-free reaching motions for interactive object manipulation and grasping
TLDR
This is, to the authors' knowledge, the first time probabilistic planning techniques are used to automatically generate collision-free reaching motions involving the entire body of a human-like character at interactive frame rates. Expand
Creating High-quality Paths for Motion Planning
TLDR
A new technique is reported, called Partial shortcut, which decreases the path length by interpolating one degree of freedom at a time and it is shown that high-quality paths can be obtained for a broad range of robots. Expand
Real-time dynamic trajectory smoothing for unmanned air vehicles
This brief presents a real-time, feasible trajectory generation algorithm for unmanned air vehicles (UAVs) flying through a sequence of waypoints. The algorithm produces extremal trajectories thatExpand
Elastic Strips : A Framework for Motion Generation in Human Environments
Robotic applications are expanding into dynamic, unstructured, and populated environments. Mechanisms specifically designed to address the challenges arising in these environments, such as humanoidExpand
Randomized multi-modal motion planning for a humanoid robot manipulation task
TLDR
This paper presents a highly general algorithm, Random-MMP, that repeatedly attempts mode switches sampled at random and applies the planner to a manipulation task on the Honda humanoid robot, where the robot is asked to push an object to a desired location on a cluttered table. Expand
Using Motion Primitives in Probabilistic Sample-Based Planning for Humanoid Robots
TLDR
A method of computing efficient and natural-looking motions for humanoid robots walking on varied terrain using a small set of high-quality motion primitives that have been generated offline to derive a sampling strategy for a probabilistic, sample-based planner. Expand
...
1
2
3
...