Home > Articles

Robot's Rules of Order

This chapter is from the book

In this chapter

  • A robot world without laws would be...well, lawless. We lay down some "laws" governing robots (or at least governing those who conceive of robots).

  • We look at some other magnificent maxims, principles, and cautions worth taking to heart.

  • Robot builders can be a scruffy bunch in need of some rules of their own. We offer up a few suggestions.

Bots in Legal Briefs

In the previous chapter, we looked at the many branches on the family tree of robot evolution. We also profiled some of the pioneering scientists and technologists who are feverishly engineering that tree, each focused on a different branch. From these various schools of robotic thought have emerged a number of operating principles (such as looking to nature for inspiration, or using human competition to accelerate robotic innovation). In this chapter, we'll look at some of the "laws," maxims, words of wisdom, and other pithy thought compressions that guide many robot builders. Some of these are from science fiction, some from engineering; some are whimsical, others more serious. They are all worth chewing over; hearty food for thought to keep you stoked as you think about, design, and build robots of your own.

Asmiov's Three (er...Four) Laws of Robotics

You can't call yourself a sci-fi fan, a deep geek, or a robot builder if you aren't familiar with Asimov's Three Laws of Robotics:

  1. A robot may not injure humanity, or, through inaction, allow humanity to come to harm.

  2. A robot may not harm a human being, or, through inaction, allow a human being to come to harm.

  3. A robot must obey the orders given to it by the human beings, except where such orders would conflict with the Zeroth or First Law.

  4. A robot must protect its own existence, as long as such protection does not conflict the Zeroth, First, or Second Law.

The laws first appeared, explicitly anyway, in the short story "Runaround" in 1942. The story was later reprinted in the wildly popular Asimov collection I, Robot in 1950. Asimov's Laws were basically created as a literary device, something for Asimov to work off of as he tried to think intelligently and rationally about the future of robots (and how intelligent robots might interact with humans). The "Zeroth Law" appeared in a later story as a necessary addition to safeguard all of humanity (not just individuals) from robot aggression. In the real world, the Three Laws aren't taken that seriously by most robot researchers, especially because we aren't even close to having a robot that can parse the full grammatical import of the words in the sentences that make up the laws, let alone comprehend their meaning.

Some roboticists, such as BEAM (Biological Electronic Aesthetics Mechanics) creator Mark Tilden, have even suggested that these laws would create laughably wimpy robots. As Dave Hrynkiw and Tilden point out in their book Junkbots, Bugbots & Bots on Wheels, "If an Asimovian robot has enough power to push a vacuum cleaner into your toe (assuming it could even recognize the difference between your toe and a toy lying on the floor), it'd be too nervous to get any practical work done." Still, Asimov and his laws deserve their props. Just as the laws gave Asimov something to push against in writing his positronic robot stories, they've also inspired countless other sci-fi writers, and real-world robot builders. Which brings us (as a for instance) to Tilden's Laws.

Tilden's Laws

BEAM innovator Mark Tilden (see Heroes of the Robolution trading cards in Chapter 2, "Robot Evolution") likes his robots a little more feral than Asimov.

  1. A robot must protect its existence at all costs.

  2. A robot must obtain and maintain access to a power source.

  3. A robot must continually search for better power sources.

The more...ah...earthy expressions of these laws are:

  1. Protect thy ass.

  2. Feed thy ass.

  3. Move thy ass to better real estate.

