Home /Research /Neural computation for planning AND/OR precedence-constraint robot assembly sequences
OTHER

Neural computation for planning AND/OR precedence-constraint robot assembly sequences

C. L. Philip Chen

Year
1990
Citations
15

Abstract

The problem of finding AND/OR precedence-constraint assembly sequences for a set of <e1 xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">n</e1> parts that construct a mechanical object using neural computation is discussed. The geometric constraints of the assembled object are transformed into the elements of the connection matrix which specifies the connection strength among neurons. A modified Hopfield network is used to tackle the AND/OR precedence-constraint assembly-sequence problem. The designed algorithm can accommodate various constraints and applications. Detailed algorithms and analysis, and examples and experiments are presented

Keywords

Constraint (computer-aided design)ComputationConnection (principal bundle)Set (abstract data type)Computer scienceConstruct (python library)Object (grammar)RobotArtificial neural networkSequence (biology)

Related papers

Browse all OTHER papers