Robotics Books
Related Subjects: Software Research Industrial Building Clubs Medical Commercial Competitions Projects
More Pages: 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250

Used price: $29.95

A prelude to automated negotiationReview Date: 2004-01-27


Set your WatchesReview Date: 2004-04-07
Synchronous motion was probably first reported by Huygens (1673), where he describes an experiment of two (marine) pendulum clocks hanging on a light weighted beam, and which exhibit (anti-)frequency synchronization after a short period of time. Synchronized sound in nearby organ tubes was reported by Rayleigh in 1877, who observed similar effects for two electrically or mechanically connected tuning forks. In the last century synchronization received a lot of attention in the Russian scientific community since it was observed in balanced and rotors and vibro-exciters. Perhaps an enlightening potential new application for coordinated motion is in the use of hundreds of piezo-actuators in order to obtain a desired motion of a large/heavy mechanical set-up like for instance an airplane or Mm-scanner, or the coordination of microactuators for manipulation at very small scales.
In astronomy synchronization theory is used to explain the motion of celestial bodies, such as orbits and planetary resonances, In biology, biochemistry and medicine many systems can be modelled as oscillatory or vibratory systems and those systems show a tendency towards synchronous behavior. Among evidences of synchronous behavior in the natural world, one can consider the chorusing of crickets, synchronous flash light in a group of fire-flies, and the metabolic synchronicity in yeast cell suspension.
The subject of synchronization has received huge attention in the last decades, in particular by biologists and physicists. This attention probably centers around one of the fundamental issues in science, namely curiosity: how come we find synchronous motion in a large ensemble of identical systems? Also, new avenues of potential use of synchronicity are now being explored.
Synchronization has much in common - and is in sense equivalent to-coordination and cooperation. In ancient times it was already understood that joint activity may enable to carry out tasks that are undoable for an individual.
The authors' interest in the subject of synchronization is strongly influenced by a desire to understand what the basic ingredients are when coordinated motion is required in an engineering system. We therefore have concentrated in this book on synchronization or coordination of mechanical systems, like in robotic systems. This allows to delve, on the one hand, in the theoretic foundations of synchronous motion, but, on the other hand, made it possible to combine the theoretical findings with experimental verification in our research laboratorium.
This book concentrates therefore on controlled synchronization of mechanical systems that are used in industry. In particular the book deals with robotic systems, which nowadays are common and important systems in production processes. However, the general ideas developed here can be extended to more general mechanical systems, such as mobile robots, ships, motors, microactuators, balanced and unbalanced rotors, vibro-exciters.
The book is organized as follows:
Chapter 1 gives a general introduction about synchronization, its definition and the different types of synchronization.
Chapter 2 presents some basic material and results on which the book is based. In Section 2.1 some mathematical tools and stability concepts used throughout the book are presented. The dynamic models of rigid and flexible joint robots are introduced in Section 2.2, including their most important properties. The experimental set-up that will be used in later chapters is introduced in Section 2.3, where a brief description of the robots and their dynamic models is presented.
Chapter 3 addresses the problem of external synchronization of rigid joint robots. The synchronization scheme formed by a feedback controller and model based observers is presented and a stability proof is developed.
Simulation and experimental results on one degree of freedom systems are included to show the applicability and performance of the proposed controller. The main contribution of this chapter is a gain tuning procedure that ensures synchronization of the interconnected robot systems.
The case of external synchronization for flexible joint robots is addressed in Chapter 4. The chapter starts by explaining the differences between rigid and flexible joint robots and the effects on the design of the synchronization scheme. The synchronization scheme for flexible joint robots and stability analysis is presented. The chapter includes a gain tuning procedure that guarantees synchronization of the interconnected robot systems. Simulation results on one degree of freedom systems are included to show the viability of the controller.
The problem of internal (mutual) synchronization of rigid robots is treated in Chapter 5. This chapter presents a general synchronization scheme for the case of mutual synchronization of rigid robots. The chapter includes a general procedure to choose the interconnections between the robots to guarantee synchronization of the multi-composed robot system. Simulation and experimental results on one degree of freedom systems are included to show the properties of the controller.
Chapter 6 presents a simulation and experimental study using two rigid robot manipulators and shows the applicability and performance of the synchronization schemes for rigid joint robots. Particular attention is given to practical problems that can be encountered at the moment of implementing the proposed synchronization schemes. The robots in the experimental setup have four degrees of freedom, such that the complexity in the implementation is higher than in the simulations and experiments included in Chapters 3 and 5.
Further extensions of the synchronization schemes designed here are discussed in Chapter 7. Some conclusions related to synchronization in general and robot synchronization in particular are presented in Chapter 8.

