Robots often have to operate in discrete partially observable worlds, wh...
We present Fast-dRRT*, a sampling-based multi-robot planner, for real-ti...
Rearrangement puzzles are variations of rearrangement problems in which ...
Automated bin-picking is a prerequisite for fully automated manufacturin...
Robots often need to solve path planning problems where essential and
di...
We present a motion planner for planning through space-time with dynamic...
Optimal sampling based motion planning and trajectory optimization are t...
Recently, there has been a wealth of development in motion planning for
...
In this extended abstract, we report on ongoing work towards an approxim...
Robotic assembly planning has the potential to profoundly change how
bui...
Contact-based motion planning for manipulation, object exploration or
ba...
Sparse roadmaps are important to compactly represent state spaces, to
de...
Sampling-based planning methods often become inefficient due to narrow
p...
Motion planning problems involving high-dimensional state spaces can oft...
Multi-robot motion planning problems often have many local minima. It is...
We present an algorithm to visualize local minima in a motion planning
p...
Motion planning problems can be simplified by admissible projections of ...
The motion of a mechanical system can be defined as a path through its
c...
A motion planning algorithm computes the motion of a robot by computing ...