Movement planning in the presence of flows

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2125, Issue , 2001, Pages 450-461

  Reif, John ^a   Sun, Zheng ^a  

^a DUKE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; APPROXIMATION ALGORITHMS; COMPUTATIONAL COMPLEXITY; DATA STRUCTURES; MOTION PLANNING; SUBMARINES;

DECISION ALGORITHMS; EFFICIENT APPROXIMATION ALGORITHMS; EXPONENTIAL NUMBERS; GEOMETRIC PROBLEMS; MICRO-SCALE ROBOTS; MOTION PLANNING PROBLEMS; MOVEMENT PLANNING; POLYGONAL REGIONS;

ROBOT PROGRAMMING;

EID: 0942282007     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44634-6_41     Document Type: Conference Paper

References (19)

1. L. Aleksandrov, M. Lanthier, A. Maheshwari, and J.-R. Sack. An ϵ-approximation algorithm for weighted shortest paths on polyhedral surfaces. Lecture Notes in Computer Science, 1432:11–22, 1998.
2. L. Aleksandrov, A. Maheshwari, and J.-R. Sack. Approximation algorithms for geometric shortest path problems. In Proceedings of the 32nd ACM Symposium on Theory of Computing, 2000.
3. J. Canny. Some algebraic and geometric computations in PSPACE. In Proceedings of the 20th Annual ACM Symposium on the Theory of Computing, 1988.
4. J. Canny and J. Reif. New lower bound techniques for robot motion planning problems. In Proceedings of the 28th IEEE Annual Symposium on Foundations of Computer Science, 1987.
5. G. E. Collins. Quantifier elimination for real closed fields by cylindric algebraic decomposition. In Proc. Second GI Conference on Automata Theory and Formal Languages, volume 33 of Lecture Notes in Computer Science, 1975.
6. M. Lanthier, A. Maheshwari, and J. Sack. Approximating weighted shortest paths on polyhedral surfaces. In 6th Annual Video Review of Computational Geometry, Proc. 13th ACM Symp. Computational Geometry, 1997.
7. C. Mata and J. Mitchell. A new algorithm for computing shortest paths in weighted planar subdivisions. In Proceedings of the 13th ACM International Annual Symposium on Computational Geometry (SCG-97), 1997.
8. J. S. B. Mitchell. Geometric shortest paths and network optimization. In J.- R. Sack and J. Urrutia, editors, Handbook of Computational Geometry. Elsevier Science Publishers B.V. North-Holland, Amsterdam, 1998.
9. J. S. B. Mitchell and C. H. Papadimitriou. The weighted region problem: Finding shortest paths through a weighted planar subdivision. Journal of the ACM, 38(1):18–73, 1991.
10. N. Papadakis and A. Perakis. Minimal time vessel routing in a time-dependent environment. Transportation Science, 23(4):266–276, 1989.
11. N. Papadakis and A. Perakis. Deterministic minimal time vessel routing. Operations Research, 38(3):426–438, 1990.
12. J. Reif. Complexity of the mover’s problem and generalizations. In Proceedings of the 20th IEEE Symposium on Foundations of Computer Science, 1979.
13. J. Reif and M. Sharir. Motion planning in the presence of moving obstacles. In 26th Annual Symposium on Foundations of Computer Science, 1985.
14. J. H. Reif and J. A. Storer. A single-exponential upper bound for finding shortest paths in three dimensions. Journal of the ACM, 41(5):1013–1019, Sept. 1994.
15. J. Reif and Z. Sun. BUSHWHACK: An Approximation Algorithm for Minimal Paths Through Pseudo-Euclidean Spaces. Submitted for publication.
16. J. Reif and Z. Sun. An efficient approximation algorithm for weighted region shortest path problem. In Proceedings of the 4th Workshop on Algorithmic Foundations of Robotics, 2000.
17. J. T. Schwartz and M. Sharir. On the piano movers problem: II. general techniques for computing topological properties of real algebraic manifolds. Advances in applied mathematics, 4:298–351, 1983.
18. J. Sellen. Direction weighted shortest path plannin. In Proceedings of the IEEE International Conference on Robotics and Automation (ICRA-95), 1995.
19. G. Wilfong. Motion planning in the presence of movable obstacles. In Proceedings of the Fourth ACM Annual Symposium on Computational Geometry, 1988.