From system-norms to practical design : A quick courseReview Date: 2000-11-14
The first section introduces system norms for multivariable control and the structured singular value for robust control design. The next section covers parameter estimation techniques. The material from both sections is then combined for application to practical design problems. All sections contain case studies of example design problems which are presented in detail.
The introduction to system norms is perhaps the best amongst existing books in terms of access to readers with only an undergraduate level background in mathematics. The section on system ID however might require parallel readings from other books if included in a course.
Overall, the book is perfectly taylored to introduce post-modern control philosophies to both graduate students as well as practising engineers.

A very good introduction to the power of MATLABReview Date: 1998-10-02

Used price: $97.49

no longer confined to science fictionReview Date: 2008-06-28
Modelling of the human arm and hand is also surveyed. Along with the study of how humans do load bearing on their frames while moving. The intent is to copy as much of this as possible to a robot.

Used price: $5.80

never received itReview Date: 2008-03-31
Impossible to use. Don't waste your money.Review Date: 2007-07-19
Very informative!Review Date: 2007-06-08
Learning ToolsReview Date: 2007-05-20
Do NOT Buy (I'm one of the victims!)Review Date: 2007-10-17
Myke says he's proud that they've included the PCB - why? Does anybody really want to gather up the parts to build this thing? The parts kits is not that great a deal either, if you can find it. Give me the **** CD which I need, not some stupid PCB I don't need - I can easily come up with a programmer, but I have no way to create the CD! In all the years I have been buying technical books, this is the stupidest move I've ever seen.
This book is a complete waste of money. Run away and boycott the publisher until they correct this rip-off.
From Myke Predko's web site:
(so where is it?)
"The CD-ROM that comes with this book is designed to be an integral part of the book. In the introduction I suggest that the reader load the CD-ROM into their computer before starting to read through the text as there is some unique information as well as code that is not present in the book due to space concerns. Along with the source (and executable) code for all the applications presented in the book, the CD-ROM also contains:
* HTML Interface to the contents of the CD-ROM including a page for each experiment and application
* HTML "appendices" for code "snippets" along with 16 Bit arithmetic and interfacing code examples and macros that can be "cut and "pasted" into your own applications.
* Two pdf appendices, "Introduction to Electronics" and "Introduction to Programming" for new developers
* Microchip MPLAB version 5.11, UMPS demonstration version 1.76 and gpsim/gpasm to give people different options in developing their own PICmicro MCU applications
* pdf data sheets for all the PICmicro MCU parts used in the book
The two pdf appendices, "Introduction to Electronics" and "Introduction to Programming" were written to help someone new to microcontrollers gain the background necessary to understand the concepts presented in the book. These appendices (which total over 250 pages) are virtually a stand-alone book on their own and provide reference information that experienced developers will probably find useful. "Introduction to Electronics" starts with basic electrical theory and explain the concepts behind digital logic, Analog to Digital Conversion, low-current power supplies, prototyping and basic test equipment. "Introduction to Programming" explains basic programming concepts and goes on to discuss structured programming and provides references to the "BASIC" (including PICmicro MCU varients) and "C" languages. "

Used price: $0.63
Collectible price: $48.00

Very nice bookReview Date: 2008-05-15
I haven't used their online resources, and I didn't do many problems from this book, because the professor teaching the course came up with problems of his own. However, from what I've seen, they have a very reasonable collection of problems suited for self-study. Every well established field has a list of standard problem, and Language Theory is no exception. The problems in this book certainly cover most of the standard ones. Please, also be aware that although this book is a good read, it is not necessary an easy read - be prepared to invest considerable amount of time into this book.
I cannot give this book 5 stars simply because I do not think it is much better than previous editions. As a matter of fact, I think it is worse. I did not have a very close look at previous editions, but I know for a fact that they were more rigorous and formal and covered more topics. As a result of that, they were less suited for teaching an introductory course, but some of the topics they studied there are really nice. From what I've heard about previous editions though, it seems that they described several open problems, that are no longer open. So I'd suggest getting this new edition, simply because it has more contemporary information.
Some people write in their review that this book requires solid background in the area it covers. I respectfully disagree - I had little to none background in Language Theory and Complexity Theory prior to taking this course and (consequently) starting to read this book; however, I did very well in the course and enjoyed it very much. Of course, I was lucky to have an excellent professor teaching that course. If good books came with good professors that would be a killer package, but unfortunately they don't.
I have not read any other books in this field, so I have nothing to compare with, but all in all, for me it worked great and if you have a good professor and are passionate about the subject, I'm sure this book won't be a miss.
extremely confusing as a beginners textbookReview Date: 2008-03-12
Updated Classic TextReview Date: 2007-08-29
Things like Context Free languages and grammar are used readily in things like XML and its accompanying standards such as the DTD. So, it makes sense to update a classic text to include such topics and further illustrate to the reader that what once was a theory is now center stage of Computer Science and the IT industry as a whole.
The text starts with the classics such as an introduction to automata theory followed by languages. The authors have taken a more relaxed approach to the topics as the proofs are less formal and easier to follow. Plain text is usually used to informally proof the topic at hand, and the authors go into a more formal approach on selected proofs. This is definitely a better approach than the other texts in the same topic that proofs are center stage of the discussion and the reader gets lost early on in the process. The text is easy to read for students, and easy to explain for the instructors. I remember when I took theory of Computation for my graduate work proofs were so convoluted and difficult to read that I had to spend many of nights trying to understand what the instructor was talking about in the class.
As one would expect, the book then goes into Turning Theory and Machine with the concept to computability and complexity. Well, the good news is that the authors' approach to the topic does not change; lots of explaining of the basics followed by a more detailed formal approach to the topic. All I need to say is that I wish my text was this reader friendly! Chapter 8, Introduction to Turing Machines, sets the ground work for the rest of the text. It explains reducibility and more importantly how to reduce a problem, something I have never seen in any other text in such detail! Automata and its relation to Turing Machine is depicted in detail, so there is no gap between the topics. What is interesting is that the authors close the loop with actually talking about, for example the Halting problem, in the real world with a program.
As one would expect, different classes of problems are explored in detail with many examples (theory and real-world examples) that accompany the topic at hand. Each chapter ends with a summary of topics discussed followed by a set of exercises. There are also a number of exercises at the end of each section in a given chapter in order to reel-in the topic for the reader.
All and all, this is one great text on automata and computation theory. It is easy to read and follow for the students without the loss of content. The authors relate abstract concepts to real-world examples to further illustrate the importance of the topic at hand.
The best theoretical computer science book out there.Review Date: 2008-06-25
All in all, it's a good introduction to these concepts. I give it 4 stars because some proofs could have been easier, but this is not a big problem. The P and NP classes of problems are wonderfully explained. We are speaking about a book every computer scientist out there should have on his/her shelf. Those who consider this book extremely hard and difficult is because of their lack of fundamental knowledge in computer science. Of course, this is not the first book you should read on the subject. But be assured, this book will give you what it promises: a good knowledge about languages theory, indecidibility and intractability of problems.
A Butchered ClassicReview Date: 2007-09-28
But overall, this edition is a disappointment. The explanations tend to be mechanical and unhelpful, and are sometimes confused or just incorrect. New sections on mathematical foundations and applications have been added, but there isn't really adequate space devoted to covering either topic, and the results are so rushed and lacking in context that I can't see those sections being useful to anyone who would need them in the first place. Finally, this edition needs to be proofread for correctness! It contains numerous mistakes, some of them in the presentations of key proofs.

Used price: $13.88

Excellent starting pointReview Date: 2006-06-01
Every project works and there is a thorough explanation in plain english as to how it works. The projects covered in this book are really very cool and I highly recommend it to anyone just getting into this field.
OK great book!!! But???Review Date: 2005-07-28
Excellent place to start with microcontrollersReview Date: 2005-12-17
Outdated and provides little useful informationReview Date: 2006-06-22
Good starter book for those interested in PICsReview Date: 2006-10-28

Used price: $2.19

Style of writer on explained Review Date: 2006-11-10
I need to repeatedly open the pages already read to understand the meaning of the contents.
But information of the resources and web info of the micom vendor and supplier is very usefull for me.
Muy util Review Date: 2004-11-15
Excellent Book!Review Date: 2005-02-05
Not well writtenReview Date: 2007-01-15
Second, if someone is new to the 8051 architecture this book is not for them. The author does a bad job of explaining many simple concepts, especially the 8051 memory layout. His diagrams and explanations are illogical and down right confusing. And when it came to more advanced topics such as serial IO via interrupts, hardly a peep of good information or examples.
There are many good books on 8051/8052 micro-controllers and this is definitely not one of them.
Don't judge one book by its thickness...Review Date: 2004-04-03
In this book, it is not much explanation on the hardware features. Being able to connect to external memory is one of the biggest strength of 8051. Surprisingly, the author failed to eleborate on it. His book on PIC is a great book. However, I think he treats 8051 as PIC, which is not the objective of the 8051 book. The projects included in this book are more like PIC project, where small memory, I/O circuit is needed.
However, the programming portion in this book gives rather simple and not bad explanation to assembly language beginner like me. I think that is the only useful part in this book.

Used price: $1.62
Collectible price: $25.00

ISReview Date: 2006-02-10
Moravec three rules of robot success are: 1) The robot must be reasonable priced 2) The customer should not have to call in specialist to put a robot to work or to change its routine 3) The robot must be reliable for at least six months before encountering a problem or a situation requiring downtime for reprogramming or other alterations.
In the 90s, Dean Pomerleau built ALVINN, a neural network with 5,000 adjustable connections, whose desired desire was built to imitate a human driver; the NN output determined the steering position; some of the camera pictures simulated being further left in the lane with corresponding adjustments in steering; NN time to learn new roads was reduced to 5 minutes; the system provided neural interconnection weights for many road types. A new road type was determined by comparing the lower half of the image with the upper half and if they matched the road up ahead was the same locally, otherwise the new road type was added to the library. The NN input was a low resolution of the road using the blue from green substitution. In 1991, ALVINN traversed a busy 30km highway at 70km/h and Pomerleau earned his PHd.
Todd Jochem, a student of Pomerleau, built the next generation of code called RALPH. RALPH used 32x32 pixel low resolution picture of the road. The land ahead appeared as a wedge in the distance. If the road angles left or right, it estimated the blur in brightness changes, one cell from the next and the sharpest vector was kept. RALPH learning was instantaneous and driving became a technique of sliding over memorized vectors. RALPH drove from Washington DC to San Diego, 98.2% of the time in control, at an average speed of 100km/hr.
Rod Brooks declared the model based approach to robotics was unworkable. Brooks designed behavior control through layers, he called reflexes, for example, one behavior might cause the robot to steer away from an obstacle and another keep the robot traveling along the wall. The limiting ability to reflexive modeling was a limitation in cognitive ability, like a moth trapped in a street light. Brooks designed Cog which represented a larger number of learning reflexes allowing the robot to learn visually by imitation. Moravec thinks that reflexive technology will accomplish its desired goal, however, states, "I think there is a faster route, on that imitates at a higher level of abstraction" referencing conditioning modeling. Moravec concludes most practical automatic machines are behavior based.
The retina modeling is the benchmark breakthrough for the beginning of modern robotics. The retina is a centimeter across and a half millimeter thick and has 100 million neurons: horizontal cells which are light sensitive, narrower bipolar cells connected by Amacrine cells, and ganglion cell, which bundle to form the optic nerve. A million ganglion cells measure light intensity and differences over space and time. A 1000 MIPs machine could match the 10 scans a second.
1st generation robots will emerge around 2010 and possess 3,000 mips computation power; their size, shape, and strength will be human like; they will be efficient mobile devices on flat ground and able to traverse stair and manipulate everyday objects; and 2,4, and 6 legged robots will be able to cross most terrains and carry their own power supply, moving slowly, and for short distances. The robots will be heavy with perhaps three motors per limb. Movement may be done through shape bending alloys. A "Shape Bending alloy" bends at room temperature, but when heat is applied, it will return to its original shape with force. Robots will be able to perceive their surroundings with sensors, video camera configured for stereoscopic vision necessary to construct a 3D map and from the map it will be able to recognize locations, plan trajectories, and detect objects by color, shape, and location.
2nd generation robots will emerge around 2020 and have 100,000 MIPS, a 30 fold increase in computation power. 2nd gen robots will be capable of adaptive learning; the robots will adjust its behavior in response to the action past effectiveness, as the robot actual behavior is nudged closer to the human ideal. Robots will be packaged with learning models and probably be capable of being trained by humans through conditioning modules and these conditioning modules watch for desirable and undesirable situations that act on task oriented programs. Conditioning signals come in two categories: positive which raise the probabilities and negative which lowers the probabilities; character is a product of the suite of condition modules of he host. 2nd gen robots will be able to learned from 1st gen robots. 2nd gen robots will use central computer stimulations of robots, in action, to approximate results by gathering data and generalizing from the data, of other robots. A proper simulation would the result of thousands of learned models for various basic interactions and these simulations would be used to effectively construct condition suite by super central computers. 2nd generation robots will find jobs everywhere.
3rd generation robots will have 3 million MIPS and they will learn by faster through trial and error simulation, done by human supervision and super computers at the factory which will be capable of stimulating in real time. The robot will be able to recognize objects for what it is, so the proper interaction modules can be brought up called perception modules. Because these robots will be processing faster than real time they can run prediction simulations to determine if a response will turn out badly and alter its plan of action. In the spare time the computer could preplay previous experiences and try variations on them, learning new ways to improve performance and invent its own simple programs in response to a specialized conditioning module. Adaption is a process of corrective sequences of robot actions and how close they are to the desired end, very similar to the affects of genetic algorithms. These robots will need time to play and use their ability to adapt, imitate, and create simple programs of its own. They will have a theorm prover to find an absolutely correct solution, of arbitrary generality, subtlety, and deviousness, if one exists.
The 4th generation machine will have 100 million MIPS and advanced mechanized reasoning. These robots will write their own programs, understand natural languages, and understand concept and statements more deeply.
Philosophically Moravec wrestles with the word "IS". What is the purpose of this life? Mans purpose is too be born, learn good over evil, and gain increase through a family. Man environment provides beauty and enjoyment for man. A machine should never have dominion over a man. Moravec explains the purpose of man within the context of natural laws. He calls the natural laws stable, measurable, definable, and reliable. Any rationale beyond natural law is considered obscured. Existence cannot be explained by natural laws only. Even Moravec cannot advocate annihilation and clings to the idea that his consciousness will continue either in another form or through robots. God is the reason for mans existence and man exists to become like God. Since God exists than natural laws must be lower level laws. Moravec theorm is incomplete considering the final destination of man.
Man exists to chose between Good from Evil. A conditioning robot cannot expect to achieve this discernment unless higher moral laws govern it. The acquisition of intelligence is beneficial within a natural law sphere but does not necessary suggest the robot will be capable of choosing good over evil. The devil is very intelligent, yet he did not chose good over evil. If a man is more intelligent than his parents, do we call him better?
Suppose, a mans interactions are evil but the results are good, do we call him justified? If robots convert all matter into digital virtual reality, do we say ou existence has improved? An existence that is force upon us. Intelligence must yield to agency which is the freedom to act and not be acted upon. Intelligence alone can not to the reason for existing, intelligence is only part of the meaning of existence, choice and accountability is the larger portion of existence. Man choice is to learn and to discover the "why and how" knowledge necessary, too reject evil. This is not an automated task which can be programmed because opposition and temptation complicate the algorithm into a chaotic mess, of uncertain and solid morality, for an hedonist. A robot will not know how to choice good and evil because it can know sense a higher purpose and morality, so its action will not follow a higher purpose.
Automation and quality of lifeReview Date: 2004-09-11
Why not engineer automation to its pleasure giving limits? Instead of giving robots a high quality of life, design automation to increase EVERYONE quality of life and wealth on Earth???
On Speculating about the ultimate future of intelligenceReview Date: 2005-06-22
One way Mankind has of receiving answers to this is through Religion.
Another way is through speculating on the basis of scientific knowledge and understanding.
Here the Speculations are preceded by a survey of the current state of Robotics.
This is preliminary to a set of projections of the distant future in which biologically- based beings i.e. us , are going to be not supplemented but essentially transcended and replaced by silicon- system artificial intelligences, robots of Intelligence far beyond our own.
The old- style humans , those who choose not to somehow transmit their identities into the new ' super- silicon beings' will kind of hang on as patronized parasites enjoying life as one big freebie thanks to their successful successors.
At this point some of us ' cool' to what is to come.
Magnificent minds simulating scenarios of infinite alternative lives simply do not warm our old aging hearts.
The prospect of monstrously beautiful recombinations in hyperspace of cyberbeings just does not turn us on.
Our minds are in the more mundane, the smaller seeings of our own inner poetries, the lives we make the people we love.
This kind of speculative stuff seems a minor curiosity when measured against the thick, dense , impossibly , non- controllable unpredictability of our small everyday lives.
Forgive us, Future- see-ers of the great Machine- meaning, we are staying home with our own for now.
Very intriguing readReview Date: 2005-04-04
Whoops, sorry, that's just wishful thinking. Seriously, this is a good book, well-written and interesting throughout. Though I personally felt that Moravec got a bit spacey (pun intended, if you've read the book) towards the end, the possibilities he raises are fascinating. As to how temporally accurate his predictions are, again, I can't say, though robotic vacuums did arrive essentially on schedule, and in general most of what he suggests seems feasible.
Like some of the other reviewers, I appreciate a book that runs counter, in large part, to the 'end-of-humanity' theme that seems to accompany the idea of robots gaining mind. As cool as "The Matrix," "Terminator," or "I, Robot" might be on the screen, a real-life instantiation of those themes would be less than cool. Being a fan of Occam's razor myself, I don't know that I'd expect the robots to expend enormous amounts of energy to enslave or exterminate us, assuming we didn't make ourselves too much of a nuisance, an this seems to be the tune Moravec himself sings.
Anyhow, this is a book that is occasionally puissant, hardly ever dull, and often thought-provoking. Any potential buyers may want to wait a few years, though, to see if Moravec keeps on schedule and releases a new version, as per his established pattern.
Exceeds expectations created by its titleReview Date: 2006-09-04
In his 1950 paper Computing Machinery and Intelligence, Alan Turing grouped the arguments opposing the possibility of machine intelligence into the following nine categories:
1- The Theological Objection - thinking is a function of the soul. Machines have no souls, so cannot think.
2 - The "Heads in the Sand" Objection - Thinking machines cannot be possible because the consequences would be too dreadful.
3 - The Mathematical Objection - Mechanical reasoning has certain provable limitations that human thought may not share.
4 - The Argument from Consciousness - Machines have no inner experiences to give meaning to their utterances, actions, or internal operations.
5 - Arguments from Various Disabilities - Machines will never be kind, moral, joyous, perceptive, original, etc.
6 - Lady Lovelace's Objection - Computers do only what we program them to do.
7 - The Argument from Continuity in the Nervous System - Nerves respond to arbitrarily tiny signal differences, while computers work in fixed-size steps.
8 - The Argument from Informality of Behavior - It is not possible to specify for a machine what to do in every possible circumstance a human might encounter.
9 - The Argument from Extrasensory Perception - Humans sometimes sense remote or future information unavailable to deterministic processes in computers.
Moravec provides current arguments countering each item above, but central to all seems to be this: the principle difference between human and machine is we are conscious. This state, however, is so complex we are unable to explain it. Neither do we understand how or from where it arises in our brains.
The author offers a compelling posit; If as of Robot's publication (1999), the most powerful computers could process a million MIPS (million instructions per second), computers capable of a billion MIPS should be just over the horizon. It will be then, Moravec projects, that the mysterious and exclusively human state we call "consciousness" will be revealed to be not exclusive at all, but merely the capacity to accumulate, process, and interpret sufficient amounts of data in the span of each instant of time - and that when this is achieved, computers will sense the state of their surroundings and thus become "conscious" in the same way we are.
He lays the groundwork for this leap carefully, detailing his personal experiences in robotics and the pace of advances in the field. Arriving at the present day situation, he then takes us step by careful step into the future. It's all completely understandable and reasonable. He's right - know what I'm saying?
Eventually though, his vision of the future exceeds my ability to absorb. I confess to less than a complete understanding of his universe of the future. One thing I did get loud and clear: there were no humans there.
Consider robots an intellectual mutation. These creatures we make will first surpass and then replace us, become us, probably in very much the same way we ourselves replaced the less capable lifeforms we arose from in the distant past. It's not a grim future the author envisions for humanity; it's a comfortable even spiritual retirement. Refuse to accept this, and you'll need to deny Darwin's theories too. Think about it.
Art Tirrell is the author of the underwater adventure novel "The Secret Ever Keeps" which does not contain robotics but does contain "...Simply put, the best underwater scenes I've ever read..." Meg W, reviewer.
Related Subjects: Software Research Industrial Building Clubs Medical Commercial Competitions Projects
More Pages: 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250
This book outlines a mathematical theory of negotiation, and combines concepts from game theory, mathematical economics, and artificial intelligence in order to build strategic negotiation models, and discusses their empirical validation. The author bases her model on the Rubenstein model of alternating offers, wherein intelligent agents exchange offers until they reach an agreement or until one of them opts out of the negotiations. She concentrates specifically on the abilities of intelligent agents to coordinate their activities with other agents and to cooperate with them. These agents are assumed to be self-interested, rational, and autonomous. They do not share a common goal and each has its own set of preferences and acts according to them. Because of space constraints, only the first four chapters will be reviewed here.
In the introduction to the book, the author reviews some of the basic concepts from game theory, such as the extensive and strategic representations of a game. The coalitional representation is left to the references. Then, in chapter 2, she discusses in some detail the Rubenstein model of alternating offers, wherein there are N agents the need to reach an agreement on a particular issue, and the agents can only take actions at certain times determined in advance and known to the agents. There is no decision-regret, and the agents are provided with utility functions. The goal is then to find simple strategies that could be recommended to all agents so that no agent could benefit by an alternate strategy.
The author turns to negotiations about data allocation in chapter 3, where servers are autonomous and self-interested, can share documents, and need to make decisions where to locate data available to them. She assumes that the agents prefer any agreement in a given time period over the continuation of the negotiation process indefinitely, assumes losses of unused information, and only considers utility functions with fixed losses per unit time and a discount rate constant in time. The negotiation process is considered in cases of complete information, in which the servers know the expected usage of each dataset, but not the future usage, and in cases of incomplete information, where the expected usage is not, but only the past usage. Recognizing that the allocation problem is NP-complete in these cases, she brings in various techniques from optimization theory and artificial intelligence to deal with it. Simulations using hill-climbing, are shown to give better results than backtracking or genetic algorithms. She also gives a literature survey on distributed file allocation and with various other techniques for the incomplete information case.
In chapter 4, the author discusses bilateral negotiations for resources. In this scenario, one agent has access to a resource and is using it during the negotiation process, while another agent is waiting to use the resource. Cases of both complete and incomplete information are treated, along with cases of multiple encounters. The case of resource allocation is different than that of data allocation in that in resource allocation each agent always prefers a larger portion of the resource. Also, one of the agents loses over time while the other gains in resource allocation. The author discusses an interesting example dealing with the sharing of resources between NASA and ESA, and which illustrates the theorem that an agreement will be reached in the first or second period. This result is also different from the data allocation case, where in the latter, agreement is always reached in the first time period. The case of incomplete information is studied using the notion of "sequential equilibrium." This requires that an agent's strategy in each time period will be optimal given its opponents' strategies and its beliefs, and the history up the given time period. Three conditions are imposed on the sequence of strategies and the agent's system of beliefs that serve to characterize sequential equilibrium. The author again compares this with the data allocation, and concludes that for resource allocation with incomplete information, there is less incentive for telling the truth. The author then addresses the situation where the agents can meet several times in order to carry out the negotiation. She points out the use of "pooling" and "separating" equilibria in analyzing the situations of multiple encounters. An agent can have different utility functions, giving the agents different "types". If all these types select the same strategy in all states, this is a pooling equilibrium. If it is not, it is a separating equilibrium, and then it is possible to identify the agent's type from its actions. It is shown, as expected, that the negotiations in the multiple encounter case end no later than the second time period. Here again, the author uses the NASA and ESA robot examples to illustrate the results she derives for multiple encounters. She also shows the results of simulations to validate the agent's performance in situations of multiple encounters. Brief discussion is devoted to extensions of this model, including two agents with more than two encounters, multiple resources, and cases where there are more than two types of agents. For the case of many resources, the author concludes that the agent holding the resource will not stop negotiating with one agent and initiate a new negotiation process with another agent for a different resource. Other approaches to the resource allocation problem follow.