Sensor-based manipulation planning as a game with nature
Proceedings of the 4th international symposium on Robotics Research
Reset sequences for monotonic automata
SIAM Journal on Computing
WAFR Proceedings of the workshop on Algorithmic foundations of robotics
On the existence of solutions in modular fixturing
International Journal of Robotics Research
Fixture Design with Edge-Fixels
Intelligent Robots: Sensing, Modeling and Planning [Dagstuhl Workshop, September 1-6, 1996]
Tolerance envelopes of planar mechanical parts
SM '04 Proceedings of the ninth ACM symposium on Solid modeling and applications
An algorithmic approach to the automated design of parts orienters
SFCS '86 Proceedings of the 27th Annual Symposium on Foundations of Computer Science
International Journal of Robotics Research
Immobilizing 2-D Serial Chains in Form-Closure Grasps
IEEE Transactions on Robotics
| Hi-index | 0.00 |
As global labor costs increase and product life cycles decrease, there is renewed interest in research in automated manufacturing systems that can be reliably and rapidly configured. Inspired by Turing's abstractions for computing, Algorithmic Automation explores mathematical abstractions and algorithms that allow the functionality of assembly lines and manufacturing automation systems to be designed independent of their underlying implementations. Abstractions based on minimal sets of geometric primitives can provide the foundation for formal specification, analysis, design, optimization, and verification. Algorithmic Automation is characterized by: (1) formal specification of sets of admissible inputs (eg, polyhedra) and operations (eg, parallel-jaw grasps), (2) complete algorithms that compute all solutions or terminate with a report that no solution exists, and (3) bounds on complexity as a function of input size. This extended abstract summarizes selected results and open problems.