Symmetry constraint inference in assembly planning: automatic assembly configuration specification

Authors:
Yanxi Liu;Robin J. Popplestone
Affiliations:
Laboratory for Perceptual Robotics, Department of Computer and Information Science, University of Massachusetts at Amherst;Laboratory for Perceptual Robotics, Department of Computer and Information Science, University of Massachusetts at Amherst
Venue:
AAAI'90 Proceedings of the eighth National conference on Artificial intelligence - Volume 2
Year:
1990

Citing 10
Cited 0

The complexity of some polynomial network consistency algorithms for constraint satisfaction problems

Artificial Intelligence
Arc and path consistence revisited

Artificial Intelligence
Constraint propagation with interval labels

Artificial Intelligence
Robotics: control, sensing, vision, and intelligence

Robotics: control, sensing, vision, and intelligence
Network-based heuristics for constraint-satisfaction problems

Artificial Intelligence
SPAR: a planner that satisfies operational and geometric goals in uncertain environments

AI Magazine - Special issue on robotic assembly and task planning
A group theoretic approach to assembly planning

AI Magazine - Special issue on robotic assembly and task planning
Task sequence planning for robotic assembly

Task sequence planning for robotic assembly
PADL-2: A Technical Summary

IEEE Computer Graphics and Applications
Spatial Planning: A Configuration Space Approach

IEEE Transactions on Computers

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we shall discuss how to treat the automatic generation of assembly task specifications as a constraint satisfaction problem (CSP) over finite and infinite domains. Conceptually it is straightforward to formulate assembly planning in terms of CSP, however the choice of constraint representation and of the order in which the constraints are applied is nontrivial if a computationally tractable system design is to be achieved. This work investigates a subtle interaction between a pair of interleaving constraints, namely the kinematic and the spatial occupancy constraints. While finding one consistent solution to a general CSP is NP-complete, our work shows how to reduce the combinatorics in problems arising in assembly using the symmetries of assembly components. Group theory, being the standard mathematical theory of symmetry, is used extensively in this work since both robots and assembly components are threedimensional rigid bodies whose features have certain symmetries. This forms part of our high-level robot assembly task planner in which geometric solid modelling, group theory and CSP are combined into one computationally effective framework.