Models and motion planning
We study the consequences of two of the realistic input models proposed in the literature, namely unclutteredness and small simple-cover complexity, for the motion planning problem. We show that the complexity of the free space of a bounded-reach robot with f degrees of freedom is O(n f/2) in the plane, and O(n 2f/3) in three dimensions, for both uncluttered environments and environments of small simple-cover complexity. We also give an example showing that these bounds are tight in the worst case. Our bounds fit nicely between the θ(nf) bound for the maximum free-space complexity in the general case, and the θ(n) bound for low-density environments.
Unable to display preview. Download preview PDF.
- J. M. Bañon. Implementation and extension of the ladder algorithm. In Proc. IEEE Internat. Conf. Robot. Autom., pages 1548–1553, 1990.Google Scholar
- M. de Berg, M. J. Katz, A. F. van der Stappen, and J. Vleugels. Realistic input models for geometric algorithms. To appear; a preliminary version appeared in Proc. 13th Annu. ACM Sympos. Comput. Geom., pages 294–303, 1997.Google Scholar
- Mark de Berg. Linear size binary space partitions for fat objects. In Proc. 3rd Annu. European Sympos. Algorithms, volume 979 of Lecture Notes Comput. Sci., pages 252–263. Springer-Verlag, 1995.Google Scholar
- A. Efrat and M. J. Katz. On the union of κ-curved objects. In Proc. 14th Annu. ACM Sympos. Comput. Geom., 1998. to appear.Google Scholar
- A. Efrat, M. J. Katz, F. Nielsen, and M. Sharir. Dynamic data structures for fat objects and their applications. In Proc. 5th Workshop Algorithms Data Struct., pages 297–306, 1997.Google Scholar
- J. Matoušek. Epsilon-nets and computational geometry. In J. Pach, editor, New Trends in Discrete and Computational Geometry, volume 10 of Algorithms and Combinatorics, pages 69–89. Springer-Verlag, 1993.Google Scholar
- J. S. B. Mitchell, D. M. Mount, and S. Suri. Query-sensitive ray shooting. In Proc. 10th Annu. ACM Sympos. Comput. Geom., pages 359–368, 1994.Google Scholar
- A. F. van der Stappen, D. Halperin, and M. H. Overmars. The complexity of the free space for a robot moving amidst fat obstacles. Comput. Geom. Theory Appl., 3:353–373, 1993.Google Scholar
- A. F. van der Stappen and M. H. Overmars. Motion planning amidst fat obstacles. In Proc. 10th Annu. ACM Sympos. Comput. Geom., pages 31–40, 1994.Google Scholar
- A. F. van der Stappen, M. H. Overmars, M. de Berg, and J. Vleugels. Motion planning in environments with low obstacle density. Report UU-CS-1997-19, Dept. Comput. Sci., Utrecht Univ., Utrecht, Netherlands, 1997.Google Scholar
- Jules Vleugels. On Fatness and Fitness—Realistic Input Models for Geometric Algorithms. Ph.d. thesis, Dept. Comput. Sci., Utrecht Univ., Utrecht, the Netherlands, March 1997.Google Scholar