Models and motion planning

DOI10.1016/S0925-7721(01)00022-0zbMath1116.68604OpenAlexW2006517136MaRDI QIDQ1614069

Jules Vleugels, Mark H. Overmars, Matthew J. Katz, A. Frank van der Stappen, Mark T. de Berg

Publication date: 3 September 2002

Published in: Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0925-7721(01)00022-0

zbMATH Keywords

Motion planningInput modelsFree space complexity

Mathematics Subject Classification ID

Robot dynamics and control of rigid bodies (70E60) Artificial intelligence for robotics (68T40)

Related Items (2)

Guarding scenes against invasive hypercubes. ⋮ On realistic terrains

Cites Work

• Approximate motion planning and the complexity of the boundary of the union of simple geometric figures
• Efficient hidden surface removal for objects with small union size
• Motion planning in environments with low obstacle density
• Parameter functionability and asymptotic behavior of cycles in Hopf's bifurcation
• The complexity of the free space for a robot moving amidst fat obstacles
• Range searching in low-density environments
• 3-D vertical ray shooting and 2-D point enclosure, range searching, and arc shooting amidst convex fat objects
• Guarding scenes against invasive hypercubes.
• Linear size binary space partitions for uncluttered scenes
• The complexity of the free space for motion planning amidst fat obstacles
• Computing depth orders for fat objects and related problems
• On the union of \(\kappa\)-curved objects
• Dynamic data structures for fat objects and their applications
• On the “piano movers'” problem I. The case of a two-dimensional rigid polygonal body moving amidst polygonal barriers
• Range Searching and Point Location among Fat Objects
• Fat Triangles Determine Linearly Many Holes

This page was built for publication: Models and motion planning