Paramater Optimization for Manipulator Motion Planning using a Novel Benchmark Set

by   Carl Gaebert, et al.

Sampling-based motion planning algorithms have been continuously developed for more than two decades. Apart from mobile robots, they are also widely used in manipulator motion planning. Hence, these methods play a key role in collaborative and shared workspaces. Despite numerous improvements, their performance can highly vary depending on the chosen parameter setting. The optimal parameters depend on numerous factors such as the start state, the goal state and the complexity of the environment. Practitioners usually choose these values using their experience and tedious trial and error experiments. To address this problem, recent works combine hyperparameter optimization methods with motion planning. They show that tuning the planner's parameters can lead to shorter planning times and lower costs. It is not clear, however, how well such approaches generalize to a diverse set of planning problems that include narrow passages as well as barely cluttered environments. In this work, we analyze optimized planner settings for a large set of diverse planning problems. We then provide insights into the connection between the characteristics of the planning problem and the optimal parameters. As a result, we provide a list of recommended parameters for various use-cases. Our experiments are based on a novel motion planning benchmark for manipulators which we provide at


page 2

page 4

page 6

page 7


Learning Sampling Distributions for Efficient High-Dimensional Motion Planning

Robot motion planning involves computing a sequence of valid robot confi...

Embodied Lifelong Learning for Task and Motion Planning

A robot deployed in a home over long stretches of time faces a true life...

Parametrized motion planning and topological complexity

In this paper we study paramertized motion planning algorithms which pro...

db-A*: Discontinuity-bounded Search for Kinodynamic Mobile Robot Motion Planning

We consider time-optimal motion planning for dynamical systems that are ...

Designing Multi-Stage Coupled Convex Programming with Data-Driven McCormick Envelope Relaxations for Motion Planning

For multi-limbed robots, motion planning with posture and force constrai...

Learning When to Quit: Meta-Reasoning for Motion Planning

Anytime motion planners are widely used in robotics. However, the relati...

Gradient-free Multi-domain Optimization for Autonomous Systems

Autonomous systems are composed of several subsystems such as mechanical...

Please sign up or login with your details

Forgot password? Click here to reset