Abstract
A general and efficient method is presented that uses a configuration space for planning a collision-free path among known stationary obstacles for an arbitrarily moving object with six degrees of freedom. The basic approach is to restrict the free space concerning path planning and to avoid executing unnecessary collision detections. The six-dimensional configuration space is equally quantized into cells by placing a regular grid, and the cells concerning path planning are enumerated by simultaneously executing multiple search strategies. Search strategies of different characteristics are defined by assigning different values to the coefficients of heuristic functions. The efficiency of each search strategy is evaluated during free-space enumeration, and a more promising one is automatically selected and preferentially executed. The free-space cells are efficiently enumerated for an arbitrary moving object in all kinds of working environments. The implementation of this method on several examples that have different characteristics is discussed.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">></ETX>
Keywords
HeuristicMotion planningPath (computing)Computer scienceSpace (punctuation)EnumerationObject (grammar)Degrees of freedom (physics and chemistry)Configuration spaceMathematical optimizationTheoretical computer scienceAlgorithmGridMathematicsArtificial intelligenceDiscrete mathematicsProgramming languageGeometryPhysicsRobot
Affiliated Institutions
Related Publications
Dynamic 3D models with local and global deformations: deformable superquadrics
The authors present a physically based approach to fitting complex three-dimensional shapes using a novel class of dynamic models that can deform both locally and globally. They...
A method for registration of 3-D shapes
The authors describe a general-purpose, representation-independent method for the accurate and computationally efficient registration of 3-D shapes including free-form curves an...
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...
Finding collision-free smooth trajectories for a non-holonomic mobile robot
Most mobile robots are subject to kinematic constraints (non-holonomic Joints), i.e., the number of degrees of freedom is less than the number of configuration parameters. Such ...
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...
Publication Info
- Year
- 1991
- Type
- article
- Volume
- 7
- Issue
- 3
- Pages
- 267-277
- Citations
- 146
- Access
- Closed
External Links
Social Impact
Altmetric
PlumX Metrics
Social media, news, blog, policy document mentions
Citation Metrics
146
OpenAlex
6
Influential
98
CrossRef
Cite This
Koichi Kondo
(1991).
Motion planning with six degrees of freedom by multistrategic bidirectional heuristic free-space enumeration.
IEEE Transactions on Robotics and Automation
, 7
(3)
, 267-277.
https://doi.org/10.1109/70.88136
Identifiers
- DOI
- 10.1109/70.88136