Patent Grant
11115798
This specification relates generally to pairing a beacon with a mobile robot.
A mobile lawn mowing robot can navigate about an environment to mow a confined area in that environment. The robot can determine its location within the environment by detecting beacons within the environment. The beacons can be passive beacons that reflect signals emitted by the robot or active beacons that emit signals detected by the robot. The robot can use these signals from the beacons to restrict its movement to the confined area within the environment and/or to enable systematic coverage of the lawn area.
In some examples, a method performed by a mobile lawn mowing robot includes pairing a beacon with the mobile lawn mowing robot. Pairing the beacon with the mobile lawn mowing robot includes determining a distance between the beacon and the mobile lawn mowing robot and confirming that the beacon is within a pairing distance from the mobile lawn mowing robot based on a comparison of the determined distance to a pairing distance. Pairing the beacon with the mobile robot lawn mowing robot further includes, subsequent to confirming that the beacon is within the pairing distance from the mobile lawn mowing robot, pairing the beacon with the mobile lawn mowing robot, and, following pairing, detecting wideband or ultra-wideband signals from the beacon, and using the wideband or ultra-wideband signals to enable navigation over an area.
In some examples, the method performed by the mobile lawn mowing robot can include outputting a request, via a user interface, for confirmation that the beacon is among a number of beacons to which the mobile lawn mowing robot is to communicate. The method can include receiving, in response to the request, the confirmation that the beacon is among the number of beacons to which the mobile lawn mowing robot is to communicate. Pairing can be performed following receipt of the confirmation.
In some examples, pairing the beacon with the mobile lawn mowing robot can include, prior to determining the distance between the beacon and the mobile lawn mowing robot, identifying a broadcast from the beacon. The broadcast can include a beacon address for the beacon and a predefined address not specific to any beacon. Pairing the beacon with the mobile lawn mowing robot can include, in response to the broadcast, sending, to the beacon at the beacon address, a robot address for the mobile lawn mowing robot. Pairing the beacon with the mobile lawn mowing robot can include receiving, from the beacon, a message. A distance between the beacon and the mobile lawn mowing can be determined from the message. Pairing the beacon with the mobile lawn mowing robot further can further include storing in memory on the mobile lawn mowing robot the beacon address in association with one or more other addresses for one or more other beacons paired with the mobile lawn mowing robot. Pairing the beacon with the mobile lawn mowing robot can further include outputting a request to move the beacon toward the mobile lawn mowing robot. The message from the beacon can be received following output of the request to move the beacon.
The method performed by the mobile lawn mowing robot can further include, following pairing, sending the beacon address to one or more other beacons. The method can include sending, to the beacon, one or more other addresses for the one or more other beacons. The method can include transmitting the beacon address and the robot address to a server for storage in association with a user account. The method can include identifying an error associated with the beacon and outputting an indication of the error via a user interface. The user interface can include a feature for indicating that the error is being addressed by replacing the beacon. The method can further include, in response to the indication that the error is being addressed by replacing the beacon, causing the mobile lawn mowing robot to listen for the predefined address not specific to any beacon.
In some examples, the method performed by the mobile lawn mowing robot can include receiving a passcode from the beacon and comparing the passcode to a passcode associated with the mobile lawn mowing lawn mowing robot. Pairing can be performed following confirmation that the passcode from the beacon matches the passcode associated with the mobile lawn mowing robot.
In some examples, a method performed by a beacon for pairing the beacon with a mobile lawn mowing robot includes outputting a broadcast to the mobile lawn mowing robot. The broadcast includes a beacon address for the beacon and a predefined address not specific to any beacon. The method includes, following the broadcast, receiving, from the mobile lawn mowing robot, a robot address for the mobile lawn mowing robot. The method includes outputting, from the beacon and to the mobile lawn mowing robot at the robot address, a message. A distance between the beacon and the mobile lawn mowing robot is determined from the message. The method includes receiving, from the mobile lawn mowing robot, a confirmation that the beacon is paired with the mobile lawn mowing robot. The method includes, in response to the confirmation, registering the beacon as paired with the mobile lawn mowing robot.
In some examples, registering can include storing, in memory on the beacon, the robot address of the mobile lawn mowing robot.
In some examples, the method performed by the beacon can include receiving one or more addresses of one or more other beacons that are paired with the mobile lawn mowing robot and storing the one or more other addresses in memory on the beacon. The one or more addresses can be received from the mobile lawn mowing robot following registering.
In some examples, a lawn mowing system includes beacons to transmit wideband or ultra-wideband signals. Each beacon has a different associated beacon address and a robot address stored in a memory. The lawn mowing system includes a mobile lawn mowing robot associated with the robot address. The mobile lawn mowing robot is paired with each of the beacons. The mobile lawn mowing robot includes memory. The memory stores instructions that are executable and stores each of the different associated beacon addresses for each of the beacons. The mobile lawn mowing robot includes one or more processing devices to execute the instructions to perform operations. The operations include receiving wideband or ultra-wideband signals representing a beacon address, determining whether the received wideband or ultra-wideband signals are associated with one of the beacons paired with the mobile lawn mowing robot based on the beacon address represented by the wideband or ultra-wideband signals, localizing the mobile lawn mowing robot based on the received wideband or ultra-wideband signals.
In some examples, the operations can include adding an additional beacon to the beacons paired with the mobile lawn mowing robot. The mobile lawn mowing robot can be configured to detect the wideband or ultra-wideband signals and to use the wideband or ultra-wideband signals to enable navigation over an area. The operations for adding the additional beacon to the beacons can include identifying a broadcast from the additional beacon. The broadcast can include an additional beacon address for the additional beacon and a predefined address not specific to any beacon. The operations can include, in response to the broadcast, sending, to the additional beacon at the additional beacon address, the robot address. The operations can include receiving, from the additional beacon, a message from which a distance between the additional beacon and the mobile lawn mowing robot is determined. The operations can include comparing the distance to a predefined distance. The operations can include registering the additional beacon as paired with the mobile lawn mowing robot when the distance is less than the predefined distance.
The additional beacon can include memory storing instructions that are executable and one or more processing devices to execute the instructions to perform operations. The operations can include outputting the broadcast to the mobile lawn mowing robot. The operations can include receiving the robot address from the mobile lawn mowing robot and outputting the message to the mobile lawn mowing robot at the robot address. The operations can include receiving, from the mobile lawn mowing robot, a confirmation that the additional beacon is paired with the mobile lawn mowing robot and, in response to the confirmation, registering the additional beacon as paired with the mobile lawn mowing robot.
The operations for adding the additional beacon to the beacons can include outputting a request for confirmation that the additional beacon is among a number of beacons to which the mobile lawn mowing robot is to communicate. The operations can include receiving, in response to the request, the confirmation that the additional beacon is among the number of beacons to which the mobile lawn mowing robot is to communicate. Registering can be performed following receipt of the confirmation. Registering can include storing, in memory on the mobile lawn mowing robot, an additional beacon address in association with the different associated beacon addresses.
The operations for adding the additional beacon to the beacons can include outputting a request to move the additional beacon toward the mobile lawn mowing robot. The message from the additional beacon can be received following output of the request to move the additional beacon.
The operations for adding the additional beacon to the beacons can include, following registering, sending the additional beacon address to the beacons. The operations can include, following registering, sending, to the additional beacon, the different associated beacon addresses.
The operations for adding the additional beacon to the beacons paired with the mobile lawn mowing robot further can include identifying an error associated with the beacon and outputting an indication of the error via a user interface. The user interface can include a feature for indicating that the error is being addressed by replacing the beacon. The operations can further include, in response to an indication that the error is being addressed by replacing the beacon, causing the mobile lawn mowing robot to listen for the predefined address not specific to any beacon.
The operations for adding the additional beacon to the beacons paired with the mobile lawn mowing robot further can include transmitting the additional beacon address and the robot address to a server for storage in association with a user account.
In some examples, a lawn mowing system includes a set of beacons and a mobile lawn mowing robot. The set of beacons includes a first beacon having a first beacon address and a robot address stored in a memory. The first beacon is configured to transmit wideband or ultra-wideband signals including the first beacon address. The set of beacons includes a second beacon having a second beacon address that differs from the first beacon address and the robot address stored in a memory. The second beacon is configured to transmit wideband or ultra-wideband signals including the second beacon address. The set of beacons includes a third beacon having a third beacon address that differs from the first and second beacon addresses and the robot address stored in a memory. The third beacon is configured to transmit wideband or ultra-wideband signals including the third beacon address. The mobile lawn mowing robot is paired with each of the first, second, and third beacons. The mobile lawn mowing robot includes memory. The memory stores instructions that are executable and stores the beacon first, second, and third beacon addresses. The mobile lawn mowing robot includes one or more processing devices to execute the instructions to perform operations. The operations include receiving the wideband or ultra-wideband signals and localizing the mobile lawn mowing robot based on the wideband or ultra-wideband signals received from at least one of the first, second, and third beacons.
Advantages of the foregoing may include, but are not limited to, the following. Each beacon can be exclusively paired to the mobile lawn mowing robot. As a result, nearby mobile lawn mowing robots that are not paired to the beacon cannot use signals emitted by the beacon to perform navigation and mowing operations. Pairing can also make beacons less attractive to would-be thieves. For example, by requiring a passcode for beacons to be paired with a mobile lawn mowing robot, the paired beacons are only useful to those who know the passcode. As a result, instances of beacon theft may be reduced.
Any two or more of the features described in this specification, including in this summary section, can be combined to form implementations not specifically described herein.
The mobile lawn mowing robots, or operational aspects thereof, described herein can include, or be controlled by, one or more computer program products that includes instructions that are stored on one or more non-transitory machine-readable storage media, and that are executable on one or more processing devices to control (e.g., to coordinate) the operations described herein. The mobile lawn mowing robots, or operational aspects thereof, described herein can be implemented as part of a system or method that can include one or more processing devices and memory to store executable instructions to implement various operations.
The details of one or more implementations are set forth in the accompanying drawings and the description below. Other features and advantages will be apparent from the description and drawings, and from the claims.
Like reference numerals in different figures indicate like elements.
Described herein are example mobile lawn mowing robots (hereinafter also referred to as robots) configured to traverse mowable surfaces, such as lawns, fields, and other mowable areas, to perform various mowing operations including, but not limited to, cutting grass on the lawns. Also described herein are beacons that can communicate with the robots to enable navigation of the robots about the lawns. In some examples, a beacon can be exclusively paired to one or more robots such that only a robot paired with the beacon can localize to the beacon. Pairing operations between the robots and the beacons are described herein. After the pairing operations are executed to pair the robots with their sets of beacons, the robots can navigate using wideband or ultra-wideband signals emitted by the beacons in their sets of beacons.
In this regard, pairing includes establishing a relationship between a robot and its paired beacons so that the robot recognizes, for navigation and localization, signals from the paired beacons only, and not signals from other beacons to which the robot is not paired. During manufacture of the beacons and the robot, the robot and three or more beacons may be paired to one another. Thus, when a user receives the beacons and the robot, the user can readily place the beacons on a lawn without performing pairing operations to pair the beacons with the robot. After the user trains the robot to use signals emitted from its paired beacons to recognize a boundary of its lawn, the robot can use the signals from its paired beacons to identify the boundary as the robot navigates around the lawn automatically (e.g., without user input).
For example, as shown in
Because different robots are paired to different sets of beacons, signals from unpaired beacons will not influence robot operation. In some implementations, signals transmitted between a robot and its paired beacons include wideband or ultra-wideband signals. Wideband signals may include radiofrequency signals having a frequency between 5925 and 7250 MHz. The ultra-wideband signals may include radiofrequency signals having a frequency greater than 500 MHz, for example, between 3.1 GHz and 10.6 GHz.
In some situations, the user may need to replace a beacon in the set of beacons or to add a beacon to the set of beacons already assigned to the system. During mowing operations, the robot uses signals from beacons to accurately estimate its location within the lawn. The user may need to replace a beacon if the beacon becomes damaged or otherwise unusable to ensure that the robot can detect a sufficient number of signals from the beacons during its mowing operations. In some cases, the user may need to add a beacon to the set of beacons placed on the lawn. For example, as shown in
In the example of
The environment 104 also includes a beacon 114 that is not paired with the first robot 100 or the second robot 102. The beacon 114 is in communication range of both robots 100 and 102 (e.g., the robots 100, 102 can detect wideband or ultra-wideband signals emitted by the beacon 114), and can be paired with either of those robots using the methods described herein. For example, first robot 100 can add the beacon 114 to the set of beacons already paired with the robot 100. Beacon 114 can replace an existing beacon or augment the existing beacons to improve localization and navigation of the first robot 100. For example, the robot may be unable to detect signals from three beacons at a location on lawn 106, or the signals from one of the beacons may be weak in that area. Beacon 114 may be added to that area of the lawn and paired to robot 100 to provide the robot 100 with better beacon signals from that area as described above. Examples of processes for pairing beacons, such as beacon 114, to a robot are described herein.
As described herein, the new beacon 114 can be configured such that the new beacon 114 can only be paired with robots that are within a pairing distance 118 from the position of the new beacon 114. In this regard, to pair the new beacon 114 with the first robot 100, the user 116 can place the first robot 100 on the first lawn 106 at a distance 200 that is within the pairing distance 118, as shown in
As noted herein, robots 100, 102 can include systems that allow the robots 100, 102 to navigate through the environment 104, to perform mowing operations on the lawns 106, 108, and to communicate with beacons (e.g., the first beacons 110, the second beacons 112, and the beacon 114).
The robot 300 includes a controller 308 (e.g., an electronic processor or one or more other appropriate processing devices) that can execute stored instructions to control the navigation, mowing, and communication operations of the robot 300.
A communications system 310 operable with the controller 308 can include a wireless transceiver—such as, for example, a wideband or ultra-wideband wireless transceiver—that enables the controller 308 to communicate wirelessly with other devices in the environment, such as the beacons. The communications system 310 allows the controller 308 to communicate with beacons to pair the robot 300 with an appropriate beacon or set of beacons, among other operations executed by the communications system 310. The communication system 310 additionally allows the robot 300 to receive wideband or ultra-wideband signals from the beacons so that the robot 300 can navigate about the environment and localize within the environment using those signals. The communications system 310 can include an additional wireless transceiver that can allow the controller 308 to communicate using Wi-Fi, Bluetooth, or other wireless protocols. This wireless transceiver also enables the controller 308 to communicate with remote systems, such as a smartphones, tablets, desktop and laptop computers, and servers. A memory 312, which is accessible to controller 308, stores information locally on the robot.
In some implementations, the robot 300 can include a movement sensor that generates movement signals indicative of at least one of a distance traveled by the robot, a speed of the robot, or an acceleration of the robot. The movement sensor can also detect relative rotations around all axes (e.g., an IMU). In some cases, the controller 308 can use the movement signals to perform Simultaneous Localization and Mapping (SLAM) techniques that the robot 300 can use, in addition to using the localization techniques described herein with respect to the beacons, to estimate its position within the environment. Based on the movement signals, the controller 308 can generate a map of the environment and determine the pose of the robot. The movement signals can include data from, for example, encoders associated with a drive of the robot, an optical mouse sensor, an inertial measurement unit (IMU), an accelerometer, or a gyroscope disposed on the robot. The data of the movement signals can be used as dead reckoning data that the controller 308 uses to determine relative positions of the robot. Thus, as the robot 300 navigates about the environment, the controller 308, using the movement signals, can determine a relative position of the robot 300 measured relative to previous positions of the robot. Accurate over relatively short distances, dead reckoning can be prone to drift errors that accumulate over time. Accumulated drift can affect both the distance computations and the heading computations.
The beacons described herein include systems to implement communications and pairing with a robot.
The controller 404 can control the communications system 406 to emit wireless signals for different purposes and functions. For example, during a pairing operation to pair the robot 300 with the beacon 400, the communications system 406 can be controlled to emit a broadcast that the robot 300 can identify to initiate pairing operations with the beacon 400. The communications system 406 can be controlled to transmit a message that the controller 308 of the robot 300 can use to determine a distance (e.g., the distance 200) between the robot 300 and the beacon 400. During navigation and mowing operations of the robot 300, the beacon 400 can emit wireless signals that the robot 300 uses to localize itself within the environment. A memory 408 that is accessible to the controller 404 permits local storage of information.
The beacon 400 can also include a replaceable power source 410 (e.g., a battery) that provides power to the various systems of the beacon 400. The controller 404 can monitor a power level of the power source 410. The communications system 406 can transmit status updates about the power level of the power source 410.
As depicted in a block diagram shown in
The memory 312 and the memory 408 of the beacon 400 can store various information transmitted through the network 500. The memory 312 can store a robot address 520 unique to the robot 300. The robot address 520 is a unique identifier (e.g., a serial number) for the robot 300 that can be sent with wireless signals (e.g., wideband or ultra-wideband signals) transmitted by the communications system 310. The memory 408 of the beacon 400, when the robot 300 is paired with the beacon 400, can also store the robot address 520. By storing the robot address 520, the memory 408 enables the beacon 400 to be uniquely paired to the robot 300, as described in more detail herein.
The memory 408 of the beacon 400 stores a beacon address 525 unique to the beacon 400. Similar to the robot address 520, the beacon address 525 is a unique identifier for the beacon 400. The beacon 400 can transmit the beacon address 525 with wireless transmissions of its communications system 406. When the robot 300 is paired with the beacon 400, the memory 312 can store the beacon address 525. By storing the robot address 520, the memory 408 can enable the beacon 400 to be paired to the robot 300 such that other robots cannot pair to the beacon 400, as described in more detail herein. By storing the beacon address 525, the memory 312 enables the robot 300 to be paired to the beacon 400 such that, during navigation and mowing operations, the robot 300 can communicate with the beacon 400, as described in more detail herein.
The robot 300 and the beacon 400 can also both store a predefined address that is not specific to any beacon or robot. During a pairing operation, the communications system 310 and the communications system 406 can communicate with one another using the predefined address prior to the robot 300 receiving the beacon address 525 and the beacon 400 receiving the robot address 520.
A passcode 530 can be stored in both the memory 312 of the robot 300 and the memory 408 of the beacon 400. As described herein, to pair the beacon 400 with another robot, the passcode 530 may be entered into, for example, a user interface of the other robot to allow the other robot to pair with the beacon 400.
The other beacons 515 form part of a set of beacons already paired with the robot 300. For example, these beacons may have been previously paired to the robot by a user or during manufacture of the robot and beacons. The other beacons 515 each include a beacon address. Each of the other beacons 515 includes a memory to store its unique beacon address. The memory 408 can store beacon addresses 535 of the other beacons 515 so that the other beacons are exclusively paired to the robot 300. During the pairing operations, the controller 308 can cause the communications system 310 to propagate the beacon addresses 535 to each of other beacons paired to the robot 300. As a result, the memories of the other beacons 515 and the memory 408 of the beacon 400 can also store the other beacon addresses 535. The memories of the other beacons 515 can also store the passcode 530.
In some implementations, the server 505 can store the robot address 520, the beacon address 525, the passcode 530, and the other beacon addresses 535 in memory storage associated with a user account 540. The robot 300 can communicate the information stored in the user account 540 by communicating with the server 505 using the communications system 310. The information stored in the user account 540 can serve as a backup to storage elsewhere on the network.
To control the operations of the robot 300 (e.g., the pairing, navigation, and mowing operations), the user can interact with the user interface 545. The user device 510 can communicate with the communications system 310 of the robot 300 using, for example, a Bluetooth or a Wi-Fi connection. The user can additionally or alternatively use the user device 510 to view information and enter information pertaining to the operations of the robot 300. As described herein, the user can invoke the user interface 545 and/or the user device 510 to, for example, confirm various operations associated with pairing the robot 300 with the beacon 400 and enter the passcode 530 to allow for pairing to occur. The user can also use the user interface 545 of the robot 300 or the user device 510 to view and respond to errors and requests transmitted by the communications system 310 of the robot 300.
The beacon 606 can then determine (610) whether an existing robot address is stored in memory of the beacon 606. In some cases, the existing address is the address of the robot 604 and the process 600 thus ends as the robot 604 is already paired to the beacon 606. If the beacon 606 determines (612) that the existing address is stored in memory and is not the address of the robot 604, a passcode confirmation operation 614 is initiated in which the beacon 606 and the robot 604 requests confirmation of a passcode. The execution of the passcode confirmation operation 614 indicates that the beacon 606 was previously paired to a robot that is not the robot 604. The password confirmation operation 614 can reduce theft from occurring while allowing users who know the passcode to re-use previously paired beacons. The user may wish to re-use beacons previously paired to the old robot for pairing to the new robot. For example, the user 602 may have received a new robot (e.g., the robot 604) to replace an old robot previously possessed by the user 602. When the user 602 paired the old robot with the beacon 606, the user 602 may have inputted a passcode that was stored on the memory of the beacon 606 or the user 602 may have received a passcode associated with the old robot that was automatically stored on the memory of the beacon 606 when the old robot and the beacon 606 were paired (e.g., by the user or during manufacture). Provided that the passcode entered by the user 602 matches the passcode associated with beacon 606, the pairing process 600 can be continued to pair the beacon 606 with the robot 604. The user 602 can enter the passcode on a user interface (e.g., on a user device 510 or on the user interface of the robot 604). A more detailed example of the passcode confirmation operation 614 is described herein with respect to
If the beacon 606 determines (616) that an existing address is not stored in the memory of the beacon 606, a beacon and address exchange operation 618 is executed. In the exchange operation 618, the beacon 606 receives a robot address uniquely associated with the robot 604, and the robot 604 receives a beacon address uniquely associated with the beacon 606. Following the exchange operation 618, a distance confirmation operation 620 is executed in which the robot 604 is placed within a pairing distance (e.g., the pairing distance 118) from the beacon 606. The pairing distance 118 can be, for example, 0 to 3 meters. The user 602 may adjust the position of the robot 604 or the beacon 606 to ensure that the robot 604 is within the pairing distance from the beacon 606. Details of the beacon and address exchange operation 618 and the distance confirmation operation 620 are described herein with respect to
Following the distance confirmation operation 620, a pairing confirmation operation 622 is executed in which pairing between the robot 604 and the beacon 606 is confirmed or denied. The robot 604 can output a request through the user interface for confirmation to pair the robot 604 with the beacon 606. If the user does not confirm (624) the pairing, the robot 604 can output (626) another request to confirm (622) the pairing. In some implementations when the user 602 does not intend to pair the beacon 606 with the robot 604, the user 602 can end the pairing process 600 at the operation 624. The user 602 may be intending to pair another beacon to the robot 604 and can restart the pairing process 600 for the other beacon.
If the user confirms (628) the pairing, an address registration operation 630 is initiated in which the beacon 606 stores the robot address in its memory and the robot 604 stores the beacon address in its memory. During the address registration operation 630, a server can receive the beacon address and the robot address to store the addresses in a user account associated with the user 602 and the robot 604.
After execution of the address registration operation 630, the robot 604 determines (632) whether it has addresses of other paired beacons stored within its memory. If the robot 604 determines (634) that its memory includes addresses of other paired beacons, an address propagation operation 636 is executed. In this case, the beacon 606 is an additional beacon to be added to the existing set of paired beacons. These operations are thus operations for adding the beacon 606 to the set of beacons paired with the robot 604. During the address propagation operation 636, the beacon address of the beacon 606 is transmitted to each of the other paired beacons to be stored in their memories. The addresses of the other paired beacons are also transmitted to the beacon 606 to be stored in its memory.
If the robot 604 determines (638) that its memory does not include addresses of other paired beacons, the address propagation operation 636 is not executed and the process 600 proceeds to operation 640 in which the user determines (640) whether additional beacons will be paired to the robot 604. The pairing confirmation operation 622, the address registration operation 630, the address propagation operation 636, and intervening operations are described in more detail with respect to
If the user determines (642) that additional beacons will be paired to the robot 604, the process 600 can be initiated again for an additional beacon, beginning with the beacon activation operation 608 for the additional beacon. If the user determines (644) that additional beacons will not be paired to the robot 604, the process 600 ends (646).
After the user 602 has established the set of beacons paired with the robot 604, the user 602 can train the robot 604 to recognize a perimeter of the lawn to be mowed. By way of example, as shown in
The user 116 can manually define the perimeter of the first lawn 106 by pushing the first robot 100 such that the first robot 100 follows a path along the perimeter. The user 116 can manually navigate the first robot 100 using, for example, a handle attached to the first robot 100. As the first robot 100 moves about the perimeter of the first lawn 106, the communications system 310 receives the wideband or ultra-wideband signals from the first beacons 110 and the beacon 114. The controller 308 can store time-of-flight information for each of the wideband or ultra wideband signals to localize and memorize the perimeter of the first lawn 106, thus completing the perimeter teaching operation.
Once the perimeter has been taught, the first robot 100 can navigate about the first lawn 106 and use the wideband and ultra-wideband signals from the first beacons 110 and the beacon 114 to localize within the environment 104. The first robot 100 can execute a mowing operation in which it cuts grass on the first lawn 106 automatically, e.g., without further intervention from the user 116.
During the navigation and mowing operations about the first lawn 106, the first robot 100 can monitor power levels of beacons paired with the first robot 100 and inform the user 116 when a beacon (e.g., one of the first beacons 110 or the beacon 114) needs to be replaced or needs to have its power source replaced. An example of monitoring the beacons and addressing errors detected from monitoring the beacons is described in more detail with respect to the flowchart of
Referring to the flowchart shown in
The operations of the process 700 occur, if, during the determining operation 610, the beacon 606 determines (616) that an existing robot address is not stored in its memory. The beacon 606 outputs (708) a broadcast of the beacon address on a predefined address. The beacon address is a unique identifier associated with the beacon 606 and stored in the memory of the beacon 606. The predefined address can also be stored on the memory of the beacon 606. The predefined address is not associated with any beacon or robot. The broadcast can therefore include the beacon address for the beacon 606 and the predefined address not specific to any beacon or robot. The broadcast output by the beacon 606 can be transmitted using a wideband or ultra wideband signal. The beacon 606 can continue to output the broadcast until another device receives the broadcast and responds.
The user 602 can communicate with the robot 604 by interacting with the user interface of the robot 604 or by interacting with the user interface of the user device 510 (shown in
After the robot 604 has entered the pairing mode and the beacon 606 outputs (708) the broadcast, the robot 604 can receive (712) the broadcast and also receive (714) the beacon address. Upon receiving (714) the beacon address, the robot 604 can send (716) the robot address. In response to receiving (712, 714) the broadcast and the beacon address, the robot 604 can send (716) the robot address for the robot 604 to the beacon 606. In some cases, the robot 604 can send (716) the robot address on the predefined address. In some implementations, the robot 604 can send (716) the robot address on the beacon address.
After outputting (708) the broadcast of the beacon address, the beacon 606 can listen over the predefined address for a transmission of an address. In some cases, the beacon 606 can listen over the beacon address for the transmission of an address. When the robot 604 sends (716) the robot address, the beacon 606 can thus receive (718) the robot address.
The process 700 can continue with operations that are part of a distance confirmation operation (e.g., the distance confirmation operation 620) that ensures the robot 604 is located within a pairing distance from the beacon 606. The robot 604 determines (720) whether a distance between the robot 604 and the beacon 606 is less than the pairing distance. The robot 604 compares the distance with the pairing distance to determine (720) whether the distance is less than the pairing distance. To determine the distance between the robot 604 and the beacon 606, the robot 604 can receive a message from the beacon 606. The beacon 606 can output the message using a wireless signal, such as a wideband or ultra-wideband signal. From the message, robot 604 can determine the distance between the robot 604 and the beacon 606 and then can determine (720) whether the distance is less than the pairing distance. The robot 604 can determine the distance using, for example, time-of-flight of the wireless signal.
If the distance is greater (722) than the pairing distance, then the robot 604 outputs (724) a request to move the beacon 606 toward the robot 604 or the robot 604 toward the beacon 606. The robot 604 can output (724) the request via the user interface. The user interface can receive the request and indicate that the user should re-position (726) the beacon 606 or the robot 604 such that distance between the robot 604 and the beacon 606 is within the pairing distance.
As shown by way of example in
Referring back to
At the determining operation 720, if the robot 604 determines (732) that the distance is less than the pairing distance, the process 700 does not proceed to outputting (724) the request to move the beacon 606, as described above. Rather, the process 700 proceeds directly to the pairing confirmation operation 622.
Referring to the flowchart shown in
The robot 604 outputs (908) a request for confirmation from the user 602. The user 602 then inputs (910) the confirmation using the user interface. As shown in
The robot 604 determines (912) whether the user 602 input the confirmation. If robot 604 determines (914) that the user 602 denied the pairing, the process 900 ends. At this point, to pair a beacon with the robot 604, the process 600 can be implemented from the beginning at, for example, the beacon activation operation 608.
If the robot 604 determines (916) that the user 602 confirmed the pairing, the process 900 can proceed to operations to register the addresses in the robot 604 and the beacon 606 (e.g., the address registration operation 630). The robot 604 transmits (918) a confirmation to the beacon 606. The confirmation can indicate that the beacon 606 is paired with the robot 604. The robot 604 then registers (920) the beacon 606 as paired with the robot 604. In response to the transmitted (918) confirmation from the robot 604, the beacon 606 registers (922) the robot 604 as paired with the beacon 606. During the registration operations (918, 920), the robot 604 stores the beacon address associated with the beacon 606, and the beacon 606 stores the robot address associated with the robot 604.
The example shown in
Following registration (920, 922) of the pairing between the beacon 606 and the robot 604, the robot 604 can transmit (924) the beacon address 1115 and the robot address 1110 to the server for storage in association with a user account. In some cases, the user account can be identified using the robot address 1110. The stored addresses in the server can provide a backup for the pairings between the robot 604 and its paired beacons.
As described herein with respect to
In some cases though, the robot 604 may already be paired to an existing set of beacons formed by the other beacons 1100a, 1100b, 1100c. If the robot 604 determines (634) that the robot 604 does have other beacon addresses (e.g., the beacon addresses 1105a, 1105b, 1105c of
As shown in
Following propagation of the addresses to each of the beacons 1100a, 1100b, 1100c, and 606 in the set of beacons paired to the robot 604, the process 900 is complete, and the determination operation 640 described with respect to
As described with respect to
In some implementations, the beacon 606 can determine that it has previously paired with a robot by comparing the robot address stored in its memory to the robot address stored in other nearby beacons. The beacon 606 can use beacon addresses stored in the memory of the beacon 606 to determine the robot with which to communicate. The beacon 606 can then compare its stored robot address with their stored robot address, and if the stored robot addresses differ, the beacon 606 can indicate to the robot that the beacon passcode is required.
After the robot 604 has received indication that the beacon 606 has been previously paired, the robot 604 can output (1208) a request for a passcode to be entered by the user 602 using the user interface. In response to the request, the user 602 can input (1210) a passcode. After receiving the indication the beacon 606 has been paired, the robot 604 also outputs (1212) a request for a beacon passcode stored in the memory of the beacon 606. The beacon 606 then transmits (1214) the beacon passcode.
As shown in
To proceed with pairing the beacon 606 with the robot 604, the user 602 should enter the passcode 1302 that matches with a beacon passcode stored on the beacon 606. The beacon passcode can be selected during a previous pairing operation or when the system is initially setup. For example, during the pairing confirmation operation 622 of the previous pairing, the user device 510 can prompt the user 602 to enter a beacon passcode to be stored in the memory of the beacon 606. While the beacon 606 has been described to the store the passcode in memory, the robot 604 can also store the passcode in memory.
In some implementations, the passcode may be a predetermined passcode associated with the previous robot paired with the beacon 606. The predetermined passcode may be included in a user manual for the previous robot to allow the user 602 to enter the passcode when the user seeks pair beacons associated with the previous robot with other robots. The passcode is propagated to the beacons paired with the previous robot and stored in their memories. To pair these beacons paired with the previous robot to other robots, such as the robot 604, the user 602 needs to enter the passcode associated with the previous robot.
After receiving both the passcode input (1210) by the user and the beacon passcode, the robot 604 can compare the passcodes and determine (1216) if the passcodes match. If the robot 604 determines (1218) that the passcodes match, the pairing operations can continue with beacon and robot address exchange operations (e.g., the beacon and robot address exchange operation 618).
If the robot 604 determines (1220) that the passcodes do not match, the robot 604 can output (1208, 1212) the requests for passcodes again so that the user 602 can attempt to enter the correct passcode again. In some cases, the robot 604 will only output (1208, 1212) the requests for passcodes a predefined number of times so that the user 602 only has a finite number of times to attempt to enter the passcode. Once the robot 604 has output (1208, 1212) the requests the predefined number of times, the beacon 606 can receive an indication from the robot 604 that the user 602 has failed to enter the passcode. The beacon 606 can then be locked from being paired again until the beacon 606 undergoes a factory reset or for a certain time period, which prevents a would-be thief from trying an excessive amount of codes in a row. The factory reset can be triggered by, for example, remote communication of the server with the beacon 606 (with the robot 604 or the user device 510 serving as an intermediary between the server and the beacon 606) or through manually resetting the beacon via a control on the beacon itself. Following the pairing and communications operations described herein with respect to
During the mowing operation of the robot 604, the user 602 can, through device 510, monitor a status of the beacons paired with the robot 604 and determine when errors have occurred. Referring to the flowchart shown in
To traverse the lawn 805, the robot 604 receives (1508) wideband or ultra-wideband signals from the beacon 606 and the other beacons 1100. The robot 604 can detect these signals from the beacons 1100a, 1100b, 1100c, and 606 use the wideband or ultra-wideband signals to enable navigation over the lawn 805. For example, the robot 604 can determine its location during navigation by localizing using these signals, as described herein. When the beacon 606 and the other beacons 1100 transmit these signals, each beacon can transmit (1510) a battery status signal that can indicate the beacon's level of power available.
After the robot 604 receives (1508) the signals, the robot 604 can transmit user interface data to the user interface so that the user 602 can receive (1512) status updates regarding the battery statuses of the beacons 1100a, 1100b, 1100c, and 606. As shown in
The robot 604 can further use the received (1508) signals to determine (1514) whether signals have been received from each of the beacons 1100a, 1100b, 1100c, and 606. For example, the robot 604 can check that the number of signals received matches the number of beacons paired with the robot 604.
If the robot 604 determines (1516) that signals have been received from each of the beacons 1100a, 1100b, 1100c, and 606, the robot 604 then determines (1518) whether any of the battery levels 1600 are below a battery level threshold. The battery level threshold can correspond to a certain percent (e.g., 5% to 15%) of full battery level that can indicate when a battery of one of the beacons is close to empty.
The robot 604 can determine (1520) that one of the battery levels 1600 is below the battery level threshold, thus indicating that the battery of one of the beacons should be replaced. In some cases, during the determining operation 1514 for the signals, the robot 604 can determine (1522) that it has not received signals from each of the beacons 1100a, 1100b, 1100c, and 606, thus indicating that the user 602 should check that all of the beacons 1100a, 1100b, 1100c, and 606 can communicate with the robot 604. The robot 604 can indicate to the user 602 which of the beacons 1100a, 1100b, 1100c, and 606 requires attention.
These determinations (1520, 1522) identify an error associated with the beacons that can be addressed by the user 602. The robot 604 can output (1524) an indication of the error by, for example, transmitting user interface data that displays a prompt describing the error. In some example, as shown in
The user 602 can address (1526) the source of error by following instructions of the prompt 1700. The user 602 can, for example, replace the battery of the beacon 606 or replace the beacon 606 with a new beacon. The beacon 606 can be the same beacon as before when the errors were identified by the robot 604 if the battery of the beacon 606 was replaced. The beacon 606 can also be a new beacon that the user 602 used to replace the old beacon 606. After the user 602 addresses the source of the error, the beacon 606 outputs (1528) a broadcast of its beacon address on the predefined address.
After addressing (1526) the source of the error, the user 602 can invoke a confirm button 1715 indicating that the source of the error has been addressed or is being addressed. The robot 604 then receives (1530) indication that the error has been addressed or is being addressed. In response to this indication, the robot 604 can listen for the predefined address not specific to any beacon.
Upon detecting the predefined address, the robot 604 can receive (1532) the broadcast on the predefined address from the beacon 606 and then receive (1534) the new beacon address of the beacon 606. The robot 604 can determine (1536) whether the new beacon address is the same as the beacon address stored in the memory of the robot 604 prior to the error being addressed (1526) by the user 602.
The robot 604 can determine (1538) that the new beacon address is not the same as the stored beacon address due to, for example, the beacon 606 being replaced by the new beacon. The robot 604 can then send (1540) the robot address, and the beacon 606—which is a new beacon 606 different from the beacon 606 that experienced the error—can receive (1541) the robot address. In response to receiving the robot address, the beacon 606 can output (1542) a message to the robot 604.
In some cases, the robot 604 determines (1543) that the new beacon address is the same as the stored beacon address. The robot 604 accordingly does not need to send (1540) the robot address, as the beacon 606 and the robot 604 are already paired, and the beacon 606 can simply output (1542) the message to the robot 604. Upon receiving (1544) the message, the robot 604 can determine (1545) a distance between the robot 604 and the beacon 606.
Based on the distance between the robot 604 and the beacon 606, the robot 604 can determine (1546) whether the beacon 606 is located at the same location as the beacon 606 was previously located before the user 602 addressed (1526) the error. If more information is needed to decide if the new beacon 606 is placed in the location of the old beacon, other beacons 1110a, 1110b, 1110c in the beacon set can determine their distances to the new beacon 606 and to compare the newly determined distances against the prior distances to the old beacon. The robot 604 can determine (1548) that the beacon 606 is located at the same location as the beacon 606 was previously located. In this case, the robot 604 can simply update the stored beacon address with the new beacon address if the new beacon address was determined (1538) to be different than the stored beacon address. The robot 604 can also indicate to the beacon 606 to store the robot address, thus completing the pairing between the robot 604 and the beacon 606. If the new beacon address was determined (1543) to be the same as the stored beacon address, the robot 604 does not need to update the stored beacon address and instruct the beacon to store the robot address. The robot 604 can notify (1551) the user 602 that the error has been successfully addressed and that the beacon 606 is successfully paired to the robot 604.
In some cases, the robot 604 determines (1552) that the beacon 606 is not located at the same location as the beacon 606 was previously located. In some cases, if the other beacons 1110a, 1110b, 1110c have not been moved and beacon 606 can communicate with at least three other beacons, the robot 604 can automatically determine the new position of beacon 606 by measuring the ranges from beacon 606 to the other beacons 1110a, 1110b, 1110c. The robot 604 can determine whether multiple beacons have been moved based on, for example, a goodness of fit (e.g. least squares residual) of its localization estimate or other appropriate statistical metric.
In some cases, the robot 604 can notify the user 602 that additional training is required for the robot 604 to localize using the beacon 606. Upon receiving (1554) the notification that additional training is required, the user 602 can perform (1556) the additional training so that the robot 604 can localize and navigate using the beacon 606. The additional training can be the perimeter teaching operation described herein. The user 602 can train the robot 604 to use the beacon 606 by navigating the robot 604 along the perimeter of the lawn 805. After the user 602 has successfully performed (1556) the additional training, the robot 604 can notify (1551) the user 602 of the success. After notifying (1551) the user 602 of the success, the robot 604 can await further instructions from the user 602. For example, the user 602 can instruct the robot 604 to continue the mowing operations of the lawn 805 and therefore restart the process 1500.
The examples described herein can be implemented in a variety of ways without departing from the scope of the specification. In the examples described herein, a single robot (e.g., the robot 604) pairs with a beacon (e.g., the beacon 606). In some implementations, each beacon can be configured to be paired with one more mobile lawn mowing robots. Thus, multiple robots can easily perform mowing operations on the same lawn.
While a single robot has been described to pair with a set of beacons, the robot can also be configured to pair with multiple sets of beacons. In such cases, the robot can maintain multiple different lawns. Each lawn may contain a different set of beacons which will also have a different map associated with it. The user may select one of the stored maps to use during a mowing operation such that the user can select between the various sets of beacons paired with the robot.
While not shown in
A set of beacons can include three or more beacons, as described in some implementations herein. In some cases, the set of beacons can include fewer than three beacons. The robot can navigate using the signals emitted from the set of beacons including fewer than three beacons and can use on-board movement sensors to also execute dead reckoning processes to improve accuracy of its estimate of its location.
The robots described herein can be controlled, at least in part, using one or more computer program products, e.g., one or more computer programs tangibly embodied in one or more information carriers, such as one or more non-transitory machine-readable media, for execution by, or to control the operation of, one or more data processing apparatus, e.g., a programmable processor, a computer, multiple computers, and/or programmable logic components.
A computer program can be written in any form of programming language, including compiled or interpreted languages, and it can be deployed in any form, including as a stand-alone program or as a module, component, subroutine, or other unit suitable for use in a computing environment.
Operations associated with controlling the robots described herein can be performed by one or more programmable processors executing one or more computer programs to perform the functions described herein. Control over all or part of the robots described herein can be implemented using special purpose logic circuitry, e.g., an FPGA (field programmable gate array) and/or an ASIC (application-specific integrated circuit).
Processors suitable for the execution of a computer program include, by way of example, both general and special purpose microprocessors, and any one or more processors of any kind of digital computer. Generally, a processor will receive instructions and data from a read-only storage area or a random access storage area or both. Elements of a computer include one or more processors for executing instructions and one or more storage area devices for storing instructions and data. Generally, a computer will also include, or be operatively coupled to receive data from, or transfer data to, or both, one or more machine-readable storage media, such as mass PCBs for storing data, e.g., magnetic, magneto-optical disks, or optical disks. Machine-readable storage media suitable for embodying computer program instructions and data include all forms of non-volatile storage area, including by way of example, semiconductor storage area devices, e.g., EPROM, EEPROM, and flash storage area devices; magnetic disks, e.g., internal hard disks or removable disks; magneto-optical disks; and CD-ROM and DVD-ROM disks.
Elements of different implementations described herein may be combined to form other embodiments not specifically set forth above. Elements may be left out of the structures described herein without adversely affecting their operation. Furthermore, various separate elements may be combined into one or more individual elements to perform the functions described herein.
| Number | Name | Date | Kind |
|---|---|---|---|
| 2751030 | Null | Jun 1956 | A |
| 3128840 | Barrett | Apr 1964 | A |
| 3385041 | Douglas | May 1968 | A |
| 3457575 | Bienek | Jul 1969 | A |
| 3550714 | Bellinger | Dec 1970 | A |
| 3674316 | De Brey | Jul 1972 | A |
| 3924389 | Kita | Dec 1975 | A |
| 3937174 | Haaga | Feb 1976 | A |
| 3946543 | Templeton | Mar 1976 | A |
| 4119900 | Kremnitz | Oct 1978 | A |
| 4133404 | Griffin | Jan 1979 | A |
| 4163977 | Polstorff | Aug 1979 | A |
| 4306329 | Yokoi | Dec 1981 | A |
| 4328545 | Halsall et al. | May 1982 | A |
| 4369543 | Chen et al. | Jan 1983 | A |
| 4513469 | Godfrey et al. | Apr 1985 | A |
| 4545453 | Yoshimura et al. | Oct 1985 | A |
| 4556313 | Miller et al. | Dec 1985 | A |
| 4603753 | Yoshimura et al. | Aug 1986 | A |
| 4626995 | Lofgren et al. | Dec 1986 | A |
| 4674048 | Okumura | Jun 1987 | A |
| 4679152 | Perdue | Jul 1987 | A |
| 4696074 | Cavalli et al. | Sep 1987 | A |
| 4700301 | Dyke | Oct 1987 | A |
| 4700427 | Knepper | Oct 1987 | A |
| 4716621 | Zoni | Jan 1988 | A |
| 4733431 | Martin | Mar 1988 | A |
| 4756049 | Uehara | Jul 1988 | A |
| 4767237 | Cosman et al. | Aug 1988 | A |
| 4769700 | Pryor | Sep 1988 | A |
| 4777416 | George, II et al. | Oct 1988 | A |
| 4782550 | Jacobs | Nov 1988 | A |
| 4811228 | Hyyppa | Mar 1989 | A |
| 4854000 | Takimoto | Aug 1989 | A |
| 4887415 | Martin | Dec 1989 | A |
| 4893025 | Lee | Jan 1990 | A |
| 4909024 | Jones et al. | Mar 1990 | A |
| 4912643 | Beirne | Mar 1990 | A |
| 4918441 | Bohman | Apr 1990 | A |
| 4919224 | Shyu et al. | Apr 1990 | A |
| 4933864 | Evans et al. | Jun 1990 | A |
| 4962453 | Pong et al. | Oct 1990 | A |
| 4974283 | Holsten et al. | Dec 1990 | A |
| 5002145 | Waqkaumi et al. | Mar 1991 | A |
| 5017415 | Cosman et al. | May 1991 | A |
| 5086535 | Grossmeyer et al. | Feb 1992 | A |
| 5093955 | Blehert et al. | Mar 1992 | A |
| 5109566 | Kobayashi et al. | May 1992 | A |
| 5142985 | Stearns et al. | Sep 1992 | A |
| 5163202 | Kawakami et al. | Nov 1992 | A |
| 5163273 | Wojtkowski et al. | Nov 1992 | A |
| 5164579 | Pryor et al. | Nov 1992 | A |
| 5165064 | Mattaboni | Nov 1992 | A |
| 5204814 | Noonan et al. | Apr 1993 | A |
| 5208521 | Aoyama | May 1993 | A |
| 5216777 | Moro et al. | Jun 1993 | A |
| 5239720 | Wood et al. | Aug 1993 | A |
| 5261139 | Lewis | Nov 1993 | A |
| 5279672 | Belker, Jr. et al. | Jan 1994 | A |
| 5284522 | Kobayashi et al. | Feb 1994 | A |
| 5293955 | Lee | Mar 1994 | A |
| 5303448 | Hennessey et al. | Apr 1994 | A |
| 5319828 | Waldhauser et al. | Jun 1994 | A |
| 5321614 | Ashworth | Jun 1994 | A |
| 5324948 | Dudar et al. | Jun 1994 | A |
| 5341540 | Soupert et al. | Aug 1994 | A |
| 5353224 | Lee et al. | Oct 1994 | A |
| 5369347 | Yoo | Nov 1994 | A |
| 5410479 | Coker | Apr 1995 | A |
| 5438721 | Pahno et al. | Aug 1995 | A |
| 5440216 | Kim | Aug 1995 | A |
| 5444965 | Colens | Aug 1995 | A |
| 5446356 | Kim | Aug 1995 | A |
| 5454129 | Kell | Oct 1995 | A |
| 5455982 | Armstrong et al. | Oct 1995 | A |
| 5465525 | Mifune et al. | Nov 1995 | A |
| 5467273 | Faibish et al. | Nov 1995 | A |
| 5497529 | Boesi | Mar 1996 | A |
| 5507067 | Hoekstra et al. | Apr 1996 | A |
| 5515572 | Hoekstra et al. | May 1996 | A |
| 5528888 | Miyamoto et al. | Jun 1996 | A |
| 5534762 | Kim | Jul 1996 | A |
| 5537017 | Feiten et al. | Jul 1996 | A |
| 5539953 | Kurz | Jul 1996 | A |
| 5542146 | Hoekstra et al. | Aug 1996 | A |
| 5548511 | Bancroft | Aug 1996 | A |
| 5553349 | Kilstrom et al. | Sep 1996 | A |
| 5555587 | Guha | Sep 1996 | A |
| 5560077 | Crotchett | Oct 1996 | A |
| 5568589 | Hwang | Oct 1996 | A |
| 5611106 | Wulff | Mar 1997 | A |
| 5611108 | Knowlton et al. | Mar 1997 | A |
| 5613261 | Kawakami et al. | Mar 1997 | A |
| 5621291 | Lee | Apr 1997 | A |
| 5622236 | Azumi et al. | Apr 1997 | A |
| 5634237 | Paranjpe | Jun 1997 | A |
| 5634239 | Tuvin et al. | Jun 1997 | A |
| 5650702 | Azumi | Jul 1997 | A |
| 5652489 | Kawakami | Jul 1997 | A |
| 5682213 | Schmutz | Oct 1997 | A |
| 5682313 | Edlund et al. | Oct 1997 | A |
| 5682839 | Grimsley et al. | Nov 1997 | A |
| 5709007 | Chiang | Jan 1998 | A |
| 5761762 | Kubo et al. | Jun 1998 | A |
| 5781960 | Kilstrom et al. | Jul 1998 | A |
| 5786602 | Pryor et al. | Jul 1998 | A |
| 5787545 | Colens | Aug 1998 | A |
| 5794297 | Muta | Aug 1998 | A |
| 5812267 | Everett, Jr. et al. | Sep 1998 | A |
| 5819008 | Asama et al. | Oct 1998 | A |
| 5825981 | Matsuda | Oct 1998 | A |
| 5839156 | Park et al. | Nov 1998 | A |
| 5841259 | Kim et al. | Nov 1998 | A |
| 5867800 | Leif | Feb 1999 | A |
| 5916111 | Colens | Jun 1999 | A |
| 5926909 | McGee | Jul 1999 | A |
| 5935179 | Kleiner et al. | Aug 1999 | A |
| 5940927 | Haegermarck et al. | Aug 1999 | A |
| 5940930 | Oh et al. | Aug 1999 | A |
| 5942869 | Katou et al. | Aug 1999 | A |
| 5943730 | Boomgaarden | Aug 1999 | A |
| 5943733 | Tagliaferri | Aug 1999 | A |
| 5959423 | Nakanishi et al. | Sep 1999 | A |
| 5974348 | Rocks | Oct 1999 | A |
| 6009358 | Angott et al. | Dec 1999 | A |
| 6041471 | Charkey et al. | Mar 2000 | A |
| 6049745 | Douglas et al. | Apr 2000 | A |
| 6073427 | Nichols | Jun 2000 | A |
| 6076025 | Ueno et al. | Jun 2000 | A |
| 6076227 | Schalig et al. | Jun 2000 | A |
| 6108067 | Hanseder | Aug 2000 | A |
| 6108076 | Hanseder | Aug 2000 | A |
| 6112143 | Allen et al. | Aug 2000 | A |
| 6124694 | Bancroft et al. | Sep 2000 | A |
| 6133730 | Winn | Oct 2000 | A |
| 6140146 | Brady et al. | Oct 2000 | A |
| 6166706 | Gallagher et al. | Dec 2000 | A |
| 6226830 | Hendriks et al. | May 2001 | B1 |
| 6240342 | Fiegert et al. | May 2001 | B1 |
| 6255793 | Peless et al. | Jul 2001 | B1 |
| 6259979 | Holmquist | Jul 2001 | B1 |
| D451931 | Peless et al. | Sep 2001 | S |
| 6285930 | Dickson et al. | Sep 2001 | B1 |
| 6300737 | Begvall et al. | Oct 2001 | B1 |
| 6339735 | Peless et al. | Jan 2002 | B1 |
| 6374155 | Wallach et al. | Apr 2002 | B1 |
| 6385515 | Dickson et al. | May 2002 | B1 |
| 6408226 | Byrne et al. | Jun 2002 | B1 |
| 6417641 | Peless et al. | Jul 2002 | B2 |
| 6438456 | Feddema et al. | Aug 2002 | B1 |
| 6442476 | Poropat | Aug 2002 | B1 |
| 6443509 | Levin et al. | Sep 2002 | B1 |
| 6444003 | Sutcliffe | Sep 2002 | B1 |
| 6463368 | Feiten et al. | Oct 2002 | B1 |
| 6465982 | Bergvall et al. | Oct 2002 | B1 |
| 6493613 | Peless et al. | Dec 2002 | B2 |
| 6496754 | Song et al. | Dec 2002 | B2 |
| 6496755 | Wallach et al. | Dec 2002 | B2 |
| 6507773 | Parker et al. | Jan 2003 | B2 |
| 6525509 | Petersson et al. | Feb 2003 | B1 |
| 6532404 | Colens | Mar 2003 | B2 |
| 6535793 | Allard | Mar 2003 | B2 |
| 6548982 | Papanikolopoulos et al. | Apr 2003 | B1 |
| 6571415 | Gerber et al. | Jun 2003 | B2 |
| 6574536 | Kawagoe et al. | Jun 2003 | B1 |
| 6580246 | Jacobs | Jun 2003 | B2 |
| 6580978 | McTamaney | Jun 2003 | B1 |
| 6584376 | Kommer | Jun 2003 | B1 |
| 6586908 | Petersson et al. | Jul 2003 | B2 |
| 6594844 | Jones | Jul 2003 | B2 |
| 6604022 | Parker | Aug 2003 | B2 |
| 6605156 | Clark et al. | Aug 2003 | B1 |
| 6611120 | Song et al. | Aug 2003 | B2 |
| 6611734 | Parker et al. | Aug 2003 | B2 |
| 6611738 | Raffner | Aug 2003 | B2 |
| 6615108 | Peless et al. | Sep 2003 | B1 |
| 6658693 | Reed, Jr. | Dec 2003 | B1 |
| 6661239 | Ozik | Dec 2003 | B1 |
| 6671592 | Bisset et al. | Dec 2003 | B1 |
| 6690134 | Jones et al. | Feb 2004 | B1 |
| 6741054 | Koselka et al. | May 2004 | B2 |
| 6748297 | Song et al. | Jun 2004 | B2 |
| 6764373 | Osawa et al. | Jul 2004 | B1 |
| 6781338 | Jones et al. | Aug 2004 | B2 |
| 6809490 | Jones et al. | Oct 2004 | B2 |
| 6830120 | Yashima et al. | Dec 2004 | B1 |
| 6841963 | Song et al. | Jan 2005 | B2 |
| 6845297 | Allard | Jan 2005 | B2 |
| 6901624 | Mori et al. | Jan 2005 | B2 |
| 6938298 | Aasen | Jan 2005 | B2 |
| 6971140 | Kim | Jan 2005 | B2 |
| 6850024 | Peless et al. | Feb 2005 | B2 |
| 6868256 | Dooley et al. | Mar 2005 | B2 |
| 6870792 | Chiappetta | Mar 2005 | B2 |
| 6883201 | Jones et al. | Apr 2005 | B2 |
| 6885912 | Peless et al. | Apr 2005 | B2 |
| D510066 | Hickey et al. | Sep 2005 | S |
| 6940291 | Ozik | Sep 2005 | B1 |
| 6956348 | Landry et al. | Oct 2005 | B2 |
| 6984952 | Peless et al. | Jan 2006 | B2 |
| 6999850 | McDonald | Feb 2006 | B2 |
| 7024278 | Chiapetta et al. | Apr 2006 | B2 |
| 7069124 | Whittaker et al. | Jun 2006 | B1 |
| 7085624 | Aldred et al. | Aug 2006 | B2 |
| 7155309 | Peless et al. | Dec 2006 | B2 |
| 7203576 | Wilson et al. | Apr 2007 | B1 |
| 7206677 | Hulden | Apr 2007 | B2 |
| D559867 | Abramson | Jan 2008 | S |
| 7349759 | Peless et al. | Mar 2008 | B2 |
| D573610 | Abramson | Jul 2008 | S |
| 7441392 | Lilliestielke et al. | Oct 2008 | B2 |
| 7481036 | Lilliestielke et al. | Jan 2009 | B2 |
| 7525287 | Miyashita et al. | Apr 2009 | B2 |
| 7729801 | Abramson | Jun 2010 | B2 |
| 8046103 | Abramson et al. | Oct 2011 | B2 |
| 8069639 | Fancher, III | Dec 2011 | B2 |
| D652431 | Naslund | Jan 2012 | S |
| D656163 | Johansson et al. | Mar 2012 | S |
| 8136333 | Levin et al. | Mar 2012 | B1 |
| 8306659 | Abramson et al. | Nov 2012 | B2 |
| 8413616 | Bergquist | Apr 2013 | B2 |
| 8532822 | Abramson et al. | Sep 2013 | B2 |
| 8634960 | Sandin et al. | Jan 2014 | B2 |
| 8635841 | Fiser et al. | Jan 2014 | B2 |
| 8781627 | Sandin et al. | Jul 2014 | B2 |
| 8868237 | Sandin et al. | Oct 2014 | B2 |
| 8954193 | Sandin et al. | Feb 2015 | B2 |
| 9043952 | Sandin et al. | Jun 2015 | B2 |
| 9043953 | Sandin et al. | Jun 2015 | B2 |
| 9471063 | Ouyang | Oct 2016 | B2 |
| 20010047231 | Peless et al. | Nov 2001 | A1 |
| 20020011813 | Koselka et al. | Jan 2002 | A1 |
| 20020016649 | Jones | Feb 2002 | A1 |
| 20020049517 | Ruffner | Apr 2002 | A1 |
| 20020120364 | Colens | Aug 2002 | A1 |
| 20020140393 | Peless et al. | Oct 2002 | A1 |
| 20020156556 | Ruffner | Oct 2002 | A1 |
| 20020160845 | Simonsen | Oct 2002 | A1 |
| 20020173877 | Zweig | Nov 2002 | A1 |
| 20030019071 | Field et al. | Jan 2003 | A1 |
| 20030023356 | Keable | Jan 2003 | A1 |
| 20030025472 | Jones et al. | Feb 2003 | A1 |
| 20030055337 | Lin | Mar 2003 | A1 |
| 20030060928 | Abramson et al. | Mar 2003 | A1 |
| 20030120389 | Abramson et al. | Jun 2003 | A1 |
| 20030137268 | Papanikolopoulos et al. | Jul 2003 | A1 |
| 20030182914 | Shibata et al. | Oct 2003 | A1 |
| 20030192144 | Song et al. | Oct 2003 | A1 |
| 20030208304 | Peless et al. | Nov 2003 | A1 |
| 20030216834 | Allard | Nov 2003 | A1 |
| 20030220765 | Overy et al. | Nov 2003 | A1 |
| 20030233177 | Johnson et al. | Dec 2003 | A1 |
| 20030234325 | Marino et al. | Dec 2003 | A1 |
| 20040020000 | Jones | Feb 2004 | A1 |
| 20040030448 | Solomon | Feb 2004 | A1 |
| 20040030449 | Solomon | Feb 2004 | A1 |
| 20040030450 | Solomon | Feb 2004 | A1 |
| 20040030571 | Solomon | Feb 2004 | A1 |
| 20040031113 | Wosewick et al. | Feb 2004 | A1 |
| 20040036618 | Ku et al. | Feb 2004 | A1 |
| 20040049877 | Jones et al. | Mar 2004 | A1 |
| 20040068351 | Solomon | Apr 2004 | A1 |
| 20040068415 | Solomon | Apr 2004 | A1 |
| 20040068416 | Solomon | Apr 2004 | A1 |
| 20040076324 | Burl et al. | Apr 2004 | A1 |
| 20040088079 | Lavarec et al. | May 2004 | A1 |
| 20040111184 | Chiappetta et al. | Jun 2004 | A1 |
| 20040111196 | Dean | Jun 2004 | A1 |
| 20040134336 | Solomon | Jul 2004 | A1 |
| 20040134337 | Solomon | Jul 2004 | A1 |
| 20040156541 | Jeon et al. | Aug 2004 | A1 |
| 20040158357 | Lee et al. | Aug 2004 | A1 |
| 20040187457 | Colens | Sep 2004 | A1 |
| 20040200505 | Taylor et al. | Oct 2004 | A1 |
| 20040204792 | Taylor et al. | Oct 2004 | A1 |
| 20040211444 | Taylor et al. | Oct 2004 | A1 |
| 20040220000 | Falone | Nov 2004 | A1 |
| 20040236468 | Taylor et al. | Nov 2004 | A1 |
| 20040244138 | Taylor et al. | Dec 2004 | A1 |
| 20050000543 | Taylor et al. | Jan 2005 | A1 |
| 20050007057 | Peless et al. | Jan 2005 | A1 |
| 20050010331 | Taylor et al. | Jan 2005 | A1 |
| 20050020374 | Wang | Jan 2005 | A1 |
| 20050097952 | Steph | May 2005 | A1 |
| 20050108999 | Bucher | May 2005 | A1 |
| 20050113990 | Peless et al. | May 2005 | A1 |
| 20050156562 | Cohen et al. | Jul 2005 | A1 |
| 20050204717 | Colens | Sep 2005 | A1 |
| 20050251292 | Casey et al. | Nov 2005 | A1 |
| 20050278094 | Swinbanks et al. | Dec 2005 | A1 |
| 20050287038 | Dubrovsky et al. | Dec 2005 | A1 |
| 20060293794 | Harwig et al. | Dec 2006 | A1 |
| 20070016328 | Ziegler et al. | Jan 2007 | A1 |
| 20070142964 | Abramson | Jun 2007 | A1 |
| 20070150109 | Peless et al. | Jun 2007 | A1 |
| 20070276590 | Leonard | Nov 2007 | A1 |
| 20080003978 | Sengupta et al. | Jan 2008 | A1 |
| 20080039974 | Sandin et al. | Feb 2008 | A1 |
| 20080097645 | Abramson et al. | Apr 2008 | A1 |
| 20080167753 | Peless et al. | Jul 2008 | A1 |
| 20080183349 | Abramson et al. | Jul 2008 | A1 |
| 20090254218 | Sandin | Oct 2009 | A1 |
| 20100059000 | Bergquist | Mar 2010 | A1 |
| 20100102525 | Fancher | Apr 2010 | A1 |
| 20110130875 | Abramson | Jun 2011 | A1 |
| 20110234153 | Abramson | Sep 2011 | A1 |
| 20120041594 | Abramson et al. | Feb 2012 | A1 |
| 20120226381 | Abramson et al. | Sep 2012 | A1 |
| 20120258741 | Tillson | Oct 2012 | A1 |
| 20120290165 | Ouyang | Nov 2012 | A1 |
| 20130006419 | Bergstrom et al. | Jan 2013 | A1 |
| 20130030609 | Jagenstedt | Jan 2013 | A1 |
| 20130066484 | Markusson et al. | Mar 2013 | A1 |
| 20130076304 | Andersson et al. | Mar 2013 | A1 |
| 20130110322 | Jagenstedt et al. | May 2013 | A1 |
| 20130152538 | Fiser et al. | Jun 2013 | A1 |
| 20130184924 | Jagenstedt et al. | Jul 2013 | A1 |
| 20130249179 | Burns | Sep 2013 | A1 |
| 20130253701 | Halloran | Sep 2013 | A1 |
| 20130261867 | Burnett | Oct 2013 | A1 |
| 20130274920 | Abramson et al. | Oct 2013 | A1 |
| 20140102061 | Sandin et al. | Apr 2014 | A1 |
| 20140102062 | Sandin et al. | Apr 2014 | A1 |
| 20140117892 | Coates | May 2014 | A1 |
| 20140249571 | Halloran et al. | Sep 2014 | A1 |
| 20140249671 | Halloran | Sep 2014 | A1 |
| 20150006015 | Sandin et al. | Jan 2015 | A1 |
| 20150017951 | Agrawal et al. | Jan 2015 | A1 |
| 20150067098 | Park et al. | Mar 2015 | A1 |
| 20150289111 | Ozkan | Oct 2015 | A1 |
| 20160065719 | Jeong | Mar 2016 | A1 |
| Number | Date | Country |
|---|---|---|
| 103076802 | May 2013 | CN |
| 103389699 | Nov 2013 | CN |
| 19932552 | Feb 2000 | DE |
| 0792726 | Sep 1997 | EP |
| 0774702 | Oct 2001 | EP |
| 1331537 | Jul 2003 | EP |
| 1704766 | Sep 2006 | EP |
| 2946650 | Nov 2015 | EP |
| 2828589 | Feb 2003 | FR |
| 2142447 | Jan 1985 | GB |
| 2283838 | May 1995 | GB |
| 2344745 | Jun 2000 | GB |
| 2382157 | May 2003 | GB |
| 62120510 | Jun 1987 | JP |
| 62154008 | Jul 1987 | JP |
| 63183032 | Jul 1988 | JP |
| 63241610 | Oct 1988 | JP |
| 26312 | Jan 1990 | JP |
| 3051023 | Mar 1991 | JP |
| 4320612 | Nov 1992 | JP |
| 6327598 | Nov 1994 | JP |
| 7129239 | May 1995 | JP |
| 7295636 | Nov 1995 | JP |
| 8016776 | Jan 1996 | JP |
| 8089451 | Apr 1996 | JP |
| 8152916 | Jun 1996 | JP |
| 9179625 | Jul 1997 | JP |
| 9185410 | Jul 1997 | JP |
| 11508810 | Aug 1999 | JP |
| 11510935 | Sep 1999 | JP |
| 2001258807 | Sep 2001 | JP |
| 2001275908 | Oct 2001 | JP |
| 2001525567 | Dec 2001 | JP |
| 2002078650 | Mar 2002 | JP |
| 2002204768 | Jul 2002 | JP |
| 3356170 | Oct 2002 | JP |
| 2002532178 | Oct 2002 | JP |
| 3375843 | Nov 2002 | JP |
| 2002323925 | Nov 2002 | JP |
| 2002355206 | Dec 2002 | JP |
| 2002360471 | Dec 2002 | JP |
| 2002360482 | Dec 2002 | JP |
| 2003005296 | Jan 2003 | JP |
| 2003010076 | Jan 2003 | JP |
| 2003036116 | Feb 2003 | JP |
| 2003038401 | Feb 2003 | JP |
| 2003038402 | Feb 2003 | JP |
| 2003505127 | Feb 2003 | JP |
| 2003061882 | Mar 2003 | JP |
| 2003310489 | Nov 2003 | JP |
| 2007049555 | Feb 2007 | JP |
| 2014003516 | Jan 2014 | JP |
| 2014075133 | Apr 2014 | JP |
| 199526512 | Oct 1995 | WO |
| 199740734 | Nov 1997 | WO |
| 199741451 | Nov 1997 | WO |
| 199853456 | Nov 1998 | WO |
| 199916078 | Apr 1999 | WO |
| 199928800 | Jun 1999 | WO |
| 199938056 | Jul 1999 | WO |
| 199938237 | Jul 1999 | WO |
| 199959042 | Nov 1999 | WO |
| 200036962 | Jun 2000 | WO |
| 200038026 | Jun 2000 | WO |
| 200038029 | Jun 2000 | WO |
| 200004430 | Oct 2000 | WO |
| 200078410 | Dec 2000 | WO |
| 200106904 | Feb 2001 | WO |
| 200106905 | Feb 2001 | WO |
| 2002039864 | May 2002 | WO |
| 2002039868 | May 2002 | WO |
| 2002058527 | Aug 2002 | WO |
| 2002062194 | Aug 2002 | WO |
| 2002067744 | Sep 2002 | WO |
| 2002067745 | Sep 2002 | WO |
| 2002074150 | Sep 2002 | WO |
| 2002075356 | Sep 2002 | WO |
| 2002075469 | Sep 2002 | WO |
| 2002075470 | Sep 2002 | WO |
| 2002101477 | Dec 2002 | WO |
| 2003026474 | Apr 2003 | WO |
| 2003040845 | May 2003 | WO |
| 2003040846 | May 2003 | WO |
| 2003065140 | Aug 2003 | WO |
| 2004004533 | Jan 2004 | WO |
| 2004006034 | Jan 2004 | WO |
| 2004058028 | Jan 2004 | WO |
| 2005077244 | Jan 2004 | WO |
| 2005055795 | Jun 2005 | WO |
| 2006068403 | Jun 2006 | WO |
| WO 2007065030 | Jun 2007 | WO |
| WO 2009124108 | Oct 2009 | WO |
| WO 2014094877 | Jun 2014 | WO |
| Entry |
|---|
| International Search Report and Written Opinion issued in PCT/US2016/043541, dated Oct. 7, 2016, 8 pages. |
| International Preliminary Report on Patentability issued in International Application No. PCT/US2018/043541, dated Jan. 23, 2018, 7 pages. |
| Angle et al., U.S. Appl. No. 60/177,703, filed Jan. 24, 2000, available at http://portal.uspto.gov/external/portal/pair , accessed Jul. 11, 2012, 16 pages. |
| Bohn et al. “Super-distributed RFID Tag Infrastructures,” Lecture Notes in Computer Science, Springer Verlag, Berlin, DE, vol. 3295, Nov. 11, 2004, pp. 1-12. |
| Campbell et al., U.S. Appl. No. 60/741,442, filed Dec. 2, 2005, available at http://patentscope.wipo.int/search/docservicepdf_pct/id00000005206306.pdf, accessed Jul. 11, 2012, 130 pages. |
| Caracciolo et al., “Trajectory Tracking Control of a Four-Wheel Differentially Driven Mobile Robot,” IEEE Int. Conf. Robotics and Automation, Detroit, MI, 1999, pp. 2632-2638. |
| Casey et al., U.S. Appl. No. 60/582,992, filed Jun. 25, 2004, available at http://portal.uspto.gov/external/portal/pair, accessed Jul. 11, 2012, 24 pages. |
| Domnitcheva “Smart Vacuum Cleaner—an Autonomous Location-Aware Cleaning Device,” Proceedings of the International Conference on Ubiquitous Computing, Sep. 10, 2004, pp. 1-2. |
| Doty and Harrison, “Sweep Strategies for a Sensory-Driven, Behavior-Based Vacuum Cleaning Agent,” AAAI 1993 Fall Symposium Series, Instantiating Real-World Agents, Oct. 22-24, 1993, pp. 1-6. |
| “Electrolux—Designed for the well-lived home (Welcome to the Electrolux Trilobite),” Retrieved from the Internet: URL<http://www.electroluxusa.com/node57.as[?currentURL=nodel42.asp%3F >. Accessed Mar. 2005, 2 pages. |
| “eVac Robotic Vacuum,” S1727 Instruction Manual, Sharper Image Corp, Copyright 2004, 13 pages. |
| Everyday Robots, “Everyday Robots: Reviews, Discussion and News for Consumers,” Aug. 2004, Retrieved from the Internet: URL<www.everydayrobots.com/index.php?option=content&task=view&id=9>, retrieved Sep. 2012, 4 pages. |
| Evolution Robotics, “NorthStar—Low-cost Indoor Localization—How it Works,” E Evolution Robotics, 2005, 2 pages. |
| Facts on Trilobite, webpage, Retrieved from the Internet: URL<http://trilobiteelectroluxse/presskit_en/model11335asp?print=yes&pressID=>, accessed Dec. 2003, 2 pages. |
| Final Office Action issued in U.S. Appl. No. 11/688,225, dated Nov. 10, 2011, 45 pages. |
| Gat, “Robust Low-Computation Sensor-driven Control for Task-Directed Navigation,” Proc of IEEE International Conference on Robotics and Automation, Sacramento, CA, Apr. 1991, pp. 2484-2489. |
| Hicks and Hall, “A Survey of Robot Lawn Mowers”, http://www.robotics.uc.edu/papers/paper2000/lawnmower.pdf, 2000, 8 pages. |
| Hitachi: News release: “The home cleaning robot of the autonomous movement type (experimental machine) is developed,” May 29, 2003, Retrieved from the Internet: URL<www.i4u.com./japanreleases/hitachirobot.htm>, retrieved Mar. 2005, 5 pages. |
| International Preliminary Report on Patentability dated Sep. 23, 2008 from International Application No. PCT/US2007/064326, dated Sep. 23, 2008, 10 pages. |
| International Preliminary Report on Patentability issued in International Application No. PCT/US2007/064323, dated Sep. 23, 2008, 10 pages. |
| International Search Report and Written Opinion issued in PCT/US2007/064326, dated Jul. 17, 2008, 6 pages. |
| International Search Report and Written Opinion issued in PCT/US2007/064323, dated Jun. 16, 2008, 14 pages. |
| Invitation to Pay Additional Fees issued in International Application No. PCT/US2007/064326, dated Apr. 18, 2008, 9 pages. |
| Kahney, “Wired News: Robot Vacs are in the House,” Jun. 2003, Retrieved from the Internet: URLwww.wired.com/news/technology/o,1282,59237,00.html, accessed Mar. 2005, 5 pages. |
| Karcher “Karcher RoboCleaner RC 3000,” Retrieved from the Internet: URL<www.robocleaner.de/english/screen3.html>. 4 pages, Dec. 2003. |
| 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, 8 pages. |
| Karcher USA, “RC3000 Robotic Cleaner,” 2005, Retrieved from the Internet: URL http://www.karcher-usa.com/showproducts.php?op=view prod¶m1=143¶m2=¶m3=, accessed Mar. 2005, 3 pages. |
| Karcher, “Product Manual Download ‘Karch’,” available at www.karcher.com, 2004, 16 pages. |
| Kimura et al., “Stuck Evasion Control for Active Wheel Passive-Joint Snake-like Mobile Robot ‘Genbu’,” Proceedings of the 2004 IEEE International Conference on Robotics 8 Automation, New Orleans, LA, Apr. 2004, 6 pages. |
| Kozlowski and Pazderski, “Modeling and Control of a 4-wheel Skid-steering Mobile Robot,” International J. of Applied Mathematics and Computer Science, 2004, 14(4):477-496. |
| Kubitz et al., “Application of radio frequency identification devices to support navigation of autonomous mobile robots” Vehicular Technology Conference, vol. 1, May 4, 1997, pp. 126-130. |
| KOOLVAC Robotic Vacuum Cleaner Owner's Manual, Koolatron, 2004, 13 pages. |
| Matthies et al., “Detecting Water Hazards for Autonomous Off-Road Navigation,” Proceedings of SPIE Conference 5083. Unmanned Ground Vehicle Technology V, Orlando, FL, Apr. 2003, pages. |
| Morland,“Autonomous Lawnmower Control,” Downloaded from the internet at: http://cns.bu.edu/˜cjmorlan/robotics/lawnmower/report.pdf, Jul. 2002, 10 pages. |
| Non-final Office Action issued in U.S. Appl. No. 11/688,213, dated Jan. 27, 2011, 27 pages. |
| Non-final Office Action issued in U.S. Appl. No. 11/688,225, dated Feb. 24, 2011, 30 pages. |
| Non-final Office Action issued in U.S. Appl. No. 12/488,094, dated Jan. 26, 2011, 25 pages. |
| Non-final Office Action issued in U.S. Appl. No. 12/488,094, dated Jul. 28, 2011, 13 pages. |
| On Robo, “Robot Reviews Samsung Robot Vacuum (VC-RP30W),” 2005, Retrieved from the Internet: URL www.onrobo.com/reviews/AT_Home/vacuum_cleaners/on00verb30rosom/index.htm, accessed Mar. 2005, 2 pages. |
| “Put Your Roomba . . . On, Automatic” webpages: http://www.acomputeredge.com/roomba, accessed Apr. 2005, 3 pages. |
| RoboMaid Sweeps Your Floors So You Won't Have to, the Official Site, Retrieved from the Internet: URL http://therobomaid.com/, accessed Mar. 2005, 2 pages. |
| Robotic Vacuum Cleaner-Blue, Retrieved from the Internet: URL http://www.sharperimage.com/us/en/catalog/productview.jhtml?sku=S1727BLU, accessed Mar. 2005, 2 pages. |
| Schofield, “Neither Master nor Slave—A Practical Study in the Development and Employment of Cleaning Robots,” Emerging Technologies and Factory Automation, 1999 Proceedings ETFA '99 1999 7th IEEE International Conference on Barcelona, Spain, Oct. 1999, pp. 1427-1434. |
| TheRobotStore.com, “Friendly Robotics Robotic Vacuum RV400—The Robot Store,” www.therobotstore.com/s.nl/sc.9/category.-109/it.A/id.43/.f, accessed Apr. 2005, 1 page. |
| Thrun, “Learning Occupancy Grid Maps With Forward Sensor Models,” Autonomous Robots 15, Sep. 1, 2003, 28 pages. |
| Wigley, “The Electric Lawn”, in The American Lawn, Princeton Architectural Press New York with Canadian Centre for Architecture Montreal, 1999, pp. 155-195. |
| “Zoombot Remote Controlled Vaccuum-RV-500 NEW Roomba 2,” eBay website: http://cgi.ebay.com/ws/eBayISAPI.dll?ViewItem&category=43526&item=4373497618&rd=1, accessed Apr. 2005, 7 pages. |
| International Search Report and Written Opinion in International Application No. PCT/US2015/050775, dated Dec. 23, 2015, 12 pages. |
| EP European Search Report in Application No. 16809623, dated Dec. 6, 2018, 10 pages. |
| Number | Date | Country | |
|---|---|---|---|
| 20170026818 A1 | Jan 2017 | US |
