COMPUTING PUSH PLANS FOR DISK-SHAPED ROBOTS

DOI10.1142/S0218195913500027zbMath1327.68322OpenAlexW2122312633MaRDI QIDQ3459360

Dirk H. P. Gerrits, Mark T. de Berg

Publication date: 22 December 2015

Published in: International Journal of Computational Geometry & Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0218195913500027

zbMATH Keywords

path planningpushing

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Artificial intelligence for robotics (68T40)

Cites Work

• Orienting polygonal parts without sensors
• On the union of Jordan regions and collision-free translational motion amidst polygonal obstacles
• Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons
• A unified approach to conic visibility
• Realistic input models for geometric algorithms

This page was built for publication: COMPUTING PUSH PLANS FOR DISK-SHAPED ROBOTS