BEAMbots are survivors. They are built to be hearty and suit the environment in which they find themselves. This is one reason BEAM developers focus mainly on tried and true analog technologies, and why they look to biological inspirations (millions of years of evolution can't be all bad). A fussy big-brained bot with wheels, cameras, multiple processors, and other high-end gear is not going to last very long, in say, a jungle environment. A robot built like a Rhinoceros Beetle, with relatively low-tech parts and primitive sense-act behaviors, is more likely to survive. The other main feature of Tilden's Laws concerns power autonomy. Tilden sees a robotic future in which robots should go about their (programmed) business and not have to be fiddled with very often by human operators (see Figure 3.1). So far, in BEAM, this has translated to solar power as the best way of delivering this autonomy.

Figure XXFigure 3.1 And you thought it was a pain when Fido mangled your slippers. Would bots based on Tilden's Laws be a little too autonomous?

Moore's Law

Moore's Law was proposed by Gordon Moore, one of the founders of computer chip juggernaut Intel:

The number of transistors on a computer microprocessor (basically a measure of processing power) will double every eighteen months.

When he first presented his forecasts on computer chip manufacturing, in a 1965 issue of Electronics magazine, Moore said this doubling would occur every 12 months. That number actually held true for a decade. In the mid-1970s, the "law's" speed limit was slowed to 18 months, and that has held true ever since. Just when we think that manufacturers can't possibly fit another transistor on a chip, some new breakthrough makes the impossible possible, and Moore's Law remains in effect.

Ohm's Law

Ohm's Law (named after German physicist George Ohm) is a formula used to figure out the interdependent relationships between voltage, current, and resistance in an electrical circuit:

One volt will push 1 amp of current through 1 ohm of resistance. Change a value, and they all change.


The perennial truth of Moore's Law is impressive, but one might ask: Why is there no equivalent law for digital storage capacity? Each year, more storage is available, for less money, on ever-shrinking storage media. In fact, storage capacity advances actually exceed Moore's Law. In 1983, a 10MB (megabyte) hard drive (which was nearly the size of a small car, and a forklift was required to get it onto your desk) cost nearly $1,000. If 10MBs cost that much in the '80s, a modern 60GB (gigabyte) hard drive (which now sells for under $100) would cost $6,000,000! In the robot world, this storage boon translates to ever-more sophisticated control programs that can fit into tinier and tinier robot brains and require much less power.

The basic formula is voltage (V) equals current (I) times resistance (R), or V=IxR (see Figure 3.2). If you know two of these values, you can calculate the other (I=V/R, R=V/I). We won't go into this any further here (we'll cover electronic fundamentals in Chapters 6–9), but knowing Ohm's Law is extremely important to anyone doing work in electronics (and that includes us bot builders!).

Figure XXFigure 3.2 It might look like a drug tablet, but this is Ohm's Little Helper, a handy pie chart to help you remember how to do Ohm's calculations (V=IxR, I=V/R, R=V/I).

Moravec's Timeline

Carnegie Mellon robot researcher Hans Moravec (see Heroes of the Robolution trading cards, Chapter 2) sees machine intelligence as basically a hardware problem, or at least, a problem not solvable with the computing hardware of today. Using animal brainpower as a guide, and roughly calculating the processing power of various animal brains (in MIPS, or Millions of Instructions Per Second), Moravec has created a timeline for when machine intelligence will be possible (according to him, anyway). So, for instance, an insect brain can handle about 1,000 MIPS. By comparison, a modern Pentium 4 PC can deal with about 1,700 MIPS. Using Moore's Law (see previous), Moravec believes that a computer will reach (and maybe even surpass) human MIPS power (approximately 100,000,000 MIPS) by 2050 (see Figure 3.3).


If voltage is abbreviated V and resistance is designated by an R, than why is current marked with an I? Well, just to confuse you and make you feel inferior, of course! Logic would dictate that it might be C (for current), but nooo... So, what does the I stand for? Bet you never guessed intensity.

Figure XXFigure 3.3 Moravec's Timeline predicts that the computing muscle needed to handle human-level instruction processing will arrive around 2050. Image courtesy of Hans Moravec.

The Turing Test

Considered to be one of the founding fathers of digital computing, British mathematician Alan Turing came up with this test in the 1950s:

If a human judge engages in a conversation with two parties, one human and one machine, and cannot tell which is which, then the machine is said to pass the Turing Test.

