Robot system

- iRobot Corporation

A power-saving robot system includes at least one peripheral device and a mobile robot. The peripheral device includes a controller having an active mode and a hibernation mode, and a wireless communication component capable of activation in the hibernation mode. A controller of the robot has an activating routine that communicates with and temporarily activates the peripheral device, via wireless communication, from the hibernation mode. In another aspect, a robot system includes a network data bridge and a mobile robot. The network data bridge includes a broadband network interface, a wireless command interface, and a data bridge component. The data bridge component extracts serial commands received via the broadband network interface from an internet protocol, applies a command protocol thereto, and broadcasts the serial commands via the wireless interface. The mobile robot includes a wireless command communication component that receives the serial commands transmitted from the network data bridge.

Skip to: Description  ·  Claims  ·  References Cited  · Patent History  ·  Patent History
Description

This U.S. patent application claims priority under 35 U.S.C. 119(e) to a U.S. provisional patent application filed on Dec. 2, 2005, entitled “ROBOT NETWORKING, THEMING AND COMMUNICATION SYSTEM” and having assigned Ser. No. 60/741,442, the entire contents of which are hereby incorporated by reference.

TECHNICAL FIELD

This invention relates to robot systems, and more particularly to power saving robot systems and robot system networks.

BACKGROUND

Autonomous robots are robots which can perform desired tasks in unstructured environments without continuous human guidance. Many kinds of robots are autonomous to some degree. Different robots can be autonomous in different ways. An autonomous coverage robot traverses a work surface without continuous human guidance to perform one or more tasks. In the field of home, office and/or consumer-oriented robotics, mobile robots that perform household functions such as vacuum cleaning, floor washing, patrolling, lawn cutting and other such tasks have been widely adopted. Autonomous coverage robot systems that include a coverage robot and peripheral devices are generally battery powered. As a result, the battery life of each component of the system affects the operability of the overall system.

SUMMARY

The present disclosure provides a robot which can communicate with a base station and/or internet site via wireless communications media, in one configuration using a wireless bridge adapted for connection directly to a home wired network to provide a direct presence and proxies for the robot, allowing the robot to be a fully functional network node.

In one aspect, a power-saving robot system includes at least one peripheral device to be placed in an environment and a mobile robot. The peripheral device includes a power supply, a wireless communication component, and a controller having an active mode in which the peripheral device is fully operative and a hibernation mode in which the peripheral device is at least partly inactive. The wireless communication component is capable of activation in the hibernation mode. The mobile robot includes a drive system that moves the robot about the environment, a wireless communication component, and a controller. The controller has an activating routine that communicates with the peripheral device via the wireless communication components and temporarily activates the peripheral device from the hibernation mode when the wireless communication components of the peripheral device and the robot come within range of one another.

In one implementation, the wireless communication components communicate with transmission wavelengths that permit the robot and the peripheral device to be outside a line of sight. Conversely, in another implementation, the wireless communication components communicate with transmission wavelengths that require the robot and the peripheral device to be within a line of sight. In one example, the peripheral device is precluded from altering modes from the hibernation mode to the active mode until a line of sight is present between the robot and the peripheral device.

The wireless communication components may communicate with a point-to-point protocol while excluding routing and may communicate commands interpretable by the peripheral device to initiate a function. In one example, the wireless transmission communicated by the robot wireless communication circuit includes identification information. Similarly, the wireless transmission communicated by the peripheral device wireless communication circuit may include identification information as well.

In some implementations, the peripheral device, while in the hibernation mode, occasionally listens for a robot ping. Also, while in the hibernation mode, the peripheral device occasionally polls for a quiet robot. In one example, the peripheral device is a base station. In another example, the peripheral device is a mobile device.

In another implementation, the robot measures a signal strength of a wireless transmission communicated by the wireless communication component of the peripheral device to determine a distance from the peripheral device. In one example, the wireless communication components communicate over a radiofrequency.

In some implementations, the controller of the robot determines a locality of the robot based on information received via the wireless communication component of the robot from a peripheral device, such as a beacon, located in an area in which the robot is operating. The peripheral device is configured to transmit radio-frequency identification information. For example, each locality within a robot environment may respectively include a beacon configured to wirelessly emit respective location information (e.g. in an environment corresponding to a house, each “locality” may represent a room, and each room may be installed with a beacon broadcasting a unique identification over radio-) frequency or other such medium). A base station may be provided in at least one locality, and the beacon may be configured to communicate with the base station and to relay data therefrom and/or thereto. It is advantageous for such beacons and base stations to save electrical power. The beacon may emerge from a low-power “hibernation” intermittently by listening for RF or IR of the robot, by operating a wake-up timer, by being actively RF or IR interrogated by the robot, or any permutation of combinations thereof based on time elapsed since a last event or number or frequency or character of interactions. Furthermore, the robot may activate a peripheral device according to a schedule or transmit schedule information to the peripheral device, which activates itself based on the schedule.

In another aspect, a robot system includes a network data bridge and a mobile robot. The network data bridge includes a broadband network interface, a wireless command interface, and a data bridge component. The broadband network interface is connectible to an internet protocol network and carries communications transferred in compliance with an internet protocol. The wireless command interface is connectible to a wireless command protocol network and carries communications transferred under a command protocol. The data bridge component extracts serial commands received via the broadband network interface from the internet protocol and applies the command protocol thereto. The data bridge component listens to the narrowband wireless interface and sends a robot, peripheral, network and system state to the Internet via the broadband network interface. This information is automatically sent to a monitoring service via internet protocols, where long-term monitoring and analysis takes place. Actions/commands resulting from this analysis are injected into the narrowband wireless network by the RF-bridge. These actions can include serial commands, new software images for robot and/or peripheral, or queries for more in-depth (debugging) information that can be interpreted and responded to by the robot. The data bridge component also broadcasts the serial commands via the narrowband wireless interface. The mobile robot includes a drive system that moves the robot about an environment and a wireless command communication component that receives the serial commands transmitted from the network data bridge.

In some implementations, the system also includes at least one peripheral device to be placed in the environment. The peripheral device includes a wireless command communication component that receives serial commands transmitted from the robot and the network data bridge. The peripheral device also includes a controller having an active mode wherein the peripheral device is fully operative and a hibernation mode wherein the peripheral device is at least partly inactive. The wireless communication circuit is capable of activation in the hibernation mode.

In another aspect, the robot can receive and utilize customizable sounds or other audio content for interacting with a user. The robot receives audible content and plays back the audible content in coordination with specific robot functions. In one example, the robot controls externally visible indicia of the robot in coordination with a play back of audible content such as, inter alia, synthesized voice content during a user interaction and/or training mode.

In yet another aspect, the robot includes a facade or external housing changeable with customized cladding. In one example, the home robot includes interchangeable molded plastic or metal body panels affixed to an exterior of the robot by snap-on fasteners, insertable fitting tabs and receivers, screws, magnetic fixing pieces, etc. The interchangeable body panels correlate to audio content uploadable to the robot. In one instance, the customized body panel includes an identification system for automatically causing the robot to download and/or use the corresponding audible content. The identification system may include an integrated circuit, characteristic resistance, bar code, optical identifier, RFID, passive magnetic resonance, or mechanical identification system (e.g. a punch-card-like series of holes or protrusions).

The ability to customize the robot by transferring selected sound or multimedia schemes, themes, tones, music, audio or visual content, choreographic or movement routines, or other data to the robot improves overall enjoyment from the robot by a user. In one aspect, the robot includes a radio receiver configured to receive audible content via wireless transmission, a memory configured to store the audible content, a speaker configured to emit the audible content, and indicia controllable by a controller and configured to indicate operative information in a first mode and to indicate illustrative information in coordination with the audible content in a second mode. The indicia may include a light-emitting diode and also a power indicator configured to indicate an actual power state of the robot in the first mode and a training pattern in the second mode. The robot may further include a voice synthesizer configured to synthesize spoken didactic information based on the audible content. Also, the wireless transmission may be structured according to a packet-encoded transmission protocol. The robot may further include a customizable body panel detachably affixed to a main body of home robot, where the customizable body panel corresponds with themed audio data included in the audible content.

The robot may be configured to operate in at least first and second modes. The first mode corresponds to a normal robot operating state of the performing a primary function. The second mode corresponds to a training mode, where the speaker emits an audible training instructional program. In the second mode, the indicia of the robot displays according to a training pattern in timed coordination with the audible training/instructional program, where the training pattern displayed on the indicia is different from an operative pattern corresponding to an actual state of the home robot.

In another aspect, a robot system includes a mobile robot and a wireless communication system for communicating with the robot. The wireless communication system includes a network interface unit configured to communicably interface with a first network and to wirelessly transmit data to the robot. The wireless communication system also includes a server configured to communicate with the network interface unit via the first network. The robot is configured to wirelessly transmit data to the network interface unit, which is configured to convert the data from a wireless protocol to a network protocol used by the first network. The network interface unit transmits the data to the server. The server may be configured to produce robot usage, robot behavior, and/or customer information based on the data transmitted to the server. Also, a user terminal configured to communicably interface with the first network and to control at least one function of the robot may be provided. The user terminal transmits a command corresponding to at least one robot function to the network interface unit via the first network. The network interface unit wirelessly transmits the command to the robot. User interaction is performed through this user interface, allowing further usage data to be collected. This offloaded interface also allows the robots to coordinate actions without needing to communicate directly with one another. The robot systems are functionally independent of one another, but are tied together via the server through a single user interface/data logging/usage information collecting server.

In one example, the wireless communication system includes audible content stored at the server. The server is configured to transmit the audible content to the network interface unit, which is configured to wirelessly transmit the audible content to the robot. Alternatively, audible content may be stored at the user terminal, which is configured to transmit the audible content to the network interface unit via the first network. The network interface unit is configured to wireless transmit the audible content to the robot. Furthermore, content may be stored at a base station to which the robot docks for recharging and/or servicing.

Robot-generated data may include theme data corresponding to audible content, in which the server transmits the audible content to the robot via the network interface unit in response to the theme data. The data may alternatively include a behavior theme configured to cause the robot to behave according to a theme. The audible content may include voice data. Other robot behavioral changes may be implemented based on long-term monitoring and analysis of the robot-generated data. (For example, if the robot does not make it back to the dock before the battery gives out three times in a row, the server modifies the behavior of the robot to start looking for the dock/base station earlier. This modifies the robot behavior to be “more conservative.”)

Behaviors are parameterized and can be modified, or even disabled/activated based on analysis of usage/sensor information. Robot performance can be autonomously modified by the learned effects of the actual customer home. This can take place after the robot has been purchased and server is updated to provide a better model of robot/home performance characteristics. The wireless reporting infrastructure allows a modification of behavior based telemetry to provide the best performance for a particular customer. The learning process is dynamic and can change as an understanding of the data increases.

In one implementation, the wireless communication system includes a second user terminal which is configured to communicably interface with the first network. A theme may be stored at the first user terminal, which transmits the theme to the second user terminal via the first network. The first network may include UDP, TCP/IP, and/or Ethernet, as examples.

In another aspect, a content distribution system for distributing data to a robot includes a first server configured to communicably interface with a first network and a user-side node configured to transmit data to the robot. The robot receives customizable content via the user-side node. In one example, the content distribution system further includes a network hub configured to use a protocol compatible with the first network and a network adapter configured to communicably connect the network hub with the first network. The user-side node is configured to detachably interface with the network hub. In another example, a data slot is installed on the robot and configured to receive the user-side node. In yet another example, the content distribution system further includes a content server configured to communicably interface with the first network and to transmit the audible content to the robot via the user-side node using the first network. The content server transmits content to the user-side node based on information received from the first server (e.g., the content served by the content server may include licensed content such as music or sound, images, “dance” moves or patterns performable by an appropriate type of mobile robot such as a wheeled robot—also referred to herein as “robo-motions”, and the like, for which the copyright is held by a third party; alternatively, the copyright holder of the content may be the manufacturer or any other entity). Also, the user-side node of the content distribution system may be configured to receive content from the server via the first network, and the user-side node may be configured to transmit the content to the robot via a wireless communication protocol.

In some instances, the content distribution system further includes a user terminal configured to communicate via the first network and a content selection display presented on the user terminal. The customizable content is transmitted to the robot when selected from the content selection display on the user terminal. The user-side node includes an Ethernet dongle or a USB dongle (or “network bridge”) configured to detachably connect to an Ethernet hub. The user-side node is configured to receive content via the Ethernet hub and is configured to transmit the content to the robot via a second protocol different from the first network. (As used herein, the term “data bridge” is understood to refer to all such dongles and/or pocketable and/or portable devices capable of appropriately communicating with a robot, either via wireless, wired, or direct physical connection, or any other suitable modality for such a portable device to communicate and/or transmit data to the robot.) Also, the user-side node may receive content from the data bridge or from a remote site, with no client application located on the user terminal, just a web browser. Alternatively, a specific client application may be provided. The user-side node may be configured to operate using power supplied via the first network. The customizable content may include audible content, which may be organized into a theme of related discrete sounds.

In other instances, the robot transmits information corresponding to a theme to the server via the user-side node and receives customizable content including thematically related audio data corresponding to the theme. In one implementation, a main body of the robot includes a detachable body panel having an audio/theme identification unit. The robot is configured to identify audio content and/or a theme corresponding to the detachable body panel via the theme identification unit. The second protocol may include a wireless transmission protocol (e.g. ZigBee, 802.11a/b, wireless USB, serial-over-RF, AMPS, CDMA, GSM, Bluetooth, a simplistic or proprietary scheme, etc.).

The content distribution system may further include a voice synthesizer installed to the robot, in which the audio data includes voice synthesis parameters (for altering the perceived “personality” of a robot, or to better accommodate someone who has hearing loss in certain frequency ranges, for example).

Also, the robot may further comprise a robot firmware which is customized based on user feedback or robot sensor data processed by a server, in which the robot firmware is downloaded to the robot from the server.

The details of one or more implementations are set forth in the accompanying drawings and the description below. Other features, objects, and advantages will be apparent from the description and drawings, and from the claims.

DESCRIPTION OF DRAWINGS

FIG. 1A is schematic diagram showing an example of a power-saving robot system.

FIG. 1B is a sectional view showing an example of a mobile robot.

FIG. 1C is schematic diagram showing an example of a peripheral device.

FIG. 2 is a schematic diagram showing an example of a robot system.

FIG. 3 is a block diagram showing an example of a network data bridge.

FIG. 4 is a schematic diagram showing an example of a robot system including mobile robots, in which a computer transmits themes to the mobile robots.

FIG. 5 is a schematic diagram showing an example of body panel themes for a mobile robot.

FIG. 6A is a schematic diagram showing an example of a mobile robot that includes a network data bridge.

FIG. 6B is a schematic diagram showing an example of a mobile robot and an example of a network data bridge which connects to other networks via a network that runs over power lines in a building.

FIG. 7 is a block diagram showing an example of a robot system including a manufacturer server and a licensed content provider server.

FIG. 8 is a schematic diagram showing an example of a robot system including a vendor and a manufacturer server.

FIG. 9A is a state diagram showing an example of a state machine for a mobile robot.

FIG. 9B is a state diagram showing an example of a state machine for a mobile robot.

FIG. 9C is a state diagram showing an example of a state machine for a mobile robot.

Like reference symbols in the various drawings indicate like elements.

DETAILED DESCRIPTION

FIG. 1A is schematic diagram showing an example of a power-saving robot system 100. The system 100 includes a peripheral device 102 and a mobile robot 104. In this example, the mobile robot 104 is a cleaning robot, such as a vacuum, brushing, or mopping robot. The peripheral device 102 transmits wireless commands to control the movement of the mobile robot 104. When the mobile robot 104 is out of range of the peripheral device 102, the peripheral device 102 enters a hibernation mode or low power consumption state. When the mobile robot 104 is in range of the peripheral device 104, a wireless command transmitted by the mobile robot 104 activates the peripheral device 102 from the hibernation mode. In certain implementations, the mobile robot 104 and the peripheral device 102 use a point to point protocol while communicating to one another. In certain implementations, the peripheral device 102 is a base station, such as a device to recharge the mobile robot 104 or a receptacle to empty debris from the mobile robot 104.

Referring to FIG. 1B, the mobile robot 104 includes a drive system 1042, a wireless communication component 1044, and a controller 1046. The drive system 1042 moves the mobile robot 104 about an environment, such as a floor to be cleaned. The wireless communication component 1044 communicates with the peripheral device 102. For example, the wireless communication component 1044 may receive signal beams from the peripheral device 102, such as infrared (IR), radio frequency (RF), and/or audio signals. In certain implementations, RF signals may be used to provide communication when the peripheral device 102 and the mobile robot 104 are outside of one another's line of sight. In certain implementations, IR signals may be used to provide communication when the peripheral device 102 and the mobile robot 104 are inside of one another's line of sight. In addition, the mobile robot 104 may use the signal strength to determine a distance to the peripheral device 102. The signals may prohibit movement of the mobile robot 104 through a particular area or guide the movement of the mobile robot 104 to a particular area. In addition, the controller 1046 uses the wireless communication component 1044 to temporarily activate the peripheral device 102 from a hibernation state, such as a state consuming a low amount of power. In certain implementations, the mobile robot 104 uses an IR signal, or line of sight form of communication, to activate the peripheral device 102 from the hibernation mode. In certain implementations, the mobile robot 104 sends the activation command in response to a query from the peripheral device 102. In certain implementations, the mobile robot 104 occasionally sends the activation command, such as continuously or periodically.

Referring to FIG. 1C, the peripheral device 102 includes a power supply 1022, a wireless communication component 1024, and a controller 1026. The power supply 1022 may be, for example, an electric battery. The power supply 1022 provides power to the various functions of the peripheral device 102, such as generating navigational signal beams 106a-c. The wireless communication component 1024 generates a fence beam 106a, a left guide (or directed) beam 106b, and a right guide (or directed) beam 106c. The wireless communication component 1024 also receives wireless signals from the mobile robot 104. The controller 1026 activates one or more of the beams 106a-c during the active mode and disables beams 106a-c in the hibernation mode. In certain implementations, the peripheral device 102 occasionally listens for an activation command from the mobile robot 104. In certain implementations, the peripheral device 102 sends an activation poll to the mobile robot 104 to determine if it should become active. In this example, the fence or barrier beam 106a prevents the mobile robot 104 from passing through the area where the mobile robot 104 detects the fence beam 106a. Beams 106b-c aid the navigation of the mobile robot 104.

In certain implementations, the robot 104 includes a display panel 105 in electrical communication with the controller board 1046. The display panel 105 includes indicia 1052 and an audio output device 1054. In one example, the indicia 1052 include a segmented illuminable maintenance display substantially mimicking the appearance of the robot. In other examples, the indicia 1052 include themed displays, which will be described later in further detail. The controller board 1046 controls the illumination of indicia 1052 and the audio responses from the audio output device 1054.

The peripheral device 104 may perform in several capacities. For example, the peripheral device 102 may act as a fence. The peripheral device 102 may use the fence beam 106a to prevent the mobile robot 104 form passing through an area, such as a doorway. The peripheral device 102 may also act as a gate. The fence beam 106a may provide a gate that prevents passage during a particular time interval, such as when the mobile robot 104 is in the process of cleaning a room. The peripheral device 102 may deactivates the fence beam 106a when the mobile robot 104 has finished cleaning the room and grants passage to the mobile robot 104. The mobile robot 104 uses the beams 106b-c to guide its way through the area covered by the gate. In addition, the peripheral device 102 may act as a trail marker or navigation beacon. For example, as described above the mobile robot 104 may use the beams 106b-c to navigate through areas, such as doorways. The beams 106a-c may contain information, such as an identifier (ID) of the peripheral device 102, an identifier of the type of beam, and an indication of whether the peripheral device 102 is a gate or a fence. If it is a gate, the beam identification allows the robot 104 to determine whether it is detecting the left or right guide beams 106b and 106c, respectively. The peripheral device identifier allows the mobile robot 104 to distinguish the beams 106a-c of the peripheral device 102 from beams transmitted by another peripheral device. The mobile robot 104 may be taught (or may itself learn) a path to an area, such as a back room of a house, by following a pattern of peripheral device identifiers. The beam type identifier indicates whether the beam is a fence beam 106a, a left side navigation beam 106b, or a right side navigation beam 106c. If the beam is a fence beam 106a, the beam information may also indicate whether the beam is acting as a gate that may be opened, given the proper command, or a barrier that remains closed. In any case, while the mobile robot 104 is out of range, the peripheral device 102 hibernates and the beams 106a-c remain inactive.

The wireless communication component 1024 of the peripheral device 102 receives a signal from the wireless communication component 1044 of the mobile robot 104 to activate the peripheral device 102 from a hibernation state. In certain implementations, the mobile robot 104 transmits a first activation signal 108a to activate a first set of peripheral device beams, such as the fence beam 106a while cleaning is in progress. In certain implementations, the mobile robot 104 transmits a second activation signal 108b to activate a second set of peripheral device beams, such as the navigation beams 106b-c when the mobile robot 104 moves to another room. In certain implementations, the signals 108a-b include a mobile robot identifier. The peripheral device 102 may use the mobile robot identifier to activate, for example, a first set of beams, such as the fence beam 106a, in response to an activation request from the mobile robot 104 and a second set of beams, such as the beams 106b-c in response to an activation request from a second mobile robot. In this example, the mobile robot identifiers allow the peripheral device 102 to activate beams based on the mobile robot requesting the activation, such as by providing a fence to the mobile robot 104 and a gate to a second mobile robot.

FIG. 2 is a schematic diagram showing an example of a robot system 200. The robot system 200 includes the mobile robot 104 and a network data bridge 202. In this example, the wireless communication component 1044 of the mobile robot 104 receives serial commands from the network data bridge 202, such as radio-frequency (RF) signals. Typically, these signals may be transmitted by the network data bridge 202 or other such user-side node, which is in turn connected to an Ethernet router/switch/hub 204 along with several other Ethernet-connected devices such as a home computer 206, a laptop computer 208, a cable/DSL/satellite/broadband-adapter 210 or modem, and e.g. one or more other computing devices such as a personal digital assistant 212.

In one example, the network data bridge 202 which attaches to an Ethernet port on the Internet-connected router 204 or switch may automatically download a script from a predetermined Internet or local server (e.g., via BOOTP, DHCP, HTTP, FTP, and/or TFTP) thereby providing automatic commands, such as device configuration or diagnostic testing, to be performed. Alternatively or additionally, a user may manage the mobile robot 104 using a device, such as the computer 206. The Ethernet-attached network data bridge 202 may provide for configuration and operational functionality via a small, embedded HTTP server built into the firmware of the network data bridge 202.

Devices other than the computer 206 may also be used to interface with the network data bridge 202, such as a set-top box, a game console, the PDA 212, a cell phone 214, or a home server that is programmed to communicate using web or other networked interfaces.

As an alternative, access to broadband is provided via a USB port, as may be provided by the computer 206. For example, a user may insert a driver CD-ROM into the computer 206 upon plugging in a USB-based wireless transceiver, in order to install a driver therefore. Another connection, such as IEEE 1394/Firewire, RS-232, parallel port connections, and/or X10, may be used. These, however, may not necessarily be network data bridges.

Once a network data bridge 202 is attached to the network-accessible device 204, it can contact a server.

FIG. 7 is a block diagram showing an example of a robot system 700 including a manufacturer server 702 and a licensed content provider server 704. The manufacturer server 702 and the content provider server 704 may be connected to the broadband modem 210 via the Internet 706 or another appropriate network. The mobile robot 104 may report information to the server 702, such as the status of the mobile robot 104 or usage data regarding the mobile robot 104. The server 702 may store the reported data in a repository 708. The reported data may be associated with information regarding the user of the mobile robot 104. The user information may be stored in a repository 710.

