Probabilistic roadmaps for path planning in high-dimensional configuration spaces
LE Kavraki, P Svestka, JC Latombe… - IEEE transactions on …, 1996 - ieeexplore.ieee.org
A new motion planning method for robots in static workspaces is presented. This method
proceeds in two phases: a learning phase and a query phase. In the learning phase, a …
proceeds in two phases: a learning phase and a query phase. In the learning phase, a …
The Gaussian sampling strategy for probabilistic roadmap planners
V Boor, MH Overmars… - Proceedings 1999 IEEE …, 1999 - ieeexplore.ieee.org
Probabilistic roadmap planners (PRMs) form a relatively new technique for motion planning
that has shown great potential. A critical aspect of PRM is the probabilistic strategy used to …
that has shown great potential. A critical aspect of PRM is the probabilistic strategy used to …
Maintenance of configurations in the plane
MH Overmars, J Van Leeuwen - Journal of computer and System Sciences, 1981 - Elsevier
For a number of common configurations of points (lines) in the plane, we develop data
structures in which insertions and deletions of points (or lines, respectively) can be processed …
structures in which insertions and deletions of points (or lines, respectively) can be processed …
[BOEK][B] The design of dynamic data structures
MH Overmars - 1983 - books.google.com
In numerous computer applications there is a need of storing large sets of objects in such a
way that some questions about those objects can be answered efficiently. Data structures …
way that some questions about those objects can be answered efficiently. Data structures …
On a class of O (n2) problems in computational geometry
A Gajentaan, MH Overmars - Computational geometry, 1995 - Elsevier
There are many problems in computational geometry for which the best know algorithms take
time Θ(n 2 ) (or more) in the worst case while only very low lower bounds are known. In this …
time Θ(n 2 ) (or more) in the worst case while only very low lower bounds are known. In this …
A comparative study of probabilistic roadmap planners
R Geraerts, MH Overmars - Algorithmic foundations of robotics V, 2004 - Springer
The probabilistic roadmap approach is one of the leading motion planning techniques. Over
the past eight years the technique has been studied by many different researchers. This has …
the past eight years the technique has been studied by many different researchers. This has …
Coordinated path planning for multiple robots
P Švestka, MH Overmars - Robotics and autonomous systems, 1998 - Elsevier
We present a new approach to the multi-robot path planning problem, where a number of
robots are to change their positions through feasible motions in the same static environment. …
robots are to change their positions through feasible motions in the same static environment. …
Prioritized motion planning for multiple robots
JP Van Den Berg, MH Overmars - 2005 IEEE/RSJ International …, 2005 - ieeexplore.ieee.org
In this paper we address the problem of motion planning for multiple robots. We introduce a
prioritized method, based on a powerful method for motion planning in dynamic …
prioritized method, based on a powerful method for motion planning in dynamic …
A predictive collision avoidance model for pedestrian simulation
I Karamouzas, P Heil, P Van Beek… - Motion in Games: Second …, 2009 - Springer
We present a new local method for collision avoidance that is based on collision prediction.
In our model, each pedestrian predicts possible future collisions with other pedestrians and …
In our model, each pedestrian predicts possible future collisions with other pedestrians and …
Creating high-quality paths for motion planning
R Geraerts, MH Overmars - The international journal of …, 2007 - journals.sagepub.com
Many algorithms have been proposed that create a path for a robot in an environment with
obstacles. Most methods are aimed at finding a solution. However, for many applications, the …
obstacles. Most methods are aimed at finding a solution. However, for many applications, the …