The idea is simple: If a human being can interact with another human intelligence and a machine "intelligence" (through written communications), and is unable to tell the difference, the machine is, for all intents and purposes, intelligent (see Figure 3.4).

Figure 3.4Figure 3.4 From party game to artificial intelligence assessment, the Turing Test lives on. Gender guessing is optional.

Over the years, there has been growing criticism of the test. Does effectively simulating conversation equal intelligence? Can't a machine be smart without having to engage in conversation? A 10-year-old child or an illiterate person wouldn't pass the Turing Test. Does that make them stupid? Although there is an annual competition every year (called the Loebner Prize) to find the most "human-like" machine, to date, no machine has passed the Turing Test.


The Turing Test was actually inspired by a party game. In the game, participants try to guess the gender of players (hidden in another room) by asking written questions and reading answers sent back to them. In Turing's original proposal for the test, he had the human participant pretending to be the opposite gender (the machine was not asked to switch hit), although this feature was quickly dropped.

Amdahl's First Law

Offered in Kenn Amdahl's hysterical and enlightening book, There Are No Electrons: Electronics for Earthlings (see Chapter 6, "Acquiring Mad Robot Skills" and Chapter 11, "Robot Books, Magazines, and Videos"), this law basically reminds us not to mistake scientific models of the world for the world itself:

Don't mistake your watermelon for the universe.

If you use a watermelon to describe the universe to children or particularly slow adults ("the universe is like a watermelon, and the stars are its seeds"), it's easy for them to start thinking "watermelon" whenever they hear "universe." Models can (and often do) become conceptual traps. The idea behind this law, and the inherent dangers of models and analogies, has been expressed in numerous other ways. Alfred Kozybski, the father of General Semantics, was famous for the quote, "The map is not the territory, the name is not the thing named." This is the same basic idea. A related maxim from the cyberneticist Stafford Beer: "Models are not true or false, they are more or less useful." Let your neurons fire that one for a few minutes!


