ProceedingsIEEE Computer Society Press - Computer integrated manufacturing systems |
From inside the book
Results 1-3 of 84
Page 92
The algorithm has following advantages: (1) it only needs computation of a
performance index for the optimization but requires no computation of the
gradient, (2)it is applicable to the problem of an arbitrary performance index to
evaluate ...
The algorithm has following advantages: (1) it only needs computation of a
performance index for the optimization but requires no computation of the
gradient, (2)it is applicable to the problem of an arbitrary performance index to
evaluate ...
Page 149
3 Desk Mover's Problem A typical problem that will be considered in this paper is
carrying a desk in a house. We call this problem the desk mover's problem. This
problem differs in some points from the traditional piano mover's problem, which
...
3 Desk Mover's Problem A typical problem that will be considered in this paper is
carrying a desk in a house. We call this problem the desk mover's problem. This
problem differs in some points from the traditional piano mover's problem, which
...
Page 238
As for problem (1), a search algorithm which combines RTA* and rule-based
supervisor is proposed. Since both RTA* and rule-based supervisor can be
executed in a reactive manner, machines and AGVs allocations can be
scheduled ...
As for problem (1), a search algorithm which combines RTA* and rule-based
supervisor is proposed. Since both RTA* and rule-based supervisor can be
executed in a reactive manner, machines and AGVs allocations can be
scheduled ...
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 |