Further, the network data bridge 202 may connect wirelessly to the mobile robot 104 and initiate communications therewith. While the Ethernet hub 204 includes four wired Ethernet ports as well as 802.11 wireless Ethernet connectivity, and although 802.11 or other such wireless networking protocol may be used to communicate with a mobile robot 104 from the base station other than via a network data bridge, in certain implementations, the mobile robot 104 and the network data bridge 202 use a simple, serialized RF protocol in order to exchange information between the mobile robot 104 and the base station, rather than the full-weight networking protocols.

In certain implementations, the mobile robot 104 may be further simplified by providing receive-only functionality on the mobile robot 104, instead of bi-directional wireless communication support. However, as an alternative, the mobile robot 104 may include full bi-directional wireless communications support in order to transmit information from the mobile robot 104 to the base station (and e.g., to the user, the manufacturer, etc.).

The manufacturer may receive real-world mobile robot data for product refinement and R & D. For example, the mobile robot 104 may collect data regarding behavioral patterns (e.g., a number of errors encountered, a number of times the mobile robot 104 has become stuck, or how frequently the mobile robot 104 is used) and forward such information to the mobile robot's manufacturer for refining market research and producing future models of the mobile robot 104, for example, by correcting design flaws or device problems. Moreover, customer information such as frequency of robot use, name, customer ID, etc., may also be correlated using information forwarded to the manufacturer's website from the mobile robot 104 via wireless and wired networking.

In addition, instead of the user having to locate and e.g., tote the mobile robot 104 to the base station in order to physically connect the mobile robot 104 thereto for software upgrades, software updates, and the like, a wireless update function may be provided by the network data bridge 202 in order to update the robot's firmware or other on-board software, personality, sounds, and/or displayed pictures. Also, a user may design themes or other content and have this content transmitted to the mobile robot 104 via the wireless communication channel provided by the network data bridge 202.

FIG. 3 is a block diagram showing an example of a network data bridge. The network data bridge 202 includes a network connector 302, such as an RJ-11-style male Ethernet connector. Also, the network data bridge 202 includes an antenna 304, such as an enclosed, internal antenna, operatively driven by a wireless command interface 306, which is in turn connected to a data bridge component 308 (the mobile 104 robot may likewise include an enclosed, internal antenna; alternatively, either the network data bridge 202 and/or the mobile robot 104 may either one or both include one or more external antennas, either in addition to or in lieu of an internal antenna, for example). The data bridge component 308 is connected to a broadband network interface 310 for managing and converting inbound and outbound broadband-side data (such as Ethernet, 802.11b, and/or TCP/IP packets) to and from to a wireless-side simplified networking protocol. The data bridge component 308 extracts serial commands received by the broadband network interface 310 and broadcasts the commands via the wireless command interface 306 and the antenna 304, using the RPAN protocol.

The network data bridge 202 is plugged directly into the owner's broadband router 204. The network data bridge 202 acquires network information from a DHCP server or optionally configured by an advanced user. The network data bridge 202 calls home (i.e., a home robot manufacturer's or reseller's Internet server) with local configuration information (serial number, local network properties, etc.). The network data bridge 202 begins polling a pre-configured URL with periodic HTTP POSTs. Each post contains status information on the mobile robot(s) 104 in the customer's home. This data can be robot/firmware specific—the network data bridge 202 need not understand the data itself (although it may well do so in certain implementations).

A CGI script receiving the POSTS processes this sensor report and updates an internal database creating a historical view of the robot system. Software-based virtual sensors examine this database (on a per-robot basis) and trigger events such as virtually pressing a button on the robot or triggering an email to its owner.

The owner may visit the home robot manufacturer's web presence using a modem, i.e.; JavaScript-enabled (or any other suitable scripting language such as Visual Basic, python, PERL, Php, etc.) web browser, and creates a user account. As part of the registration process, the customer enters the unique key as shipped with the wireless data bridge—this unique key pairs the incoming sensor stream with this user's account.

After registration, the user may be forwarded to their portal page. This page is dynamically generated using the information already provided by the robot gateway and product information and tie-ins provided by the back end infrastructure of the manufacturer's server(s).

Owner browses to theme or content store and purchases an audio theme with immediate online delivery. Theme or content store contacts robot sensor database and adds to the command queue: “download this content to robot #2” When the gateway device next posts sensor data, the HTTP response is the command to download the attached content data to the specified robot. The wireless data bridge begins forwarding this binary stream to the robot via RF. When completed, the gateway may sends a download acknowledgement with the next sensor report.

During this transaction, the javascript (or other suitable script) embedded into the owners' web interface has been polling the back-end servers for status updates. A progress bar has been drawn and animated using javascript and DHTML (or Ruby on Rails, a JAVA applet, or any other suitable display technology). The user may feel that s/he is interacting directly with the robot via the web page, despite the levels of software and communication indirection laying therebetween.

In one implementation, the wireless data bridge 202 may include a female port into which an Ethernet patch cable (or other such networking cord) plugs into from a suitable network connection point, and/or into which an interface portion of a home robot attaches, for example. As examples of such a system as described hereinabove, these communication channels provides a mechanism for retrieving sensor data and sending commands to robots in the field by piggy-backing on their broadband connection.

Such a bi-directional communication system allows deployment of online services and to retrieve sensor data from a manufacturer's installed base for improved customer service and system characterizations. It may further increase the manufacturer's comprehension of how robots and individual subsystems perform in the field.

Interaction the network-enabled mobile robot(s) 104 in a customer's home may take place through a web browser, in accordance with certain embodiments. Web browser access provides support for robot interaction via non-PC devices (e.g., cell phones, and PDAs) with compliant browsers.

FIG. 6A is a schematic diagram showing an example of the mobile robot 104 that includes the network data bridge 202. In this example, the network data bridge 202 is a card that is inserted into an interface slot 602 in the mobile robot 104. This type of network data bridge may be self-contained and transport data on constituent RAM, ROM, Flash, or EEPROM, type storage devices (which might be loaded with software, video, or audio content either at a user's computer equipped with a special writing unit or at the manufacturer in order to provide content such as themed content, for example); or can be loaded with code number(s) that authorizes a wireless download to the network data bridge 202; or, alternatively, may be connected to a network via a wire or by wireless Ethernet, for example.

A “Memory stick”-type (serial port interface), network data bridge 202 may provide content to mobile robot users who lack an Ethernet hub or Internet connection, or for users who are unable to purchase content online via credit card, or who simply come across a set of content while at a store and wish to make an impulse purchase or gift purchase for another. Furthermore, similar to the network data bridge implementation discussed above, personal computer use is not necessarily required because the user may plug the “memory stick”-type network data bridge 202 directly into a receptacle 602 defined by the mobile robot 104, and content on the network data bridge 202 may be automatically uploaded to the mobile robot 104. See, e.g., U.S. patent application Ser. No. 11/166,518, incorporated herein by reference in its entirety.

FIG. 6B is a schematic diagram showing an example of the mobile robot 104 and an example of the network data bridge 202 which connects to other networks via a network that runs over power lines in a building. The network data bridge 202 may be configured to plug into a standard power outlet 604 and to participate with a home power-line network, for example, in homes or markets where Ethernet networking components are not available. Alternatively, the network data bridge 202 may plug into a standard telephone wall jack in order to communicate via a home telephone wiring network, for example. In certain implementations, the network data bridge 202 might be plugged into any of an Ethernet port, the power socket 604 or a telephone wall jack, and auto-negotiate a connection to the Internet (if available) and/or to the mobile robot(s) 104. To this end, many “Ethernet-over-home power lines” and similar schemes or products are widely produced and well known in the art; for example, as an early commercial endeavor in this technology area, the X10 communication standard permits communication over power lines by encoding a single bit of information at each zero-point in the 120 V(RMS) @ 60 Hz power cycle common in North America, for example, and many more modern Ethernet-like power line networking systems are commercially available, in which each networked device connects to the network typically via an electrical socket on a wall. A common feature is that the network data bridge extracts the serial commands and data from encapsulating broadband protocols (Ethernet, TCP/IP, 802.11x) for transmission on the local wireless robot network (RPAN), and similarly encapsulates such commands and data from the RPAN for transmission on the broadband network.

The wireless data bridge 202 may provide web server functionality and serve static or dynamic web content corresponding to enabled mobile robots 104 belonging to the mobile robot user. Such web server functionality may be provided on the mobile robot user's local broadband network and e.g., be broadcast discoverable using TCP/IP, UDP, Ethernet, SNMP, NetBEUI, IPX, SMB or uPnP broadcast network announcing, for example, in order to be found by mobile robot users when browsing the local area network; alternatively, a static network address (such as a standard, pre-set IP address) may be assigned to the data bridge 202 such that users may simply type the static network address into a web browser to reach the web server on the network data bridge 202. The web content may be active or static, and may be tailored to the functionality to be provided and/or may be updated via the Internet or local network.

FIG. 9 is a schematic diagram showing an example of the robot system 200 with a content serving system for transmitting content to a mobile robot. The system 200 for accessing home robot-related content and controlling a home robot via the Internet may include an embedded web-server; an online presence accessible as a service/content provider; and a web-based user interface specific to the robots 104 in the customer's home. These components may be used to tunnel events across the Internet to an online “robot presence” generated by, for example, a home robot manufacturer. This “robot presence” may provide interactivity with the user's home robot (audible content or other types of theme and/or content downloads, remote button presses, etc.) via a hosted web service. The events thus tunneled may include: changes in sensor values, user interaction, commands to the robot, and state changes, inter alia. Use of a bi-directional communication channel (such as a wireless robot network communication channel) allows melding between a robot in someone's home, procedural and informational repositories on a remote server, and a web-based robot user interface, to produce powerful capabilities and forge new functionalities such as adding offloaded “intelligence” to otherwise simple robots (by, for example, performing the bulk of number-crunching or compute-intensive tasks on a separate computer or server, and simply uploading and/or downloading results and/or sensor input to and from the home robot itself). In effect, by tunneling the local robot system's communication fabric across the Internet or other suitable network, it is possible to allow back-end servers to interact with robots in users' homes.

The data bridge 202 may send local network information to the Internet server. As a non-limiting example, the user may connect to the Internet 706 and may be redirected to the local bridge as appropriate. By publishing a well known Internet address that both bridge and/or the user may access, the need to know the user's local information may be eliminated.

In addition to the network data bridge 202, a wireless remote control may offer several similar wireless functions for controlling or managing the mobile robot 104. The wireless remote control may communicate directly with the mobile robot 104 via an infrared (IR) or RF protocol, or may relay commands through the network data bridge 202, for example, when the mobile robot 104 is not within sight but the remote control is within IR signaling range of the network data bridge 202. The network data bridge 202 may thus also be provided with an IR sensor for receiving mobile robot control commands from the wireless remote control, and then relay the commands wirelessly to the mobile robot 104—for example, the embedded web-server may bridge a proprietary or ad-hoc communication method used internally by the mobile robot 104 (and also used by accessory items added to the mobile robot 104) with a persistent online presence by translating the internal communication protocol(s) into HTTP POST and GET transactions.

The online presence may generate a web-based user interface that incorporates javascript components to asynchronously poll the mobile robot 104 for state changes (e.g., battery voltage). This javascript may asynchronously fetch changes in the robot properties and rewrite the content in the page. Sensor values, etc., can be refreshed by the web browser without the customer needing to click refresh on the browser, for example.

The web-based interface may use customer tracking and persistence robot sensor data to pair the mobile robot 104 with the customer account and present user interfaces for equipment the customer owns.

Further, if a series of the peripheral devices 102 are arranged throughout a home or other location and set up as a relay network stemming from the base station, for example, then the commands relayed from the remote control may also be relayed throughout the beacon network to reach a home robot that may be quite distant from the remote control.

Wireless bandwidth (especially in unlicensed bands such as 900 MHz, 2.5 GHz, or any other such suitable public RF band) is by its nature limited, and because the presence of multiple RF devices (such as, for example, multiple mobile robots and/or network data bridges; WiFi, BlueTooth, X10, mobile or portable telephone or other common wireless devices; and/or interference from sources such as solar flares, RF discharge from electrical lines, florescent lights, or any other RF-interfering entity) may further restrict the effective amount of bandwidth or the degree of reliability of bandwidth available for wireless mobile robot communications, reliability and postponement measures may be taken to enhance the functionality of the network data bridge 202 and/or the mobile robot 104; conversely, the network data bridge 202 and/or the mobile robot 104 may be configured to reduce their consumption of available bandwidth in order to give priority to other wireless devices. For example, regarding the reliability of the wireless robot network communications, techniques such as cyclic redundancy checking (CRC) and/or hash routines (such as, MD5 sums or CRAM) or other appropriate reliability techniques (such as parity or error correcting codes (ECC)) may be employed on either the data bridge-to-robot channel and/or the Internet-connected channel (e.g., on the Ethernet-to-data bridge channel). Furthermore, to limit the use of valuable bandwidth during business or other peak usage times, the network data bridge 202 and/or the mobile robot 104 may be scheduled to transmit theme content, usage/behavior data, or any other such communication during night-time or off-peak times; alternatively, for example, the network data bridge 202 and/or the mobile robot 104 (and/or the manufacturer's server) may be scheduled to perform their communication (or the bulk of their communication) at an automatically detected off-peak usage time, by detecting when bandwidth usage is lowest (either in real-time or by collecting data of bandwidth usage-per-time-of-day over a series of days or weeks and then determining the generally least used times of day, as non-limiting examples). Reliability measures may be taken at either the network or application layer or both, for example, or at any other suitable layer in a communication stack (such as the data bridge using UDP on the Internet for simplicity and non-critical communications, but the web server using full error-checking, reliability and/or error correction measures, windowing, etc.

Also, the web server functionality in such a data bridge can communicate with a known network address or location (such as a fixed IP address or uniform resource locator (URL)) in view of issues that arise with DHCP and dynamic IP address assignment, for example; the web server on the network data bridge 202 may thus behave in a manner similar to a client for a significant portion of time in order to actively access and/or poll “server”-like resources available on the mobile robot 104 (via wireless connection, for example), as in many examples the mobile robot 104 maintains relatively little network functionality in the mobile robot 104 itself (such capabilities being offloaded largely onto the network data bridge 202).

The web server functionality may establish network communications with the mobile robot 104 and/or Internet server(s) via a suitable protocol or standard, such as FTP, FTPS, TFTP, HTTP, HTTPS, GOPHER, TELNET, DICT, FILE and LDAP, HTTP POST, HTTP PUT, FTP uploading, HTTP form based upload, proxies, cookies, user+password authentication (Basic, Digest, NTLM, Negotiate, Kerberos4), file transfer resume, http proxy tunneling, and/or other suitable network methods (such as a method supported by libcurl, for example). The network data bridge 202 may employ network announcement techniques such as uPnP, dynamic DNS, reverse ARP, Ethernet or UDP or TCP/IP broadcasting, or another suitable method of broadcasting the existence of the network data bridge 202 to other devices on the same network.

By offloading much of the server functionality from the mobile robot 104 to the network data bridge 202, and using the network data bridge 202 as a communications proxy, mirror and gateway, the mobile robot 104 is also shielded from excessive client requests that might otherwise tax its processing and/or bandwidth resources. For example, the mobile robot 104 may in one time period (e.g., ten minutes) produce thirty visual snapshots from an on-board camera. Then, if several entities were to attempt to download the snapshots from the mobile robot 104 simultaneously, the mobile robot 104 might quickly be overwhelmed as the wireless network became bogged with service request traffic. As an alternative, however, the mobile robot 104 may be accessed by just one entity, the network data bridge 202, at a known regimen of polling requests, thus preserving the mobile robot's bandwidth and processing capability while still permitting replication of any such collected data by copying it to Internet servers for broader access, for example.

In addition to RF-band wireless communication, the network data bridge 202 (and/or the mobile robot 104 or the peripheral device 102) may transmit via other suitable frequencies and/or bands in the electromagnetic spectrum, such as the 900 MHz, 2.4 GHz, microwave frequencies, or other suitable bands. To alleviate interference that may occur in these or the RF or another band, the mobile robot 104 and/or the network data bridge 202 may employ frequency shifting, spread spectrum, sub-channel technologies, and/or other such interference-avoidance schemes or techniques for avoiding interference with other unlicensed RF applications (phones, baby monitors, etc.).

In addition, robot commands might be sent by the network data bridge 202. Additional functionality may be provided to the user in the form of issuing remote commands while away from home. Accordingly, if a home robot owner were to forget to schedule or activate the mobile robot 104 prior to leaving on a business trip, the mobile robot user might still program or activate the mobile robot 104 remotely via a command generated by (for example) a mobile robot interaction website provided by the mobile robot manufacturer, which would be relayed through the Internet or other suitable network to the network data bridge 202, which would in turn convert the information received from the Internet into a corresponding wireless robot network command and transmit the command wirelessly to the mobile robot 104 for execution.

In certain, implementations, a series of robot commands corresponding to timing and execution of movements, etc., may be compiled into a “dance” routine and transmitted to the mobile robot 104 after a user selects the “dance” from a website maintained on the mobile robot manufacturer's server; alternatively, the “dance” might be combined with audible content such as music or sounds, and/or commands to control the indicia (such as light-emitting diodes (LEDs), liquid-crystal displays, and/or backlights, inter alia) to provide a multimedia “dance,” music and lightshow. A further non-limiting example includes live trouble-shooting or technical support provided to mobile robot users, e.g., initiated through a telephone call or the Internet, or e.g., through a microphone and speaker installed as part of the mobile robot 104 along with the appropriate computing, recording, mixing and transceiving hardware and software (and bandwidth, both wireless and over the Internet, as well as proper latency and synchronization). Additionally, for example, a camera might be included for enhancing such virtual interaction, and/or the proximity sensor normally put to use in obstacle detection may be employed during alternative modes as a general-purpose observation camera in those implementations in which the proximity sensor is configured to function as a visual-spectrum camera, with encoding and transmission of streaming video from the robot via the wireless link to the network data bridge 202 and onto a networked destination, inter alia.

Similarly, for transmitting robot usage and behavior information to the mobile robot manufacturer's server, the mobile robot 104 may collect certain data regarding battery use, recharging frequency, amount of time spent performing its primary task, the amount of time spent idle, the frequency with which the robot becomes stuck, etc., and periodically transmit this data to the mobile robot manufacturer's servers via the network data bridge 202.

Moreover, the ability to transmit audible content to the mobile robot 104, either via the network data bridge 202 or via a “memory stick ”-type data bridge, permits the mobile robot 104 to “speak” instructions directly to the user of the mobile robot 104 at the time and place of use. For example, the mobile robot 104 may speak directions when in a demo mode that is initially run to demonstrate various features the mobile robot 104 can perform. Voice instruction to the mobile robot user can be accomplished by transmitting encoded audible content to the mobile robot 104 (either by installing such audible content on read-only memory (ROM) in the home robot at the time of manufacture, or by transmitting wirelessly or otherwise and storing the audible content in flash RAM, for example) and playing it back over an on-board decoder and/or synthesizer and speaker installed in the mobile robot 104. Synthesized speech encoded for decoding on speech synthesis hardware may require less on-board storage than non-) synthesized speech; however, as an alternative, natural or computer speech may be recorded as wave-form encoded (and/or psycho-acoustically encoded) sound data and transmitted to the mobile robot 104 for storage and later playback. Alternatively, however, speech for playback on the mobile robot 104 may also be encoded as WAV files or compressed sound files (e.g., employing compression such as Lempel-Zev-Welch (LZW) or other techniques that are less computer-resource-intensive than, for example, MP3 or Windows Media (WMV) decoding).

As another example, by using a synthesizer, a phoneme string file to be downloaded to the mobile robot 104 may include and/or be thematically associated with, for example, an animation storyboard file including tags that trigger synchronized or asynchronous parallel movement events, lights (or other indicia) and/or non-synthesized sound Using such a phoneme pattern and storyboard, a string such as “he-llo ha-w [which may here represent a tag to start a “bowing” trajectory in, trajectory out movement as an asynchronous ballistic behavior] a-re y-ou” may thus trigger the associated “bowing” robo-motion (e.g., thematic “dance” or emotive behavior performable by the mobile robot 104). Further, if sound recording hardware such as a microphone and sound processing hardware are installed in the mobile robot 104, as well as sufficient processing or transmitting capability, then the mobile robot 104 may include speech-recognition functionality in order to recognize spoken commands or other interaction from mobile robot users; also, the storyboarding capability as discussed above may encompass and encode responses and references to any of the functionalities or capabilities performable by the mobile robot 104.

An RF system used by the mobile robot 104, the network data bridge 202, the remote control, and/or the peripheral device 102 may include four radio transceiver modules that are located in the mobile robot 104, the remote control, the peripheral device 102, and the network data bridge 202. The remote control may use RF to transmit control signals to the mobile robot 104 using a bidirectional protocol or unidirectional protocol; also, the remote control unit may allow the user to “drive” the mobile robot 104 around as well as sending scheduling data created on the remote control unit. The mobile robot 104 may use RF to wake-up and power-manage the peripheral deice 102 using a bidirectional protocol. The network data bridge 202 may use RF to transmit data and code updates to the mobile robot 104 as well as to upload diagnostic data from the mobile robot 104 using a bidirectional protocol. Furthermore, when there are multiple peripheral devices as well as the network data bridge 202 in operation, in which the peripheral devices and the network data bridge 202 can maintain an RF or other communication channel in a relayed fashion, the wireless robot network communication between the network data bridge 202 and the mobile robot 104 may be propagated along the chain of peripheral devices even when the mobile robot 104 is beyond the direct RF range of the network data bridge 202. The effective range of the wireless robot network can be extended by the linking of peripheral devices.

The 2.4 GHz ISM band may be used with either direct-sequence or frequency-hopping spread-spectrum transmission techniques. In addition, either a custom proprietary protocol based on some implementation of a standard 7-layer OSI model may be used, or the ZigBee 802.15.4 standard protocol may alternatively be used, inter alia. The custom protocol may allow for proper regulatory compliance in all countries of interest, for example, or alternatively, may be suited for each anticipated national market.

The following single chip, integrated RF transceiver radio modules are examples of chipsets that may be used to implement the RF system: Chipcon CC2500; Chipcon CC2420; Freescale MC13191; Freescale MC13192. Aprinted circuit “F” style antenna design may be used with either no external RF power amplification or a suitable RF power amplification depending on the range and power requirements.

Regarding a proprietary robot-net RF protocol, such a protocol may be simpler than Zigbee, for example, in that Zigbee has two parts—signaling (IEEE 802.15.4) and application (routing, etc.). As an alternative, the proprietary robot-net protocol may use 802.15.4 because the standard has driven down the cost of goods for antennas, microcontrollers, etc. The contemplated robot-net may however deviate from Zigbee (a meshed network with routing) at least in that it may be a point-to-point network. Under Zigbee, nodes would be required (in some cases) to route traffic for other nodes; this behavior may place excessive responsibility on Lighthouses, Remote controls, and RF data bridges, etc. Robot-net RF may include a sparse protocol that simply has robot or beacon control and reporting messages like WAKEUP, GO_CLEAN(robot-n), ERROR(robot-n, i-am-stuck), etc.

Tthe savings in complexity may enable small amounts of memory (e.g., 8K) on some elements of the network. As an example, a Lighthouse may have 8 KByte of program memory. The point-to-point protocol may be simpler than Zigbee because it does not support routing of traffic from endpoints other than the home robot products, encryption of data packets, or many other features needed for meshing. Above this packet transport layer, robot-net may define messages that are specific to robot control and monitoring which are unique (lighthouses may also be configured to use the protocol, although they may be turned on and off by the robot extra-protocol). This control is unique even if implemented such that ZigBee forms a portion of the application layer, as a non-limiting example.

At least one of the endpoints may be mobile. Instantaneous signal strength, or signal strength over time can be used to help the robot navigate or correct beacon-based navigation, e.g., by providing additional data informing the robot that it is proceeding in the correct direction or in a failure mode, as non-limiting examples.

With regard to a vocal and multimedia demonstration mode executed e.g., just once when the mobile robot 104 is first used (and then the accompanying data being e.g., discarded to liberate system resources), or at any time when an appropriate “demo” button is pushed, the demo mode may include several speech files may be scripted in sequence; in which the script is not necessarily an interpreted script, but may simply represent a linear routine coded in any suitable manner. The script may flash the lights and buttons visible on the mobile robot 104, make sounds and cause the mobile robot 104 to do the things it is supposed to demonstrate (such as spot cleaning). The demo script may flash the lights or other indicia directly and run the behaviors directly, or could generate phantom presses/sensor events within the robot's computer control system to make the appropriate indicia and/or behaviors occur. For example, to start the spot cleaning demo, the voice routine could tell the user to press spot clean now (or could send a phantom button press to the UI control, which would flash the button as usual and start as usual. Other demos may be triggered by fake signals forwarded to a virtual sensor, for example—demo of stasis/stuck response by telling the mobile robot 104 it is stuck, etc.), then wait a certain period before reasserting control for the remainder of the demo. The demo could detect that the user pressed the wrong button and redirect him, as well, for example.

Examples of “robo-motions” (interchangeably, “animotions”) which may be transmitted either alone or as part of a theme or bundle may include new functional robot motions or behaviors such as spot-coverage, wall-following, and bounce operational modes, which may pertain to at least certain implementations of mobile robots in accordance with the present invention are specifically described in U.S. Pat. No. 6,809,490, by Jones et al., entitled, Method and System for Multi-Mode Coverage for an Autonomous Robot, the entire disclosure of which is herein incorporated by reference in its entirety.

In addition, according to one example, the mobile robot 104 may be provided with a speaker for playback of audible content, a wireless or direct link to the network data bridge 202 for receiving the audible content, and a processor (for example, a speech synthesizer, MIDI chipset and/or frequency modulation (FM) unit, etc.) for replaying the audible content. The audible content may have significant functionality—in a non-limiting example, a warning siren sound may be downloaded to provide a clear signal when the mobile robot 104 detects a potentially hazardous condition such as overheating of a vacuum motor, or a series of slowly-spoken instructions may provide hard-of-hearing or disabled mobile robot users with a more understandable tutorial on the use of the mobile robot 104. Furthermore, the audible content and/or theme may provide instructions or other speech in any of a variety of human languages or dialects; in addition, any behavioral or movement-based content such as may be associated with or included in a regional, national, linguistic, cultural, occupational, character or other such theme may also be appropriately correlated. For example, a “ballerina” theme might include spoken instructions affecting an accent reminiscent of a French accent, and a motion profile that causes the mobile robot 104 to perform pirouettes, spirals, figure eights, and other movements reminiscent of a dancer performing ballet, inter alia; this might also be associated with a body cladding set that would suggest a leotard, for example, to enhance the thematic effect.

The specific tying of certain content to certain behaviors is also made possible. For example, whenever the mobile robot 104 performs a certain “robo-motion” or trick (or less sanguinely, gets stuck, for example) such as a game of chase, it might play the “William Tell Overture;” alternatively, it may issue plaintive wails for help when the mobile robot 104 detects that it is lost, cut off from communication with any beacon, the network data bridge 202 or a home base, or is otherwise stuck or stymied.

FIG. 5 is a schematic diagram showing an example of body panel themes for the mobile robot 104. The mobile robot 104 may include customizable, snap-on or otherwise interchangeable exterior panels 502a-b which may be “themed” for permitting mobile robot users to individualize their mobile robots. As an example, body panels may be molded from plastic and thereafter painted, dyed, or covered with an adhesive material; any suitable modality for coloring, designing or drawing patterns thereon may be used, as appropriate. As an example, a design may be applied to the interior of a transparent sheet-like polymer material, and then the polymer sheet or body panel may be applied to a molded plastic piece as a body panel; as a result, the design is protected by the transparent polymer sheet, while rapid theming of body panels in a “just-in-time” (JIT) distribution strategy may be achieved. The panels may also be customized by user content, e.g., printed by ink jet onto an appropriate material. For example, the user may upload a photo, which can be adapted to a template, and the JIT-made shell may be made and delivered at the appropriate time (e.g., x-mas panel with sounds of a user's own family singing Christmas Carols, e.g. uploaded to the server by the user earlier for inclusion into a modified or customized theme).

Furthermore, the interchangeable body panels 502a-b may include an identification system corresponding to audible or other thematic content that may be transmitted to the home robot to complete the theming effect. For example, the body panels include an electrical contact 504 which is positioned along the interior edge of the panels 502a-b so as to contact a corresponding electrical contact on the mobile robot 104 when installed thereon. The electrical contact 504 on the body panels 502a-b is operatively connected to an appropriate electronic identification unit, such as an integrated circuit (IC) 506 that outputs a voltage pattern corresponding to a unique theme ID number; and/or a specific resistance 508 which likewise corresponds to particular theme IDs 510a-b. Alternatively, the body panels 502a-b may include an RFID or passive magnetic device; a mechanical ID mechanism such as a punch-card like series of holes or peaks; an optical ID system such as a barcode or characteristic color; or any other modality suitable for identifying a body panel's corresponding theme. The ID can be transmitted by the mobile robot 104 back to the network data bridge 202 as authorization or identification to download corresponding themed firmware, multimedia, etc. to the mobile robot 104 as discussed herein.

As a default behavior, if no identification of the body panel can be made by the sensors of the mobile robot 104, the mobile robot 104 may e.g., reject theme content as potentially unauthorized; or, conversely, accept any theme material if there is little concern regarding unlicensed theme content.

FIG. 8 is a schematic diagram showing an example of a robot system 800 including a vendor 802 (as a type of audible or other content) and a manufacturer server 804. The system 800 acts as a content distribution system, in which the vendor 802 distributes licensed content to mobile robots (“consumer robots”) under the supervision of licensing and security-checking systems (“big brother” 806, “CRM” 808) as a back-end to a consumer-oriented website administered by a robot manufacturer (“E-Commerce Site” 810). In this example, “Rtoon” may signify distributable content, whether audio or other thematic material, for example.

Also, once an identification of the theme corresponding to an installed body panel is determined, the mobile robot 104 may wirelessly transmit information regarding the detected theme ID to the mobile robot manufacturer's server via the wireless robot network data bridge 202 and Internet, for example. The server may then determine whether audible or other content corresponding to the transmitted theme ID is available, and if so whether the corresponding content is properly paid for, licensed, etc. If all determinations are affirmative, the server may transmit the corresponding content (such as a set of audio data arranged as a sound theme and/or a set of robot “dance” commands, indicia patterns, etc.) to the mobile robot 104 via the Internet and the network data bridge 202, for example; alternatively, the server may transmit an “unlock code” or cryptographic key for decoding encrypted and/or otherwise restricted content already present at the mobile robot 104; or, for example, the mobile robot manufacturer's server may cause a separate content server (e.g., belonging to a third party and under licensing and electronic distribution agreement with the mobile robot manufacturer, for example) to transmit such data to the appropriate mobile robot which sent the theme ID.

FIG. 4 is a schematic diagram showing an example of a robot system 400 including mobile robots 104a-c, in which the computer 206 transmits themes to the mobile robots 104a-c. Mobile robot users may receive new or updated musical, sound, visual, choreographic or other such thematic content which corresponds to the themed body panels installed on their mobile robots. A website 402 displayed on the personal computer (PC) 206 offers a choice of three sets of music contents, ‘A’ 404a, ‘B’ 404b, or ‘C’ 404c, for transmittal to or activation on the mobile robots 104a-c).

Also, the theming may even extend to the content within themes—e.g., if a robot has several audio files or “earcons” loaded (e.g., in a format such as MIDI), and then selects a “steel drum” theme, the theme might include musical instrument elements (e.g., also encoded as MIDI instruments or other suitable format) which replace the standard instruments that would normally be played in the earcons or sound files; as such, a rock ballad may be “themed” into a Caribbean anthem, as a non-limiting example.

With regards to the themed content, combinations of various interdependent (or independent) content types (e.g., including—but not necessarily limited to—sounds, body cladding, choreographed “dance” moves, behavioral response profiles, or the like, as non-limiting examples) are possible to permit a high degree of thoroughness in the impact themes may have on users. Sounds such as background music to be played while the home robot either sits idle or performs tasks; “earcons”—that is, sounds that convey meaning and which are played back when triggered by certain events or behaviors, such as the robot playing a car-crash “earcon” when the robot bump sensor detects a collision with an obstacle, or the phrase “feed me!” as an earcon when the robot's detergent or other consumable bin is empty, inter alia; daily or monthly activity or activation schedules such that a “family dog” themed robot may cease hibernation or recharging mode when a sound corresponding to the delivery of the morning newspaper is detected, and then proceed to the user's bedroom to “bark” and cavort about in figure “s” or semi-random movement patterns (or to “wag its tail” by rotating the hind portion of the robot repeatedly back and forth) adjacent the user's bed to wake the user or to get the user's attention in a manner reminiscent of an excited dog; a “listening” behavioral routine which may cause the robot to, for example, behave as a parrot (e.g., in combination with other parrot-themed content such as plumage-like body cladding, “whistling” sounds and a parrot-like gait for movement) and repeat back recently spoken words that are detected by an on-board microphone (e.g., in a distorted, squawking manner reminiscent of a true parrot, for example); and/or network-access patterns for robots equipped to communicate via a wireless network (for example, a “spy” theme might, in combination with various other thematic content, include a network access profile that might cease all network access for various periods of time when the “spy” robot is expected to maintain “complete radio silence,” for example; or conversely may be conditioned to frequently retrieve updated information from a network source in order to fulfill a role as a trivia quizmaster by downloading questions and/or answers to be posed to guests of the user while playing a party game, for example—indeed, such quiz questions and answers or the rules of a game might themselves be bundled into a theme in static format, as a further example of the broad extent of theme-able content types). Also, content such as the “robo-motions” (“dance” moves or distinctive motions performed by wheeled or otherwise mobile home robots) may be triggered on command by way of voice command recognition, etc., on the robot such that the user may clap her hands or verbally instruct the robot to “beg” or “stand still” or “dance the Lindy Hop,” and the robot would comply by performing the associated robo-motion, for example.

Functional themes may enhance the primary purpose (or any other purpose) of the mobile robot, as well—for a non-limiting example, a “super robot cleaner” theme might include behavioral patterns that cause the home robot to detect spots on the floor and to spend a particular proportion of cleaning time vacuuming or washing the spots discovered as a result of the theme.

User commands to initiate actions such as power on/off, start, stop or to change a cleaning mode, set a cleaning duration, program cleaning parameters such as start time and duration, and or many other user initiated commands, functions, and/or components contemplated for use with the present invention are specifically described in U.S. patent application Ser. No. 11/166,891, by Dubrovsky et al., filed on Jun. 24, 2005, entitled Remote Control Scheduler and Method for Autonomous Robotic Device, the entire disclosure of which is herein incorporated by reference it its entirety.

For another example of a type of theme which encompasses a variety of behavioral, audio, visual and other types of eclectic content, a mobile robot may be themed as a chess piece, such theme to include not only distinctive body cladding (with different types possible such as “knight,” “rook,” “pawn,” etc.) and e.g., chess-themed music and sounds, but also e.g., a network behavior so as to coordinate with a central server (or possible to “swarm” with several other home robots also acting as chess pieces) so as to adopt the role of a particular piece on a chessboard, in which a user or users bring a plurality of home robots and arrange them in an environment simulating a chess board and command the home robots to move as chess pieces during a chess game; this high-level “chess” theme thus may include also the rules of chess and behaviors and movement patterns (as well as network routines and functions) of various chess pieces, as well as visual and/or audio content and the like, for example.

As illustrated by the above-discussed non-limiting examples, the content types that may be used and combined into theme packages may encompass a broad range of material, virtually as broad as the range of potential capabilities performable by the mobile robot 104, for example. The present inventors intend that the examples of associated themed content given herein can be generalized for the purposes of the invention according to their readily recognized type:

The chess and trivia game examples are examples of providing associated themed content linking at least two of a predetermined game rule set, game piece or paraphernalia set, game appearance, and game sounds.

The parrot and dog examples are examples of providing associated themed content linking at least two of a predetermined entity (i.e., animal or person) motion set, appearance, and sounds. This would extend to celebrities, so called “licensed properties” linked to well-known entertainment programs or books, characters and the like.

The ballet example is an example of providing associated themed content linking at least two of a predetermined dance move set, paraphernalia, appearance, music, and sounds.

The country-and-western example below is an example of providing associated themed content linking at least two of a musical genre move set, paraphernalia, appearance, music, and sounds.

Mobile robot users with Internet-capable personal computers, cell phones, PDAs, and other devices may also browse the home robot manufacturer's server via a web site and select themes, sounds, tones, “dances,” software, or other suitable mobile robot content for download and/or purchase. (For example, a user interested in quelling potential sources of RF interference in her home, or for conserving bandwidth for other tasks, might purchase a low-RF-noise network profile content from a manufacturer's website, for example.) The user interface presented to the user may also be customized to match the robot theme as well—that is, a theme may include multimedia content that can be manifested on the robot but also on an online interface that is associated with the robot having the theme, and with which the user interacts when using the online interface and/or the robot.