If you'd like to know more about the Loebner Prize, check out the competition's Web site (http://www.loebner.net). It's also worth doing a Web search on Hugh Loebner, creator of the prize, to read up on some of the controversy surrounding him and the contest. And you thought the Turing Test had its critics!

Brooks's Research Heuristic

In Rodney Brooks's book Flesh and Machines, he reveals how he came upon many of his radical ideas regarding robots and AI:

Figure out what is so obvious to all of the other researchers that it's not even on their radar, and put it on yours.

Essentially, Brooks would look at how everyone else was tackling a given problem, and what assumptions were so implicit to them that these assumptions weren't even being questioned. Brooks would then question them.

Braitenberg's Maxim

This idea lies at the heart of Valentino Braitenberg's groundbreaking book:

Get used to a way of thinking in which the hardware for realizing an idea is not as important as the idea itself.


(Kenn) Amdahl's First Law is not to be confused with (Gene) Amdahl's Law. The more widely known Amdahl's Law deals with the performance trade-offs of a single (large) computer processor versus multiple parallel processors.

Braitenberg's book, Vehicles: Experiments in Synthetic Psychology (see Chapter 11) is a series of thought experiments using hypothetical autonomous robot vehicles to demonstrate increasingly complex, lifelike behaviors. What's amazing, and a testament to this type of freeform thinking, is how useful these ideas have proven in real-world robotics (and even in possibly understanding the building blocks of human psychology). Braitenberg's "vehicles" have inspired many real-world robot designs. Our "Mousey the Junkbot" project in Chapter 8 is basically Vehicle 2, the "Fear and Aggression" robot, described in Braitenberg's book.

The Krogh Principle

August Krogh (1874-1949) was a Danish physiologist, who wrote:

For a large number of problems there will be some animal of choice, on which it can be most conveniently studied.

He strongly believed that studying the structures of the natural world could solve most engineering problems encountered in the human world. Many roboticists, such as Robert Full of the Poly-PEDAL Lab (see Chapter 2), have been inspired by Krogh's working principle.

The Sugarman Caution

A colleague of mine, Peter Sugarman, a pioneer of pre-Web hypermedia and a constant supplier of potent bumper sticker wisdom (he reads way too many comic books), once told me this one after my hard drive fried itself in the middle of a hellish book deadline (no, not this hellish book deadline):

A computer can smell your fear.

The animistic paranoia behind this maxim suggests that machines will heartlessly pick the worst possible time to crap out on you (see Figure 3.5). And the more nervous and uptight you are around them, the more likely they are to check out. So relax, stay sharp, and back up frequently!

Figure XXFigure 3.5 Caution: Your high-tech machines (including robots) are waiting for the worst possible time to fail you. Be prepared!

InformIT Promotional Mailings & Special Offers

I would like to receive exclusive offers and hear about products from InformIT and its family of brands. I can unsubscribe at any time.


Pearson Education, Inc., 221 River Street, Hoboken, New Jersey 07030, (Pearson) presents this site to provide information about products and services that can be purchased through this site.

This privacy notice provides an overview of our commitment to privacy and describes how we collect, protect, use and share personal information collected through this site. Please note that other Pearson websites and online products and services have their own separate privacy policies.

Collection and Use of Information

To conduct business and deliver products and services, Pearson collects and uses personal information in several ways in connection with this site, including:

Questions and Inquiries

For inquiries and questions, we collect the inquiry or question, together with name, contact details (email address, phone number and mailing address) and any other additional information voluntarily submitted to us through a Contact Us form or an email. We use this information to address the inquiry and respond to the question.

Online Store

For orders and purchases placed through our online store on this site, we collect order details, name, institution name and address (if applicable), email address, phone number, shipping and billing addresses, credit/debit card information, shipping options and any instructions. We use this information to complete transactions, fulfill orders, communicate with individuals placing orders or visiting the online store, and for related purposes.


Pearson may offer opportunities to provide feedback or participate in surveys, including surveys evaluating Pearson products, services or sites. Participation is voluntary. Pearson collects information requested in the survey questions and uses the information to evaluate, support, maintain and improve products, services or sites, develop new products and services, conduct educational research and for other purposes specified in the survey.

Contests and Drawings

Occasionally, we may sponsor a contest or drawing. Participation is optional. Pearson collects name, contact information and other information specified on the entry form for the contest or drawing to conduct the contest or drawing. Pearson may collect additional personal information from the winners of a contest or drawing in order to award the prize and for tax reporting purposes, as required by law.


If you have elected to receive email newsletters or promotional mailings and special offers but want to unsubscribe, simply email information@informit.com.

Service Announcements

On rare occasions it is necessary to send out a strictly service related announcement. For instance, if our service is temporarily suspended for maintenance we might send users an email. Generally, users may not opt-out of these communications, though they can deactivate their account information. However, these communications are not promotional in nature.

Customer Service

We communicate with users on a regular basis to provide requested services and in regard to issues relating to their account we reply via email or phone in accordance with the users' wishes when a user submits their information through our Contact Us form.

Other Collection and Use of Information

Application and System Logs

Pearson automatically collects log data to help ensure the delivery, availability and security of this site. Log data may include technical information about how a user or visitor connected to this site, such as browser type, type of computer/device, operating system, internet service provider and IP address. We use this information for support purposes and to monitor the health of the site, identify problems, improve service, detect unauthorized access and fraudulent activity, prevent and respond to security incidents and appropriately scale computing resources.

Web Analytics

Pearson may use third party web trend analytical services, including Google Analytics, to collect visitor information, such as IP addresses, browser types, referring pages, pages visited and time spent on a particular site. While these analytical services collect and report information on an anonymous basis, they may use cookies to gather web trend information. The information gathered may enable Pearson (but not the third party web trend services) to link information with application and system log data. Pearson uses this information for system administration and to identify problems, improve service, detect unauthorized access and fraudulent activity, prevent and respond to security incidents, appropriately scale computing resources and otherwise support and deliver this site and its services.

Cookies and Related Technologies

This site uses cookies and similar technologies to personalize content, measure traffic patterns, control security, track use and access of information on this site, and provide interest-based messages and advertising. Users can manage and block the use of cookies through their browser. Disabling or blocking certain cookies may limit the functionality of this site.

Do Not Track

This site currently does not respond to Do Not Track signals.


Pearson uses appropriate physical, administrative and technical security measures to protect personal information from unauthorized access, use and disclosure.


This site is not directed to children under the age of 13.


Pearson may send or direct marketing communications to users, provided that

  • Pearson will not use personal information collected or processed as a K-12 school service provider for the purpose of directed or targeted advertising.
  • Such marketing is consistent with applicable law and Pearson's legal obligations.
  • Pearson will not knowingly direct or send marketing communications to an individual who has expressed a preference not to receive marketing.
  • Where required by applicable law, express or implied consent to marketing exists and has not been withdrawn.

Pearson may provide personal information to a third party service provider on a restricted basis to provide marketing solely on behalf of Pearson or an affiliate or customer for whom Pearson is a service provider. Marketing preferences may be changed at any time.

Correcting/Updating Personal Information

If a user's personally identifiable information changes (such as your postal address or email address), we provide a way to correct or update that user's personal data provided to us. This can be done on the Account page. If a user no longer desires our service and desires to delete his or her account, please contact us at customer-service@informit.com and we will process the deletion of a user's account.


Users can always make an informed choice as to whether they should proceed with certain services offered by InformIT. If you choose to remove yourself from our mailing list(s) simply visit the following page and uncheck any communication you no longer want to receive: www.informit.com/u.aspx.

Sale of Personal Information

Pearson does not rent or sell personal information in exchange for any payment of money.

While Pearson does not sell personal information, as defined in Nevada law, Nevada residents may email a request for no sale of their personal information to NevadaDesignatedRequest@pearson.com.

Supplemental Privacy Statement for California Residents

California residents should read our Supplemental privacy statement for California residents in conjunction with this Privacy Notice. The Supplemental privacy statement for California residents explains Pearson's commitment to comply with California law and applies to personal information of California residents collected in connection with this site and the Services.

Sharing and Disclosure

Pearson may disclose personal information, as follows:

  • As required by law.
  • With the consent of the individual (or their parent, if the individual is a minor)
  • In response to a subpoena, court order or legal process, to the extent permitted or required by law
  • To protect the security and safety of individuals, data, assets and systems, consistent with applicable law
  • In connection the sale, joint venture or other transfer of some or all of its company or assets, subject to the provisions of this Privacy Notice
  • To investigate or address actual or suspected fraud or other illegal activities
  • To exercise its legal rights, including enforcement of the Terms of Use for this site or another contract
  • To affiliated Pearson companies and other companies and organizations who perform work for Pearson and are obligated to protect the privacy of personal information consistent with this Privacy Notice
  • To a school, organization, company or government agency, where Pearson collects or processes the personal information in a school setting or on behalf of such organization, company or government agency.


This web site contains links to other sites. Please be aware that we are not responsible for the privacy practices of such other sites. We encourage our users to be aware when they leave our site and to read the privacy statements of each and every web site that collects Personal Information. This privacy statement applies solely to information collected by this web site.

Requests and Contact

Please contact us about this Privacy Notice or if you have any requests or questions relating to the privacy of your personal information.

Changes to this Privacy Notice

We may revise this Privacy Notice through an updated posting. We will identify the effective date of the revision in the posting. Often, updates are made to provide greater clarity or to comply with changes in regulatory requirements. If the updates involve material changes to the collection, protection, use or disclosure of Personal Information, Pearson will provide notice of the change through a conspicuous notice on this site or other appropriate way. Continued use of the site after the effective date of a posted revision evidences acceptance. Please contact us if you have questions or concerns about the Privacy Notice or any objection to any revisions.

Last Update: November 17, 2020