ProceedingsIEEE Computer Society Press - Computer integrated manufacturing systems |
From inside the book
Results 1-3 of 77
Page 2
It is defined as &t* ( v< ; r> • r»* ) 3 s8n[G( v, )] • G( v, )2 , (2) where sgn(x) denotes
the sign of x and G(v,) is defined by G(v() = ^ - ^(v,,^-^, - r,|. (3) The position rVn is
the robot's position at time t+1 if the robot moves at the velocity v, from the ...
It is defined as &t* ( v< ; r> • r»* ) 3 s8n[G( v, )] • G( v, )2 , (2) where sgn(x) denotes
the sign of x and G(v,) is defined by G(v() = ^ - ^(v,,^-^, - r,|. (3) The position rVn is
the robot's position at time t+1 if the robot moves at the velocity v, from the ...
Page 459
The disassembly process planning method is based on a recursive definition of
the concept of sub-assemblies. Starting from a model of the product, all the
operations, related to disassembly [Tou99], that are associated to a subassembly,
are ...
The disassembly process planning method is based on a recursive definition of
the concept of sub-assemblies. Starting from a model of the product, all the
operations, related to disassembly [Tou99], that are associated to a subassembly,
are ...
Page 460
By definition, the liaison graph is connected graph. 3.2 Attachments An
attachment is a physical element that contributes to secure one liaison. To any
product P are associated: - the set of attachments Z ; - the application / #(C) that
associates ...
By definition, the liaison graph is connected graph. 3.2 Attachments An
attachment is a physical element that contributes to secure one liaison. To any
product P are associated: - the set of attachments Z ; - the application / #(C) that
associates ...
What people are saying - Write a review
We haven't found any reviews in the usual places.
Contents
Monday May 282001 | 1 |
Session M1B Assembly Planning Room | 31 |
Session MIC Production Systeml RoomC | 61 |
Copyright | |
15 other sections not shown
Other editions - View all
Common terms and phrases
4th IEEE International algorithm analysis applied approach Assembly and Task assembly model assembly planning assembly process assembly sequences assembly system assembly task automatic B-spline Bayesian network calculated camera collision components computed configuration constraints contact point coordinate cost defined deformable described developed disassembly sequences dynamic Engineering environment evaluation feasible Figure finger flexible Fukuoka function genetic algorithm geometric grasp holons IEEE International Symposium information entropy Japan liaison Lie algebra machine manipulation matrix mechanical method mobile robot module motion planning node object obstacles obtained operation optimal parameters path planning Petri nets Planning Soft Research precedence graph problem proposed Radon transform represented Robotics and Automation rotation scheduling Screw Theory selected self-organizing map sensor shown in Fig simulation Soft Research Park solutions specification station step structure subassembly Symposium on Assembly Task Planning Soft tion tool trajectory vector velocity
Bibliographic information
| Title | Proceedings |
| Author | IEEE International Symposium on Assembly and Task Planning |
| Contributors | IEEE Robotics and Automation Society, IEEE Xplore (Online service) |
| Publisher | IEEE Computer Society Press |
| Original from | the University of Michigan |
| Digitized | 11 Jan 2008 |
| Export Citation | BiBTeX EndNote RefMan |