ProceedingsIEEE Computer Society Press, 2001 - Artificial intelligence |
From inside the book
Results 1-3 of 48
Page 118
... Edge points To detect points on the edge of a body , it is necessary to find the edge before starting measurement . Thus an al- gorithm must be found to detect the edge of the inspected object . When the edge is located , the point on ...
... Edge points To detect points on the edge of a body , it is necessary to find the edge before starting measurement . Thus an al- gorithm must be found to detect the edge of the inspected object . When the edge is located , the point on ...
Page 119
... edge ZTCPP Pa PHz PmPi PH Bya DYNI " AYM " XTCPF Ду Дун дун AY Figure 7 : Locating an edge by gradient strategy Locating Pg's position requires another algorithm . Between the two points Pi + 1 and P ; an iterative algorithm is used to ...
... edge ZTCPP Pa PHz PmPi PH Bya DYNI " AYM " XTCPF Ду Дун дун AY Figure 7 : Locating an edge by gradient strategy Locating Pg's position requires another algorithm . Between the two points Pi + 1 and P ; an iterative algorithm is used to ...
Page 186
... edge D and right end of edge A ) . This is because that they do not construct any contact - pairs of vertex and edge . Since an object is a rectangle or a square , so we do not make distinction for four edges nor four vertices . In the ...
... edge D and right end of edge A ) . This is because that they do not construct any contact - pairs of vertex and edge . Since an object is a rectangle or a square , so we do not make distinction for four edges nor four vertices . In the ...
Contents
Session M1B Assembly Planning Room | 27 |
Session M1C Production System1 Room C | 61 |
Concurrent Requirement Specification for Conceptual Design of Modular Assembly Cells | 79 |
Copyright | |
17 other sections not shown
Other editions - View all
Common terms and phrases
4th IEEE International air hoist algorithm applied approach Assembly and Task assembly model assembly planning assembly process assembly sequences assembly system assembly task automatic B-spline Bayesian network calculated camera cell components computed configuration constraints contact point coordinate cost defined described developed disassembly disassembly sequences dynamic environment evaluation feasible finger flexible force Fukuoka function genetic algorithm geometric holons IEEE International Symposium information entropy input Japan kinematic liaison Lie algebra machine manipulation manufacturing matrix mechanical method misalignment mobile robot module motion planning node obstacles obtained operation optimal parameters path Petri Petri net Planning Soft Research pneumatic circuit possible precedence graph problem proposed Radon transform recycling represented Robotics and Automation rotation self-organizing map sensor shown in Figure simulation Soft Research Park solutions specific step subassembly Symposium on Assembly Task Planning Soft tion trajectory vector velocity