Abstract
This paper describes the application of a recent approach to path planning for robots with many degrees of freedom (DOF) to articulated robots moving in two or three dimensional static environments. The planning approach, which itself is not restricted to articulated robots, consists of a preprocessing and a planning stage. The preprocessing is done only once for a given environment and generates a connected network of randomly, but properly selected, collision-free configurations (nodes). The planning then connects any given initial and final configurations of the robot to two nodes of the network and computes a path through the network between these two nodes. We show that after paying the preprocessing cost, planning is extremely fast for many difficult examples involving 7-DOF and 12-DOF robots. The approach is particularly attractive for many-DOF robots which have to perform many successive point-to-point motions in the same environment.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">></ETX>
Keywords
RobotMotion planningPreprocessorComputer sciencePath (computing)Point (geometry)Artificial intelligenceConfiguration spaceAny-angle path planningMathematicsProgramming language
Affiliated Institutions
Related Publications
Near-optimal nonholonomic motion planning for a system of coupled rigid bodies
How does a falling cat change her orientation in midair without violating angular momentum constraint? This has become an interesting problem to both control engineers and robot...
Real time inverse kinematics for general 6R manipulators
The authors present a real-time algorithm for the inverse kinematics of general 6R robot manipulators. The algorithm involves symbolic preprocessing, matrix computation and a va...
Path loss and delay spread models as functions of antenna height for microcellular system design
Results of wideband path loss and delay spread measurements for two representative microcellular environments in the San Francisco Bay area in the 1900 MHz band are presented. T...
A numerical solution to the generalized mapmaker's problem: flattening nonconvex polyhedral surfaces
Methods are described to unfold and flatten the curved, convoluted surfaces of the brain in order to study the functional architectures and neural maps embedded in them. In orde...
Bilateral averaging over receiving and transmitting areas for accurate measurements of sector average signal strength inside buildings
In defining path loss for narrowband systems, it is common to introduce the concept of the sector or local average in order to remove the rapid (Rayleigh or Rician) fading. As o...
Publication Info
- Year
- 2002
- Type
- article
- Volume
- 3
- Pages
- 1764-1771
- Citations
- 49
- Access
- Closed
External Links
Social Impact
Altmetric
PlumX Metrics
Social media, news, blog, policy document mentions
Citation Metrics
49
OpenAlex
3
Influential
35
CrossRef
Cite This
Lydia E. Kavraki,
J.-C. Latombe
(2002).
Randomized preprocessing of configuration space for path planning: articulated robots.
Proceedings of IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS'94)
, 3
, 1764-1771.
https://doi.org/10.1109/iros.1994.407619
Identifiers
- DOI
- 10.1109/iros.1994.407619