Orienting polygonal parts without sensors

DOI10.1007/BF01891840zbMATH Open0777.68104DBLPjournals/algorithmica/Goldberg93WikidataQ57366277 ScholiaQ57366277MaRDI QIDQ686743FDOQ686743

Authors: Kenneth Y. Goldberg 

Publication date: 13 October 1993

Published in: Algorithmica (Search for Journal in Brave)

Recommendations

• Computing fence designs for orienting parts
• Mechanical parts orienting: the case of a polyhedron on a table
• Orienting polyhedral parts by pushing
• A near-quadratic algorithm for fence design
• The complexity of oblivious plans for orienting and distinguishing polygonal parts

zbMATH Keywords

planningcompliancegraspingroboticscompliant motion planningmotion planning with uncertaintyparts feeding

Mathematics Subject Classification ID

Computing methodologies and applications (68U99) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Reset Sequences for Monotonic Automata
• The complexity of oblivious plans for orienting and distinguishing polygonal parts
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (22)

• Synchronizing automata with a letter of deficiency 2
• Orienting polyhedral parts by pushing
• Mechanical parts orienting: the case of a polyhedron on a table
• COMPUTING PUSH PLANS FOR DISK-SHAPED ROBOTS
• Reprint of: Bounding the locus of the center of mass for a part with shape variation
• Positioning symmetric and non-symmetric parts using radial and constant force fields
• The complexity of oblivious plans for orienting and distinguishing polygonal parts
• Friction and part curvature in parallel‐ jaw grasping
• Bounding the locus of the center of mass for a part with shape variation
• Computing fence designs for orienting parts
• Combinatorial filter reduction: special cases, approximation, and fixed-parameter tractability
• Computational complexity of synchronization under sparse regular constraints
• Computing grasp functions
• Synchronizing Automata Preserving a Chain of Partial Orders
• Efficient workspace generation for binary manipulators with many actuators
• Synchronizing automata preserving a chain of partial orders
• Černý's conjecture and the road colouring problem
• Integer linear programming formulations of the filter partitioning minimization problem
• Synchronizing Automata and the Černý Conjecture
• Particle computation: complexity, algorithms, and logic
• Title not available (Why is that?)
• Completely distinguishable automata and the set of synchronizing words

This page was built for publication: Orienting polygonal parts without sensors

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q686743)