This invention relates to an autonomous mobile robot for grass cutting.
Autonomous robots that perform household functions such as floor cleaning and lawn cutting are now readily available consumer products. Commercially successful robots are not unnecessarily complex, and generally operate randomly within a confined area. In the case of floor cleaning, such robots are generally confined within (i) touched walls and other obstacles within the rooms of a dwelling, (ii) IR-detected staircases (cliffs) leading downward; and/or (iii) user-placed detectable barriers such as directed IR beams, physical barriers or magnetic tape. Walls provide much of the confinement perimeter. Other robots may try to map the dwelling using a complex system of sensors and/or active or passive beacons (e.g., sonar, RFID or bar code detection, or various kinds of machine vision).
Some autonomous robotic lawn mowers use a continuous boundary marker (e.g., a boundary wire) for confining random motion robotic mowers. The boundary wire is intended to confine the robot within the lawn or other appropriate area, so as to avoid damaging non-grassy areas of the yard or intruding onto a neighboring property. The boundary marker is typically a continuous electrically conductive loop around the property to be mowed. Although the guide conductor can be drawn into the property in peninsulas to surround gardens or other off-limit areas, it remains a continuous loop, and is energized with an AC current detectable as a magnetic field at a distance of a few feet. The guide conductor loop must be supplied with power, usually from a wall socket. Within the bounded area, a mowing robot may “bounce” randomly as the robot nears the guide conductor, or may follow along the guide conductor. Some mowers also touch and bounce from physical barriers.
In some implementations of this disclosure, a method of mowing an area with an autonomous mowing robot, the method comprises storing, in non-transient memory of the robot, a set of geospatially referenced perimeter data corresponding to positions of the mowing robot as the mowing robot is guided about a perimeter of an area to be mowed, removing from the set of perimeter data one or more data points thereby creating a redacted data set, and controlling the mowing robot to autonomously mow an area bounded by a boundary corresponding to the redacted data set, including altering direction of the mowing robot at or near a position corresponding to data in the redacted data set so as to redirect the robot back into the bounded area. In some aspects, prior to storing the geospatially referenced data, determining locations of discrete markers along the perimeter of the area to be mowed. The geospatially referenced data are geospatially referenced as the mowing robot is guided about the perimeter in relation to the discrete markers. Prior to removing data points from the set of perimeter data, determining the reference point from a location of the mowing robot within the area to be mowed. The method comprises prompting an operator to position the mowing robot within the area to be mowed and to then initiate reference point determination. The boundary corresponding to the redacted data set is an interior boundary or an exterior boundary of the area to be mowed is determined from the location of the reference point with respect to the boundary.
In other aspects of this disclosure, the method includes storing the geospatially referenced perimeter data comprises marking cells of a two-dimensional data array as corresponding to the positions of the mowing robot. Also possible is removing the one or more data points comprises altering entries in one or more marked cells to indicate that such cells do not correspond to perimeter locations. The data points to be removed are BOUNDARY cells that are not adjacent to both MOWABLE and NON-MOWABLE cells. Storing the set of perimeter data comprises determining whether the mowing robot is being guided in a forward or a backward direction, and pausing data storage while the mowing robot is being guided in the backward direction. Prior to controlling the robot to autonomously mow the area, determining whether the stored perimeter data represents a continuous path. The method can include adding data points to fill any path gaps of less than a predetermined width. Upon determining that the stored perimeter data represents a discontinuous path defining a gap of more than a predetermined width, signaling an operator to resume guidance of the mowing robot about the perimeter and storing additional perimeter data during resumed guidance. Prior to controlling the robot to autonomously mow the area, altering a portion of the stored perimeter data set corresponding to a perimeter path segment defining an interior angle less than 135 degrees, to define a smoothed boundary. The storage of the set of perimeter data is paused while the guided mowing robot remains stationary for less than a predetermined time interval, and resumes upon motion of the mowing robot. The storage of the set of perimeter data is concluded in response to the guided mowing robot remaining stationary for more than the predetermined time interval. Controlling the mowing robot to autonomously mow the area comprises determining whether the mowing robot is within a predetermined distance from the boundary, and in response to determining that the mowing robot is within the predetermined distance, slowing a mowing speed of the robot. The perimeter is an external perimeter circumscribing the area to be mowed. The perimeter is an internal boundary circumscribing an area surrounded by the area to be mowed.
In other aspects of this disclosure, an autonomous mowing robot comprises a robot body carrying a grass cutter, a drive system including a motorized wheel supporting the robot body, a controller operably coupled to the motorized wheel for maneuvering the mowing robot to traverse a bounded lawn area while cutting grass. The controller is configured to: in a teaching mode, store in non-transient memory a set of geospatially referenced boundary data corresponding to positions of the mowing robot as the mowing robot is guided about a border of the lawn area, in the teaching mode, store reference data corresponding to a reference position within the lawn area, remove from the set of boundary data one or more data points corresponding to positions spatially closer to the reference position than another adjacent position represented by another data point of the set of boundary data, thereby creating a redacted boundary data set, and then, in an autonomous operating mode, control the mowing robot to autonomously mow an area bounded by a path corresponding to the redacted boundary data set, including altering direction of the mowing robot at or near a position corresponding to data in the redacted data set so as to redirect the robot back into the bounded area.
Implementations can include an emitter/receiver carried on the robot body and configured to communicate with perimeter markers bounding the lawn area in the teaching mode. A removable handle securable to the robot body and graspable by an operator to manually guide the mowing robot about the border of the lawn area in the teaching mode. The robot is configured to detect if the handle is attached to the robot body. The controller is configured to initiate the teaching mode in response to detecting that the handle is attached. The handle comprises a kill switch in communication with the drive system, the kill switch configured to send a signal to turn off the mowing robot when the kill switch is not activated.
The details of one or more embodiments of the invention are set forth in the accompanying drawings and the description below. Other features, objects, and advantages of the invention will be apparent from the description and drawings, and from the claims.
Like reference symbols in the various drawings indicate like elements.
Referring to
An important step in the use of the robot lawnmower 10 is defining a perimeter 21 of the lawn 20 to be mowed. In some implementations, as a safety measure autonomous use of the robot lawnmower 10 can only be executed once a perimeter or boundary has been determined and stored in non-transitory memory of the robot lawnmower 10. In some implementations, a human operator manually defines a perimeter 21 by pushing the robot 10 using a handle 116 attached to the robot body 100, as shown in
Referring to
As noted above, prior to autonomously mowing the lawn, the robot lawnmower 10 completes a teaching phase. During the perimeter teaching phase, the human operator may pilot the robot lawnmower 10 in a manner that requires correction, thus putting the robot lawnmower 10 in an unteachable state. When the robot lawnmower 10 detects that it is in an unteachable state during a teach run, the robot lawnmower 10 alerts the operator (e.g., via operator feedback unit 700 such as a display on a mobile device or a display integrated in a handle 116) to change a direction or speed of the robot lawnmower 10 to enable the robot lawnmower 10 to continue to record the perimeter 21 and/or return to traveling on traversable terrain. For instance, the robot lawnmower 10 may enter the unteachable state when the operator pushes the robot lawnmower 10 into an area of the lawn 20 where the robot lawnmower 10 loses ability to determine its location, when the user is on a second teaching path that varies from a first teaching path, or when the user pushes the robot lawnmower 10 too fast or over terrain that is too bumpy or tilted.
For example, the operator may try to push the robot lawnmower 10 between a divot and a rock, causing the robot lawnmower 10 to tilt at an excessive angle (e.g., over 30 degrees). Or the operator may attempt to teach the robot lawnmower 10 a path that goes through topography that the robot lawnmower 10 cannot traverse in the autonomous mode. In such cases, the robot lawnmower 10 alerts the operator (e.g., via the operator feedback unit 700) to select a different path. As previously described, the robot lawnmower 10 may alert the operator via the operator feedback unit 700 by a visual signal on a display, an audible signal through a speaker, and/or a tactile signal, such a vibration from a vibrational unit of the operator feedback unit 700.
If the operator is pushing the robot lawnmower 10 too fast or too slow during the teaching mode, thus placing the robot in the unteachable state, the robot lawnmower 10 prompts the user to either increase or decrease the speed of the robot lawnmower 10. In some examples, operator feedback unit 700 includes a speed indicator that will light or flash (green, yellow, red light) when the robot lawnmower 10 is going at a speed greater or lower than a threshold speed.
As will be discussed below in reference to
In some examples, the teaching routine requires the operator to traverse the perimeter 21 of the lawn 20 a second time (or more). Once the operator completes a first teaching run, completing a closed loop about the perimeter of the area to be mowed, the robot lawnmower 10 may alert the operator that a second run is needed. In one example, the operator hits a STOP button to affirmatively indicate completion of a teaching run around the perimeter 21 of the lawn 20. In some examples, the robot lawnmower 10 allows the operator to either complete the second teaching run right after the first teaching run or wait until later. If the operator completes a second or subsequent teaching run and the robot lawnmower detects a variance between the two determined perimeters that is greater than a threshold variance, the robot lawnmower 10 alerts the user to the apparent discrepancy and prompts another teaching run to learn the perimeter 21 of the lawn 20.
When the perimeter-teaching process is complete, the user may dock the robot lawnmower 10 in its dock 12 (see
In some implementations, the robot lawnmower 10 includes a boundary detection system 800 that includes the emitter/receiver 151 disposed on the robot body 100 and passive boundary markers 805 (
As shown in
Alternately, landmarks such as Ultra-wide Band (UWB) beacons can be placed in the environment, and the robot can use the landmarks to localize its position. These beacons can be placed inside the mowable area (e.g., beacon 810b), on the boundary (e.g., beacon 810a), or outside the boundary (e.g., beacon 810c). These beacons 810 (
In general, ultra-wideband (also known as UWB, ultra-wide band and ultraband) is a radio technology which operates at a low energy level for short-range, high-bandwidth communications. Ultra-wideband transmits information spread over a large bandwidth (>500 MHz). In some examples, UWB includes transmission from an antenna for which the emitted signal bandwidth exceeds the lesser of 500 MHz or 20% of the center frequency. The use of UWB beacons 810a-c (which include the UWB transceivers 811a-c) provides several advantages over other confinement/localization systems. In general, ultra-wideband characteristics are well-suited to short-distance applications. Use of ultra-wideband can be beneficial in autonomous lawn mowing because the signals can be transmitted past/through obstacles such as bushes or trees and provide precision localization of the lawn mowing robot 10 relative to the UWB beacons 810a-c. UWB transceivers 811a-c emit an omnidirectional signal so the use of UWB signals can be more resistant to robot orientation than line-of-sight optical systems, such as vision-based or laser-based systems. Additionally, a UWB signal can pass through small obstacles such as trees and shrubs allowing placement of the UWB beacons in less visible locations about a mowable space (e.g., as shown by the transmission between beacon 810b and 810c).
If UWB signals from UWB beacons 810a-c positioned about a yard are to be used to determine the autonomous lawn mowing robot's location within the yard, the location of the UWB beacons 810a-c needs to be established. In general, as described below in more detail in relation to
Referring to
The initialization process includes gathering/obtaining information about the distances between the UWB beacons positioned around the mowable space (step 850). More particularly, one UWB transceiver (e.g., the transceiver located on the robot 860 or on the dock) sends a request to each of the other UWB transceivers for information about the distance between itself and each of the other UWB transceivers. This information can include time-of-flight information or other data that can be used to determine distance. For example, in the examples shown in
After receiving the information about the relative distances between the UWB transmitters in each of the UWB beacons, a processor in the robot lawnmower 10 (or a remotely located processor) uses a multi-dimensional scaling algorithm to determine the relative position (e.g., the x-y position relative to a global origin such as the dock position) of the UWB beacons (852,
In some examples, the use of a multi-dimensional scaling (MDS) algorithm can generate a beacon map that is a mirror image of the actual beacon layout. If a mirror image of the actual beacon layout were used during navigation, this would result in the robot not turning in the intended direction when trying to face another point in space. To test for a mirror image layout, the autonomous lawn mowing robot 860 is moved in an orientation determination sequence (step 854). The system then determines whether the UWB beacon locations are mirrored (step 856) and if so, reassigns headings to the UWB beacon locations to correct the orientation (step 858). More particularly, after performing the initial beacon setup and localization, the robot stores its initial point and drives forward for a short distance (e.g., 15-30 cm) to a second point. This driving forward establishes a y-axis used to reassign beacon locations if the beacon map is determined to be a mirror image of the actual beacon layout. Then the robot turns roughly 90 degrees to the left and drives forward another short distance (e.g., 15-30 cm) as shown in path 872 in
After the UWB beacon locations are determined and stored, the system localizes the autonomous lawn mowing robot 860 by trilaterating based on received time-of-flight information (range) from each of the UWB transceivers (
In one example, a least squares algorithm can be used to minimize the sum of squared error between the sensed ranges and the position estimate.
In another example, as shown in
Using the MIST technique, the time-of-flight measurements are used to determine a circle of possible locations around each of the beacons where the radius of the circle is based on the distance between the UWB transceiver in the UWB beacon and the UWB transceiver in the robot. For every pair of range circles, there may be zero, one, or two intersection points.
MIST works by examining all of the feasible sets of intersection points and selecting the set with the minimum total distance between points. A feasible set consists of a candidate point for each pair of range circles. There are three possible cases for each pair of circles.
As shown in
As shown in
As shown in
In some examples, one or more of the UWB beacons may be in an isolated location and therefore it may be challenging to locate the UWB beacon relative to the other UWB beacons. For example, one beacon could be placed in a side-yard where the house prohibits communication with some of the other UWB beacons. As such, the initially determined location for the beacon may have a lower confidence since the location determination is based on communications between the isolated beacon and only a subset of the other beacons positioned about the yard. If a calculated confidence value is below a threshold confidence value, the system could request that the user move the mower (which itself includes a UWB transceiver) to a location where the mower can communicate with both the isolated beacon and a plurality of other beacons. The system can then use the UWB transceiver on the robot to help position the isolated UWB beacon (e.g., using a similar process to that described above). Once the isolated UWB beacon's revised location has been determined, the autonomous robot can be moved and the isolated beacon's location can be stored relative to the other beacons.
Referring to
In order to establish the boundary of the mowable area, an algorithm will select the positions navigated by the robot lawnmower 10 during teaching mode. Once the rough lawn boundary is determined, the algorithm will perform edge selection and smoothing functions on the initial boundary data (or on a subset of the collected data). The edge selection function finds the outermost edge of the mowable area, maximizing the area to be mowed, and combined with the smoothing function results in a continuous boundary that the robot lawnmower 10 can navigate autonomously subsequent to the teaching mode. This process for determining and smoothing the boundary of the mowable space can be used with various beacon-based localization systems where distance is measured from the mobile asset (robot) to the beacons. Such technologies include but are not limited to time-of-flight (TOF), time distance of arrival (TDOA), or signal strength based systems.
During the teaching mode a user will attempt to navigate the robot around perimeter 21 of the lawn 20, illustrated by the solid boundary line, but in fact navigate along the actual teaching path 23 (illustrated by the dashed boundary line) which may be non-smooth, and can include irregularities. During the teaching mode the robot lawnmower 10 will determine and store its position at all times relative to the beacons 810, via a data processing unit. This data processing unit may be the controller 150 mounted on the robot lawnmower (see
At the start of teaching, the values of all cells are initialized to NONMOWABLE. The operator presses the start button to start the teach process and then drives around the perimeter 21 of the mowing area. As the robot drives, the values of all cells along its actual teaching path 23 are set to BOUNDARY, the location of the cells being determined by the distance to the beacons 810. After walking the perimeter, the operator presses a button to end the teaching process. Then, the operator positions the robot lawnmower 10 anywhere within the mowable area of lawn 20, for example at position P, and presses a button, indicating to the robot lawnmower 10 that it is inside the perimeter. In response, the system performs a flood fill to set the values of all cells inside perimeter 21 defined by the BOUNDARY cells 25C to mark them as MOWABLE cells 25B corresponding to areas to be mowed.
As shown in
In some additional examples, the system can re-label some of the previous BOUNDARY cells 25C as MOWABLE cells 25B, in order to determine the outermost edges of the path to be followed by the robot lawnmower 10 when it navigates the lawn 20 autonomously at a later time. In the edge-selection function, the controller 150 selects all the BOUNDARY cells 25C and computes the distance between each BOUNDARY cell 25C to the origin (0, 0) cell. For example, the origin call can be the interior position cell P shown in
The controller compares the distance of each BOUNDARY cell 25C to select the BOUNDARY 25C cells most distant from the origin P and determines a single-cell line of cells representing the outermost BOUNDARY cells 25C. The controller 150 examines the mowing-area value of each cell adjacent to each cell labeled BOUNDARY. Any BOUNDARY cell 25C that is in an adjacent position to more than one other BOUNDARY cell 25C is then examined to determine which cell 25C is furthest from the origin P and is thus the outermost limit to be mowed. To remove interior BOUNDARY cell 25C data points from the set of perimeter data, for subsets of the perimeter data representing multiple spatially adjacent locations the controller 150 selects only those cells spatially farthest from the reference or origin point P. Thus, in a grouping of cells which are contiguous to each other, the controller selects only the outermost (e.g., farthest away) cells. In
In some additional examples, the system can identify a gap, or break in the contiguous BOUNDARY cells. The controller 150 can search for such discontinuities, by searching for BOUNDARY cells that are not adjacent to or corner to corner with any other BOUNDARY cell. The controller 150 can then select MOWABLE cells adjacent to the discontinuous BOUNDARY cells. In one implementation, the controller 150 can interpolate between the x, y values of the discontinuous BOUNDARY cells, and reassign all cells lying on the line between the discontinuous cells as BOUNDARY cells. In some implementations, the controller 150 can alter a portion of the stored perimeter data set corresponding to a perimeter path segment defining an interior angle less than 135 degrees, to define a smoothed boundary. For example, the interior angle can be less than 90 degrees, or less than 45 degrees.
Referring again to
At this point, the robot lawnmower is ready to begin teachable mode motion by the operator. The robot lawnmower prompts the operator to push the robot lawnmower around the perimeter of the lawn (step 1012). As the robot lawnmower is pushed by the operator, the controller is in communication with the beacons and collects location data (step 1014). For example, the robot can collect time of flight data from each of the UWB beacons and use the data to determine the location (e.g., by triangulation). Each cell of the 2D grid corresponding to a detected position of the robot during this motion is set to a value marking the cell as a boundary cell (step 1016). The robot lawnmower continuously checks if it has received operator input indicating completion, or whether a length of non-mobile time greater than a stored threshold time has elapsed (step 1018). If not, the robot lawnmower continues collecting location data and marking the cells corresponding to those locations as boundary cells.
Next, the operator may optionally define keep-out zones around any interior regions by pushing the mower around the internal boundary of these regions. Once at step 1018 the robot determines that the mapping of the perimeter is complete, the robot lawnmower prompts the operator to move the robot lawnmower 10 to a mowable, interior area of the lawn (i.e., the space to be mowed, step 1020), and then determines and saves the position of this initial interior position. The controller then identifies all boundary cells that are not adjacent to both mowable and non-mowable cells and relabels boundary cells that are adjacent to mowable or another boundary cell and not adjacent to non-mowable as mowable (step 1022) to calculate a final, smoothed boundary. Thus, in situations where multiple adjacent cells were identified initially as boundary, the system retains only the outermost cell as a boundary cell (e.g., the cell touching the non-mowable space) and relabels the other cells as mowable. For example, the re-labeling process selects the cells that are adjacent to only mowable cells and boundary cells and relabels those cells as mowable. The controller then uses a filling function to assign all locations inside the calculated smoothed boundary as inside/mowable area (step 1024).
In another example, once the robot determines that the mapping of the perimeter is complete and determines and saves the position of this initial interior position, the controller then selects the outermost locations of the boundary cells in the map and performs the edge selection and smoothing operation on selected cells to calculate a final, smoothed boundary. The controller then uses a filling function to assign all locations inside the calculated smoothed boundary as inside/mowable area.
Referring to
The robot lawnmower then prompts the operator to move to a mowable area of the lawn (step 2014) within the outside perimeter border and not inside any of the (optional) keep-out zones, and records the pose of the robot in the mowable space (step 2016). The system then uses a flood fill to set all cells within the boundary to NON-MOWABLE (e.g., all of the cells that are within the keep out zone) (step 2018). Finally, the system re-labels boundary cells for keep out perimeters that are adjacent to mowable and not adjacent to both mowable and non-mowable (keep out zone) to mowable (step 2020).
In some additional examples, the system can perform the above-described smoothing operation on the entire grid map including both the interior boundaries of the keep out zones and the external perimeter in a single process. In such an example, the system uses a flood fill to fill all areas indicated by the robot pose in the mowable space. This flood fill sets all grid locations inside of the external perimeter of the lawn and outside of the defined keep out zones to MOWABLE. The system then performs a smoothing algorithm on both the perimeter of the lawn and the perimeters of the keep out zones. For example, the system can set all boundary cells that are not adjacent to both MOWABLE and NONMOWABLE to MOWABLE such that a boundary is generated where each boundary cell contacts both MOWABLE and NONMOWABLE space.
Referring to
A method of autonomous control as the robot lawnmower navigates the lawn is shown in
In a further embodiment, a method of smoothing the path of the robot lawnmower for later traversing of a boundary, can use the suspension of teaching mode feature discussed above. For example, when the user pulls the robot backwards to reposition the robot during teaching, a jagged path (such as jag 28 in
At this point the robot lawnmower then determines its initial location relative to the beacons 810 and the dock 12, and initializes a virtual 2D grid of cells around its initial location, to represent lawn (step 4010). The robot lawnmower 10 is ready to begin teachable mode motion by the operator and prompts the operator to push the robot lawnmower 10 around the perimeter 21 of the lawn 20 (step 4012). As the robot lawnmower 10 is pushed by the operator, the controller 150 is in communication with the beacons 810 and collects location data (step 4014). Each cell of the 2D grid corresponding to a detected position of the robot during this motion is set to a value marking it as a BOUNDARY cell (step 4016). The robot continuously checks if it is moving forward (step 4017). If so, the robot continues to collect location data and set each cell traversed to boundary (steps 4014 and 4016). If not, the robot checks whether it has received operator input indicating completion, or whether a length of non-mobile time greater than a stored threshold time has elapsed (step 4018) and again checks whether the robot is moving forward (step 4017). If so, the robot resumes collecting location data. Otherwise the robot determines (step 4018) whether the operator has indicated completion (or that time has run out), in which case the robot lawnmower 10 determines that the mapping of the perimeter 21 is complete and prompts the operator to move to a mowable, interior area of the lawn (i.e., the space to be mowed, step 4020). The controller then selects the outermost locations of the boundary cells in the map (step 4022) and performs the smoothing operation on selected cells (step 4024) to calculate a final, smoothed boundary. The controller then uses a filling function to assign all locations inside the calculated boundary as inside/mowable area (step 4026).
In some examples, the grid established with MOWABLE, NONMOWABLE, and BOUNDARY cells can additionally be used to determine where the mobile robot should travel while mowing the lawn. For example, during a particular run of the robot (or over multiple different runs), the system can record information about coverage-type states for the robot. For example, the system can keep track of the number of time the robot has visited the cell (to mow it) during a particular run or across multiple runs. For example, the system could determine a pose of the robot and identify the associated location on the grid. Information associated with that grid location could then be updated to indicate that the robot had mowed the location. The robot could then identify cells that had either not been mowed during the current run or that had been mowed less frequently over a series of past mowing runs (e.g., over the past 3 runs) and mow those areas prior to mowing other areas. This would be helpful for covering areas adequately before moving to other areas.
While at least some of the examples above have been discussed in relation to the use of UWB beacons, the methods described herein can be used in systems having other beacon-based localization systems where distance is measured from the mobile asset (robot) to the beacons. Such technologies include but are not limited to time-of-flight (TOF), time distance of arrival (TDOA), or signal strength based systems.
While this specification contains many specifics, these should not be construed as limitations on the scope of the disclosure or of what may be claimed, but rather as descriptions of features specific to particular implementations of the disclosure. Certain features that are described in this specification in the context of separate implementations can also be implemented in combination in a single implementation. Conversely, various features that are described in the context of a single implementation can also be implemented in multiple implementations separately or in any suitable sub-combination. Moreover, although features may be described above as acting in certain combinations and even initially claimed as such, one or more features from a claimed combination can in some cases be excised from the combination, and the claimed combination may be directed to a sub-combination or variation of a sub-combination.
Similarly, while operations are depicted in the drawings in a particular order, this should not be understood as requiring that such operations be performed in the particular order shown or in sequential order, or that all illustrated operations be performed, to achieve desirable results. In certain circumstances, multi-tasking and parallel processing may be advantageous. Moreover, the separation of various system components in the embodiments described above should not be understood as requiring such separation in all embodiments, and it should be understood that the described program components and systems can generally be integrated together in a single software product or packaged into multiple software products.
Accordingly, other embodiments are within the scope of the following claims.
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 |
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 |
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 |
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 |
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 |
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 |
6285930 | Dickson et al. | Sep 2001 | B1 |
6300737 | Begvall et al. | Oct 2001 | B1 |
D451931 | Abramson et al. | Dec 2001 | S |
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 | Van 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 | Ruffner | 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 |
6850024 | Peless et al. | Feb 2005 | B2 |
6870792 | Chiappetta | Mar 2005 | B2 |
6883201 | Jones et al. | Apr 2005 | B2 |
6885912 | Peless et al. | Apr 2005 | B2 |
6901624 | Mori et al. | Jun 2005 | B2 |
D510066 | Hickey et al. | Sep 2005 | S |
6938298 | Aasen | Sep 2005 | B2 |
6940291 | Ozick | Sep 2005 | B1 |
6956348 | Landry et al. | Oct 2005 | B2 |
6971140 | Kim | Dec 2005 | B2 |
6984952 | Peless et al. | Jan 2006 | B2 |
6999850 | McDonald | Feb 2006 | B2 |
7024278 | Chiappetta 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 |
20010022506 | Peless et al. | Sep 2001 | A1 |
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 |
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 |
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 et al. | 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 |
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 |
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 |
20150006015 | Sandin et al. | Jan 2015 | A1 |
Number | Date | Country |
---|---|---|
19932552 | Feb 2000 | DE |
0 792 726 | 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 |
2382157 | May 2003 | GB |
62120510 | Jun 1987 | JP |
62154008 | Jul 1987 | JP |
63-183032 | Jul 1988 | JP |
63241610 | Oct 1988 | JP |
2-6312 | Jan 1990 | JP |
3051023 | Mar 1991 | JP |
04320612 | Nov 1992 | JP |
06327598 | Nov 1994 | JP |
07-129239 | May 1995 | JP |
7-295636 | Nov 1995 | JP |
8-16776 | Jan 1996 | JP |
08089451 | Apr 1996 | JP |
8152916 | Jun 1996 | JP |
09179625 | Jul 1997 | JP |
9185410 | Jul 1997 | JP |
11-508810 | Aug 1999 | JP |
11-510935 | Sep 1999 | JP |
2001-258807 | Sep 2001 | JP |
2001-275908 | Oct 2001 | JP |
2001-525567 | Dec 2001 | JP |
2002078650 | Mar 2002 | JP |
2002-204768 | Jul 2002 | JP |
2002-532178 | Oct 2002 | JP |
3356170 | Oct 2002 | JP |
2002-323925 | Nov 2002 | JP |
3375843 | Nov 2002 | JP |
2002-355206 | Dec 2002 | JP |
2002-360471 | Dec 2002 | JP |
2002-360482 | Dec 2002 | JP |
2003005296 | Jan 2003 | JP |
2003010076 | Jan 2003 | JP |
2003-505127 | Feb 2003 | JP |
2003036116 | Feb 2003 | JP |
2003038401 | Feb 2003 | JP |
2003038402 | Feb 2003 | JP |
2003061882 | Mar 2003 | JP |
2003-310489 | Nov 2003 | JP |
9526512 | Oct 1995 | WO |
9740734 | Nov 1997 | WO |
9741451 | Nov 1997 | WO |
9853456 | Nov 1998 | WO |
9916078 | Apr 1999 | WO |
9928800 | Jun 1999 | WO |
9938056 | Jul 1999 | WO |
9938237 | Jul 1999 | WO |
9959042 | Nov 1999 | WO |
0036962 | Jun 2000 | WO |
0038026 | Jun 2000 | WO |
0038029 | Jun 2000 | WO |
0004430 | Oct 2000 | WO |
0078410 | Dec 2000 | WO |
0106904 | Feb 2001 | WO |
0106905 | Feb 2001 | WO |
0239864 | May 2002 | WO |
0239868 | May 2002 | WO |
02058527 | Aug 2002 | WO |
02062194 | Aug 2002 | WO |
02067744 | Sep 2002 | WO |
02067745 | Sep 2002 | WO |
02074150 | Sep 2002 | WO |
02075356 | Sep 2002 | WO |
02075469 | Sep 2002 | WO |
02075470 | Sep 2002 | WO |
02101477 | Dec 2002 | WO |
03026474 | Apr 2003 | WO |
03040845 | May 2003 | WO |
03040846 | May 2003 | WO |
03065140 | Aug 2003 | WO |
2004004533 | Jan 2004 | WO |
2004006034 | Jan 2004 | WO |
2004058028 | Jan 2004 | WO |
2005055795 | Jun 2005 | WO |
2005077244 | Aug 2005 | WO |
2006068403 | Jun 2006 | WO |
Entry |
---|
International Search Report and Written Opinion in International Application No. PCT/US2015/050775, dated Dec. 23, 2015, 12 pages. |
Angle et al., U.S. Appl. No. 60/177,703, filed Jan. 24, 2000, 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, 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=node142.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.ue.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 URLwww.wired.com/news/technology/o,1282,59237,00.html, accessed from the Internet: 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¶ml=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, pp. 231-242. |
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-RP3OW),” 2005, Retrieved from the Internet: URL www.onrobo.com/reviews/AT—Home/vacuum—cleaners/on00vcrb30rosam/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: URLhttp://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.d11?ViewItem&category=43526&item=4373497618&rd=1, accessed Apr. 2005, 7 pages. |
Number | Date | Country | |
---|---|---|---|
20160100522 A1 | Apr 2016 | US |