Also, users may select themed body panels, base stations, batteries, accessories, new home robots, data bridges, etc., from the web site, and have the items shipped to their home. Items such as body panels may then be ordered in bulk in blank form by the manufacturer or reseller who operates the web site, and then apply themed designs rapidly and “just-in-time” after (or before, when sales prediction analysis is properly applied) receiving an order from a home robot user.

Furthermore, themed items may be accompanied by a CD-ROM, floppy disk, “memory stick ”-type data bridge, or other data medium in order to transmit the appropriate corresponding themed content to the home robot upon installation of the ordered themed item. Alternatively, the mobile robot manufacturer or reseller may omit shipping data media along with physical items, and instead offer Internet-based transmission of the corresponding themed content (via the wireless robot network data bridge, for example), or do so when orders are received from customers who the manufacturer or reseller has a record of having previously bought the network data bridge 202, for example (or when records show that the customer already has the most up-to-date version of the appropriate themed content). The mobile robot manufacturer or reseller may reduce shipping charges when it is known that the ordering customer has the ability to update the mobile robot 104 via the network data bridge 202, for example.

Moreover, by virtue of the online ordering system and manufacturer's or reseller's website, customers may be offered a variety of functional and thematic combinations for body paneling, sounds and music, “dance” routines, and indicia flash patterns (and/or one-off or single-item offerings in a “mix-‘n’-match” mode, such as a Country/Western paneling-themed robot with a rock‘n’roll “dance” routine and a classical piano sound theme, in a non-limiting example). For example, the County/Western theme body panel 502a is linked to music content ‘A’ 510a; and the piano theme body panel 502b is linked to music content ‘B’ 510b (which would usually be piano-related). Additionally, accessory replacement and service reminders tied to usage can be contemplated—e.g., reminders to replace the batteries after a certain number of recharge cycles or hours expended. The online service may be configured to enter a recommended replacement part (to replace a part recorded as having accumulated sufficient cycles or time to be worn according to the uploaded data) or a consumable material such as detergent, cat food, lubricant or any other such material (to augment the stock of the consumable material recorded as needing replenishment) into the user's online shopping cart or one-click purchase queue, as non-limiting examples.

Other aspects of such a website may be handled in a conventional manner, by permitting online credit card or check payment, etc. As an advantage, customers may place orders for a customized home robot with their choice of complete theme or a “mix-‘n’-match” robot (e.g., a male lion vs. a female lion) personalized to the users' own variegated tastes and styles. Moreover, by using laser printing or other modality for applying digital images and/or writing to the polymer sheet panel coverings discussed above, users may be offered the option to apply slogans, names, or any arbitrary writing and/or images to be printed on their home robots, for example.

A further example permits the user to create or record his or her own sounds or music content and to transmit this custom content to his or her home robot. In order to address licensing and unauthorized duplication concerns, the home robot manufacturer may employ a media and/or authoring software protection scheme, for example, such that only licensed copies of the authoring software will function properly and such that only content produced on a properly licensed copy of the manufacturer-provided software will correctly play back on that manufacturer's home robots, for example. As a non-limiting example, public-key encryption techniques may be applied in which each robot receives a public key known to the user (such as a serial number, for example), and a private key known only by the manufacturer. Accordingly, when a home robot user purchases a copy of the content authoring software from the manufacturer, the copy that the home robot user receives may “watermark” its output content with the encryption key such that only the particular user's home robot can pay back the output content, as a non-limiting example. Other encryption or protection schemes may be employed to allow wider or narrow distribution, as appropriate to business and license/copyright protection concerns.

As a further example, users may be offered a content subscription service in which a number of themes and/or audible or other content are made available per month or other time period to the user who purchases the subscription. As an advantage, users can be assured of the integrity of the content they download and copyright concerns can be addressed.

FIGS. 9A-C are state diagrams showing examples of state machines 900, 930, and 960 for the mobile robot 104, the lighthouse peripheral device 102, and a remote control peripheral device, respectively. The Robot Personal Area Network (RPAN) protocol used by the network data bridge 202, the mobile robot 104, and the peripheral device 102 can be used in many ways as defined by applications.

FIG. 9A shows a high level state diagram that serves as a reference for the following discussion. The mobile robot 104 is an RPAN master responsible for several tasks, such as providing a unique address to isolate communications with its peripherals from other RPAN systems, deciding on a radio channel to use, operating on the common channel as necessary to report this operational channel, and transmitting a beacon which defines time windows that peripherals should use to communicate.

When the mobile robot 104 is conserving power in its dormant state 902 or charging, the RF network is inactive, meaning that no beacon is transmitted. While in this state 902, the mobile robot 104 can be woken up over RF by executing the following steps in a constant loop.

1. Turn on radio on the Common Signaling Channel (CSC).

2. Send “Activate Invite” broadcast message.

3. Listen for “Activate Request” message for up to 30 milliseconds.

4. Receive “Activate Request” message and leave Dormant state. Or, turn off radio and sleep for 970 milliseconds.

Therefore, every second the mobile robot 104 invites peripheral devices, such as the peripheral device 102, to wake it up. A peripheral wanting to wake up the mobile robot 104 will listen for a second for the “Activate Invite” message and respond promptly with the “Activate Request” message which wakes up the mobile robot 104.

When the mobile robot 104 has been woken up to active scan state 904, it checks if its radio channel is still valid. If the robot sleeps for more than 10 minutes, the radio channel will be reselected. This time is chosen to safely exceed any session oriented timers. The first step in reselecting a channel is to actively scan for other RPAN masters and exclude their channels from the set of acceptable channels.

An active scan is performed by sending two “Ping” messages on the CSC to the broadcast RPAN address. The mobile robot 104 listens for 30 ms after each message for “Ping Response”. Each “Ping” message is separated by 360 ms.

After ruling out radio channels through active scanning the mobile robot 104 moves to energy scan state 906, candidate channels are scanned for energy levels in order of preference. On a given channel, 100 energy level samples are obtained in about 100 ms of time. The first channel to have an average energy level below an acceptance threshold is chosen as the new operational channel. In the unlikely event that no channels meet these criteria, one is randomly chosen.

When the mobile robot 104 is operating its RF network normally, then it is in normal state 908 and it transmits a beacon every 720 ms which is called the “beacon period”. In that beacon message, a window of time following the beacon which is valid for devices to communicate is advertised. This “contention access period” is set to 220 ms in the normal mode. While not in the contention access period, the robot operates on the common channel to answer “Ping” messages with “Ping Responses” advertising the radio channel on which the robot is operating.

The motivations behind the specific beacon and contention access periods chosen are as follows: to keep beacon tracking overhead low, to keep radio power consumption low, and to allow peripherals with very inaccurate clocks to reliably find robots. This final goal is satisfied by defining one more time constant which is the “ping separation period”. If a peripheral sends two pings separated by 360 ms, the real time assuming the clock is plus or minus 30% is anywhere between 252 ms and 468 ms. On the low side, the 252 ms is sufficiently high so that both pings will not occur while the mobile robot 104 is on the operational channel. On the high side, the 468 ms is smaller than the 500 ms that the mobile robot 104 is listening on the common channel guaranteeing that one of them will be receiving during that time. There are other combinations of values that work. Also, with higher clock accuracy the contention access period duty cycle can be higher. These values can be recalculated for other systems based on those needs.

The 500 ms when the mobile robot 104 is operating on the common channel represent a dead time that can be unacceptable at times. One such time is when the mobile robot 104 is being driven remotely. Another is when the mobile robot 104 sensors are being monitored for diagnostic purposes. When low latency state 910 is needed, a peripheral may send a “Low Latency Request” message which contains a byte representing the number of seconds that low latency mode should be used. The low latency time can be refreshed with subsequent messages. Also, the mobile robot 104 itself may switch to low latency mode.

FIG. 9B shows the state diagram 930 that serves as a reference for the following discussion. In this section, message flows between the mobile robot 104 and the lighthouse peripheral device 102 are illustrated. A peripheral device, such as the lighthouse peripheral device 102, may be a simple slave device.

The slave 102 begins in a low power consumption state 932 designated as “Free” in the state diagram 930. In this state 932, it wakes up periodically and attempts to join a robot network. It does this by setting its channel to the common signaling channel (CSC is the 5th channel). It then sends a broadcast message to ask any robots who are listening on this channel to respond. The response from a robot hearing this message advertises a network with an ID on an appropriate channel (zero based numbering).This is the same active scanning process described above. The lighthouse 102 will get 0 or more responses in the two 30 ms windows of time it listens after sending the requests. If none are received, it will go back to sleep and perform another active scan in 4 seconds. If one or more are received, it will choose to join the network of a mobile robot whose response message was received with the greatest signal strength value.

If the lighthouse 102 has ever received a Join Accept message from a robot, that robot's RPAN ID is used instead of the broadcast address in the ping message. In this way, the lighthouse 102 will not waste power waking up for a robot that is in RF range but not its owner, e.g. the neighbor's mobile robot.

If the lighthouse 102 wants to join a robot's network and does not have an assigned address, the lighthouse 102 will randomly select a MAC address (marked as “Soft” in the MAC header) to use temporarily until the robot assigns one to it.

In “Seeking” state 934, the lighthouse 102 changes channels and listens for the beacon emitted periodically by the mobile robot 104. It should pick this up within a few seconds at most. If this does not happen, a timeout (30 seconds) will send it back to the “Free” state 932.

If all goes well and the beacon is found, the lighthouse 102 will advance to “Binding” state 936. In the “Binding” state 936 and subsequent states, the lighthouse 102 will filter packets from other robots and monitor its link to the RPAN network from the MAC layer beacon tracking. These are shown in the state diagram as “Link Up” and “Link Down” events.

