Corpus ID: 220936550

Predicted Composite Signed-Distance Fields for Real-Time Motion Planning in Dynamic Environments

  title={Predicted Composite Signed-Distance Fields for Real-Time Motion Planning in Dynamic Environments},
  author={M. N. Finean and Wolfgang Merkt and I. Havoutis},
We present a novel framework for motion planning in dynamic environments that accounts for the predicted trajectories of moving objects in the scene. We explore the use of composite signed-distance fields in motion planning and detail how they can be used to generate signed-distance fields (SDFs) in real-time to incorporate predicted obstacle motions. We benchmark our approach of using composite SDFs against performing exact SDF calculations on the workspace occupancy grid. Our proposed… Expand
A Workspace Limit Approach for Teleoperation Based on Signed Distance Function
A novel representation method to describe the geometric information of the workspace by using Signed Distance Function (SDF) and the corresponding nearest points on the boundary for unreachable points are also pre-computed and stored. Expand
Simultaneous Scene Reconstruction and Whole-Body Motion Planning for Safe Operation in Dynamic Environments
This work studies the impact that signed and unsigned distance fields have on optimisation convergence, and the resultant error cost in trajectory optimisation problems in 2D path planning, arm manipulator motion planning, and whole-body loco-manipulation planning and constructs a practical hybrid mapping and motion planning system which uses GPU-Voxels and GPMP2. Expand
Where Should I Look? Optimised Gaze Control for Whole-Body Collision Avoidance in Dynamic Environments
As robots operate in increasingly complex and dynamic environments, fast motion re-planning has become a widely explored area of research. In a real-world deployment, we often lack the ability toExpand


ITOMP: Incremental Trajectory Optimization for Real-Time Replanning in Dynamic Environments
We present a novel optimization-based algorithm for motion planning in dynamic environments. Our approach uses a stochastic trajectory optimization framework to avoid collisions and satisfyExpand
Safe and Efficient High Dimensional Motion Planning in Space-Time with Time Parameterized Prediction
  • S. Li, J. Shah
  • Computer Science
  • 2019 International Conference on Robotics and Automation (ICRA)
  • 2019
An algorithm that can plan safe and efficient robot trajectories in real time, given time-parameterized motion predictions, in order to avoid fast-moving obstacles in human-robot collaborative environments is proposed. Expand
Gaussian Process Motion planning
This paper develops the Gaussian Process Motion Planner (GPMP), a gradient-based optimization technique that optimizes continuous-time trajectories with respect to a cost functional by exploiting GP interpolation. Expand
I-Planner: Intention-aware motion planning using learning-based human motion prediction
A motion planning algorithm to compute collision-free and smooth trajectories for high-degree-of-freedom (high-DOF) robots interacting with humans in a shared workspace and the benefits of the intention-aware planner in terms of computing safe trajectories in such uncertain environments are demonstrated. Expand
Probabilistic Roadmaps for Path Planning in High-Dimensional Configuration Spaces
Real-time robot motion planning using rasterizing computer graphics hardware. In Proc. OY82] C. O'D unlaing and C.K. Yap. A retraction method for planning the motion of a disc. A local approach forExpand
Motion planning with sequential convex optimization and convex collision checking
A sequential convex optimization procedure, which penalizes collisions with a hinge loss and increases the penalty coefficients in an outer loop as necessary, and an efficient formulation of the no-collisions constraint that directly considers continuous-time safety are presented. Expand
CHOMP: Gradient optimization techniques for efficient motion planning
This paper presents CHOMP, a novel method for continuous path refinement that uses covariant gradient techniques to improve the quality of sampled trajectories and relax the collision-free feasibility prerequisite on input paths required by those strategies. Expand
Randomized Kinodynamic Motion Planning with Moving Obstacles
A detailed analysis of the planner's convergence rate shows that, if the state×time space satisfies a geometric property called expansiveness, then a slightly idealized version of the implemented planner is guaranteed to find a trajectory when one exists, with probability quickly converging to 1, as the number of milestones increases. Expand
RRT-connect: An efficient approach to single-query path planning
  • J. Kuffner, S. LaValle
  • Computer Science
  • Proceedings 2000 ICRA. Millennium Conference. IEEE International Conference on Robotics and Automation. Symposia Proceedings (Cat. No.00CH37065)
  • 2000
A simple and efficient randomized algorithm is presented for solving single-query path planning problems in high-dimensional configuration spaces. The method works by incrementally building twoExpand
Online Motion Planning Over Multiple Homotopy Classes with Gaussian Process Inference
This work builds on prior work that considers graph-based trajectories to find solutions in multiple homotopy classes concurrently and extends it to an online setting where the unreachable part of the graph is pruned and the remaining graph is reoptimized at every time step. Expand