To save content items to your account,
please confirm that you agree to abide by our usage policies.
If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account.
Find out more about saving content to .
To save content items to your Kindle, first ensure no-reply@cambridge.org
is added to your Approved Personal Document E-mail List under your Personal Document Settings
on the Manage Your Content and Devices page of your Amazon account. Then enter the ‘name’ part
of your Kindle email address below.
Find out more about saving to your Kindle.
Note you can select to save to either the @free.kindle.com or @kindle.com variations.
‘@free.kindle.com’ emails are free but can only be saved to your device when it is connected to wi-fi.
‘@kindle.com’ emails can be delivered even when you are not connected to wi-fi, but note that service fees apply.
This special issue is concerned with the intelligent control of robots in the performance of manipulation tasks. First we will try to define what we mean by intelligent control and by manipulation tasks.
Unfortunately, intelligent control is a somewhat imprecise term, just like the word control itself, so that its meaning can vary widely depending on the application and on the writer's scientific discipline. In general terms, we can say that intelligent control implies some degree of autonomy in performing a task while accommodating uncertainty. In the control of sensor-based robot systems, we could characterize an intelligent controller as one with the following capabilities;
An off-line programming station for a robotised welding cell is presented. In this context the choice of a kinematic inversion method applied to the simulation of robots is discussed.
A direct inversion method is developed in the case of 5-axes robots of plane geometry and for a task presenting a symmetry of revolution. It uses the geometry of the tool and of the robot and vectorial calculations very well adapted to this particular case. The results presented validate the choice of this method for a specialised programming environment.
In this paper, we suggest an optimal force distribution scheme by weak point force minimization and we also present an efficient method to solve the problem. The concept of a weak point is a generalized one which is applicable to any points of interest, as well as joints or contact points between end-effectors and an object. The problem is formulated by a quadratic objective function of the forces exerted at weak points subject to the linear equality and inequality constraints, and its optimal solution is obtained by an efficient method. As regards the solution of the problem, the original problem is reformulated to a reduced order dual problem after the equality constraints are eliminated by force decomposition.
In this paper a new approach to planning of Flexible Manufacturing Systems (FMSs) is discussed. This approach takes advantage of FMS features and is based on linking of machining and assembling operations. There are two problems embedded in the presented approach: station loading and operation scheduling. A formulation of a station loading problem for a single machining period is presented. Some of the computational results are also discussed.
In this chapter we will develop classes to represent playing cards, decks of cards, and poker hands. If you don't play poker, you can read about it at wikipedia.org/wiki/Poker, but you don't have to; I'll tell you what you need to know for the exercises.
If you are not familiar with Anglo-American playing cards, you can read about them at wikipedia.org/wiki/Playing_cards.
CARD OBJECTS
There are fifty-two cards in a deck, each of which belongs to one of four suits and one of thirteen ranks. The suits are Spades, Hearts, Diamonds, and Clubs (in descending order in bridge). The ranks are Ace, 2, 3, 4, 5, 6, 7, 8, 9, 10, Jack, Queen, and King. Depending on the game that you are playing, an Ace may be higher than King or lower than 2.
If we want to define a new object to represent a playing card, it is obvious what the attributes should be: rank and suit. It is not as obvious what type the attributes should be. One possibility is to use strings containing words like ‘Spade’ for suits and ‘Queen’ for ranks. One problem with this implementation is that it would not be easy to compare cards to see which had a higher rank or suit.
An alternative is to use integers to encode the ranks and suits. In this context, “encode” means that we are going to define a mapping between numbers and suits, or between numbers and ranks.