Upon entering this state 936, the robot will send a “join request” message. This starts a timer on the lighthouse 102 getting accepted into the network within 5 minutes. If that expires, the lighthouse 102 will return to “Free” 932. (This 5 minute time period is known to both the robot 104 and the lighthouse 102 so that each can expire their pending Whenever the robot 104 receives a join request that causes a collision of soft MAC addresses in its table, it will send a join rejection message that does not need to be acknowledged, and the entry will not go into the table. The lighthouse 102 (and perhaps the other lighthouse with the colliding MAC address) will follow the Join Fail event on the state diagram which will result in regenerating a MAC address and trying the bind again.

When the robot 104 receives a join request message and wants to delay the binding until another handshake is performed as is the case with lighthouses, it sends a join pending message. Ajoin pending message is needed if an acceptance or rejection will not be sent within 3500 ms.

While acceptance is pending, the lighthouse 102 will transmit a 4-bit code in the confinement beam (11) which indicates that it has not bound to the robot. When the robot 104 runs into a code 11 beam, it stops and looks at its list of lighthouses requesting bindings. For each entry, it issues a command to wink the code to 12. If that command is not acknowledged or the beam change is not seen, the lighthouse 102 is not in range, and the robot 104 moves on to the next entry in the list. If the robot 104 succeeds in seeing the beam, it sends a join accept message which moves the lighthouse 102 into Active state 938 where it obeys beam commands requested by the master. The beam command message contains the state of beams as well as the 4-bit code that should be in the beam.

While a lighthouse is in the binding state 936, it will probably lose contact with the robot 104 as it moves around a room and throughout a house. Losing the beacon for over 2 minutes returns the lighthouse 102 to the “Free” state 932 where the beams are off and power is being saved. When the robot 104 is back in range, the binding procedure is skipped since the assigned address is still valid.

After the lighthouse 102 has been bound to the robot 104, it will probably lose contact with the robot 104 as it moves around a room and throughout a house. A “Roam Recover” state is designed so that the binding process does not have to be repeated following each of these expected losses of communication. A gross timeout of 90 minutes is shown in the state diagram which puts the lighthouse back in a state where re-binding is necessary. The MAC address assigned is now considered expired.

The binding process is designed to obviate the need to assign static MAC addresses to simple devices of which there can be multiple talking to a robot at once. The assignment of addresses by the robot 104 can simply amount to cycling through a list of valid addresses. If the assigned MAC addresses are to expire some time after the bind, it greatly reduces the chance that the user could cause a configuration error.

For example, if there were a procedure the user needed to follow to assign MAC addresses to the lighthouse 102 (e.g. install the batteries, place in front of robot, and hit button sequence on robot), he might do this successfully for the two included in the initial package. If the robot 104 ever forgot the last one assigned due to a code update or software problem, he might assign a conflicting address in the future if the user purchased an additional one later. Or, if the user replaces the robot 104 and then uses it to configure a new lighthouse, a conflict is very possible. Having the lighthouse MAC addresses expire tends to heal all such problems. One drawback to expiring addresses is that memories of what lighthouses the robot 104 encountered while cleaning are forgotten. These memories are potentially useful in having the robot 104 clean different rooms on different days. In either case, the age of a MAC address is specified in the “join accept” message giving the robot 104 (hence future software revisions of the robot 104) the freedom to make such decisions.

FIG. 9C shows the state diagram 960 for the remote control. The remote is used to drive the robot 104 around program its schedule. The remote control has a group address and does not require a numeric address.

From power saving state 962, the pressing of a button triggers seeking state 934 and the search for robots on the common channel. The search is performed at a very low power setting if the RPAN ID stored in non-volatile memory is blank. Otherwise, full power is used. In this way, a robot in very close proximity will respond to an unpaired remote. The search can be described by the following loop which is executed continually until a robot is found or until the remote puts itself back to sleep due to inactivity.

1. Operate radio on CSC responding to Activate Invite messages (1 second).

2. Perform 1 active scan (360 milliseconds).

If the active scan collects responses, the remote moves to binding state 936 and the robot with the highest signal strength is selected. The remote switches to the robots channel and gets link by tracking the beacon. It then sends a ping message to itself. If it gets a response, then that means another remote control is using the group address. If no response is received, the remote is in active state 938 and is allowed to control the robot 104.

If the remote successfully communicates with the robot 104 on the operational channel, that robots RPAN ID is programmed into the remote controls non-volatile memory. The remote control communicates with the robot 104 as long as it is awake and buttons have been pressed recently (60 seconds). If the beacon is lost for over 10 seconds which is how Link Down is configured on the remote, it tried to find a robot again.

A paired remote control can be unpaired by installing the batteries with the left drive button depressed and keeping it held down for three seconds. It is then paired as part of the robot discovery algorithm described above.

Driving the robot 104 and operating its user interface remotely is accomplished by sending button states to the robot 104 and receiving LED states from the robot 104. These are updated when they change as well as at a refresh interval. In this way, the remote can be thought of as a dumb terminal.

The following describes the design of RF communications system for a robot system, such as the robot systems 100 and 200. The communications system performs the following actions: wake to RF for lighthouses and robots, remote control and lighthouse beam control commands, low power consumes a low amount of power, occupies a small RAM/ROM footprint, code and sound download, coexists with common interferers found in such environments, coexists with other robot systems in proximity as will be common in the mobile robot 104 development labs and some home environments, provides a simple growth path at each layer of the networking hierarchy.

The RF communications stack to be used on the robot systems 100 and 200 is discussed in a layer oriented approach starting from lowest and ending with the highest. The approach is based on the seven layer Open Systems Interconnection (OSI) Reference Model.

The physical layer uses the 2.4 GHz direct sequence spread spectrum (DSSS) modem as is specified in IEEE 802.15.4. The physical layer supports the following features: 16 available channels; energy detection (ED) provided on demand; clear channel assessment (CCA) using energy, carrier sense or both; and link quality indication (LQI) provided with packet reception.

The MAC layer provides the ability for a device to transmit broadcast and uni-cast messages to other devices within radio range. This does not preclude any topology from being supported in the future. However, layers above this MAC layer will impose restrictions. The MAC layer supports the following features: single master and multiple slaves, master sends beacon containing the beacon period and active period which allows a slave device to track the beacon knowing when to listen and when to save power, slave tracks beacon to establish link status, master can be told by higher layers to listen on the network establishment channel during idle periods of the beacon, a 16-bit Robot Personal Area Network Identifier (RPAN ID) to allow devices to filter packets not on the robot network of interest when channel is shared, group identifier in addresses include allow broadcast to specific device types and obviate need for unique MAC addresses for many types of peripherals, collision avoidance algorithm using CCA and random back-off, and reliability through acknowledge requests and automatic retry.

Including acknowledgement in the MAC layer was done for the IEEE 802.15.4. This may bring the MAC layer up to par with wired media such as half duplex Ethernet where collision detection can be used to give the sender a high level of confidence that the packet arrived at the destination. Network layer acknowledgement schemes may be needed when bridges and routers between the sender and receiver have the potential to drop packets due to resource constraints. Either MAC layer or network layer acknowledgement can be made to suit the needs of this network.

The MAC layer acknowledge is time sensitive since there is no addressing information contained in the packet. If the acknowledgement is sent very quickly, it is unlikely to collide with a new data packet or be confused as an acknowledgement to the new data packet. The sequence number reduces the chances of processing the wrong ACK.

An acknowledgement at the network layer is not as time sensitive since the packet contains addressing information. However, more time is wasted sending this extra information and the latency is worse as information is passed between layers. More state information is potentially needed to remember which packets have not been acknowledged unless head of line blocking is used.

Avoiding time critical processing of packets is not desirable, but there may be situations in which it is used. If another robot or an IEEE 802.15.4 device is operating on the same channel, the receiver may need to promptly parse and discard a valid packet not intended for it. To the extent it delays, it risks not listening when a packet intended for it is received. After factoring this in, it may be appropriate to include the ACK and retry feature at the MAC layer and take steps to mitigate the imposed real time constraints.

Again, an acknowledgement scheme implemented at the MAC or network layers can be made to work. If the MAC layer proves problematic, due to any of the concerns expressed above, the acknowledgment scheme can be implemented at the network layer.

The network layer is responsible for establishing membership in a network. The role of a master device and a slave device are different at this layer. The network layer supports the following slave features: network discovery using low power active scanning on common channel, can issue requests to join a network using a temporary random MAC address, and can participate in a network without any joining transaction if MAC address is known. The network layer supports the following master features: channel selection when network is started based on best available channel, and management of join requests sent on the common channel including assignment of MAC addresses to slaves using temporary ones.

The 16 available channels are discussed in a zero based manner (0-15). Channel 4 does not get 802.11b interference in the USA or Europe. As such, it is chosen as the common signaling channel used for network joining procedures.

The defined MAC layer draws on IEEE 802.15.4. Some concepts borrowed include the CSMA-CD algorithm, the reliability feature, and the beacon concept to some extent. The PAN coordination features are replaced with a method more targeted to the more limited needs of the higher layers.

The MAC layer is based on the presence of a master who generates beacons which define a period of active communications during which any device can talk to a device. Slave devices track this beacon to determine if the robot is present and when it can save power. The mobile robot 104 is the master device and is responsible for transmitting the beacon and managing slave devices. Slave devices track the beacon of the master so they know when they should listen for the next beacon, when they can communicate with other devices, and when they should turn off their RF modems to save power.

The MAC layer header includes a field designed to conflict with the IEEE 802.15.4 frame type field so that such a MAC device should reject it as an invalid frame type, and is otherwise designed to allow multiple RPANs to share a single channel. The RPAN ID field is in a fixed location in the packet, so a receiver can filter on a particular RPAN much like a Virtual LAN (VLAN) in Ethernet.

Beacons are transmitted by a master at periodic intervals. One reason is to imbed information about when the slave devices should expect to exchange messages with the master. This duty cycle control allows some level of power saving even during active operational modes. The second reason for transmitting beacons is to provide a constant status on the proximity of the robot. The goal is to unburden application layer software from doing this task.

A beacon is sent periodically as specified by the Beacon Period which is specified in the beacon itself. So, a slave receiving a beacon knows when to expect the next one. An Access Period is specified in the beacon, as well. This dictates the period of time during which the master will be active on the channel. Slaves should pay attention during this time and may shut down their receivers at other times. The sequence number in the beacon allows the slave to detect one or more missing beacons.

When a master specifies a small active period relative to the beacon period, it gives it the opportunity to spend the idle time listening on the CSC to admit new peripherals into the network. As such, the beacon periods may be set in a manner related to the period that peripherals use to wake up and try to join a network.

A typical beacon period may be on the order of a second. The jitter of the beacon message is relatively high considering the random nature of the back-off algorithm. Also, the slaves should not be burdened with having to manage events with a high level of temporal precision. Subject to the clocking requirements discussed later, the slave should define a “beacon window” which is a time period centered on the next expected time a beacon will be received. The slave should listen for the beacon during this window. The window ends when the expected beacon is received, ideally. If no beacon is received, the window ends, but the slave operates during the access period as if it received one. When a beacon is missed in this way, the window is lengthened for the next beacon since clock inaccuracies add. Once too many beacons have been missed, a loss of beacon is declared and the slave just listens constantly until it reacquires it. The loss of beacon condition is analogous in the Ethernet world to losing link. The master transmits beacons with a time accuracy of less than 0.1%.

The MAC engine is based on a 250 microsecond process tick in order to simplify the management of state timers and avoid busy waiting. It should be a design goal of the implementation to insure that the processing in a single tick never exceeds 125 microseconds in order to leave plenty of processor available for other more critical tasks. In 250 microseconds, 7.8 characters can be transmitted at the fixed baud rate of 250 kbps. Including the preamble and PHY header, the smallest possible packet is 8 characters long. This means that two CCA functions performed in consecutive ticks will almost certainly detect an ACK in flight.

The collision avoidance algorithm is invoked whenever there is a packet ready to transmit. The transmitter will delay a random number of back-off periods before running the CCA function. On the tick where the CCA function has completed, the transmitter will start sending if the CCA returned saying that the channel is clear.

The dead time between a packet reception ending and an ACK starting is between one and two ticks. So, a CCA function that does its best to prevent stepping on the ACK is one which performs two CCA measurements spaced a tick apart and declaring the channel clear if both pass. The back-off period is designed to be longer than the transmission time of a small packet such as an ACK, so two ticks is chosen.

If a data frame is received with acknowledgement requested with a matching destination address, the receiver prepares to send an acknowledge packet provided that it will be able to pass the buffer along to the application. The receiver waits one tick to give the sender time to switch its transceiver into receive mode, then transmits an acknowledgement which is the first 2 bytes of the MAC header echoed with the frame type changed to an the ACK value. The sender expecting an ACK will wait for up to five ticks (1.25 ms) to receive the reply before retrying the transmission. Up to three retries are performed. If an acknowledgement is requested, the sender should postpone sending the packet if there is not enough time remaining in the current active period for the receiver to send the acknowledgement.

Data payloads in this network begin with the Transport Header which consists of a byte specifying the Service Access Point (SAP). This multiplexes different types of services onto the same device address. Previously, this has been accomplished using the “opcodes”.

Device Control, Device Status Request, and Device Status SAPs are related in that the payload messages use the same code points on a per device basis. That is to say that devices will have a published set of control and status information elements consisting of an element code followed by a known number of element payload bytes. If controllable over RF, the Device Control SAP is used to set values. Controllable and observable items can be queried with a Device Status Request. The actual status is delivered using the Device Status SAP whether solicited, i.e. requested over the Device Status Request SAP, or unsolicited, i.e. sent spontaneously. Alarms and other indications may be delivered in this way.

The reason to use multiple SAP codes for this related functionality is that it may a major portion of the overall RF traffic. As such, the smaller the packets can be made, the more reliable the transmission. So, for critical control and status messages, having a two byte header <Device_SAP><Control_Cmd> or <Device_SAP><Status_Cmd> keeps the PHY and MAC headers as small as possible.

“ROBOT OBSTACLE DETECTION SYSTEM”, U.S. Pat. No. 6,594,844, disclosing proximity sensors such as cliff sensors and wall following sensors; “AUTONOMOUS FLOOR-CLEANING ROBOT”, U.S. Pat. No. 6,883,201, disclosing a general structure of an iRobot Roomba coverage/cleaning robot and main and edge cleaning heads in detail; “METHOD AND SYSTEM FOR MULTI-MODE COVERAGE FOR AN AUTONOMOUS ROBOT”, U.S. Pat. No. 6,809,490, disclosing motion control and coverage behaviors, including escape behaviors, selected by an arbiter according to the principles of behavior based robotics; and “METHOD AND SYSTEM FOR ROBOT LOCALIZATION AND CONFINEMENT”, U.S. Pat. No. 6,781,338, disclosing virtual walls, i.e,. robot confinement using wall-simulating directed beams, are each incorporated by reference herein in their entireties.

Other robot details and features combinable with those described herein may be found in the following U.S. patent applications filed concurrently herewith, entitled “AUTONOMOUS COVERAGE ROBOT NAVIGATION SYSTEM” having assigned Ser. No. 11/633,869; “MODULAR ROBOT” having assigned Ser. No. 11/633,886; and “COVERAGE ROBOT MOBILITY” having assigned Ser. No. 11/633,885, the entire contents of the aforementioned applications arc hereby incorporated by reference.

A number of implementations have been described. Nevertheless, it will be understood that various modifications may be made without departing from the spirit and scope of the following claims. Accordingly, other implementations are within the scope of the following claims.

Claims

1. A robot system comprising:

at least one peripheral device to be placed in an environment and comprising: a power supply; a wireless communication component comprising infrared communication components; and a controller having an active mode in which the peripheral device is fully operative, and a hibernation mode in which the peripheral device is at least partly inactive, the wireless communication component being capable of activation in the hibernation mode; and
a mobile robot comprising: a drive system that moves the robot about the environment, a wireless communication component comprising infrared communication components; and
a controller having an activating routine that communicates with the peripheral device via the wireless communication components and temporarily activates the peripheral device from the hibernation mode when the wireless communication components of the peripheral device and the robot come within range of one another, and the controller having a binding routine that communicates using the mobile robot's infrared communication components, wherein the mobile robot and the peripheral device are within infrared communication while the controller is executing the binding routine.

2. The system of claim 1 wherein upon the wireless command communication component of the peripheral device receiving a robot ping from the wireless command communication component of the robot, the controller of the peripheral device switches to operate in the active mode.

3. The system of claim 1 wherein when the robot is located outside a communication range between the wireless command communication component of the robot and the wireless command communication component of the peripheral device, the controller of the peripheral device operates in the hibernation mode.

4. The system of claim 3 wherein when the peripheral device enters a low power state, the controller of the peripheral device switches to the hibernation mode.

5. The system of claim 1 wherein the robot comprises a floor-cleaning coverage robot.

6. The system of claim 1 wherein the peripheral device comprises a navigation beacon with a gateway beacon emitter arranged to transmit a gateway marking emission with the navigation beacon disposed within a gateway between a first bounded area and an adjacent second bounded area, the areas both within the environment.

7. The system of claim 1 wherein the wireless communication components communicate with transmission wavelengths that permit the robot and the peripheral device to be outside of line of sight during communication of the activating routine.

8. The system of claim 1 wherein the wireless communication components communicate with transmission wavelengths that require the robot and the peripheral device to be within a line of sight during communication of the binding routine.

9. The system of claim 1 wherein the peripheral device is precluded from altering modes from the hibernation mode to the active mode until a line of sight is present between the robot and the peripheral device and the binding routine has successfully executed.

10. The system of claim 1 wherein the wireless communication components communicate with a point-to-point protocol while excluding routing.

11. The system of claim 1 wherein the wireless communication components communicate commands interpretable by the peripheral device to initiate a function.

12. The system of claim 1 wherein the peripheral device, while in the hibernation mode, occasionally listens for a robot ping.

13. The system of claim 1 wherein the peripheral device, while in the hibernation mode, occasionally polls for a quiet robot.

14. The system of claim 1 wherein the peripheral device is a base station.

15. The system of claim 1 wherein the peripheral device is a mobile device.

16. The system of claim 1 wherein the robot measures a signal strength of a wireless transmission communicated by the wireless communication component of the peripheral device to determine a distance from the peripheral device.

17. The system of claim 1 wherein the wireless transmission communicated by the robot wireless communication circuit includes identification information.

18. The system of claim 1 wherein the wireless transmission communicated by the peripheral device wireless communication circuit includes identification information.

19. A robot system comprising:

a network data bridge comprising: a broadband network interface connectible to an internet protocol network and carrying communications transferred in compliance with an internet protocol, wherein the internet protocol specifies internet protocol header information; a wireless command interface connectible to a wireless command protocol network and carrying communications transferred under a command protocol, wherein the command protocol specifies communication lacking the internet protocol header information; and a data bridge component, the data bridge component extracting serial commands received via the broadband network interface from the internet protocol and applying the command protocol thereto, the data bridge component broadcasting the serial commands via the wireless command interface; and
a mobile robot comprising: a drive system that moves the robot about an environment; and a wireless command communication component that receives the serial commands transmitted from the network data bridge.

20. The system of claim 19 further comprising at least one peripheral device to be placed in the environment and comprising:

a peripheral wireless command communication component receiving serial commands transmitted from the robot and the network data bridge; and
a controller having an active mode in which the peripheral device is fully operative, and a hibernation mode in which the peripheral device is at least partly inactive;
wherein the peripheral wireless command communication component is capable of activation in the hibernation mode.

21. The system of claim 20 wherein upon the peripheral wireless command communication component receiving a robot ping from the wireless command communication component of the robot, the controller of the peripheral device switches to the active mode.

22. The system of claim 19 wherein when the robot is located outside a communication range between the wireless command communication component of the robot and the wireless command communication component of the peripheral device, the controller of the peripheral device operates in the hibernation mode.

23. The system of claim 22 wherein when the peripheral device enters a low power state, the controller of the peripheral device switches to the hibernation mode.

24. The system of claim 19 wherein the peripheral device, while operating in the hibernation mode, occasionally polls for a quiet robot.

25. The system of claim 19 wherein the peripheral device, while operating in the hibernation mode, occasionally listens for a robot ping.

Referenced Cited
U.S. Patent Documents
2136324 November 1938 John
2353621 July 1944 Sav et al.
2770825 November 1956 Pullen
3119369 January 1964 Harland et al.
3166138 January 1965 Dunn
3333565 August 1967 Waters
3375375 March 1968 Robert et al.
3381652 May 1968 Schaeffer et al.
3457575 July 1969 Bienek
3550714 December 1970 Bellinger
3569727 March 1971 Aggarwal et al.
3674316 July 1972 De Brey
3678882 July 1972 Kinsella
3744586 July 1973 Leinauer
3756667 September 1973 Bombardier et al.
3809004 May 1974 Leonheart
3816004 June 1974 Bignardi
3845831 November 1974 James
3853086 December 1974 Asplund
3863285 February 1975 Hukuba
3888181 June 1975 Kups
3937174 February 10, 1976 Haaga
3952361 April 27, 1976 Wilkins
3989311 November 2, 1976 Debrey
3989931 November 2, 1976 Phillips
4012681 March 15, 1977 Finger et al.
4070170 January 24, 1978 Leinfelt
4099284 July 11, 1978 Shinozaki et al.
4119900 October 10, 1978 Kremnitz
4175589 November 27, 1979 Nakamura et al.
4175892 November 27, 1979 De
4196727 April 8, 1980 Verkaart et al.
4198727 April 22, 1980 Farmer
4199838 April 29, 1980 Simonsson
4209254 June 24, 1980 Reymond et al.
D258901 April 14, 1981 Keyworth
4297578 October 27, 1981 Carter
4306329 December 22, 1981 Yokoi
4309758 January 5, 1982 Halsall et al.
4328545 May 4, 1982 Halsall et al.
4367403 January 4, 1983 Miller
4369543 January 25, 1983 Chen et al.
4401909 August 30, 1983 Gorsek
4416033 November 22, 1983 Specht
4445245 May 1, 1984 Lu
4465370 August 14, 1984 Yuasa et al.
4477998 October 23, 1984 You
4481692 November 13, 1984 Kurz
4482960 November 13, 1984 Pryor
4492058 January 8, 1985 Goldfarb et al.
4513469 April 30, 1985 Godfrey et al.
D278732 May 7, 1985 Ohkado
4518437 May 21, 1985 Sommer
4534637 August 13, 1985 Suzuki et al.
4556313 December 3, 1985 Miller et al.
4575211 March 11, 1986 Matsumura et al.
4580311 April 8, 1986 Kurz
4601082 July 22, 1986 Kurz
4618213 October 21, 1986 Chen
4620285 October 28, 1986 Perdue
4624026 November 25, 1986 Olson et al.
4626995 December 2, 1986 Lofgren et al.
4628454 December 9, 1986 Ito
4638445 January 20, 1987 Mattaboni
4644156 February 17, 1987 Takahashi et al.
4649504 March 10, 1987 Krouglicof et al.
4652917 March 24, 1987 Miller
4654492 March 31, 1987 Koerner et al.
4654924 April 7, 1987 Getz et al.
4660969 April 28, 1987 Sorimachi et al.
4662854 May 5, 1987 Fang
4674047 June 16, 1987 Tyler
4674048 June 16, 1987 Okumura
4679152 July 7, 1987 Perdue
4680827 July 21, 1987 Hummel
4696074 September 29, 1987 Cavalli et al.
D292223 October 6, 1987 Trumbull
4700301 October 13, 1987 Dyke
4700427 October 20, 1987 Knepper
4703820 November 3, 1987 Reinaud
4710020 December 1, 1987 Maddox et al.
4716621 January 5, 1988 Zoni
4728801 March 1, 1988 O'Connor
4733343 March 22, 1988 Yoneda et al.
4733430 March 29, 1988 Westergren
4733431 March 29, 1988 Martin
4735136 April 5, 1988 Lee et al.
4735138 April 5, 1988 Gawler et al.
4748336 May 31, 1988 Fujie et al.
4748833 June 7, 1988 Nagasawa
4756049 July 12, 1988 Uehara
4767213 August 30, 1988 Hummel
4769700 September 6, 1988 Pryor
4777416 October 11, 1988 George, II et al.
D298766 November 29, 1988 Tanno et al.
4782550 November 8, 1988 Jacobs
4796198 January 3, 1989 Boultinghouse et al.
4806751 February 21, 1989 Abe et al.
4811228 March 7, 1989 Hyyppa
4813906 March 21, 1989 Matsuyama et al.
4815157 March 28, 1989 Tsuchiya
4817000 March 28, 1989 Eberhardt
4818875 April 4, 1989 Weiner
4829442 May 9, 1989 Kadonoff et al.
4829626 May 16, 1989 Harkonen et al.
4832098 May 23, 1989 Palinkas et al.
4851661 July 25, 1989 Everett
4854000 August 8, 1989 Takimoto
4854006 August 8, 1989 Nishimura et al.
4855915 August 8, 1989 Dallaire
4857912 August 15, 1989 Everett et al.
4858132 August 15, 1989 Holmquist
4867570 September 19, 1989 Sorimachi et al.
4880474 November 14, 1989 Koharagi et al.
4884506 December 5, 1989 Guerreri
4887415 December 19, 1989 Martin
4891762 January 2, 1990 Chotiros
4893025 January 9, 1990 Lee
4901394 February 20, 1990 Nakamura et al.
4905151 February 27, 1990 Weiman et al.
4912643 March 27, 1990 Beirne
4918441 April 17, 1990 Bohman
4919224 April 24, 1990 Shyu et al.
4919489 April 24, 1990 Kopsco
4920060 April 24, 1990 Parrent et al.
4920605 May 1, 1990 Takashima
4933864 June 12, 1990 Evans et al.
4937912 July 3, 1990 Kurz
4953253 September 4, 1990 Fukuda et al.
4954962 September 4, 1990 Evans et al.
4955714 September 11, 1990 Stotler et al.
4956891 September 18, 1990 Wulff
4961303 October 9, 1990 McCarty et al.
4961304 October 9, 1990 Ovsborn et al.
4962453 October 9, 1990 Pong et al.
4971591 November 20, 1990 Raviv et al.
4973912 November 27, 1990 Kaminski et al.
4974283 December 4, 1990 Holsten et al.
4977618 December 11, 1990 Allen
4977639 December 18, 1990 Takahashi et al.
4986663 January 22, 1991 Cecchi et al.
5001635 March 19, 1991 Yasutomi et al.
5002145 March 26, 1991 Waqkaumi et al.
5012886 May 7, 1991 Jonas et al.
5018240 May 28, 1991 Holman
5020186 June 4, 1991 Lessig et al.
5022812 June 11, 1991 Coughlan et al.
5023788 June 11, 1991 Kitazume et al.
5024529 June 18, 1991 Svetkoff et al.
D318500 July 23, 1991 Malewicki et al.
5032775 July 16, 1991 Mizuno et al.
5033151 July 23, 1991 Kraft et al.
5033291 July 23, 1991 Podoloff et al.
5040116 August 13, 1991 Evans et al.
5045769 September 3, 1991 Everett
5049802 September 17, 1991 Mintus et al.
5051906 September 24, 1991 Evans et al.
5062819 November 5, 1991 Mallory
5084934 February 4, 1992 Lessig et al.
5086535 February 11, 1992 Grossmeyer et al.
5090321 February 25, 1992 Abouav
5093955 March 10, 1992 Blehert et al.
5094311 March 10, 1992 Akeel
5105502 April 21, 1992 Takashima
5105550 April 21, 1992 Shenoha
5109566 May 5, 1992 Kobayashi et al.
5115538 May 26, 1992 Cochran et al.
5127128 July 7, 1992 Lee
5136675 August 4, 1992 Hodson
5136750 August 11, 1992 Takashima et al.
5142985 September 1, 1992 Stearns
5144471 September 1, 1992 Takanashi et al.
5144714 September 8, 1992 Mori et al.
5144715 September 8, 1992 Matsuyo et al.
5152028 October 6, 1992 Hirano
5152202 October 6, 1992 Strauss
5155684 October 13, 1992 Burke et al.
5163202 November 17, 1992 Kawakami et al.
5163320 November 17, 1992 Goshima et al.
5164579 November 17, 1992 Pryor et al.
5165064 November 17, 1992 Mattaboni
5170352 December 8, 1992 McTamaney et al.
5173881 December 22, 1992 Sindle
5182833 February 2, 1993 Yamaguhi et al.
5202742 April 13, 1993 Frank et al.
5204814 April 20, 1993 Noonan et al.
5206500 April 27, 1993 Decker et al.
5208521 May 4, 1993 Aoyama
5216777 June 8, 1993 Moro et al.
5227985 July 13, 1993 DeMenthon
5233682 August 3, 1993 Abe et al.
5239720 August 31, 1993 Wood et al.
5251358 October 12, 1993 Moro et al.
5261139 November 16, 1993 Lewis
5276618 January 4, 1994 Everett
5276939 January 11, 1994 Uenishi
5277064 January 11, 1994 Knigga et al.
5279672 January 18, 1994 Belker, Jr. et al.
5284452 February 8, 1994 Corona
5284522 February 8, 1994 Kobayashi et al.
5293955 March 15, 1994 Lee
D345707 April 5, 1994 Alister
5303448 April 19, 1994 Hennessey et al.
5307273 April 26, 1994 Oh et al.
5309592 May 10, 1994 Hiratsuka
5310379 May 10, 1994 Hippely et al.
5315227 May 24, 1994 Pierson et al.
5319827 June 14, 1994 Yang
5319828 June 14, 1994 Waldhauser et al.
5321614 June 14, 1994 Ashworth
5323483 June 21, 1994 Baeg
5324948 June 28, 1994 Dudar et al.
5341186 August 23, 1994 Kato
5341540 August 30, 1994 Soupert et al.
5341549 August 30, 1994 Wirtz et al.
5345649 September 13, 1994 Whitlow
5353224 October 4, 1994 Lee et al.
5363305 November 8, 1994 Cox et al.
5363935 November 15, 1994 Schempf et al.
5369347 November 29, 1994 Yoo
5369838 December 6, 1994 Wood et al.
5386862 February 7, 1995 Glover et al.
5399951 March 21, 1995 Lavallee et al.
5400244 March 21, 1995 Watanabe et al.
5404612 April 11, 1995 Ishikawa
5410479 April 25, 1995 Coker
5435405 July 25, 1995 Schempf et al.
5440216 August 8, 1995 Kim
5442358 August 15, 1995 Keeler et al.
5444965 August 29, 1995 Colens
5446356 August 29, 1995 Kim
5446445 August 29, 1995 Bloomfield et al.
5451135 September 19, 1995 Schempf et al.
5454129 October 3, 1995 Kell
5455982 October 10, 1995 Armstrong et al.
5465525 November 14, 1995 Mifune et al.
5465619 November 14, 1995 Sotack et al.
5467273 November 14, 1995 Faibish et al.
5471560 November 28, 1995 Allard et al.
5491670 February 13, 1996 Weber
5497529 March 12, 1996 Boesi
5498948 March 12, 1996 Bruni et al.
5502638 March 26, 1996 Takenaka
5505072 April 9, 1996 Oreper
5507067 April 16, 1996 Hoekstra et al.
5510893 April 23, 1996 Suzuki
5511147 April 23, 1996 Abdel
5515572 May 14, 1996 Hoekstra et al.
5534762 July 9, 1996 Kim
5537017 July 16, 1996 Feiten et al.
5537711 July 23, 1996 Tseng
5539953 July 30, 1996 Kurz
5542146 August 6, 1996 Hoekstra et al.
5542148 August 6, 1996 Young
5546631 August 20, 1996 Chambon
5548511 August 20, 1996 Bancroft
5551525 September 3, 1996 Pack et al.
5553349 September 10, 1996 Kilstrom et al.
5555587 September 17, 1996 Guha
5560077 October 1, 1996 Crotchett
5563366 October 8, 1996 La Mura
5568589 October 22, 1996 Hwang
D375592 November 12, 1996 Ljunggren
5608306 March 4, 1997 Rybeck et al.
5608894 March 4, 1997 Kawakami et al.
5608944 March 11, 1997 Gordon
5610488 March 11, 1997 Miyazawa
5611106 March 18, 1997 Wulff
5611108 March 18, 1997 Knowlton et al.
5613261 March 25, 1997 Kawakami et al.
5613269 March 25, 1997 Miwa
5621291 April 15, 1997 Lee
5622236 April 22, 1997 Azumi et al.
5634237 June 3, 1997 Paranjpe
5634239 June 3, 1997 Tuvin et al.
5636402 June 10, 1997 Kubo et al.
5642299 June 24, 1997 Hardin et al.
5646494 July 8, 1997 Han
5647554 July 15, 1997 Ikegami et al.
5650702 July 22, 1997 Azumi
5652489 July 29, 1997 Kawakami
5682313 October 28, 1997 Edlund et al.
5682839 November 4, 1997 Grimsley et al.
5696675 December 9, 1997 Nakamura et al.
5698861 December 16, 1997 Oh
5709007 January 20, 1998 Chiang
5710506 January 20, 1998 Broell et al.
5714119 February 3, 1998 Kawagoe et al.
5717169 February 10, 1998 Liang et al.
5717484 February 10, 1998 Hamaguchi et al.
5720077 February 24, 1998 Nakamura et al.
5732401 March 24, 1998 Conway
5735959 April 7, 1998 Kubo et al.
5745235 April 28, 1998 Vercammen et al.
5752871 May 19, 1998 Tsuzuki
5756904 May 26, 1998 Oreper et al.
5761762 June 9, 1998 Kubo et al.
5764888 June 9, 1998 Bolan et al.
5767437 June 16, 1998 Rogers
5767960 June 16, 1998 Orman
5777596 July 7, 1998 Herbert
5778486 July 14, 1998 Kim
5781697 July 14, 1998 Jeong
5781960 July 21, 1998 Kilstrom et al.
5786602 July 28, 1998 Pryor et al.
5787545 August 4, 1998 Colens
5793900 August 11, 1998 Nourbakhsh et al.
5794297 August 18, 1998 Muta
5812267 September 22, 1998 Everett, Jr. et al.
5814808 September 29, 1998 Takada et al.
5815880 October 6, 1998 Nakanishi
5815884 October 6, 1998 Imamura et al.
5819008 October 6, 1998 Asama et al.
5819360 October 13, 1998 Fujii
5819936 October 13, 1998 Saveliev et al.
5820821 October 13, 1998 Kawagoe et al.
5821730 October 13, 1998 Drapkin
5825981 October 20, 1998 Matsuda
5828770 October 27, 1998 Leis et al.
5831597 November 3, 1998 West et al.
5839156 November 24, 1998 Park et al.
5839532 November 24, 1998 Yoshiji et al.
5841259 November 24, 1998 Kim et al.
5867800 February 2, 1999 Leif
5869910 February 9, 1999 Colens
5896611 April 27, 1999 Haaga
5903124 May 11, 1999 Kawakami
5905209 May 18, 1999 Oreper
5907886 June 1, 1999 Buscher
5910700 June 8, 1999 Crotzer
5916008 June 29, 1999 Wong
5924167 July 20, 1999 Wright et al.
5926909 July 27, 1999 McGee
5933102 August 3, 1999 Miller et al.
5933913 August 10, 1999 Wright et al.
5935179 August 10, 1999 Kleiner et al.
5940346 August 17, 1999 Sadowsky et al.
5940927 August 24, 1999 Haegermarck et al.
5940930 August 24, 1999 Oh et al.
5942869 August 24, 1999 Katou et al.
5943730 August 31, 1999 Boomgaarden
5943733 August 31, 1999 Tagliaferri
5947225 September 7, 1999 Kawakami et al.
5950408 September 14, 1999 Schaedler
5959423 September 28, 1999 Nakanishi et al.
5968281 October 19, 1999 Wright et al.
5974348 October 26, 1999 Rocks
5974365 October 26, 1999 Mitchell
5983448 November 16, 1999 Wright et al.
5984880 November 16, 1999 Lander et al.
5987383 November 16, 1999 Keller et al.
5989700 November 23, 1999 Krivopal
5991951 November 30, 1999 Kubo et al.
5995884 November 30, 1999 Allen et al.
5998953 December 7, 1999 Nakamura et al.
5998971 December 7, 1999 Corbridge
6000088 December 14, 1999 Wright et al.
6009358 December 28, 1999 Angott et al.
6021545 February 8, 2000 Delgado et al.
6023813 February 15, 2000 Thatcher et al.
6023814 February 15, 2000 Imamura
6025687 February 15, 2000 Himeda et al.
6026539 February 22, 2000 Mouw et al.
6030465 February 29, 2000 Marcussen et al.
6032542 March 7, 2000 Warnick et al.
6036572 March 14, 2000 Sze
6038501 March 14, 2000 Kawakami
6040669 March 21, 2000 Hog
6041471 March 28, 2000 Charkey et al.
6041472 March 28, 2000 Kasen et al.
6046800 April 4, 2000 Ohtomo et al.
6049620 April 11, 2000 Dickinson et al.
6052821 April 18, 2000 Chouly et al.
6055042 April 25, 2000 Sarangapani
6055702 May 2, 2000 Imamura et al.
6061868 May 16, 2000 Moritsch et al.
6065182 May 23, 2000 Wright et al.
6073432 June 13, 2000 Schaedler
6076025 June 13, 2000 Ueno et al.
6076026 June 13, 2000 Jambhekar et al.
6076226 June 20, 2000 Reed
6076227 June 20, 2000 Schallig et al.
6081257 June 27, 2000 Zeller
6088020 July 11, 2000 Mor
6094775 August 1, 2000 Behmer
6099091 August 8, 2000 Campbell
6101670 August 15, 2000 Song
6101671 August 15, 2000 Wright et al.
6108031 August 22, 2000 King et al.
6108067 August 22, 2000 Okamoto
6108076 August 22, 2000 Hanseder
6108269 August 22, 2000 Kabel
6108597 August 22, 2000 Kirchner et al.
6112143 August 29, 2000 Allen et al.
6112996 September 5, 2000 Matsuo
6119057 September 12, 2000 Kawagoe
6122798 September 26, 2000 Kobayashi et al.
6124694 September 26, 2000 Bancroft et al.
6125498 October 3, 2000 Roberts et al.
6131237 October 17, 2000 Kasper et al.
6138063 October 24, 2000 Himeda
6142252 November 7, 2000 Kinto et al.
6146278 November 14, 2000 Kobayashi
6154279 November 28, 2000 Thayer
6154694 November 28, 2000 Aoki et al.
6160479 December 12, 2000 ANG.hlen et al.
6167332 December 26, 2000 Kurtzberg et al.
6167587 January 2, 2001 Kasper et al.
6173651 January 16, 2001 Pathe et al.
6192548 February 27, 2001 Huffman
6216307 April 17, 2001 Kaleta et al.
6220865 April 24, 2001 Macri et al.
6226830 May 8, 2001 Hendriks et al.
6230362 May 15, 2001 Kasper et al.
6237741 May 29, 2001 Guidetti
6240342 May 29, 2001 Fiegert et al.
6243913 June 12, 2001 Frank et al.
6255793 July 3, 2001 Peless et al.
6259979 July 10, 2001 Holmquist
6261379 July 17, 2001 Conrad et al.
6263539 July 24, 2001 Baig
6263989 July 24, 2001 Won
6272936 August 14, 2001 Oreper et al.
6278918 August 21, 2001 Dickson et al.
6282526 August 28, 2001 Ganesh
6283034 September 4, 2001 Miles
6285778 September 4, 2001 Nakajima et al.
6285930 September 4, 2001 Dickson et al.
6300737 October 9, 2001 Bergvall et al.
6321337 November 20, 2001 Reshef et al.
6321515 November 27, 2001 Colens
6323570 November 27, 2001 Nishimura et al.
6324714 December 4, 2001 Walz et al.
6327741 December 11, 2001 Reed
6332400 December 25, 2001 Meyer
6339735 January 15, 2002 Peless et al.
6362875 March 26, 2002 Burkley
6370453 April 9, 2002 Sommer
6374155 April 16, 2002 Wallach et al.
6374157 April 16, 2002 Takamura
6381802 May 7, 2002 Park
6385515 May 7, 2002 Dickson et al.
6388013 May 14, 2002 Saraf et al.
6389329 May 14, 2002 Colens
6400048 June 4, 2002 Nishimura et al.
6401294 June 11, 2002 Kasper
6408226 June 18, 2002 Byrne et al.
6412141 July 2, 2002 Kasper et al.
6415203 July 2, 2002 Inoue et al.
6421870 July 23, 2002 Basham et al.
6427285 August 6, 2002 Legatt et al.
6430471 August 6, 2002 Kintou et al.
6431296 August 13, 2002 Won
6437227 August 20, 2002 Theimer
6437465 August 20, 2002 Nishimura et al.
6438456 August 20, 2002 Feddema et al.
6438793 August 27, 2002 Miner et al.
6442476 August 27, 2002 Poropat
6443509 September 3, 2002 Levin et al.
6444003 September 3, 2002 Sutcliffe
6446302 September 10, 2002 Kasper et al.
6454036 September 24, 2002 Airey et al.
D464091 October 8, 2002 Christianson
6457206 October 1, 2002 Judson
6459955 October 1, 2002 Bartsch et al.
6463368 October 8, 2002 Feiten et al.
6465982 October 15, 2002 Bergvall et al.
6473167 October 29, 2002 Odell
6480762 November 12, 2002 Uchikubo et al.
6481515 November 19, 2002 Kirkpatrick et al.
6490539 December 3, 2002 Dickson et al.
6490977 December 10, 2002 Bossarte et al.
6491127 December 10, 2002 Holmberg et al.
6493612 December 10, 2002 Bisset et al.
6493613 December 10, 2002 Peless et al.
6496754 December 17, 2002 Song et al.
6496755 December 17, 2002 Wallach et al.
6502657 January 7, 2003 Kerrebrock et al.
6504610 January 7, 2003 Bauer et al.
6507773 January 14, 2003 Parker et al.
6525509 February 25, 2003 Petersson et al.
D471243 March 4, 2003 Cioffi et al.
6532404 March 11, 2003 Colens
6535793 March 18, 2003 Allard
6540607 April 1, 2003 Mokris et al.
6548982 April 15, 2003 Papanikolopoulos et al.
6553612 April 29, 2003 Dyson et al.
6556722 April 29, 2003 Russell et al.
6556892 April 29, 2003 Kuroki et al.
6557104 April 29, 2003 Vu et al.
D474312 May 6, 2003 Stephens et al.
6563130 May 13, 2003 Dworkowski et al.
6571415 June 3, 2003 Gerber et al.
6571422 June 3, 2003 Gordon et al.
6572711 June 3, 2003 Sclafani et al.
6574536 June 3, 2003 Kawagoe et al.
6580246 June 17, 2003 Jacobs
6584376 June 24, 2003 Kommer
6586908 July 1, 2003 Petersson et al.
6587573 July 1, 2003 Stam et al.
6590222 July 8, 2003 Bisset et al.
6594551 July 15, 2003 McKinney, Jr. et al.
6594844 July 22, 2003 Jones
D478884 August 26, 2003 Slipy et al.
6601265 August 5, 2003 Burlington
6604021 August 5, 2003 Imai et al.
6604022 August 5, 2003 Parker et al.
6605156 August 12, 2003 Clark et al.
6611120 August 26, 2003 Song et al.
6611734 August 26, 2003 Parker et al.
6611738 August 26, 2003 Ruffner
6615108 September 2, 2003 Peless et al.
6615885 September 9, 2003 Ohm
6622465 September 23, 2003 Jerome et al.
6624744 September 23, 2003 Wilson et al.
6625843 September 30, 2003 Kim et al.
6629028 September 30, 2003 Paromtchik et al.
6639659 October 28, 2003 Granger
6658325 December 2, 2003 Zweig
6658354 December 2, 2003 Lin
6658692 December 9, 2003 Lenkiewicz et al.
6658693 December 9, 2003 Reed, Jr.
6661239 December 9, 2003 Ozick
6662889 December 16, 2003 De et al.
6668951 December 30, 2003 Won
6670817 December 30, 2003 Fournier et al.
6671592 December 30, 2003 Bisset et al.
6687571 February 3, 2004 Byrne et al.
6690134 February 10, 2004 Jones et al.
6690993 February 10, 2004 Foulke et al.
6697147 February 24, 2004 Ko et al.
6711280 March 23, 2004 Stafsudd et al.
6732826 May 11, 2004 Song et al.
6737591 May 18, 2004 Lapstun et al.
6741054 May 25, 2004 Koselka et al.
6741364 May 25, 2004 Lange et al.
6748297 June 8, 2004 Song et al.
6756703 June 29, 2004 Chang
6760647 July 6, 2004 Nourbakhsh et al.
6764373 July 20, 2004 Osawa et al.
6769004 July 27, 2004 Barrett
6774596 August 10, 2004 Bisset
6779380 August 24, 2004 Nieuwkamp
6781338 August 24, 2004 Jones et al.
6809490 October 26, 2004 Jones et al.
6810305 October 26, 2004 Kirkpatrick
6830120 December 14, 2004 Yashima et al.
6832407 December 21, 2004 Salem et al.
6836701 December 28, 2004 McKee
6841963 January 11, 2005 Song et al.
6845297 January 18, 2005 Allard
6856811 February 15, 2005 Burdue et al.
6859010 February 22, 2005 Jeon et al.
6859682 February 22, 2005 Naka et al.
6860206 March 1, 2005 Rudakevych et al.
6865447 March 8, 2005 Lau et al.
6870792 March 22, 2005 Chiappetta
6871115 March 22, 2005 Huang et al.
6883201 April 26, 2005 Jones et al.
6886651 May 3, 2005 Slocum et al.
6888333 May 3, 2005 Laby
6901624 June 7, 2005 Mori et al.
6906702 June 14, 2005 Tanaka et al.
6914403 July 5, 2005 Tsurumi
6917854 July 12, 2005 Bayer
6925357 August 2, 2005 Wang et al.
6925679 August 9, 2005 Wallach et al.
6929548 August 16, 2005 Wang
D510066 September 27, 2005 Hickey et al.
6938298 September 6, 2005 Aasen
6940291 September 6, 2005 Ozick
6941199 September 6, 2005 Bottomley et al.
6956348 October 18, 2005 Landry et al.
6957712 October 25, 2005 Song et al.
6960986 November 1, 2005 Asama et al.
6965209 November 15, 2005 Jones et al.
6965211 November 15, 2005 Tsurumi
6968592 November 29, 2005 Takeuchi et al.
6971140 December 6, 2005 Kim
6975246 December 13, 2005 Trudeau
6980229 December 27, 2005 Ebersole
6985556 January 10, 2006 Shanmugavel et al.
6993954 February 7, 2006 George et al.
6999850 February 14, 2006 McDonald
7013527 March 21, 2006 Thomas et al.
7024278 April 4, 2006 Chiappetta et al.
7024280 April 4, 2006 Parker et al.
7027893 April 11, 2006 Perry et al.
7030768 April 18, 2006 Wanie
7031805 April 18, 2006 Lee et al.
7032469 April 25, 2006 Bailey
7053578 May 30, 2006 Diehl et al.
7054716 May 30, 2006 McKee et al.
7055210 June 6, 2006 Keppler et al.
7057120 June 6, 2006 Ma et al.
7057643 June 6, 2006 Iida et al.
7065430 June 20, 2006 Naka et al.
7066291 June 27, 2006 Martins et al.
7069124 June 27, 2006 Whittaker et al.
7079923 July 18, 2006 Abramson et al.
7085623 August 1, 2006 Siegers
7085624 August 1, 2006 Aldred et al.
7113847 September 26, 2006 Chmura et al.
7133746 November 7, 2006 Abramson et al.
7142198 November 28, 2006 Lee
7148458 December 12, 2006 Schell et al.
7155308 December 26, 2006 Jones
7167775 January 23, 2007 Abramson et al.
7171285 January 30, 2007 Kim et al.
7173391 February 6, 2007 Jones et al.
7174238 February 6, 2007 Zweig
7188000 March 6, 2007 Chiappetta et al.
7193384 March 20, 2007 Norman et al.
7196487 March 27, 2007 Jones et al.
7201786 April 10, 2007 Wegelin et al.
7206677 April 17, 2007 Hulden
7211980 May 1, 2007 Bruemmer et al.
7225500 June 5, 2007 Diehl et al.
7246405 July 24, 2007 Yan
7248951 July 24, 2007 Hulden
7275280 October 2, 2007 Haegermarck et al.
7283892 October 16, 2007 Boillot et al.
7288912 October 30, 2007 Landry et al.
7318248 January 15, 2008 Yan
7320149 January 22, 2008 Huffman et al.
7324870 January 29, 2008 Lee
7328196 February 5, 2008 Peters, II
7332890 February 19, 2008 Cohen et al.
7352153 April 1, 2008 Yan
7359766 April 15, 2008 Jeon et al.
7360277 April 22, 2008 Moshenrose et al.
7363108 April 22, 2008 Noda et al.
7388879 June 17, 2008 Sabe et al.
7389166 June 17, 2008 Harwig et al.
7408157 August 5, 2008 Yan
7418762 September 2, 2008 Arai et al.
7430455 September 30, 2008 Casey et al.
7430462 September 30, 2008 Chiu et al.
7441298 October 28, 2008 Svendsen et al.
7444206 October 28, 2008 Abramson et al.
7448113 November 11, 2008 Jones et al.
7459871 December 2, 2008 Landry et al.
7467026 December 16, 2008 Sakagami et al.
7474941 January 6, 2009 Kim et al.
7503096 March 17, 2009 Lin
7515991 April 7, 2009 Egawa et al.
7555363 June 30, 2009 Augenbraun et al.
7557703 July 7, 2009 Yamada et al.
7568259 August 4, 2009 Yan
7571511 August 11, 2009 Jones et al.
7578020 August 25, 2009 Jaworski et al.
7600521 October 13, 2009 Woo
7603744 October 20, 2009 Reindle
7617557 November 17, 2009 Reindle
7620476 November 17, 2009 Morse et al.
7636982 December 29, 2009 Jones et al.
7647144 January 12, 2010 Haegermarck
7650666 January 26, 2010 Jang
7660650 February 9, 2010 Kawagoe et al.
7663333 February 16, 2010 Jones et al.
7693605 April 6, 2010 Park
7706917 April 27, 2010 Chiappetta et al.
7765635 August 3, 2010 Park
7801645 September 21, 2010 Taylor et al.
7805220 September 28, 2010 Taylor et al.
7809944 October 5, 2010 Kawamoto
7849555 December 14, 2010 Hahm et al.
7853645 December 14, 2010 Brown et al.
7920941 April 5, 2011 Park et al.
7937800 May 10, 2011 Yan
7957836 June 7, 2011 Myeong et al.
20010004719 June 21, 2001 Sommer
20010013929 August 16, 2001 Torsten
20010020200 September 6, 2001 Das et al.
20010025183 September 27, 2001 Shahidi
20010037163 November 1, 2001 Allard
20010043509 November 22, 2001 Green et al.
20010045883 November 29, 2001 Holdaway et al.
20010047231 November 29, 2001 Peless et al.
20010047895 December 6, 2001 De et al.
20020011367 January 31, 2002 Kolesnik
20020011813 January 31, 2002 Koselka et al.
20020016649 February 7, 2002 Jones
20020021219 February 21, 2002 Edwards
20020027652 March 7, 2002 Paromtchik et al.
20020036779 March 28, 2002 Kiyoi et al.
20020081937 June 27, 2002 Yamada et al.
20020095239 July 18, 2002 Wallach et al.
20020097400 July 25, 2002 Jung et al.
20020104963 August 8, 2002 Mancevski
20020108209 August 15, 2002 Peterson
20020112742 August 22, 2002 Bredo et al.
20020113973 August 22, 2002 Ge
20020116089 August 22, 2002 Kirkpatrick
20020120364 August 29, 2002 Colens
20020124343 September 12, 2002 Reed
20020153185 October 24, 2002 Song et al.
20020156556 October 24, 2002 Ruffner
20020159051 October 31, 2002 Guo
20020166193 November 14, 2002 Kasper
20020169521 November 14, 2002 Goodman et al.
20020173877 November 21, 2002 Zweig
20020189871 December 19, 2002 Won
20030009259 January 9, 2003 Hattori et al.
20030019071 January 30, 2003 Field et al.
20030023356 January 30, 2003 Keable
20030024986 February 6, 2003 Mazz et al.
20030025472 February 6, 2003 Jones et al.
20030028286 February 6, 2003 Glenn et al.
20030030399 February 13, 2003 Jacobs
20030058262 March 27, 2003 Sato et al.
20030060928 March 27, 2003 Abramson et al.
20030067451 April 10, 2003 Tagg et al.
20030097875 May 29, 2003 Lentz et al.
20030120389 June 26, 2003 Abramson et al.
20030124312 July 3, 2003 Autumn
20030126352 July 3, 2003 Barrett
20030137268 July 24, 2003 Papanikolopoulos et al.
20030146384 August 7, 2003 Logsdon et al.
20030192144 October 16, 2003 Song et al.
20030193657 October 16, 2003 Uomori et al.
20030216834 November 20, 2003 Allard
20030221114 November 27, 2003 Hino et al.
20030229421 December 11, 2003 Chmura et al.
20030229474 December 11, 2003 Suzuki et al.
20030233171 December 18, 2003 Heiligensetzer
20030233177 December 18, 2003 Johnson et al.
20030233870 December 25, 2003 Mancevski
20030233930 December 25, 2003 Ozick
20040016077 January 29, 2004 Song et al.
20040020000 February 5, 2004 Jones
20040030448 February 12, 2004 Solomon
20040030449 February 12, 2004 Solomon
20040030450 February 12, 2004 Solomon
20040030451 February 12, 2004 Solomon
20040030570 February 12, 2004 Solomon
20040030571 February 12, 2004 Solomon
20040031113 February 19, 2004 Wosewick et al.
20040049877 March 18, 2004 Jones et al.
20040055163 March 25, 2004 McCambridge et al.
20040068351 April 8, 2004 Solomon
20040068415 April 8, 2004 Solomon
20040068416 April 8, 2004 Solomon
20040074038 April 22, 2004 Im et al.
20040074044 April 22, 2004 Diehl et al.
20040076324 April 22, 2004 Burl et al.
20040083570 May 6, 2004 Song et al.
20040088079 May 6, 2004 Lavarec et al.
20040093122 May 13, 2004 Galibraith
20040098167 May 20, 2004 Yi et al.
20040111184 June 10, 2004 Chiappetta et al.
20040111821 June 17, 2004 Lenkiewicz et al.
20040113777 June 17, 2004 Matsuhira et al.
20040117064 June 17, 2004 McDonald
20040117846 June 17, 2004 Karaoguz et al.
20040118998 June 24, 2004 Wingett et al.
20040128028 July 1, 2004 Miyamoto et al.
20040133316 July 8, 2004 Dean
20040134336 July 15, 2004 Solomon
20040134337 July 15, 2004 Solomon
20040143919 July 29, 2004 Wilder
20040148419 July 29, 2004 Chen et al.
20040148731 August 5, 2004 Damman et al.
20040153212 August 5, 2004 Profio et al.
20040156541 August 12, 2004 Jeon et al.
20040158357 August 12, 2004 Lee et al.
20040181706 September 16, 2004 Chen et al.
20040187249 September 30, 2004 Jones et al.
20040187457 September 30, 2004 Colens
20040196451 October 7, 2004 Aoyama
20040200505 October 14, 2004 Taylor et al.
20040204792 October 14, 2004 Taylor et al.
20040210345 October 21, 2004 Noda et al.
20040210347 October 21, 2004 Sawada et al.
20040211444 October 28, 2004 Taylor et al.
20040221790 November 11, 2004 Sinclair et al.
20040236468 November 25, 2004 Taylor et al.
20040244138 December 9, 2004 Taylor et al.
20040255425 December 23, 2004 Arai et al.
20050000543 January 6, 2005 Taylor et al.
20050010330 January 13, 2005 Abramson et al.
20050010331 January 13, 2005 Taylor et al.
20050021181 January 27, 2005 Kim et al.
20050067994 March 31, 2005 Jones et al.
20050085947 April 21, 2005 Aldred et al.
20050137749 June 23, 2005 Jeon et al.
20050144751 July 7, 2005 Kegg et al.
20050150074 July 14, 2005 Diehl et al.
20050150519 July 14, 2005 Keppler et al.
20050154795 July 14, 2005 Kuz et al.
20050156562 July 21, 2005 Cohen et al.
20050165508 July 28, 2005 Kanda et al.
20050166354 August 4, 2005 Uehigashi
20050166355 August 4, 2005 Tani
20050172445 August 11, 2005 Diehl et al.
20050183229 August 25, 2005 Uehigashi
20050183230 August 25, 2005 Uehigashi
20050187678 August 25, 2005 Myeong et al.
20050192707 September 1, 2005 Park et al.
20050204717 September 22, 2005 Colens
20050209736 September 22, 2005 Kawagoe
20050211880 September 29, 2005 Schell et al.
20050212929 September 29, 2005 Schell et al.
20050213082 September 29, 2005 DiBernardo et al.
20050213109 September 29, 2005 Schell et al.
20050217042 October 6, 2005 Reindle
20050218852 October 6, 2005 Landry et al.
20050222933 October 6, 2005 Wesby
20050229340 October 20, 2005 Sawalski et al.
20050229355 October 20, 2005 Crouch et al.
20050235451 October 27, 2005 Yan
20050251292 November 10, 2005 Casey et al.
20050255425 November 17, 2005 Pierson
20050258154 November 24, 2005 Blankenship et al.
20050273967 December 15, 2005 Taylor et al.
20050288819 December 29, 2005 De Guzman
20060000050 January 5, 2006 Cipolla et al.
20060010638 January 19, 2006 Shimizu et al.
20060020369 January 26, 2006 Taylor et al.
20060020370 January 26, 2006 Abramson
20060021168 February 2, 2006 Nishikawa
20060025134 February 2, 2006 Cho et al.
20060037170 February 23, 2006 Shimizu
20060044546 March 2, 2006 Lewin et al.
20060060216 March 23, 2006 Woo
20060061657 March 23, 2006 Rew et al.
20060064828 March 30, 2006 Stein et al.
20060087273 April 27, 2006 Ko et al.
20060089765 April 27, 2006 Pack et al.
20060100741 May 11, 2006 Jung
20060119839 June 8, 2006 Bertin et al.
20060143295 June 29, 2006 Costa-Requena et al.
20060146776 July 6, 2006 Kim
20060190133 August 24, 2006 Konandreas et al.
20060190146 August 24, 2006 Morse et al.
20060196003 September 7, 2006 Song et al.
20060220900 October 5, 2006 Ceskutti et al.
20060259194 November 16, 2006 Chiu
20060288519 December 28, 2006 Jaworski et al.
20060293787 December 28, 2006 Kanda et al.
20070006404 January 11, 2007 Cheng et al.
20070017061 January 25, 2007 Yan
20070028574 February 8, 2007 Yan
20070032904 February 8, 2007 Kawagoe
20070043459 February 22, 2007 Abbott et al.
20070061041 March 15, 2007 Zweig
20070114975 May 24, 2007 Cohen et al.
20070150096 June 28, 2007 Yeh et al.
20070157415 July 12, 2007 Lee et al.
20070157420 July 12, 2007 Lee et al.
20070179670 August 2, 2007 Chiappetta et al.
20070226949 October 4, 2007 Hahm et al.
20070234492 October 11, 2007 Svendsen et al.
20070244610 October 18, 2007 Ozick et al.
20070250212 October 25, 2007 Halloran et al.
20070266508 November 22, 2007 Jones et al.
20080007203 January 10, 2008 Cohen et al.
20080039974 February 14, 2008 Sandin et al.
20080052846 March 6, 2008 Kapoor et al.
20080091304 April 17, 2008 Ozick et al.
20080184518 August 7, 2008 Taylor et al.
20080276407 November 13, 2008 Schnittman et al.
20080281470 November 13, 2008 Gilbert et al.
20080282494 November 20, 2008 Won et al.
20080294288 November 27, 2008 Yamauchi
20080302586 December 11, 2008 Yan
20080307590 December 18, 2008 Jones et al.
20090007366 January 8, 2009 Svendsen et al.
20090038089 February 12, 2009 Landry et al.
20090049640 February 26, 2009 Lee et al.
20090055022 February 26, 2009 Casey et al.
20090102296 April 23, 2009 Greene et al.
20090292393 November 26, 2009 Casey et al.
20100011529 January 21, 2010 Won et al.
20100049365 February 25, 2010 Jones et al.
20100063628 March 11, 2010 Landry et al.
20100107355 May 6, 2010 Won et al.
20100257690 October 14, 2010 Jones et al.
20100257691 October 14, 2010 Jones et al.
20100263158 October 21, 2010 Jones et al.
RE28268 December 1974
Foreign Patent Documents
2003275566 June 2004 AU
2003275566 June 2004 AU
2128842 December 1980 DE
3317376 November 1984 DE
3317376 December 1987 DE
3536907 February 1989 DE
3404202 December 1992 DE
3404202 December 1992 DE
199311014 October 1993 DE
4414683 October 1995 DE
4338841 August 1999 DE
19849978 February 2001 DE
10242257 April 2003 DE
102004038074 June 2005 DE
10357636 July 2005 DE
10357636 July 2005 DE
102004041021 August 2005 DE
102005046813 April 2007 DE
102005046813 April 2007 DE
198803389 December 1988 DK
265542 May 1988 EP
281085 September 1988 EP
307381 July 1990 EP
358628 May 1991 EP
433697 June 1991 EP
0 437 024 July 1991 EP
437024 July 1991 EP
433697 December 1992 EP
479273 May 1993 EP
294101 December 1993 EP
554978 March 1994 EP
615719 September 1994 EP
0 792 726 September 1997 EP
861629 September 1998 EP
930040 October 1999 EP
845237 April 2000 EP
1018315 July 2000 EP
1172719 January 2002 EP
1228734 June 2003 EP
1 331 537 July 2003 EP
1 331 537 July 2003 EP
1331537 July 2003 EP
1 380 245 January 2004 EP
1380245 January 2004 EP
1380246 January 2004 EP
1380246 March 2005 EP
1 553 472 July 2005 EP
1 557 730 July 2005 EP
1553472 July 2005 EP
1557730 July 2005 EP
1642522 April 2006 EP
1642522 November 2007 EP
2238196 November 2006 ES
2601443 November 1991 FR
2 828 589 August 2001 FR
2828589 December 2003 FR
702426 January 1954 GB
2128842 May 1984 GB
2128842 April 1986 GB
2128842 April 1986 GB
2225221 May 1990 GB
2225221 May 1990 GB
2 283 838 May 1995 GB
2284957 June 1995 GB
2267360 December 1995 GB
2300082 September 1999 GB
2404330 July 2005 GB
2417354 February 2006 GB
2417354 February 2006 GB
53021869 February 1978 JP
53110257 September 1978 JP
943901 March 1979 JP
57064217 April 1982 JP
59005315 January 1984 JP
59005315 February 1984 JP
59094005 May 1984 JP
59099308 July 1984 JP
59112311 July 1984 JP
59033511 August 1984 JP
59120124 August 1984 JP
59131668 September 1984 JP
59164973 September 1984 JP
59184917 October 1984 JP
59212924 December 1984 JP
59226909 December 1984 JP
60089213 June 1985 JP
60211510 October 1985 JP
60259895 December 1985 JP
61097712 May 1986 JP
61023221 June 1986 JP
62074018 April 1987 JP
62070709 May 1987 JP
62-120510 June 1987 JP
62-154008 July 1987 JP
62154008 July 1987 JP
62164431 October 1987 JP
62263507 November 1987 JP
62263508 November 1987 JP
62189057 December 1987 JP
63079623 April 1988 JP
63-183032 July 1988 JP
63158032 July 1988 JP
63-241610 October 1988 JP
1162454 June 1989 JP
2-6312 January 1990 JP
2026312 June 1990 JP
2283343 November 1990 JP
03-051023 March 1991 JP
3197758 August 1991 JP
3201903 September 1991 JP
4019586 March 1992 JP
4084921 March 1992 JP
5-23269 February 1993 JP
5023269 April 1993 JP
5042076 June 1993 JP
5046246 June 1993 JP
5150827 June 1993 JP
5150829 June 1993 JP
5046239 July 1993 JP
5054620 July 1993 JP
5040519 October 1993 JP
5257527 October 1993 JP
5257533 October 1993 JP
5257533 October 1993 JP
5285861 November 1993 JP
6003251 January 1994 JP
6026312 April 1994 JP
6137828 May 1994 JP
6293095 October 1994 JP
06-327598 November 1994 JP
6105781 December 1994 JP
07-129239 May 1995 JP
7059702 June 1995 JP
7222705 August 1995 JP
7270518 October 1995 JP
7281752 October 1995 JP
7-295636 November 1995 JP
7313417 December 1995 JP
7313417 December 1995 JP
8-1676 January 1996 JP
8000393 January 1996 JP
8083125 March 1996 JP
08-089451 April 1996 JP
8089449 April 1996 JP
8123548 May 1996 JP
8123548 May 1996 JP
08-152916 June 1996 JP
8263137 October 1996 JP
8263137 October 1996 JP
8322774 December 1996 JP
8335112 December 1996 JP
8335112 December 1996 JP
9043901 February 1997 JP
9044240 February 1997 JP
9047413 February 1997 JP
9066855 March 1997 JP
9066855 March 1997 JP
9145309 June 1997 JP
9160644 June 1997 JP
9-179625 July 1997 JP
9185410 July 1997 JP
9206258 August 1997 JP
9206258 August 1997 JP
9233712 September 1997 JP
9251318 September 1997 JP
9265319 October 1997 JP
9265319 October 1997 JP
9269807 October 1997 JP
9269807 October 1997 JP
9269810 October 1997 JP
9269810 October 1997 JP
02555263 November 1997 JP
9319431 December 1997 JP
9319432 December 1997 JP
9319432 December 1997 JP
9319434 December 1997 JP
9319434 December 1997 JP
9325812 December 1997 JP
9325812 December 1997 JP
10055215 February 1998 JP
10055215 February 1998 JP
10117973 May 1998 JP
10117973 May 1998 JP
10118963 May 1998 JP
10118963 May 1998 JP
10177414 June 1998 JP
10214114 August 1998 JP
10295595 November 1998 JP
10295595 November 1998 JP
11015941 January 1999 JP
11015941 January 1999 JP
11102220 April 1999 JP
11102220 April 1999 JP
11162454 June 1999 JP
11174145 July 1999 JP
11174145 July 1999 JP
11175149 July 1999 JP
11175149 July 1999 JP
11178764 July 1999 JP
11178765 July 1999 JP
11-508810 August 1999 JP
11212642 August 1999 JP
11213157 August 1999 JP
11213157 August 1999 JP
11-510935 September 1999 JP
11248806 September 1999 JP
11282532 October 1999 JP
11282533 October 1999 JP
11295412 October 1999 JP
11295412 October 1999 JP
2000047728 February 2000 JP
2000056006 February 2000 JP
2000056006 February 2000 JP
2000056831 February 2000 JP
2000056831 February 2000 JP
2000066722 March 2000 JP
2000066722 March 2000 JP
2000075925 March 2000 JP
2000075925 March 2000 JP
2000275321 October 2000 JP
2000275321 October 2000 JP
2000353014 December 2000 JP
200122443 January 2001 JP
2001022443 January 2001 JP
2001067588 March 2001 JP
2001067588 March 2001 JP
2001087182 April 2001 JP
2001121455 May 2001 JP
2001125641 May 2001 JP
2001197008 July 2001 JP
2001216482 August 2001 JP
2001-258807 September 2001 JP
2001265437 September 2001 JP
2001265437 September 2001 JP
2001-275908 October 2001 JP
2001289939 October 2001 JP
2001306170 November 2001 JP
2001320781 November 2001 JP
2001-525567 December 2001 JP
2002-78650 March 2002 JP
2002073170 March 2002 JP
2002-204768 July 2002 JP
22204768 July 2002 JP
2002204769 July 2002 JP
2002247510 August 2002 JP
2002-532178 October 2002 JP
3356170 October 2002 JP
WO0281074 October 2002 JP
2002-323925 November 2002 JP
3375843 November 2002 JP
2002333920 November 2002 JP
2002333920 November 2002 JP
2002-355206 December 2002 JP
2002-360471 December 2002 JP
2002-360482 December 2002 JP
2005-366227 December 2002 JP
2002360479 December 2002 JP
2002366227 December 2002 JP
2002369778 December 2002 JP
2003-10076 January 2003 JP
23028528 January 2003 JP
2003010076 January 2003 JP
2003010076 January 2003 JP
2003010088 January 2003 JP
2003010088 January 2003 JP
2003015740 January 2003 JP
2003015740 January 2003 JP
2003028528 January 2003 JP
2003-5296 February 2003 JP
2003-036116 February 2003 JP
2003-38401 February 2003 JP
2003-38402 February 2003 JP
2003-047579 February 2003 JP
2003-505127 February 2003 JP
23036116 February 2003 JP
23052596 February 2003 JP
2003036116 February 2003 JP
2003047579 February 2003 JP
2003052596 February 2003 JP
2003-061882 March 2003 JP
2003061882 March 2003 JP
2003084994 March 2003 JP
2003167628 June 2003 JP
2003167628 June 2003 JP
2003-180586 July 2003 JP
2003180586 July 2003 JP
2003180587 July 2003 JP
2003186539 July 2003 JP
2003190064 July 2003 JP
2003241836 August 2003 JP
2003262520 September 2003 JP
2003262520 September 2003 JP
2003285288 October 2003 JP
2003304992 October 2003 JP
2003304992 October 2003 JP
2003-310489 November 2003 JP
2003310509 November 2003 JP
2003310509 November 2003 JP
2003330543 November 2003 JP
2004123040 April 2004 JP
2004123040 April 2004 JP
2004148021 May 2004 JP
2004148021 May 2004 JP
2004160102 June 2004 JP
2004160102 June 2004 JP
2004166968 June 2004 JP
2004174228 June 2004 JP
2004174228 June 2004 JP
2004198330 July 2004 JP
2004219186 August 2004 JP
2005352707 February 2005 JP
2005118354 May 2005 JP
2005118354 May 2005 JP
2005135400 May 2005 JP
2005135400 May 2005 JP
2005-211360 August 2005 JP
2005211360 August 2005 JP
2005224265 August 2005 JP
2005-230032 September 2005 JP
2005230032 September 2005 JP
2005245916 September 2005 JP
2005245916 September 2005 JP
2005296511 October 2005 JP
2005352707 December 2005 JP
2006043071 February 2006 JP
2006043071 February 2006 JP
2006155274 June 2006 JP
2006155274 June 2006 JP
2006164223 June 2006 JP
2006227673 August 2006 JP
2006247467 September 2006 JP
2006247467 September 2006 JP
2006260161 September 2006 JP
2006260161 September 2006 JP
2006293662 October 2006 JP
2006293662 October 2006 JP
2006296697 November 2006 JP
2006296697 November 2006 JP
2007034866 February 2007 JP
2007034866 February 2007 JP
2007213180 August 2007 JP
2007213180 August 2007 JP
04074285 April 2008 JP
2009015611 January 2009 JP
2009015611 January 2009 JP
2010198552 September 2010 JP
2010198552 September 2010 JP
WO 95/26512 October 1995 WO
WO9530887 November 1995 WO
WO9617258 February 1997 WO
WO 97/15224 May 1997 WO
WO 97/40734 November 1997 WO
WO 97/41451 November 1997 WO
WO9740734 November 1997 WO
WO 98/53456 November 1998 WO
WO9055843 February 1999 WO
WO9905580 February 1999 WO
WO 99/16078 April 1999 WO
WO 99/28800 June 1999 WO
WO 99/38056 July 1999 WO
WO 99/38237 July 1999 WO
WO9938237 July 1999 WO
WO 99/43250 September 1999 WO
WO 99/59042 November 1999 WO
WO 00/04430 January 2000 WO
WO 00/36962 June 2000 WO
WO 00/38026 June 2000 WO
WO0038028 June 2000 WO
WO0038028 June 2000 WO
WO0038029 June 2000 WO
WO 00/78410 December 2000 WO
WO 01/06904 February 2001 WO
WO 01/06905 February 2001 WO
WO0180703 November 2001 WO
WO 01/91623 December 2001 WO
WO0191623 December 2001 WO
WO 02/39864 May 2002 WO
WO 02/39868 May 2002 WO
WO 02/058527 August 2002 WO
WO 02/062194 August 2002 WO
WO 02/067744 September 2002 WO
WO 02/067745 September 2002 WO
WO02/071175 September 2002 WO
WO 02/074150 September 2002 WO
WO 02/075356 September 2002 WO
WO 02/075469 September 2002 WO
WO 02/075470 September 2002 WO
WO0267752 September 2002 WO
WO0269774 September 2002 WO
WO0275350 September 2002 WO
WO02069775 September 2002 WO
WO 02/101477 December 2002 WO
WO03015220 February 2003 WO
WO03015220 February 2003 WO
WO03024292 March 2003 WO
WO 03/026474 April 2003 WO
WO 03/040845 May 2003 WO
WO 03/040846 May 2003 WO
WO0269775 May 2003 WO
WO03040546 May 2003 WO
WO 03/062850 July 2003 WO
WO03062850 July 2003 WO
WO03062852 July 2003 WO
WO2004/004533 January 2004 WO
WO 2004/006034 January 2004 WO
WO2004/058028 January 2004 WO
WO2005/077244 January 2004 WO
WO2004004534 January 2004 WO
WO2004005956 January 2004 WO
WO2004005956 January 2004 WO
WO2004006034 January 2004 WO
WO2006068403 January 2004 WO
WO2004/025947 March 2004 WO
WO2004043215 May 2004 WO
WO2004043215 May 2004 WO
WO2004/058028 July 2004 WO
WO2004/059409 July 2004 WO
WO2004059409 July 2004 WO
WO2005006935 January 2005 WO
WO2005006935 January 2005 WO
WO2005036292 April 2005 WO
WO2005036292 April 2005 WO
WO 2005/055795 June 2005 WO
WO2005055795 June 2005 WO
WO2005055796 June 2005 WO
WO2005055796 June 2005 WO
WO 2005/076545 August 2005 WO
WO 2005/077244 August 2005 WO
WO2005076545 August 2005 WO
WO2005077243 August 2005 WO
WO 2005/081074 September 2005 WO
WO2005/083541 September 2005 WO
WO2005081074 September 2005 WO
WO2005082223 September 2005 WO
WO2005082223 September 2005 WO
WO2005098475 October 2005 WO
WO2005098476 October 2005 WO
WO2006046400 May 2006 WO
WO2006/061133 June 2006 WO
WO2006061133 June 2006 WO
WO2006068403 June 2006 WO
WO2006073248 July 2006 WO
WO2006073248 July 2006 WO
WO2007036490 April 2007 WO
WO2007036490 May 2007 WO
WO2007065033 June 2007 WO
WO2007137234 November 2007 WO
Other references
  • European Search Report dated Nov. 19, 2009 in connection with corresponding EP Application No. 09169766.4.
  • Cameron Morland, Autonomous Lawn Mower Control, Jul. 24, 2002.
  • Doty, Keith L et al, “Sweep Strategies for a Sensory-Driven, Behavior-Based Vacuum Cleaning Agent” AAAI 1993 Fall Symposium Series Instantiating Real-World Agents Research Triangle Park, Raleigh, NC, Oct. 22-24, 1993.
  • Electrolux designed for the well-lived home, website: http://www.electroluxusa.com/node57.as[?currentURL=nodel 42.asp%3F, acessed Mar. 18, 2005.
  • eVac Robotic Vacuum S1727 Instruction Manual, Sharper Image Corp, Copyright 2004.
  • Everyday Robots, website: http://www.everydayrobots.com/index.php?option=content&task=view&id=9, accessed Apr. 20, 2005.
  • Facts on the Trilobite webpage: “http://trilobiteelectroluxse/presskiten/nodel1335asp?print=yes&pressID=” accessed Dec. 12, 2003.
  • Friendly Robotics Robotic Vacuum RV400-The Robot Store website: http://www.therobotstore.com/s.nl/sc.9/category,-109/it.A/id.43/.f, accessed Apr. 20, 2005.
  • Gat, Erann, Robust Low-computation Sensor-driven Control for Task-Directed Navigation, Proceedings of the 1991 IEEE, International Conference on Robotics and Automation, Sacramento, California, Apr. 1991, pp. 2484-2489.
  • Hitachi: News release: The home cleaning robot of the autonomous movement type (experimental machine) is developed, website: http://www.i4u.com/japanreleases/hitachirobot.htm., accessed Mar. 18, 2005.
  • Kärcher Product Manual Download webpage: “http://wwwkarchercom/bta/downloadenshtml?ACTION=SELECTTEILENR&ID=rc3000&submitButtonName=Select+Product+Manual” and associated pdf file “5959-915enpdf (47 MB) English/English” accessed Jan. 21, 2004.
  • Karcher RC 3000 Cleaning Robot—user manual Manufacturer: Alfred-Karcher GmbH & Co, Cleaning Systems, Alfred Karcher-Str 28-40, PO Box 160, D-71349 Winnenden, Germany, Dec. 2002.
  • Kärcher RoboCleaner RC 3000 Product Details webpages: “http://wwwrobocleanerde/english/screen3html” through “...screen6html” accessed Dec. 12, 2003.
  • Karcher USA, RC3000 Robotic Cleaner, website: http://www.karcher-usa.com/showproducts.php?op=viewprod¶m1=143¶m2=¶m3=, accessed Mar. 18, 2005.
  • koolvac Robotic Vacuum Cleaner Owner's Manual, Koolatron, Undated.
  • NorthStar Low-Cost, Indoor Localization, Evolution robotics, Powering Intelligent Products.
  • Put Your Roomba . . . On “Automatic” Roomba Timer>Timed Cleaning-Floorvac Robotic Vacuum webpages: http://cgi.ebay.com/ws/eBayISAPI.dll?ViewItem&category=43575198387&rd=1, accessed Apr. 20, 2005, 5 pgs.
  • Put Your Roomba . . . On “Automatic” webpages: “http://www.acomputeredge.com/roomba,” accessed Apr. 20, 2005.
  • RoboMaid Sweeps Your Floors So You Won't Have To, the Official Site, website: http://www.thereobomaid.com/, accessed Mar. 18, 2005.
  • Robot Review Samsung Robot Vacuum (VC-RP30W), website: http://www.onrobo.com/reviews/AtHome/VacuunCleaners/on00vcrp30rosam/index.htm, accessed Mar. 18, 2005.
  • Robotic Vacuum Cleaner-Blue, website: http://www.sharperimage.com/us/en/catalog/productview.jhtml?sku=S1727BLU, accessed Mar. 18, 2005.
  • Schofield, Monica, “Neither Master nor Slave” A Practical Study in the Development and Employment of Cleaning Robots, Emerging Technologies and Factory Automation, 1999 Proceedings EFA'99 1999 7th IEEE International Conference on Barcelona, Spain Oct. 18-21, 1999, pp. 1427-1434.
  • Wired News: Robot Vacs Are in the House, website: http://www.wired.com/news/print/0,1294,59237,00.html, accessed Mar. 18, 2005.
  • Zoombot Remote Controlled Vaccum-RV-500 New Roomba 2, website: http://cgi.ebay.com/ws/eBayISAPI.dll?ViewItem&category=43526&item=4373497618&rd=1, accessed Apr. 20, 2005.
  • European Search Report dated Apr. 3, 2009 in connection with Application No. 09154458.5-2206. 6 pages.
  • NPL0115 Robot Locator Beacon System, Chamberlin, et al.
  • NPL0120 Range-Only Robot Localization and SLAM with Radio, Robotics Institute Carnegie Mellon—Author: Derek Kurth.
  • NPL0126 Physical Management of IT Assets in Data Centers Using RFID Technologies, Eric Champy.
  • NPL0128 Robust Statistical Methods for Securing Wireless Localization in Sensor Networks, Zang Li, Wade.
  • NPL0129 Sweep Strategies for a Sensory Driven Behavior Based Vacuum Cleaning Agent, Keith L. Doty and Reid R. Harrison.
  • European Search Report dated Oct. 6, 2009 in connection with EP Application No. 09168571.9-2206. 149 pages.
  • International Search Report in application PCT/US2006/046398, dated Oct. 31, 2007.
  • Office action dated Sep. 16, 2010 received in corresponding U.S. Appl. No. 11/633,869.
  • Chamberlin, et al., Robot Locator Beacon System, NASA Goddard SFC, Design Proposal, Feb. 17, 2006.
  • NorthStar Low-Cost, Indoor Localization, Evolution robotics, Powering Intelligent Products, Date 2005.
  • NPL0127 Radio Frequency Identification: Tracking ISS Consumables, Author Unknown.
  • NPL0128 Robust Statistical Methods for Securing Wireless Localization in Sensor Networks, Zang Li, Wade, Date Apr. 2005.
  • Examination report dated Dec. 22, 2010 for corresponding application (EP) 10174129.6.
  • Prassler et al., A Short History of Cleaning Robots, Autonomous Robots 9, 211-226, 2000, 16 pages.
  • Examination report dated Mar. 10, 2011 for corresponding application JP 2010-282185.
  • Examination report dated Jul. 20, 2011 for corresponding application JP 2008-543548.
  • U.S. Appl. No. 60/605,066, Aug. 27, 2004, Taylor.
  • U.S. Appl. No. 60/605,181, Aug. 27, 2004, Taylor.
  • Roboking—not just a vacuum cleaner, a robot!
  • Robovacc1999.
  • SVET Computers—New Technologies—Robot vacuum claeaner.
  • http://www.popco.net/zboard/view.php?id=tr review&no=40.
  • http://www.rakuten.co.jp/matsucame/587179/711512/.
  • http://www.gizmag.com/go/1282/.
  • http://www.electrolux-ui.com:8080/2002%5C822%5C833102EN.pdf.
  • http://www.robocon.co.kr/trilobite/Presentation Trilobite Kor 030104.ppt.
  • http://www.frc.ri.cmu.edu/˜hpm/talks/Extras/trilobote.desc.html.
  • http://www.euroflex.tv/novita dett.php?id=15.
  • http://www.consensus.com.au/SoftwareAwards/CSAarchive/CSA2004/CSAart04/FloorBot/FX1%20Product%20Description&2020&20January%202004.pdf.
  • http://www.robotsandrelax.com/PDFs/RV400Manual.pdf.
  • www.hitachi.co.jp/rd/pdf/topics/hitac2003 10.pdf.
  • http://www.hitachi.co.jp/New/cnews/hl030529hl030529.pdf.
  • http://robotbg.com/news/2003/04/22/lg announces the first robotic vacuum cleaner of korea.
  • www.metapo.com/support/usermanual.pdf.
  • http://us.aving.net/news/view.php?articleld=23031.
  • http://www.taipeitimes.com/News/worldbiz/archives/2002/03/26/0000129338.
  • http://techon.nikkeibp.co.jp/members/01db/200203/1006501/.
  • http://ascii.jp/elern/000/000/330/330024/.
  • http://www.itmedia.co.jp/news/0111/16/robofesta m.html.
  • http://us.aving.net/news/view.php?articield=7257.
  • http://www.toshiba.co.jp/tech/review/2004/09/59 09pdf/a13.pdf.
  • http://warp.ndl.go.jp/info:ndljp/pid/258151/www.soumu.go.jp/joho tsusin/policyreports/chousa/netrobot/pdf/030214 1 33 a.pdf.
  • http://www.sk.rs/1999/10/sknt01.html.
  • Jarosiewicz et al. “Final Report—Lucid”, Unversity of Florida, Departmetn of Electrical and Computer Engineering, EEL 5666—Intelligent Machine Design Laboratory, 50 pages, Aug. 4, 1999.
  • Jensfelt, et al. “Active Global Localization for a mobile robot using multiple hypothesis tracking”, IEEE Transactions on Robots and Automation vol. 17, No. 5, pp. 748-760, Oct. 2001.
  • Jeong et al. “An intelligent map-buiding system for indoor mobile robot using low cost photo sensors”SPIE vol. 6042, 6 pages, 2005.
  • Kahney, “Robot Vacs are in the House,” www.wired.com/news/technology/o,1282,59237,00.html, 6 pages, Jun. 18, 2003.
  • Karcher “Product Manual Download Karch”, www.karcher.com, 17 pages, 2004.
  • Karcher “Karcher RoboCleaner RC 3000”, www.robocleaner.de/english/screen3.html, 4 pages, Dec. 12, 2003.
  • Karcher USA “RC 3000 Robotics cleaner”, www.karcher-usa.com, 3 pages, Mar. 18, 2005.
  • Karlsson et al., The vSLAM Algorithm for Robust Localization and Mapping, Proceedings of the 2005 IEEE International Conference on Robotics and Automation, Barcelona, Spain, pp. 24-29, Apr. 2005.
  • Karlsson, et al Core Technologies for service Robotics, IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS 2004), vol. 3, pp. 2979-2984, Sep. 28-Oct. 2, 2004.
  • King “Helpmate-TM—Autonomous mobile Robots Navigation Systems”, SPlE vol. 1388 Mobile Robots pp. 190-198, 1990.
  • Kleinberg, The Localization Problem for Mobile Robots, Laboratory for Computer Science, Massachusetts Institute of Technology, 1994 IEEE, pp. 521-531, 1994.
  • Knight et al., “Localization and Identification of Visual Landmarks”, Journal of Computing Sciences in Colleges, vol. 16 Issue 4, 2001 pp. 312-313, May 2001.
  • Kolodko et al. “Experimental System for Real-Time Motion Estimation”, Proceedings of the 2003 IEEE/ASME International Conference on Advanced Intelligent Mechatronics (AIM 2003), pp. 981-986, 2003.
  • Komoriya et al., Planning of Landmark Measurement for the Navigation of a Mobile Robot, Proceedings of the 1992 IEEE/RSJ International Conference on Intelligent Robots and Systems, Raleigh, NC pp. 1476-1481, Jul. 7-10, 1992.
  • Koolatron “KOOLVAC—Owner's Manual”, 13 pages.
  • Krotov, et al. “Digital Sextant”, Downloaded from the internet at: http://www.cs.cmu.edu/˜epk/, 1 page, 1995.
  • Krupa et al. “Autonomous 3-D Positioning of Surgical Instruments in Robotized Laparoscopic Surgery Using Visual Servoing”, IEEE Transactions on Robotics and Automation, vol. 19, No. 5, pp. 842-853, Oct. 5, 2003.
  • Kuhl, et al. “Self Localization in Environments using Visual Angles” , VRCAI '04 Poceedings of the 2004 ACM SIGGRAPH international conference on Virtual Reality continuum and its applications in industry, pp. 472-475, 2004.
  • Kurth, “Range-Only Robot Localization and SLAM with Radio”, http://www.ri.cmu.edu/pubfiles/pub4/kurthderek20041/kurthderek20041.pdf. 60 pages, May, 2004.
  • Lambrinos, et al. “A mobile robot employing insect strategies for navigation”, http//www8.cs.umu.se/kurser/TDBD17/VT04/dl/Assignment%20Papers/lambrinos-RAS-2000.pdf. 38 pages, Feb. 19, 1999.
  • Lang et al. “Visual Measurement of Orientation Using Ceiling Features”, 1994 IEEE, pp. 552-555, 1994.
  • Lapin, “Adaptive position estimation for an automated guided vehicle”, SPIE vol. 1831 Mobile Robots VII, pp. 82-94, 1992.
  • LaValle et al. “Robot Motion Planning in a Changing, Partially Predictable Environment”, 1994 IEEE International Symposium on Intelligent Control, Columbus, OH, pp. 261-266, Aug. 16-18, 1994.
  • Lee, et al. “Localization Of a Mobile Robot Using the Image of a Moving Object”, lEEE Transaction on Industrial Electronics, vol. 50, No. 3 pp. 612-619, Jun. 2003.
  • Lee, et al. “Development of Indoor Navigation system for Humanoid Robot Using Multi-sensors Integration”, ION NTM, San Diego, CA pp. 798-805, Jan 22-24, 2007.
  • Leonard, et al. “Mobile Robot Localization by tracking Geometric Beacons”IEEE Transaction on Robotics and Automation, vol. 7, No. 3 pp. 376-382, Jun. 1991.
  • Li et al. “Robost Statistical Methods for Securing Wireless Localization in Sensor Networks”, Wireless Information Network Laboratory, Rutgers University.
  • Li et al. “Making a Local Map of Indoor Environments by Swiveling a Camera and a Sonar”, Proceedings of the 1999 IEEE/RSJ International Conference on Intelligent Robots and Systems, pp. 954-959, 1999.
  • Lin, et al.. “Mobile Robot Navigation Using Artificial Landmarks”, Journal of robotics System 14(2). pp. 93-106, 1997.
  • Linde “Dissertation, “On Aspects of Indoor Localization”” https://eldorado.tu-dortmund.de/handle/2003/22854, University of Dortmund, 138 pages, Aug. 28, 2006.
  • Lumelsky, et al. “An Algorithm for Maze Searching with Azimuth Input”, 1994 IEEE International Conference on Robotics and Automation, San Diego, CA vol. 1, pp. 111-116, 1994.
  • Luo et al., “Real-time Area-Covering Operations with Obstacle Avoidance for Cleaning Robots,” 2002, IEeE, pp. 2359-2364.
  • Ma “Thesis: Documentation On Northstar”, California Institute of Technology, 14 pages, May 17, 2006.
  • Madsen, et al. “Optimal landmark seletion for triangulaton of robot position”, Journal of Robtics and Autonomous Systems vol. 13 pp. 277-292, 1998.
  • Martishevcky, “The Accuracy of point light target coordinate determination by dissectoral tracking system”, SPIE vol. 2591 pp. 25-30.
  • Matsutek Enterprises Co. Ltd “Automatic Rechargeable Vacuum Cleaner”, http://matsutek.manufacturer.globalsources.com/si/6008801427181/pdtl/Home-vacuurn/10 . . . , Apr. 23, 2007.
  • McGillem, et al. “Infa-red Lacation System for Navigation and Autonomous Vehicles”1988 IEEE International Conference on Robotics and Automation, vol. 2, pp. 1236-1238, Apr. 24-29, 1988.
  • McGillem, et al. “A Beacon Navigation Method for Autonomous Vehicles”, IEEE Transactions on Vehicular Technology, vol. 38. No. 3, pp. 132-139, Aug. 1989.
  • Michelson “Autonomous Navigation”, 2000 Yearbook of Science & Technology, McGraw-Hill, New York, ISBN 0-07-052771-7, pp. 28-30, 1999.
  • Miro, et al. “Towards Vision Based Navigation in Large Indoor Environments”, Proceedings of the IEEE/RSJ International Conference on Intelligent Robots and Systems, Beijing, China, pp. 2096-2102, Oct. 9-15, 2006.
  • MobileMag “Samsung Unveils High-tech Robot Vacuum Cleaner”, http://www.mobilemag.com/content/100/102/C2261/, 4 pages, Mar. 18, 2005.
  • Monteiro, et al. “Visual Servoing for Fast Mobile Robot: Adaptive Estimation of Kinematic Parameters”, Proceedings of the IECON '93., International Conference on Industrial Electronics, Maui, HI, pp. 1588-1593, Nov. 15-19, 1993.
  • Moore, et al. A simple Map-bases Localization strategy using range measurements, SPIE vol. 5804 pp. 612-620, 2005.
  • Munich et al. “SIFT-ing Through Features with ViPR”, IEEE Robotics & Automation Magazine. pp. 72-77, Sep. 2006.
  • Munich et al “ERSP: A Software Platform and Architecture for the Service Robotics Industry”, Intelligent Robots and Systems, 2005. (IROS 2005), pp. 460-467, Aug. 2-6, 2005.
  • Nam, et al. “Real-Time Dynamic Visual Tracking Using PSD Sensors and extended Trapezoidal Motion Planning”, Applied Intelligence 10, pp. 53-70, 1999.
  • Nitu et al. “Optomechatronic System for Position Detection of a Mobile Mini-Robot”, IEEE Ttransactons on Indusrial Electronics, vol. 52, No. 4, pp. 969-973, Aug. 2005.
  • On Robo “Robot Reviews Samsung Robot Vacuum (VC-RP3OW)”, www.onrobo.com/reviews/ATHome/vacuumcleaners/on00vcrb30rosam/index.htm.. 2 pages, 2005.
  • InMach “lntelligent Machines”, www.inmach.de/inside.html, 1 page. Nov. 19, 2008.
  • Innovation First “2004 EDU Robot Controller Reference Guide”, http://www.ifirobotics.com, 13 pgs., Mar. 1, 2004.
  • Borges et al. “Optimal Mobile Robot Pose Estimation Using Geometrical Maps”, IEEE Transactions on Robotics and Automation, vol. 18, No. 1, pp. 87-94, Feb. 2002.
  • Braunstingl et al. “Fuzzy Logic Wall Following of a Mobile Robot Based on the Concept of General Perception” ICAR '95, 7th International Conference on Advanced Robotics, Sant Feliu De Guixols, Spain, pp. 367-376, Sep. 1995.
  • Bulusu, et al. “Self Configuring Localization systems: Design and Experimental Evaluation”, ACM Transactons on Embedded Computing Systems vol. 3, No. 1 pp. 24-60, 2003.
  • Caccia, et al. “Bottom-Following for Remotely Operated Vehicies”, 5th IFAC conference, Alaborg, Denmark, pp. 245-250 Aug. 1, 2000.
  • Chae, et al. “StarLITE: A new artificial landmark for the navigation of mobile robots”, http://www.irc.atr.jp/jk-nrs2005/pdf/Starlite.pdf, 4 pages, 2005.
  • Chamberlin et al. “Team 1: Robot Locator Beacon System” NASA Goddard SFC, Design Proposal, 15 pages, Feb. 17, 2006.
  • Champy “Physical management of IT assets in Data Centers using RFID technologies”, RFID 2005 University, Oct. 12-14, 2005 (NPL0126).
  • Chiri “Joystck Control for Tiny OS Robot”htp://www.eecs.berkeley.edu/Program/ugrad/superb/papers2002/chiri.pdf. 12 pages, Aug. 8, 2002.
  • Christensen et al. “Theoretical Methods for Planning and Control in Mobile Robotics” 1997 First international Conference on Knowledge-Based Intelligent Electronic Systems, Adelaide, Australia, pp. 81-86, May 21-27, 1997.
  • Andersen et al., “Landmark based navigation strategies”, SPIE Conference on Mobile Robots XIII, SPIE vol. 3525, pp.
  • Clerentin et al. “A localzation mehod based on two omnidirectional pecepton systems cooperation” Proc of IEEE International Conference on Robotics & Automation, San Francisco, CA vol. 2, pp. 1219-1224, Apr. 2000.
  • Corke “High Performance Visual serving for robots end-point control”. SPIE vol. 2056 Intelligent robots and computer vision 1993.
  • Cozman et al. “Robot Localization using a Computer Vision Sextant”, IEEE International Midwest Conference on Robotics and Automation, pp. 106-111, 1995.
  • D'Orazio, et al. “Model based Vision System for mobile robot position estimation”, SPIE vol. 2058 Mobile Robots VIII, pp. 38-49, 1992.
  • De Bakker, et al. “Smart PSD-array for sheet of light range imaging”, Proc. Of SPIE vol. 3965. pp. 1-12, May 15, 2000.
  • Desaulniers, et al. “An Efficient Algorithm to find a shortest path for a car-like Robot”, IEEE Transactions on robotics and Automation vol. 11 No. 6, pp. 819-828, Dec. 1995.
  • Dorfmüller-Ulhaas “Optical Tracking From User Motion to 3D Interaction”, http://www.cg.tuwien.ac.at/research/publications/2002/Dorfrnueller-Ulhaas-thesis, 182 pages. 2002.
  • Dorsch, et al. “Laser Triangulation: Fundamental uncertainty in distance measurement”, Applied Optics, vol. 33 No. 7. pp. 1306-1314, Mar. 1, 1994.
  • Dudek et al. “Localizing A Robot with Minimum Travel ”Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms, vol. 27 No. 2 pp. 583-604, Apr. 1998.
  • Dulimarta, et al. “Mobile Robot Localization in Indoor Environment”, Pattern Recognition, vol. 30, No. 1, pp. 99-111, 1997.
  • EBay “Roomba Timer → Timed Cleaning—Floorvac Robotic Vacuum”, Cgi.ebay.com/ws/eBay[SAP].dll?viewitem&category=43526&item=4375198387&rd=1, 5 pages, Apr. 20, 2005.
  • Electrolux “Welcome to the Electrolux trilobite” www.electroluxusa.com/node57.asp?currentURL=node142.asp%3F, 2 pages, Mar. 18, 2005.
  • Eren, et al. “Accuracy in position estimation of mobile robots based on coded infrared signal transmission”, Proceedings: Integrating Intelligent Instrumentation and Control, Instrumentation and Measurement Technology Conference, 1995. IMTC/95, pp. 548-551, 1995.
  • Eren, et al. “Operation of Mobile Robots in a Structured Infrared Environment”, Proceedings. ‘Sensing, Processing, Networking’, IEEE Instrumentation and Measurement Technology Conference, 1997 (IMTC/97), Ottawa, Canada vol. 1, pp. 20-25, May 19-21, 1997.
  • Barker, “Navigation by the Stars—Ben Barker 4th Year Project” Power point pp. 1-20.
  • Becker, et al. “Reliable Navigation Using Landmarks ” IEEE International Conference on Robotics and Automation, 0/7803-1965-6, pp. 401-406, 1995.
  • Benayad-Cherif, et al., “Mobile Robot Navigation Sensors” SPIE vol. 1831 Mobile Robots, VII, pp. 378-387, 1992.
  • Facchinetti, Claudio et al. “Using and Learning Vision-Based Self-Positioning for Autonomous Robot Navigation”, ICARCV '94, vol. 3 pp. 1694-1698, 1994.
  • Betke, et al., “Mobile Robot localization using Landmarks” Proceedings of the IEEE/RSJ/GI International Conference on Intelligent Robots and Systems '94 “Advanced Robotic Systems and the Real World” (IROS '94), vol.
  • Facchinetti, Claudio et al, “Self-Positioning Robot Navigation Using Ceiling Images Sequences”, ACCV '95, 5 pages, Dec. 5-8, 1995.
  • Fairfield, Nathaniel et al. “Mobile Robot Localization with Sparse Landmarks”, SPIE vol. 4573 pp. 148-155, 2002.
  • Favre-Bulle, Bernard “Efficient tracking of 3D-Robot Position by Dynamic Triangulation”, IEEE Instrumentation and Measurement Technology Conference IMTC 98 Session on Instrumentation and Measurement in Robotics, vol. 1, pp. 446-449, May 18-21, 1998.
  • Fayman “Exploiting Process Integration and Composition in the context of Active Vision”. IEEE Transactions on Systems, Man, and Cybernetics—Part C: Application and reviews, vol. 29 No. 1, pp. 73-86, Feb. 1999.
  • Florbot GE Plastics Image (1989-1990).
  • Franz, et al. “Biomimetric robot navigation”, Robotics and Autonomous Systems vol. 30 pp. 133-153, 2000.
  • Friendly Robotics “Friendly Robotics-Friendly Vac, Robotic Vacuum Cleaner”, www.friendlyrobotics.com/vac.htm. 5 pages Apr. 20, 2005.
  • Fuentes, et al. “Mobile Robotics 1994”, University of Rochester. Computer Science Department, TR 588, 44 pages, Dec. 7, 1994.
  • Bison, P et al. “Using a structured beacon for cooperative position estimation” Robotics and Autonomous Systems vol. 29, No. 1, pp. 33-40, Oct. 1999.
  • Fukuda, et al. “Navigation System based on Ceiling Landmark Recognition for Autonomous mobile robot”, 1995 IEEE/RSJ International Conference on Intelligent Robots and Systems 95. ‘Human Robot Interaction and Cooperative Robots’, Pittsburgh, PA, pp. 1466/1471, Aug. 5-9, 1995.
  • Gionis “A hand-held optical surface scanner for environmental Modeling and Virtual Reality”, Virtual Reality World, 16 pages 1996.
  • Goncalves et al. “A Visual Front-End for Simultaneous Localization and Mapping”, Proceedings of the 2005 IEEE International Conference on Robotics and Automation, Barcelona, Spain, pp. 44-49, Apr. 2005.
  • Gregg et al. “Autonomous Lawn Care Applications”, 2006 Florida Conference on Recent Advances in Robotics, FCRAR 2006, pp. 1-5, May 25-26, 2006.
  • Hamamatsu “SI PIN Diode S5980, S5981 S5870—Multi-element photodiodes for surface mounting”, Hamatsu Photonics, 2 pages Apr. 2004.
  • Hammacher Schlemmer “Electrolux Trilobite Robotic Vacuum” www.hammacher.com/publish/71579.asp?promo=xsells, 3 pages, Mar. 18, 2005.
  • Haralick et al. “Pose Estimation from Corresponding Point Data”, IEEE Transactions on systems, Man, and Cybernetics, vol. 19, No. 6, pp. 1426-1446. Nov. 1989.
  • Hausler “About the Scaling Behaviour of Optical Range Sensors”Fringe'97 Prceedings of the 3rd International Workshop on Automatic Processing of Fringe Patterns, Bremen, Germany, pp. 147-155, Sep. 15-17, 1997.
  • Blaasvaer et al “AMOR—An Autonomous Robot NAvigation System”, Proceedings of the IEEE International Conference on Systems, Man, and Cybernetics, pp. 2266-2271, 1994.
  • Hoag, et al. “Navigation and Guidance in interstellar space”, ACTA Astronautica vol. 2, pp. 513-533 , Feb. 14, 1975.
  • Huntsberger et al. “CAMPOUT: A Control Architecture for Tightly Coupled Coordination of Multirobot Systems for Planetary Surface Exploration”, IEEE Transactions on Systems, Man, and Cybernetics—Part A: Systems and Humans, vol. 33, No. 5, pp. 560-559, Sep. 2003.
  • Iirobotics.com “Samsung Unveils Its Multifunction Robot Vacuum”, www.iirobotics.com/webpages/hotstuff.php?ubre=111, 3 pages, Mar. 18, 2005.
  • OnRobo “Samsung Unveils Its Multifunction Robot Vacuum”, www.onrobo.comienews/0210/samsungvacuum.shtml, 3 pages, Mar. 18, 2005.
  • Pages et al. “Optimizing Plane-to-Plane Positioning Tasks by Image-Based Visual Servoing and Structured Light”, IEEE Transactions on Robotics. vol. 22, No. 5. pp. 1000-1010, Oct. 2006.
  • Pages et al “A camera-projector system for robot positioning by visual servoing”, Proceedings of the 2006 Conference on Computer Vision and Pattern Recognition Workshop (CVPRW06), 8 pages, Jun. 17-22, 2006.
  • Pages; et al. “Robust decoupled visual servoing based on structured light”, 2005 IEEE/RSJ Int. Conf. on Intelligent Robots and Systems, pp. 2676-2681, 2005.
  • Park et al. “A Neural Network Based Real-Time Robot Tracking Controller Using Position Sensitive Detectors,” IEEE World Congress on Computational Intelligence., 1994 IEEE International Conference on Neutral Networks, Orlando, Florida pp. 2754-2758, Jun. 27-Jul. 2, 1994.
  • Park, et al. “Dynamic Visual Servo Control of Robot Manipulators using Neutral Networks”, The Korean Institute Telematics and Electronics, vol. 29-B, No. 10. pp. 771-779, Oct. 1992.
  • Paromtchik “Toward Optical Guidance of Mobile Robots”.
  • Paromtchik, et al. “Optical Guidance System for Multiple mobile Robots”, Proceedings 2001 ICRA. IEEE International Conference on Robotics and Automation, vol. 3, pp. 2935-2940 (May 21-26, 2001).
  • Penna, et al. “Models for Map Building and Navigation”, IEEE Transactions on Systems. Man. And Cybernetics. vol. 23 No. 5, pp. 1276-1301, Sep./Oct. 1993.
  • Pirjanian “Reliable Reaction”. Proceedings of the 1996 IEEE/SICE/RSJ International Conference on Muitisensor Fusion and Integration for Intelligent Systems, pp. 158-165, 1996.
  • Pirjanian “Challenges for Standards for consumer Robotics”, IEEE Workshop on Advanced Robotics and its Social impacts, pp. 260-264, Jun. 12-15, 2005.
  • Piranian et al “Distributed Control for a Modular, Reconfigurable Cliff Robot” Proceedings of the 2002 IEEE International Conference on Robotics & Automation, Washington, D.C. pp. 4083-4088, May 2002.
  • Pirjanian et al. “Representation and Execution of Plan Sequences for Multi-Agent Systems”, Proceedings of the 2001 IEEE/RSJ International Conference on Intelligent Robots and Systems, Maui, Hawaii, pp. 2117-2123, Oct. 29-Nov. 3, 2001.
  • Pirjanian et al. “Multi-Robot Target Acquisition using Multiple Objective Behavior Coordination”. Proceedings of the 2000 IEEE International Conference on Robotics & Automation, San Francisco, CA, pp. 2696-2702, Apr. 2000.
  • Pirjanian et al. “A decision-theoretic approach to fuzzy behavior coordination”, 1999 IEEE International Symposium on Computational Intelligence in Robotics and Automation, 1999. CIRA '99., Monterey, CA, pp. 101-106, Nov. 8-9, 1999.
  • Pirjanian et al. “Improving Task Reliability by Fusion of Redundant Homogeneous Modules Using Voting Schemes”, Proceedings of the 1997 IEEE International Conference on Robotics and Automation, Albuquerque, NM, pp. 425-430. Apr. 1997.
  • Prassler et al., “A Short History of Cleaning Robots”, Autonomous Robots 9, 211-226, 2000, 16 pages.
  • Radio Frequency Identification: Tracking ISS Consumables, Author Unknown, 41 pages (NPL0127).
  • Remazeilles, et al. “Image based robot navigation in 3D environments”, Proc. Of SPIE, vol. 6052, pp. 1-14, Dec. 6, 2005.
  • Rives, et al. “Visual servoing based on ellipse features”, SPIE vol. 2056 Intelligent Robots and Computer Vision pp. 356-367, 1993.
  • Robotics World Jan. 2001: “A Clean Sweep”(Jan. 2001).
  • Ronnback “On Methods for Assistive Mobile Robots”, http://www.openthesis.org/documents/methods-assistive-mobile-robots-595019.html, 218 pages, Jan. 1, 2006.
  • Roth-Tabak, et al. “Environment Model for mobile Robots Indoor Navigation”, SPIE vol. 1388 Mobile Robots pp. 453-463, 1990.
  • Sadath M Maiik et al. “Virtual Prototyping for Conceptual Design of a Tracked Mobile Robot”. Electrical and Computer Engineering, Canadian Conference on, IEEE, PI. May 1, 2006, pp. 2349-2352.
  • Sahin, et al. “Development of a Visual Object Localization Module for Mobile Robots”, 1999 Third European Workshop on Advanced Mobile Robots, (Eurobot '99), pp. 65-72, 1999.
  • Salomon, et al. “Low-Cost Optical Indoor Localization system for Mobile Objects without Image Processing”, IEEE Conference on Emerging Technologies and Factory Automation. 2006. (ETFA '06). pp. 629-632, Sep. 20-22, 2006.
  • Sato “Range Imaging Based on Moving Pattern Light and Spatio-Temporal Matched Filter”, Proceedings International Conference on Image Processing, vol. 1., Lausanne, Switzerland. pp. 33-36, Sep. 16-19, 1996.
  • Schenker et al. “Lightweight rovers for Mars science exploration and sample return”, Intelligent Robots and Computer Vision XVI, SPIE Proc. 3208, pp. 24-36, 1997.
  • Sebastian Thrun, Learning Occupancy Grid Maps With Forward Sensor Models, School of Computer Science, Carnegie Mellon University, pp. 1-28.
  • Shimoga et al. “Touch and Force Reflection for Telepresence Surgery”, Engineering in Medicine and Biology Society, 1994. Engineering Advances: New Opportunities for Biomedical Engineers. Proceedings of the 16th Annual International Conference of the IEEE, Baltimore, MD, pp. 1049-1050, 1994.
  • Sim, et al “Learning Visual Landmarks for Pose Estimation”, IEEE International Conference on Robotics and Automation, vol. 3, Detroit, MI, pp. 1972-1978, May 10-15, 1999.
  • Sobh et al. “Case Studies in Web-Controlled Devices and Remote Manipulation”, Automation Congress, 2002 Proceedings of the 5th Biannual World, pp. 435-440, Dec. 10, 2002.
  • Stella et al. “Self-Location for Indoor Navigation of Autonomous Vahicles”, Part of the SPIE conference on Enhanced and Synthetic Vision SPIE vol. 3364 pp. 298-302, 1998.
  • Summet “Tracking Locations of Moving Hand-held Displays Using Projected Light”, Pervasive 2005, LNCS 3468 pp. 37-46 (2005).
  • Svedman et al. “Structure from Stereo Vision using Unsynchronized Cameras for Simultaneous Localization and Mapping”, 2005 IEEE/RSJ International Conference on Intelligent Robots and Systems, pp. 2993-2998, 2005.
  • Takio et al. “Real-Time Position and Pose Tracking Method of Moving Object Using Visual Servo System”, 47th IEEE International Symposium on Circuits and Systems, pp. 167-170, 2004.
  • Teller “Pervasive pose awareness for people, Objects and Robots”, http://www.ai.mit.edu/lab/dangerous-ideas/Spring2003/teller-pose.pdf, 6 pages, Apr. 30, 2003.
  • Terada et al. “An Acquisition of the Relation between Vision and Action using Self-Organizing Map and Reinforcement Learning”, 1998 Second International Conference on Knowledge-Based Intelligent Electronic Systems, Adelaide, Australiam pp. 429-434, Apr. 21-23, 1998.
  • The Sharper Image “e-Vac Robotic Vacuum, S1727 Instructions”www.sharperimage.com, 18 pages.
  • The Sharper Image “Robotic Vacuum Cleaner—Blue” www.Sharperimage.com, 2 pages, Mar. 18, 2005.
  • The Sharper Image “E Vac Robotic Vacuum”www.sharperimage.com/us/en/templates/products/pipmorework1printable.jhtml, 2 pages, Mar. 18, 2005.
  • TheRobotStore.com “Friendly Robotics Robotic Vacuum RV400—The Robot Store”, www.therobotstore.com/s.nl/sc.9/category.-109/it.A/id.43/f, 1 page, Apr. 20, 2005.
  • TotalVac.com RC3000 RoboCleaner website Mar. 18, 2005.
  • Trebi-Olennu et al. “Mars Rover Pair Cooperatvely Transporting a Long Payload” Proceedings of the 2002 IEEE International Conference on Robotics & Automation, Washington, D.C. pp. 3136-3141, May 2002.
  • Tribelhom et al., “Evaluating the Roomba: A low-cost, ubiquitous platform for robotics research and education,” 2007, IEEE, pp. 1393-1399.
  • Tse et al. “Design of a Navigation System for a Household Mobile Robot Using Neural Networks”, Department of Manufacturing Engg. & Engg. Management, City University of Hong Kong, pp. 2151-2156, 1998.
  • UAMA (Asia) Industrial Co., Ltd. “RobotFamily”, 2005.
  • Watanabe et al. “Position Estimation of Mobile Robots With Internal and External Sensors Using Uncertainty Evolution Technique”, 1990 IEEE International Conference on Robotics and Automation, Cincinnati, OH, pp. 2011-2016, May 13-18, 1990.
  • Watts “Robot, boldly goes where no man can”, The Times—pp. 20, Jan. 1985.
  • Wijk at al. “Triangulation-Based Fusion of Sonar Data with Application in Robot Pose Tracking ”, IEEE Transactions on Robotics and Automation, vol. 16, No. 6, pp. 740-752, Dec. 2000.
  • Wolf et al. “Robust Vision-based Localization for Mobile Robots Using an Image Retrieval System Based on Invariant Features”, Proceedings of the 2002 IEEE international Conference on Robotics & Automation, Washington, D.C. pp. 359-365, May, 2002.
  • Wolf et al. “Robust Vision-Based Localization by Combining an Image-Retrieval System with Monte Carol Localization”, IEEE Transactions on Robotics, vol. 21. No. 2. pp. 208-216, Apr. 2005.
  • Wong “ElED Online>> Robot Business”, Ed Online ID# 13114, 17 pages, Jul. 2006.
  • Yamamoto et al “Optical Sensing for Robot Perception and Localization”, 2005 IEEE Workshop on Advanced Robotics and its Social Impacts, pp. 14-17, 2005.
  • Yata et al. “Wall Following Using Angle Information Measured by a Single Ultrasonic Transducer”, Proceedings of the 1998 IEEE, International Conference on Robotics & Automation, Leuven, Belgium, pp. 1590-1596, May, 1998.
  • Yun, et al. “Image-Based Absolute Positioning System for Mobile Robot Navigation”, IAPR International Workshops SSPR, Hong Kong, pp. 261-269, Aug. 17-19, 2006.
  • Yun, et al. “Robust Positioning a Mobile Robot with Active Beacon Sensors”, Lecture Notes in Computer Science, 2006, vol. 4251, pp. 690-897, 2006.
  • Yuta, et al. “Implementation of an Active Optical Range sensor Using Laser Slit for In-Door Intelligent Mobile Robot”, IEE/RSJ International workshop on Intelligent Robots and systems (IROS 91) vol. 1, Osaka, Japan, pp. 415-420, Nov. 3-5, 1991.
  • Zha et at. “Mobile Robot Localization Using Incomplete Maps for Change Detection in a Dynamic Environment”, Advanced Intelligent Mechatronics '97. Final Program and Abstacts., IEEE/ASME International Conference, pp. 110, Jun. 16-20, 1997.
  • Zhang, et at. “A Novel Mobile Robot Localization Based on Vision”, SPIE vol. 6279, 6 pages, Jan. 29, 2007.
  • Euroflex Intellegente Monstre Mauele (English only except).
  • Roboking—not just a vacuum cleaner, a robot! Jan. 21, 2004, 5 pages.
  • SVET Computers—New Technologies—Robot vacuum cleaner, 1 page.
  • Popco.net Make your digital life http://www.popco.net/zboard/view.php?id=trreview&no=40 accessed Nov. 1, 2011.
  • Matsumura Camera Online Shop http://www.rakuten.co.jp/matsucame/587179/711512/ accessed Nov. 1. 2011.
  • Dyson's Robot Vacuum Cleaner—the DC06, May 2, 2004 http://www.gizmag.com/go/1282/ accessed Nov. 11, 2011.
  • Electrolux Trilobite, http://www.electrolux-ui.com:8080/2002%5C822%5C833102EN.pdf 10 pages.
  • Electrolux Trilobite, Time to enjoy life, 38 pages http://www.robocon.co.kr/trilobite/PresentationTrilobitekor030104. ppt accessed Dec. 22, 2011.
  • Facts on the Trilobite http://www.frc.ri.cmu.edu/˜hpm/talks/Extras/trilobite.desc.html 2 pages accessed Nov. 1, 2011.
  • Eurofiex Jan. 1, 2006 http://www.euroflex.tv/novitadett.php?id=15 1 page accessed Nov. 1, 2011.
  • FloorBotics, VR-8 Floor Cleaning Robot, Product Description for Manuafacturers, http://www.consensus.com.au/SoftwareAwards/CSAarchive/CSA2004/CSAart04/FloorBot/F.
  • Friendly Robotics, 18 pages http://www.robotsandrelax.com/PDFs/RV400Manual.pdf accessed Dec. 22, 2011.
  • It's eye, 2003 www.hitachi.co.jp/rd/pdf/topics/hitac200310.pdf 2 pages.
  • Hitachi, May 29, 2003 http://www.hitachi.co.jp/New/cnews/hl030529hl030529.pdf 8 pages.
  • Robot Buying Guide, LG announces the first robotic vacuum cleaner for Korea. Apr. 21, 2003 http://robotbg.com/news/2003/04122/lgannouncesthefirstroboticvacu.
  • CleanMate 365, Intelligent Automatic Vacuum Cleaner, Model No. Q0-1, User Manual www.metapo.com/support/usermanual.pdf 11 pages.
  • UBOT, cleaning robot capable of wiping with a wet duster, http://us.aving.net/news/view.php?articield=23031, 4 pages accessed Nov. 1, 2011.
  • Taipei Times, Robotic vacuum by Matsuhita about of undergo testing, Mar. 26, 2002 http://www.taipeitimes.com/News/worldbiz/archives/2002/03/26/0000129338 accessed.
  • Tech-on! http://techon.nikkeibp.co.jp/members/01db/200203/1006501/, 4 pages, accessed Nov. 1, 2011.
  • http://ascii.jp/elem/000/000/330/330024/.
  • IT media http://www.itmedia.co.jp/news/0111/16/robofestam.htmi accessed Nov. 1, 2011.
  • Yujin Robotics, an intelligent cleaning robot ‘iclebo Q’ AVING USA http://us.aving.net/news/view.php?articleld=7257, 8 pages accessed Nov. 4, 2011.
  • Special Reports, Vacuum Cleaner Robot Operated in Conjunction with 3G Celluar Phone vol. 59. No. 9 (2004) 3 pages http://www.toshiba.co.jp/tech/review/2004/09/590.
  • Toshiba Corporation 2003, http://warp.ndl.go.jp/info:ndljp/pid/258151/www.soumu.go.jp/johotsusin/policyreports/chousa/netrobot/pdf/030214133a.pdf 16 pages.
  • http://www.karcher.de/versions/intg/assets/video/24roboen.swf. Accessed Sep. 25, 2009.
  • McLurkin “The Ants: A community of Microrobots”, Paper submitted for requirements of BSEE at MIT, May 12, 1995.
  • Grumet “Robots Clean House”, Popular Mechanics, Nov. 2003.
  • McLurkin Stupid Robot Tricks: A Behavior-based Distributed Algorithm Library for Programming Swarms of Robots, Paper submitted for requirements of BSEE at MIT, May 2004.
  • Kurs et al, Wireless Power transfer via Strongly Coupled Magnetic Resonances, Downloaded from www.sciencemag.org , Aug. 17, 2007.
  • Hitachi “Feature”, http://kadenfan.hitachi.co.jp/robot/feature/feature.html, 1 page Nov. 19, 2008.
  • Japanese Examiner A. Sato Japanese Office Action in Japanese Application No. 2008-543546, Oct. 31, 2011, 4 pages.
  • Japanese Examiner A. Sato Japanese Office Action in Japanese Application No. 2008-543547, Oct. 11, 2011, 6 pages.
Patent History
Patent number: 8271129
Type: Grant
Filed: Dec 4, 2006
Date of Patent: Sep 18, 2012
Patent Publication Number: 20070250212
Assignee: iRobot Corporation (Bedford, MA)
Inventors: Michael J. Halloran (Waltham, MA), Jeffrey W. Mammen (Westford, MA), Tony L. Campbell (Pepperell, MA), Jason S. Walker (Medford, MA), Paul E. Sandin (Brookline, NH), John N. Billington, Jr. (Georgetown, MA), Daniel N. Ozick (Newton, MA)
Primary Examiner: Khoi Tran
Assistant Examiner: Jamie Figueroa
Attorney: Fish & Richardson P.C.
Application Number: 11/633,883