An efficient parallel solution for Euclidean shortest path in three dimensions

@article{Bajaj1986AnEP,
  title={An efficient parallel solution for Euclidean shortest path in three dimensions},
  author={C. Bajaj},
  journal={Proceedings. 1986 IEEE International Conference on Robotics and Automation},
  year={1986},
  volume={3},
  pages={1897-1900}
}
  • C. Bajaj
  • Published 1986
  • Mathematics, Computer Science
  • Proceedings. 1986 IEEE International Conference on Robotics and Automation
  • We describe an efficient parallel solution for the problem of finding the shortest Euclidean path between two points in three dimensional space in the presence of polyhedral obstacles. We consider the important case where the order in which the obstacles are encountered in this shortest path is known. In particular for this case we describe an efficient parallel numerical iterative method on a concurrent-read exclusive-write synchronous shared-memory model. The iterations are essentially… CONTINUE READING
    13 Citations
    Generalized Unfoldings for Shortest Paths
    • 8
    An efficient algorithm for finding a collision-free path among polyhedral obstacles
    • 31
    On the shortest paths between two convex polyhedra
    • 40
    Finding Shortest Isothetic Path Inside a 3D Digital Object
    Distributed intelligent real-time technique for coordinated multi-agents autonomous path planning among moving complex obstacles
    • D. Megherbi
    • Computer Science, Engineering
    • SPIE Defense + Commercial Sensing
    • 2001
    • 1
    Fast Motion Planning by Parallel Processing – a Review
    • D. Henrich
    • Computer Science
    • J. Intell. Robotic Syst.
    • 1997
    • 54
    • PDF
    Supercomputing about Physical Objects
    • 8

    References

    SHOWING 1-10 OF 10 REFERENCES
    Generalized Unfoldings for Shortest Paths
    • 8
    The Algebraic Complexity of Shortest Paths in Polyhedral Spaces
    • 38
    An Algorithm for Shortest-Path Motion in Three Dimensions
    • 234
    On shortest paths in polyhedral spaces
    • 171
    An algorithm for planning collision-free paths among polyhedral obstacles
    • 2,283
    • PDF
    Fast parallel matrix and GCD computations
    • 168
    • PDF
    Fast parallel matrix and GCD computations
    • 139
    Iterative solution of nonlinear equations in several variables
    • 7,432
    Limitations to algorithm solvability: Galois methods and models of computation
    • C. Bajaj
    • Mathematics, Computer Science
    • SYMSAC '86
    • 1986
    • 7