US 9,538,702 B2Grant

Robotic mowing of separated lawn areas

Issue Date:2017-01-10

•22 Claims

•17 Drawing Sheets

Abstract

A method of mowing multiple areas includes training the robotic mower to move across a space separating at least two areas, and initiating a mowing operation. Training the robotic mower to move across the space separating the areas includes moving the robotic mower to a traversal launch point of a first of the areas, storing data indicative of location of the traversal launch point, moving the robotic mower to a traversal landing point of a second of the areas, and storing data indicative of location of the traversal landing point. The mowing operation causes the robotic mower to autonomously and in sequence mow the first of the areas, move to the traversal launch point, move from the traversal launch point across the space to the traversal landing point, and then mow the second of the areas.

Metadata

Assignee

iRobot Corporation

Inventors

Paul Balutis
Andrew Beaulieu
Brian Yamauchi

Application Information

Application Number:US 14/579,080

Filing Date:2014-12-22

Priority Date:2014-12-22

Art Unit:3663

Classifications

IPC:

G01C21/00A01D34/00B25J9/00B25J5/00B25J9/16G05D1/02A01D101/00

Field of Search:

G01C 21/00

Patent Drawings (17 sheets)

Description

Technical Field

[0001] This invention relates to mowing lawn areas and other areas with an autonomous robot, and more particularly to mowing multiple, discontiguous areas.

Background

[0002] Autonomous robots can be programmed to mow lawn areas. Care must be taken to keep such robots from mowing outside intended areas. Buried electrical wires often define lawn boundaries that the robots are programmed to not cross. Other forms of navigation have also been considered.

Summary

[0003] One aspect of the invention features a method of mowing multiple areas separated by a space. The method includes training a robotic mower to mow the areas, including moving the robotic mower about the areas while storing data indicative of location of boundaries of each area relative to boundary markers. The method further includes training the robotic mower to move across the space separating the areas, including moving the robotic mower to a traversal launch point of a first of the areas, storing data indicative of location of the traversal launch point, moving the robotic mower to a traversal landing point of a second of the areas, and storing data indicative of location of the traversal landing point. Initiating a mowing operation causes the robotic mower to autonomously, and in sequence: mow the first of the areas, move to the traversal launch point, move from the traversal launch point across the space to the traversal landing point, and then mow the second of the areas.

[0004] In some examples, the method further includes training the robotic mower to move across a second space separating the second area from a third area to be mowed. The method may also include generating a 2D grid of cells representing one or more of the areas and the space, and assigning a value to each of the cells. The value indicates whether a particular cell is mowable. The value may also indicate whether the cell is on one or more of the boundaries. The value may indicate whether the cell is along a path between the traversal launch point and the traversal landing point.

[0005] In some examples, training of the robotic mower to move across the space separating the areas is performed after training the robotic mower to mow the first of the areas and before training the robotic mower to mow the second of the areas. The mower and each of the boundary markers may include a respective wideband transceiver that operates from a frequency of 5925 MHz to 7250 MHz. Training the robotic mower to move across the space can further include storing data indicative of at least one intermediate position along a path between the traversal launch point and the traversal landing point, and initiating the mowing operation may cause the robotic mower to move along the path through the intermediate position.

[0006] In some cases, initiating the mowing operation may cause the robotic mower to mow the first area according to a mowing pattern determined in part by a shape of the first area. The mowing pattern may be a corn row pattern, for example. Initiating the mowing operation may cause the robotic mower to automatically conclude the mowing operation after mowing the second of the areas, without again mowing within the first of the areas.

[0007] In some embodiments, the traversal launch point is on the boundary of the first area. The traversal landing point may be on the boundary of the second area.

[0008] In some implementations, during the mowing operation the mower moves in a straight line from the traversal launch point across the space to the traversal landing point. During the mowing operation, the robotic mower may automatically disable a mowing function while moving across the space and then may reactivate the mowing function in the second area.

[0009] Another aspect of the invention features a robotic mower with a wheeled chassis, a motorized grass cutter carried by the wheeled chassis, and a controller. The controller is configured to store data indicative of location of boundaries of each of at least two areas to be mowed, wherein the at least two areas are separated by a space not to be mowed, store data indicative of a traversal path across the space not to be mowed, wherein a traversal launch point of a first of the areas and a traversal landing point of a second of the areas are located along the traversal path, and control the robotic mower to perform a mowing operation. In a mowing operation, the robotic mower autonomously and in sequence mows the first of the areas, moves to the traversal launch point, moves from the traversal launch point across the space and along the traversal path to the traversal landing point, and mows the second of the areas.

[0010] In some examples, the controller is further configured to move the robotic mower in a straight line from the traversal launch point to the traversal landing point. The controller can be further configured to train the robotic mower to move across a second space separating the second area from a third area to be mowed. The controller can also be configured to automatically disable the grass cutter while the robotic mower moves along the traversal path, and to reactivate the grass cutter once the robotic mower is in the second area. The controller may store data indicative of at least one intermediate position along the traversal path, and wherein the mowing operation causes the robotic mower to move along the traversal path through the intermediate position.

[0011] The controller may be configured to generate a 2D grid of cells representing one or more of the areas and the space, and assign a value to each of the cells. The value may indicates whether a cell is mowable, for example. The value may further indicate whether the cell is on one or more of the boundaries. The value may also indicate whether the cell is along a path between the traversal launch point and the traversal landing point.

[0012] In some implementations of the robotic mower, the controller trains the robotic mower to move across the space separating the areas after the robotic mower is trained to mow the first of the areas and before the robotic mower is trained to mow the second of the areas. The robotic mower and each of the boundary markers may include a respective wideband transceiver that operates from a frequency of 5925 MHz to 7250 MHz., for example. The controller may store data indicative of at least one intermediate position along the traversal path, and the mowing operation may involve the robotic mower moving along the path through the intermediate position.

[0013] Many lawns are not regularly shaped or composed of continuous grass regions. For example, a lawn may include multiple different mowable areas separated by a non-mowable area such as a path or driveway. In order to mow multiple discontiguous sections or areas of a lawn, the robot lawnmower described herein navigates between the separated lawn areas to mow the multiple areas.

[0014] In some examples, the robot includes a controller and sub-systems configured to guide the robot to traverse non-mowable areas separating a first lawn area from a second lawn area. In some cases the robot controls its sub-systems such that the cutting system is operable during a mowing operation and not operable during traversal of the non-mowable areas between lawn areas and bypass of a lawn area to travel to another lawn area. As a result, a single robot can be used to care for two or more physically separate lawn areas.

[0015] The system may further allow for automated methods, manual methods, or a selectable combination of automated and manual methods of training routes that the robot takes to complete mowing, bypass, and traversal operations and move between the lawn areas. The automated methods may include optimization techniques to increase efficiency of mowing operations. The user may also have the flexibility to override the automated methods with manual training methods.

[0016] 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.

Description of Drawings

[0017] FIG. 1A is a schematic bottom view of an autonomous lawnmower robot.

[0018] FIG. 1B is a schematic side view of the robot of FIG. 1A.

[0019] FIG. 1C is a block diagram of a control system of the robot of FIG. 1A.

[0020] FIG. 2 is a schematic of an example set of discontiguous lawn areas with traversal regions that separate the discontiguous lawn areas.

[0021] FIG. 3 is a block diagram of a memory structure of the robot of FIG. 2.

[0022] FIGS. 4A-B are schematics illustrating methods of teaching boundaries of the discontiguous lawn areas to the robot.

[0023] FIGS. 5A and 5B are schematics illustrating methods of teaching traversal routes of the traversal regions to the robot.

[0024] FIG. 6 is a schematic illustrating methods of teaching bypass routes of the discontiguous lawn areas to the robot.

[0025] FIGS. 7A-B are the schematic of FIG. 2, each with a different overlaid route for the robot.

[0026] FIG. 8 is a screenshot of a computing device installed with an application to control the robot.

[0027] FIG. 9 is a flowchart for an example method of training the robot.

[0028] FIG. 10A-B are flowcharts for examples of operating the robot.

[0029] Like reference symbols in the various drawings indicate like elements.

Detailed Description

[0030] The robotic lawnmower described below can mow discontiguous lawn areas as it autonomously moves about the lawn areas and crosses traversal regions or spaces that separate the lawn areas. The robot includes a cutting system with cutting blades to cut grass on the lawn areas as it moves along a lawn route (A “route” is hereby also referred to as a “path.”) via a drive system with wheels that mobilizes the robot. The cutting system is decoupled from the drive system such that the robot can deactivate the cutting system while the drive system is running. For example, while the robot follows traversal routes across the traversal regions between the lawn areas, the robot can deactivate the cutting system.

[0031] A controller is coupled to a memory storage element that stores the behavior of robot during various operations and the schedules for mowing the discontiguous lawn areas. In some schedules, the robot can be programmed to mow a target lawn area that is separated from the robot's current location. The robot can be programmed to move along bypass routes across the lawn areas with the cutting system deactivated so that the robot can reach a target lawn area without mowing the lawn areas that are in between the location of the robot and the target lawn area. The memory storage element further stores, for example, data corresponding to points or segments along the lawn routes, the traversal routes, and the bypass routes. A combination of manual training by a user or automatic path planning by subroutines programmed on the robot determines the routes, and the memory storage element can data pertaining to the routes.

[0032] FIGS. 1A-B are general schematic overviews of an example of the autonomous lawnmower robot 10, and FIG. 1C shows a block diagram of a control system that operates the autonomous lawnmower robot 10. FIG. 1A shows a schematic bottom view of the robot 10 with a forward direction F, which includes a main body 20 that contains wheel modules 610a-b of a drive system 600 (shown in FIG. 1C) and a cutter 410 of a cutting system 400 (shown in FIG. 1C).

[0033] The wheel modules 610a-b include the wheels, motor, and gearbox for driving the robot 10 in a forward or backward direction. The wheel modules 610a-b can be differentially operated such that the robot can turn based on a level of drive supplied to each wheel. The drive system 600 further includes caster wheels 620a-b that partially supports the weight of the robot 10.

[0034] The cutter 410 is, for example, rotatable reciprocating blades that can cut grass as a cutter drive sub-system 420 (shown in FIG. 1C) drives the cutter 410 to rotate. The cutter 410 has a mowing width W_Mthat defines the width of grass that the robot 10 cuts as the robot 10 moves over uncut grass. The cutter drive sub-system 420 includes a high-power motor and a high-torque gearbox that operate the cutter 410 such that, at highest power, the motor, gearbox, and the cutter 410 can cut thick swaths of grass.

[0035] The bottom portion of the robot 10 can further include sensors part of a sensor system 650 (shown in FIG. 1C). These sensors may include cut edge sensors 510a-b that differentiate between cut grass and uncut grass, grass height sensors that measure the height of grass beneath the robot 10, and cliff sensors that detect drop-offs in the terrain underneath the robot 10.

[0036] FIG. 1B is a schematic side view of the exemplary robot 10. The robot 10 includes a power system 800 with a power source 810, a controller 1000, a communication system 1100, and a memory storage element 900. The controller 1000 controls the systems of the robot 10, which will be described in more detail later in reference to FIG. 1C. The power system 800 supplies power via the power source 810 to the other robot systems. The communication system 1100 allows the controller 1000 to wirelessly communicate with external computing devices, such a mobile device or web-based device. The communication system 1100 can include, for example, a Bluetooth transceiver and/or a WiFi transceiver.

[0037] The power system 800, which includes a power source 810, provides power to the systems operable with the robot. The power source 810 is adjustable such that the power system 800 can provide a percent of full power. A charging system 820 within the power system 800 is connectable to an external charging dock to charge the power source 810.

[0038] The sensor system 650 (shown in FIG. 1C) of the robot 10 further includes a location estimation system 655 (shown in FIG. 1C). In some examples, the location estimation system 655 is a time-of-flight based system that uses a time-of-flight between a boundary marker (hereby also referred to as a “beacon” or a “marker”) and the robot to determine the pose of the robot. For example, boundary markers may be placed along the boundary of the lawn. While the time-of-flight system uses markers that have been described as boundary markers, the marker can also be placed within or near the lawn to aid localization of the robot lawnmower. In some cases, the boundary markers send out a signal that the robot lawnmower interprets to determine its position relative to the boundary marker. In other examples, the boundary markers are passive and a radiation source on the robot lawnmower emits radiation that reflects off surfaces situated in the lawn area and is detected by a radiation detector on the robot. The localization can use triangulation to determine the robot position within the boundary. The signals sent between the boundary markers and the robot positioned on the property allow the robot to estimate the angles and the distance by calculating time of flight to each of the boundary markers, and using trigonometry to calculate the robot's current position. In another example, rather than use time-of-flight measurements, the system can triangulate the distance to an object using a fixed-angle laser pointer and a CMOS imager, with a known baseline between the two. In such examples, the pixel location of the received signal at the imager is indicative of the distance to the object. In some particular examples, the boundary markers are wideband transceivers in the 5,925 to 7,250 MHz range or ultra-wideband transceivers. However, other time-of-flight transceivers could be used.

[0039] Moreover, the sensor system 650 includes an obstacle sensing system 657 that further includes the proximity sensors 680 disposed on the lateral sides of the robot 10 such that the robot can detect when it has made contact with a physical barrier or when it is in close proximity to a physical barrier. The proximity sensors 680 can take the form of contact sensors (e.g. a sensor that detects an impact of a bumper on the robot with a physical barrier) and/or LIDAR (Light Detection And Ranging, which can entail optical remote sensing that measures properties of scattered light to find range and/or other information of a distant target) sensors that detect when the robot is in close proximity to nearby objects.

[0040] The sensor system 650 also includes a handle sensing system 670 (shown in FIG. 1C), which detects when a detachable handle 675 is attached to the robot 10. The detachable handle 675 is usable in a training mode as well as a mowing mode. Other sensors of the sensor system 650 include a global positioning system (GPS) as an additional means to determine the location of the robot 10, a tilt sensor to detect the level of the terrain beneath the robot, a rain sensor to detect water from, e.g. rain, that could damage the electromechanical components of the robot 10, and sensors and encoders operable with other systems to assist in control of the robot 10. Additionally or alternatively, the sensor system 650 can include, but not limited to, wheel drop sensors, sonar, radar, etc., infrared cliff sensors, a camera (e.g., volumetric point cloud imaging, three-dimensional (3D) imaging or depth map sensors, visible light camera and/or infrared camera), etc.

[0041] Referring to FIG. 1C, to achieve reliable and robust autonomous movement and cutting, the robot 10 includes the controller 1000 that operates the memory storage element 900, the communication system 1100, the cutting system 400, the sensor system 650, the drive system 600, the navigation system 700, and the power system 800. The cutting system 400 includes the cutter drive sub-system 420, which can comprise a motor and gearbox to drive the cutter. The sensor system 650 further includes the handle sensing system 670 and the location estimation system 655 as well as other sensors mentioned earlier. The controller 1000 operates the navigation system 700 configured to maneuver the robot 10 in a path or route stored in the memory storage element 900 across the lawn areas and/or traversal regions. The navigation system 700 is a behavior-based system executed on the controller 1000. The navigation system 700 communicates with the sensor system 650 to determine and issue drive commands to the drive system 600. In particular, the controller includes obstacle detection and avoidance methods and behaviors implemented in response to sensor signals from the obstacle sensing system 657. The robot can use its proximity sensors to detect the general geometry of an obstacle in the general vicinity in front of the robot 10 so that the robot 10 can determine what direction to turn. For example, using proximity sensors 680 disposed on the front portion of the robot 10, the controller 1000 can determine when the robot is about to collide with an obstacle and communicate instructions to the navigation system 700 and the drive system 600 to avoid the obstacle.

[0042] The memory storage element 900 stores data pertaining to operations—such as mowing operations or traversal operations—and the subroutines of the robot that can be implemented for, for example, training or mowing operations. The data further includes lawn route data, traversal route data, bypass route data, path behavior data, and scheduling data all of which will be described in more detail later. The controller 1000 communicates with the memory storage element 900 to determine which systems to activate or deactivate during an operation. A system (e.g. the cutting system 400, the drive system 600, the power system 800) can be activated at a level from 0% (e.g., off) to 100%. The memory storage element 900 includes data associated with a level of activation for an operation. For example, in some operations such as traversal operations, the controller 1000 activates the power system 800 at a 50% activation level due to lower power requirements for the traversal operations. The controller 1000 can have a high power mode (e.g. 75%-100% activation level of the power system 800) to accommodate greater mechanical stresses in the cutting system 400 when mowing large and thick swaths of grass.

[0043] The electromechanical systems, including sensing, cutting, drive, navigation, power, communication systems, disclosed and illustrated herein may include the additional elements and features as disclosed in U.S. patent application Ser. No. 11/688,213, filed Mar. 19, 2007, titled “Robot Confinement,” the disclosure of which is incorporated by reference herein in its entirety.

[0044] In general, many lawns are irregularly shaped or composed of discontinuous grass regions. For example, a lawn may include multiple different mowable areas separated by a non-mowable area such as a path or driveway. In order to mow multiple discontiguous sections or areas of a lawn, the robot lawnmower described herein navigates between the separated lawn areas to mow the multiple areas.

[0045] FIG. 2 depicts a schematic view of an example of a property 100 with three discontiguous lawn areas 102a-c. The lawn areas 102a-c have boundaries 106a-c, respectively. A traversal region 104a separates the lawn area 102a and the lawn area 102b, and a traversal region 104b separates the lawn area 102b and the lawn area 102c. The lawn area 102a has a rose garden 125, which is an un-mowable feature (e.g., a keep-out or non-mowable space within the boundary of area 102a). The traversal region 104a includes a concrete walkway 115 that separates the lawn area 102a from the lawn area 102b and a floral divider 116 within the concrete walkway 115. Thus, if the robotic lawn mower is to mow both lawn area 102a and area 102b, it must cross the concrete walkway 115 in a region free of the floral divider 116. The lawn area 102c has an amorphous shape with trees 127 located at segments of the boundary 106c. The traversal region 104b is a rocky area 117 that includes a circular fire pit 131. Thus, to navigate between lawn area 102b and lawn area 102c, the robot must traverse region 104b while avoiding the fire pit 131.

[0046] The robot 10, shown parked at a charging dock 50, mows the lawn areas 102a-c according to a schedule pre-determined by the user. The charging dock 50 restores the power source (described earlier) of the robot 10 and also serves as a launch point 1001 for route data that the robot stores (described later in more detail). The robot 10 can move from one lawn area to another via the traversal regions 104a-b.

[0047] FIG. 3 shows an example of training data 303 stored in the memory storage element 900 (depicted in FIG. 1C) that the robot can execute to mow a discontiguous set of lawn areas. To train the robot 10, as will be discussed later, the training data 303 can be generated in automated methods, manual methods, or a combination of the two methods. The training data 303 includes boundary data 305, internal boundary data 310, traversal route data 315, bypass route data 320, lawn route data 325, path behavior data 330, and scheduling data 335. The controller 1000 (depicted in FIG. 1C) can process and execute at least some of the training data 303 to move about lawn areas and traversal regions and mow target lawn areas.

[0048] The boundary data 305 is the set of points that bounds a lawn area. Referring briefly back to FIG. 2, the boundary 106a-c of the lawn areas 102a-c can be represented by a set of discrete points stored as the boundary data 305a-c, respectively, or as a set of labelled cells in a Cartesian grid, which will be described in more detail later. From the boundary data 305, the controller can determine geometric characteristics of the lawn area, including length, width, area, and shape.

[0049] The internal boundary data 310 is the set of points that bound obstacles that cannot be traversed. The internal boundary data 310 defines the keep-out zones within a mowable area where the robot lawn mower should not mow. For example, referring briefly back to FIG. 2 again, the rose garden 125 and the fire pit 131 can be represented by a set of discrete points stored as the internal boundary data 310.

[0050] The traversal route data 315, the bypass route data 320, and the lawn route data 325 each include a set of points. Each point stored in the traversal route data 315, the bypass route data 320, and the lawn route data 325 includes one or more locations (e.g. X-, Y-coordinates measured from one or more datum points). As will be described in greater detail later, the one or more datum points can correspond to locations relative to boundary markers placed along the boundary. The locations of the boundary markers serve as reference points for other points stored in the boundary data 305, the traversal route data 315, the bypass route data 320, and the lawn route data 325. Locations of points herein are generally measured relative to a coordinate system established relative to the boundary markers.

[0051] The controller can use the route data 315, 320, 325 to generate one or more paths of movements that the robot 10 follows as it executes mowing, traversal, or bypass operations. The points and the orientation angle can be measured with respect to a Cartesian coordinate system, defined by for example, Cardinal directions and a reference point on the lawn. The points correspond to a position of the robot, and the orientation corresponds to the direction that the front of the robot is facing. The controller can control the drive system and navigation system such that the robot is placed into the position of the point and the orientation associated with that point. The controller uses the points of the route data 315, 320, 325 to generate routes to move about the lawn areas and traversal regions.

[0052] Referring also to FIG. 2, the traversal route data 315 includes traversal route data 315a and traversal route data 315b for the traversal region 104a and the traversal region 104b, respectively. Generally, during a traversal operation, a robot starts on the boundary of a first lawn area, follows a route that crosses a traversal region, and ends on a second lawn area. In the example of FIG. 2, the controller uses the points stored in the traversal route data 315a to generate a traversal route for the robot to move from the lawn area 102a across the traversal region 104a to arrive at the lawn area 102b. The controller uses the points stored in the traversal route data 315b to generate a traversal route for the robot to move from the lawn area 102b across the traversal region 104b to arrive at the lawn area 102c. Traversal route data includes at least a traversal launch point and a traversal landing point. The traversal launch and landing points can be geolocations or positions (e.g., X, Y positions in a coordinate system) relative to the boundary markers. Traversal route data can further include intermediate traversal points.

[0053] The traversal launch points generally correspond to an end point of a first lawn route; the intermediate traversal points generally correspond to points in the traversal region where the robot travels (e.g., the path or the route); and the traversal landing points generally correspond to a start point of a second lawn route. The first lawn route terminates at a first interface between the first lawn area and the traversable region. The first interface is defined by a subset of points of the boundary data for the first lawn area.

[0054] The intermediate traversal points within the traversal route correspond to points that the robot follows while traversing the area. The intermediate traversal points can further correspond to other changes in behavior of the systems of the robot, such as the drive system, the power system, the navigation system, etc. For example, the controller could increase the power level at the intermediate traversal point in order to compensate for a change in terrain at the intermediate traversal point. The terrain could be more difficult for the robot to traverse after crossing the intermediate traversal point, and it would thus be beneficial to increase the power level of the power system. The intermediate traversal routes can include one or more additional intermediate points that, with the intermediate traversal points, can define line geometries that can be represented by two or more points. For example, two intermediate traversal points and an intermediate point can define an arc.

[0055] The traversal landing point corresponds to the end of the traversal region and may additionally correspond to a start point of a second lawn route. The second lawn route can begin at a second interface between the second lawn area and the traversal region. The second interface is defined by a subset of points of the boundary data for the second lawn area. The traversal route data 305a includes a traversal launch point, intermediate traversal points, and a traversal landing point. The traversal route data 305b includes a traversal launch point, intermediate traversal points, an intermediate traversal route, and a traversal landing point. The points described above for the traversal route data 305a-b will be elaborated in more detail herein.

[0056] In some situations, it can be desirable to move to a different lawn area without first mowing the lawn area nearest to the robot docking station 50. In other situations, it can be beneficial to traverse a lawn area without mowing the area (e.g., to return to the docking station 50 from a separated lawn area). Bypass route data 320a-b provides a path for the robot lawnmower to follow to traverse a particular lawn area without mowing the area.

[0057] The bypass route data includes the bypass route data 320a for the lawn area 102a and the bypass route data 320b for the lawn area 102b. Also referring briefly to FIG. 2, the points stored in the bypass route data 320a allow the controller to generate a bypass route going from the launch point 1001 across the lawn area 102a to the start of the traversal route for the traversal region 104a. The bypass route data 320b allow the controller to generate a bypass route going from the start of the traversal route for the traversal region 104a across the lawn area 102b to the start of the traversal route for the traversal region 104b.

[0058] During mowing of a particular lawn area, the robot lawnmower can follow a predetermined path or pattern to complete cutting of the grass in the lawn area. The information about the path is stored as lawn route data. The robot lawnmower can store separate route data for each of the different lawn areas allowing each to be mowed according to a pattern that is appropriate for the lawn area. The lawn route data 325 includes lawn route data 325a for lawn area 102a, lawn route data 325b for lawn area 102b, and lawn route data 325c for lawn area 102c. The controller uses the lawn route data 325a-c to guide the robot through movement patterns (described in more detail below in relation to FIG. 7) that cover the areas of the lawn area 102a-c. The covered area of the robot is defined by the product of the mowing width W_M(described above) and the length of distance traveled by the robot while executing a lawn route. The lawn route data 325a-c each include a start point and an end point as well as the movement pattern for each lawn area 102a-c, respectively. The controller can further compute the area of each lawn to determine the movement pattern. During a mowing operation, the computed area allows the controller to compare the computed area of the lawn to the covered area of the lawn to determine whether the robot has achieved enough coverage of the lawn. In some implementations, sufficient coverage is defined by a ratio of covered area to computed area greater than 1.

[0059] The path behavior data 330 indicates the operations of the robot systems (e.g. the drive system, the cutting system, the navigation system) along segments of the routes defined by the route data 315, 320, 325. For example, parts of or all of the routes corresponding to the lawn route data 325 can be associated with path behavior data 330 that instructs the controller to set the power system such that the drive system and the cutting system are both on and the grass is cut while the robot traverses the route. Parts of or all of the routes corresponding to the traversal route data 315 and the bypass data 320 can be associated with path behavior data 330 that sets the drive system to a predetermined drive speed (e.g., slower than mowing when the robot is likely to maneuver difficult turns or faster than during the mowing if the robot traverses a long distance) and the cutting system to an activation level of 0% (e.g., mowing is disabled). The path behavior data 330 can further include instructions to the navigation and/or drive systems to navigate the robot through turning and forward drive.

[0060] The scheduling data 335 can be set by the user via the mobile application or a user interface on the robot. The user can set a schedule that automates the robot to mow each lawn at a different time. For example, the robot can be set to mow lawn areas 102a-b at a user-selected time on one day of the week and can be set to mow lawn area 102c at another user-selected time on another day of the week. The scheduling data 335 determines which routes 315, 320, 325 to combine to generate a path for the mowing operation at the given time.

[0061] To generate the route data 315, 320, 325, the robot can be trained manually by a user or automatically. FIGS. 4-8 depict aspects of both automated and manual methods of training the robot. In particular, FIGS. 4A-C show different examples of generating the boundary data 305 that can be used by the controller or the user to generate the route data 315, 320, 325. FIGS. 5A-C show different examples of generating the traversal route data 315. FIG. 6 depicts an example of generating the bypass route data 320. FIG. 7 shows examples of route data (e.g., lawn route data, traversal route data, and bypass route data) that can be generated based on the results from FIGS. 4-6. As the route data 315, 320, 325 are generated, the path behavior data 330 can be automatically (described in association with FIG. 7) or manually (described in association with FIG. 8) associated with each of the route data 315, 320, 325 such that appropriate systems of the robot 10 are activated and deactivated. While the examples shown in each of FIGS. 6-8 are for the lawn areas and the traversal regions of the shown geometry, it should be understood that each training mode can be implemented to train the robot 10 for a variety of lawn geometries and configurations.

[0062] FIG. 4A shows an exemplary lawn area 102c in which the robot 10 determines its pose within the lawn area 102c by detecting boundary markers 128a-c. Each boundary marker is positioned at a known location and situated so that the robot can detect each boundary marker as the robot navigates the lawn. To determine its position on the lawn, the robot receives signals from the individual boundary markers. The robot determines its pose based on the signals, which can represent the robot's location relative to the three boundary markers.

[0063] The pose of the robot (e.g., P₁, P₂) can be determined based on the signals received from the boundary markers (e.g., a signal sent from the robot and reflected by the boundary marker or a signal generated by the boundary marker and received by the robot). The robot lawnmower determines the distance between the robot and the boundary marker based on the time-of-flight between the marker and the robot. Thus, based on the information from multiple boundary markers, the robot's pose can be determined by trilaterating based on received range/heading information from each of the boundary markers. In general, trilateration is the process of determining absolute or relative locations of points by measuring distances, using the geometry of circles, spheres, or triangles. In one example, trilateration can be based on a least squares algorithm using the distance/time-of-flight measurements. In another example, time-of-flight can be measured indirectly by measuring the phase shift between the signal and the receipt of the reflect signal. Alternately, distance can be determined by transmitting a signal from the robot, measuring the time the signal arrives at each boundary marker, and using a time-difference-of-arrival technique to estimate the robot's location.

[0064] The boundary 106b is trained using a teach-and-playback routing in which the user pushes the robot around the boundary 106b and the robot stores information about the location of the trained boundary. Further details of an exemplary process for determining the lawn boundary can be found, for example, in U.S. Ser. No. 14/512,098 filed on Oct. 10, 2014 and titled “Robotic Lawn Mowing Boundary Determination,” the contents of which is hereby incorporated by reference in its entirety.

[0065] FIG. 4B shows a manual process of generating the lawn boundary data for the lawn area 102b. The user manually navigates the robot 10 around the boundary 106b of the lawn area 102b by guiding the robot 10 with the detachable handle 675, and the robot 10 generates the boundary data 305b as it is moved around the lawn area 102b. The user 70 manually maneuvers the robot 10 by pushing and pulling the handle 675. The robot 10 can automatically store points, or the user 70 can manually trigger a point to be stored. As the user 70 moves the robot 10, the robot 10 can be programmed to store the point corresponding to its current position route under the boundary data 305b (described in reference to FIG. 3 above) for the boundary 106b of the lawn area 102b. In some implementations, the robot 10 can be programmed to automatically store its current position every second. The user 70 can also manually instruct the robot 10 to store its current position, via, for example, the application on the mobile device, which will be described in more detail later.

[0066] In some examples, a data processing unit generates a 2D grid of cells to represent the lawn areas. As the robot lawnmower determines its position relative to the beacons, the data processing unit determines and saves the coordinates of each cell containing the robot lawnmower during its motion. For each lawn area, each cell in the grid can be assigned a mowing-area value indicating whether the cell is understood to be NONMOWABLE (i.e. outside the boundary), MOWABLE (i.e., inside the boundary), or BOUNDARY (i.e., on the boundary). Each cell of the grid can be assigned (X, Y) coordinates based on a chosen origin (0,0) cell. Each cell can represent a square area, with each cell having a side length between 1 and 100 cm. For example, the grid can be a grid of cells, each 10 cm×10 cm. The robot lawnmower stores the (X, Y) coordinates of each cell traversed by the robot lawnmower along the actual teaching path travelled during the teaching mode. The robot lawnmower can mark the actual teaching path as a simple line tracing the path of the robot through single cells. Alternatively, the robot can mark all cells under the footprint of the robot as BOUNDARY cells. At the start of teaching, the values of all cells are initialized to NONMOWABLE. The operator presses the start button to start the training process and then drives around the boundary of the mowing area. As the robot drives, the values of all cells along its actual teaching path are set to BOUNDARY, the location of the cells being determined by the distance to the beacons. After walking the boundary, the operator presses a button to end the teaching process. Then, the operator positions the robot lawnmower anywhere within the mowing area and presses a button, indicating to the robot lawnmower that it is inside the boundary. In response, the system performs a flood fill to set the values of all cells inside boundary defined by the BOUNDARY cells to mark them as MOWABLE cells to be mowed.

[0067] Referring back to FIG. 3, the traversal route data 315 instructs the robot with a route to move across the traversal regions between the separated lawn areas, such as the traversal regions 104a-b shown in FIG. 2. By way of general overview, to train the traversal route data, the controller determines and stores at least a traversal launch point and a traversal landing point. In some implementations, the controller further determines and stores intermediate traversal points. FIGS. 5A and 5B depict examples of points generated for the traversal route data 315a and 315b (described earlier in relation to FIG. 3), respectively. The traversal route data 315a contain points that define a traversal route 1500 within the traversal region 104a that the robot takes to move from the lawn area 102a to the lawn area 102b. The traversal route data 315b contain points that define a traversal route 1600 within the traversal region 104b that the robot follows to move from the lawn area 102b to the lawn area 102c.

[0068] FIGS. 5A-B show examples of the traversal routes 1500, 1600, respectively, generated for the traversal regions 104a-b, respectively. During the traversal operation, the robot 10 navigates across the traversal regions 104a-b by going sequentially through points that define the traversal routes 1500, 1600. The traversal route 1500 is defined by a first traversal launch point 1540, intermediate traversal points 1550a-b, and a first traversal landing point 1560. The robot 10 moves sequentially in straight line segments from point 1540, to point 1550a, to point 1550b, to point 1560. Referring to FIG. 5B, the traversal route 1600 is defined by a second traversal launch point 1640, an intermediate traversal point 1650, and a second traversal landing point 1660. To move across the traversal region 104b, the robot 10 moves sequentially in straight line segments from point 1640, to point 1650, to point 1660. While the example shown in FIG. 5C shows the traversal route data for particular configurations of the traversal regions, it should be understood that traversal route data can be generated for other traversable configurations of traversal regions.

[0069] In some examples, the route between the traversal launch point and the traversal landing point can be trained using a process similar to the process used to train the boundary of the lawn. For example, the user can place the robot into a traversal training mode and the traversal launch point can be the robot's location relative to the beacons. The user then pushes the robot along a path and the robot stores the path in a memory. The end of the path is stored as the traversal landing point.

[0070] While in the example described above, the traversal route was manually trained, in some examples an automated process can be used to train the traversal route. In an automated implementation of training the traversal route 1500, the controller automatically generates the traversal route 1500. Referring to FIG. 5A, the controller determines and stores the shortest traversable route between a source boundary (the boundary 106a) and a destination boundary (the boundary 106b). The robot 10 can identify the shortest traversable route in various ways. For example, the robot can identify locations where the robot is able to drive between one area and the other (e.g., determine regions free of obstacles). Given a grid-based representation of the lawn as described earlier, a path planning algorithm such as A*, rapidly exploring random trees (RRTs), or probabilistic roadmaps can then be used to find the shortest path from the robot's current location to the destination.

[0071] In a manual implementation of training the traversal routes 1500, 1600, the robot 10 is manually driven via a detachable handle (described earlier in relation to FIG. 4C but not shown in FIG. 5). When the user attaches the detachable handle to the robot 10 and notes in the application that the user is performing a traversal route training, the controller initiates a training mode. With respect to the traversal route 1500, the user navigates the robot 10 through the traversal route 1500, and the robot systems (e.g. the controller and the memory storage elements) generate points corresponding to the traversal route 1500. The robot systems, via the manual navigation of the robot 10, can generate points substantially similar to the ones described above, e.g., the traversal launch point 1540, the traversal landing point 1560, and the intermediate traversal points 1550a-b, though it should be understood that the user can navigate the robot 10 along a different route with fewer or more intermediate traversal points. When the users pushes the robot 10 out of the region of the lawn area 102a, the controller of the robot 10 confirms this departure and generates the traversal launch point 1540 corresponding to the point where the robot 10 exits the lawn area 102a. The user of the robot 10 guides the robot through the traversal route 1500 turning to avoid the floral divider 116 and the robot 10 stores information about the path the robot 10 follows during the traversal route training. When the user pushes the robot 10 across the boundary 106b, the controller can detect the crossing based on mapping data of the lawn 104b and automatically generate the traversal landing point 1560.

[0072] With respect to the traversal route 1600, the user pushes the robot 10 across the boundary 106b in a diagonal direction, and the controller generates the traversal launch point 1640. The user manually navigates the robot 10 toward the boundary 106c avoiding the fire pit 131 and the robot 10 stores the path followed by the robot 10. When the robot 10 crosses the boundary 106c, the controller generates the traversal landing point 1660 and completes the traversal route training for the traversal region 104b.

[0073] In some examples, as noted above, the data processing unit generates a 2D grid of cells to represent the lawn areas and each cell is indicated as MOWABLE, NONMOWABLE, or BOUNDARY. In such a grid based system, during training of the traversal region, as the robot lawnmower determines its position relative to the beacons, the data processing unit determines and saves the coordinates of each cell containing the robot lawnmower during its motion (e,g., while traversing the boundary area between the lawn areas). Each cell of the grid can be assigned (X, Y) coordinates based on a chosen origin (0,0) cell. The robot lawnmower stores the (X, Y) coordinates of each cell traversed by the robot lawnmower along the actual teaching path travelled during the teaching of the traversal path. The robot lawnmower can mark the actual teaching path as a simple line tracing the path of the robot through single cells. Alternatively, the robot can mark all cells under the footprint of the robot as TRAVERSAL PATH cells.

[0074] At the start of teaching, the values of all cells between the multiple mowing lawn areas are initialized to NONMOWABLE. The operator presses the start button to start the teach process and then drives from one lawn area to another lawn area. As the robot drives, the values of all cells along its actual teaching path are set to TRAVERSAL PATH, the location of the cells being determined by the distance to the beacons. After walking the traversal path, the operator presses a button to end the teaching process. During operation, when the robot lawnmower traverses calls marked as TRAVERSAL PATH, the robot lawnmower disables (turns off) its cutting system.

[0075] FIG. 6 is an example of training bypass route data 320a, 320b, which provides data the controller uses to cross through the lawn area 102a, 102b, respectively. The controller generates a bypass launch point 1740 corresponding to the launch point 1001. The controller further generates a bypass landing point 1760, which coincides with the traversal launch point 1540. The bypass launch and landing points are locations relative to the beacons. The controller determines and stores the shortest route between the bypass launch point 1740 and the bypass landing point 1760 avoiding any keep-out zones within the lawn area. The controller selects initial points for the shortest route. The controller directs the robot 10 to move from the bypass launch point 1740 to the bypass landing point 1760 via the shortest route (e.g., a straight line). The controller knows the location of the rose garden 125 from the keep-out zone training of the mowable space and uses internal boundary data (e.g., internal boundary data 310 depicted in FIG. 3) for the rose garden 125 to determine a bypass route 1700 that avoids traversal of the prohibited space. As a result of this route determination, the controller stores the bypass launch point 1740, an intermediate bypass point 1750, and the bypass landing point 1760 as shown in FIG. 6.

[0076] Similarly, to train the bypass route data 320b representing the bypass route 1800, the controller generates a bypass launch point 1840 that coincides with the traversal landing point 1560 and a bypass landing point 1860 that coincides with the traversal launch point 1640. The controller determines and stores the shortest route between the bypass launch point 1840 and the bypass landing point 1860 that avoids prohibited or keep-out areas (e.g., determines a path that stays within the mowable space). In other examples, a user can train the bypass routes in a similar manner to the process used to train the boundary by pushing the mower along a desired path while the robot stores information about the path.

[0077] In some examples, as noted above, the data processing unit generates a 2D grid of cells to represent the lawn areas, and each cell is indicated as MOWABLE, NONMOWABLE, or BOUNDARY. Regions between the lawn areas can have connection paths marked as TRAVERSAL PATH cells. In such a grid based system, during training of the bypass route, as the robot lawnmower determines its position relative to the beacons, the data processing unit determines and saves the coordinates of each cell containing the robot lawnmower during its motion (e.g., while traversing across the lawn area). Each cell of the grid can be assigned (X, Y) coordinates based on a chosen origin (0,0) cell. The robot lawnmower stores the (X, Y) coordinates of each cell traversed by the robot lawnmower along the actual teaching path travelled during the teaching of the bypass path. The robot lawnmower can mark the actual teaching path as a simple line tracing the path of the robot through single cells. Alternatively, the robot can mark all cells under the footprint of the robot as BYPASS cells.

[0078] At the start of teaching, since the bypass route is within the lawn area to be mowed, the values of all cells are MOWABLE. The operator presses the start button to start the teach process and then drives from one position within the lawn area to another position within the lawn area. As the robot drives, the values of all cells along its actual teaching path are set to BYPASS (or MOWABLE/BYPASS), the location of the cells being determined by the distance to the beacons. After walking the bypass route path, the operator presses a button to end the teaching process.

[0079] FIGS. 7A-B depict automatic generation of the lawn route data 325a-c as well as the different path behaviors 330 associated with the route data 315, 320 generated above. The lawn route data 325a-c includes a start point, an end point, and a movement pattern. The movement pattern can be, for example, a spiral pattern, a corn row pattern, zig-zag pattern, etc. A user can select a desired movement pattern for each of the lawn areas and different patterns may be selected for different areas of the same lawn.

[0080] In some examples, a yard may be too large to mow on a single charge of the robot lawnmower battery. In such situations, the robot can mow different areas of the yard at different times allowing the robot to return to the dock and charge its battery between mowing the different areas.

[0081] FIG. 7A depicts the execution of a mowing operation of lawn area 102a, 102b, after which the robot returns to the charging dock 50. FIG. 7B depicts the execution of a mowing operation of lawn area 102c after which the robot returns to the charging dock 50. In the examples as shown, the lawn routes 1900a-b are automatically generated based on the start points, the end points, and default movement patterns. For the lawn area 102a, the robot is beginning at the launch point 1001 and proceeds in a corn row movement pattern until the robot has determined that it has covered the lawn area 102a (e.g., completed the coverage pattern or determined that the covered area—defined by, for example, the distance covered by the robot multiplied by the width of the cutting element—is greater than 100% of the computed area for the lawn area 102a). The corn row movement pattern guides the robot back and forth across the lawn such that the robot moves perpendicular to the longitudinal movement of the pattern slightly between each traversal. Upon completion of mowing of lawn area 102a, to move from the lawn area 102a to the lawn area 102b, the controller executes the traversal route data 320a which defines the traversal route 1500. The associated path behavior data 330 for the traversal route data 320 includes a deactivation of the cutting system. For the lawn route data 325b, the start point is defined as the traversal landing point 1560, and the end point is defined as the traversal launch point 1640. Upon entry into lawn area 102b, the robot activates the cutting system. After completion, the robot returns to the launch point 1001.

[0082] Referring to FIG. 7B, at a subsequent time (e.g., after charging) the robot continues to mow the lawn by mowing lawn area 102c. To move from the launch point 1001 to the lawn area 102c, the controller executes the bypass route data 320a, the traversal route data 315a, the bypass route data 320b, and the traversal route data 315b. The data 320a-b, 315a-b together define a bypass route 2100 to move the robot from the launch point 1001 to lawn area 102c. The associated path behavior data 330 for the bypass route 2100 to bypass the lawn areas 102a-b includes a deactivation of the cutting system. Upon entry into the intended area to mow, the robot activates the cutting system. The start point of the lawn route 1900c corresponds to the end point of the bypass route 2100. The robot proceeds in a corn row movement pattern until the robot has determined that it has covered the lawn area 102c. When the robot has determined that the robot has covered the lawn area 102c, the controller directs the robot 10 to return to the launch point 1001.

[0083] As mentioned throughout this disclosure, the user can monitor and control various aspects of the robot and the training of the robot through an application installed on a computing device, which allows a user to enable functionality such as scheduling, bypassing, movement selection, lawn area selection, among other functions. The user can interact with the computing device via user interface features, such as a touchscreen display, a keyboard, voice command, gestures, or another type of interaction. While the computing device as shown in FIG. 8 is a smartphone, in other implementations, the device could be a portable device such as smart glasses, smart watch, a laptop computer, or a computing device such as a desktop computer.

[0084] FIG. 8 shows a screenshot of the user interface of the exemplary lawn area shown in FIG. 2. The mobile device displays a menu portion 3000 and a map portion 3500. The menu portion 3000 shows options including “Show Routes”, “Schedule”, and “Default Settings”. Tapping “Show Routes” on the menu portion 3000 will reveal the points or cells stored as a result of training the traversal routes, bypass routes, and lawn routes. As will be discussed, the user can interact with these points. Tapping “Schedule” allows the user to modify the schedule for the mowing operations of the robot. Tapping “Default Settings” allows the user to modify the default settings for the training subroutines.

[0085] The map portion 3500 includes a satellite map of the lawn areas that the user would like to mow. The satellite map can be selected by the user and can be downloaded from a map provider service. The processor of the mobile device can further recognize boundaries and delineations on the satellite map. Prior to any training, the user can interact with the satellite map to give a general area corresponding to the lawn areas that the user wishes to mow. The user can use the touchscreen to draw geometric shapes that function as virtual regions that can assist the robot in training. A user can set a virtual region as a lawn area, which can give the controller a general location for the boundary of the lawn areas. The user can further set virtual regions for the traversal regions and for obstacles. Also prior to training, the map includes the launch point 1001 corresponding to the location of the charging dock as well as the current location of the robot 10. The user can also select default settings for the training methods described herein.

[0086] As the user proceeds through additional aspects of training the robot (e.g. boundary training, traversal route training, and bypass route training), additional options from the main menu become available. After the robot has completed boundary training of the lawn areas, the map can include the points of the boundary data 305 (described above). While the traversal launch point and traversal landing point for each traversal region have been described as set automatically, the user can also override the automatically selected points by selecting one of the points of the boundaries shown on the map on the application. After the user selects traversal launch points and traversal landing points for each traversal region, the controller can further implement optimization algorithms (e.g. quasi-Newton methods) that consider the location of the traversal launch points and traversal landing points to compute the shortest route between the traversal launch points and the traversal landing points. In some implementations, the user can mark on the mobile device the boundaries that are traversable and non-traversable.

[0087] After a traversal launch point and a traversal end point for a traversal region are determined and stored, the user can initiate the automated or manual traversal route training described in detail earlier. As the mowing pattern can be defined after a lawn route start point and a lawn route end point have been defined, the user can also select the mowing pattern of each lawn prior to implementing the traversal route training.

[0088] The user can further create a schedule for the robot. Each area of the lawn can be separately scheduled. Thus, the robot stores scheduling data for each of multiple lawn areas. For example, if the user would like the robot to mow lawn area 102c separately from lawn areas 102a-b, the user can select the lawn area 102c via the user interface and set a schedule (e.g. time and day of week) to mow the lawn area 102c. The robot can be scheduled to mow the lawn areas 102a-b in one mowing operation and the lawn area 102c in another mowing operation. When the robot is scheduled to mow lawn area 102b, the robot will follow the routes as described in FIG. 7A. When the robot is scheduled to mow lawn area 102c, the robot will bypass the lawn areas 102a-b to mow the lawn area 102c, as shown in FIG. 7B.

[0089] FIG. 9 is a flow chart for training a robot to mow a first and a second lawn with a traversal region that separates the first lawn from the second lawn, such as lawn areas 102a-b of FIG. 2. In general, the process involves identifying the boundary of the first lawn, identifying the boundary of the second lawn, selecting a traversal launch point, train first lawn route, selecting intermediate traversal points, selecting a traversal landing point, training a bypass route for the first lawn, selecting a movement pattern for the first lawn, and selecting a movement pattern for the second lawn area.

[0090] At step S900 the controller trains the robot to identify the boundary of the first lawn area. The controller implements one or more of the boundary training methods described with respect to FIGS. 4A-C to generate the points corresponding to the boundary of the first lawn area.

[0091] At step S905, the controller trains the robot to identify the boundary of the second lawn area. The controller implements one or more of the boundary training methods described with respect to FIGS. 4A-C to generate the points corresponding to the boundary of the second lawn area.

[0092] At step S910, the controller trains the traversal launch point. The controller can train the traversal launch point via a user selection on the application as described in FIG. 8, or the controller can implement route training (e.g., as described in FIG. 5) to automatically select the traversal launch point.

[0093] At step S915, the controller trains a first lawn route for the first lawn area. The first lawn area route uses a start point generally pre-determined by the location of a charging station and uses an end point determined by the traversal launch point trained in step S910. The controller selects a first mowing pattern for the first lawn route that can be a default pattern (e.g. corn row pattern) for the geometry of the first lawn area. The controller can further set the associated path behavior for the first lawn route.

[0094] At step S920, the controller trains the intermediate traversal points and the traversal landing point for the traversal region by implementing the traversal route training as described with respect FIG. 5A-B. The controller navigates the robot to the traversal launch point selected in step S910 and directs the robot through the traversal region as the controller implements the traversal route training. If there are obstacles within the traversal region, the controller can generate intermediate traversal points as the robot avoids the obstacles. As the robot crosses the traversal region and enters the second lawn, the controller generates the traversal landing point and thus completes the training of the traversal route. The controller can further set the associated path behavior for the traversal route including turning off the cutting system of the robot lawnmower.

[0095] At step S925, the controller trains a second lawn route for the second lawn area. The mowing pattern for the second lawn uses a start point generally determined by the location of the traversal landing point training in step S920. The mowing pattern for the second lawn uses an end point generally determined by the boundary points trained in step S905 and the traversal landing point. In some implementations, the end point is the boundary point farthest from the traversal landing point. The controller selects a second mowing pattern for the second lawn route that can be a default pattern (e.g. corn row pattern) for the geometry of the first lawn area. The controller can further set the associated path behavior for the second lawn route.

[0096] At step S930, the controller trains the bypass route to move from a launch point corresponding to the location of the charging station across the first lawn area to the start of the traversal route. The controller implements bypass route training described in FIG. 7 to generate the points of the bypass route. The controller can further set the associated path behavior for the bypass route.

[0097] FIG. 10A-B are flow charts for the mowing operations after the robot has been trained following the method of FIG. 9.

[0098] FIG. 10A is a flow chart of a mowing operation that mows both the first lawn area and the second lawn area. At step S1000A, the robot enables a cutting system of the robot and mows the first lawn area. The robot follows the first mowing pattern determined in step S915. After the robot has covered an area of at least 100% of the area of the first lawn, the mowing pattern ends at the traversal launch point determined in step S910.

[0099] At step S1005A, after the robot reaches the traversal launch point of the traversal route, the robot disables the cutting system and begins traversing the traversal region via the traversal route (including the traversal start point, the intermediate traversal points, and the traversal end point) determined in steps S910 and S920. The robot completes the traversal route at the traversal end point determined in step S920.

[0100] At step S1010A, after the robot traverses the traversal region, the robot enables the cutting system and begins to mow the second lawn via the second lawn route determined in step S925. The robot follows the second mowing pattern until the robot has covered an area at least 100% of the area of the second lawn area. The robot then terminates the second lawn route at the end point determined in step S925.

[0101] At step S1015A, after the robot reaches the end point of the second lawn route, the robot disables the cutting system and returns to the launch point.

[0102] FIG. 10B is a flow chart of a mowing operation that bypasses the first lawn and mows the second lawn area. At step S1000B, the robot disables a mowing function, bypasses the first lawn via the bypass route trained in step S935, traverses the first traversal region via the traversal route trained in steps S910 and S920 to reach the traversal landing point on the second lawn area.

[0103] At step S1005B, after the robot reaches the traversal landing point of the traversal route, the robot enables the cutting system and begins to mow the second lawn via the second lawn route determined in step S925. The robot follows the second mowing pattern until the robot has covered an area at least 100% of the area of the second lawn area. The robot then terminates the second lawn route at the end point determined in step S925.

[0104] At step S1010B, after the robot reaches the end point of the second lawn route, the robot disables the cutting system and returns to the launch point.

[0105] While the examples as described in this disclosure described three discontiguous lawn areas 102a-c, in some implementations, the robot can be trained to mow more or fewer lawn areas. For example, in some implementations, the robot can be trained to mow a continuous lawn and consequently does not require traversal route data to move across traversal regions. In other implementations, the robot can be trained to mow several discontiguous lawn areas (e.g. four or more). The robot can be scheduled to execute several mowing operations at different times so that the power system of the robot can be sustained through the entire mowing operation. The robot can be trained to include several bypass routes that allow the robot to bypass lawn areas that are not to be mowed in a mowing operation.

[0106] While the combination of activation levels of systems have been briefly described (e.g. a 50% activation level of the drive system and 0% activation level of the cutting system during the traversal operations) for various operations, in some implementations, the setting of the activation levels can be adaptive. For example, as the robot executes training operations, the robot may have swath sensors that can detect the stiffness of grass that the robot passes over. As the robot detects the stiffness of the grass, it can modify the activation level of the cutting system during mowing operations to accommodate the stiffness. If the grass is stiff, then the activation level of the cutting system can be increased. The robot can further include torque or force sensors in the drive system to determine the level of activation for the drive system to drive the wheel modules to cross various terrains.

[0107] While the scheduling data 335 has been described to be set by the user via application on the computing device, in some implementations, the controller can be configured to automatically set the scheduling data. The controller can, for example, compute the area of each of the discontiguous lawn areas and the distance of potential routes, and use those computations to estimate an amount of power consumption associated with particular route options. The controller can then set a schedule of routes such that the robot can execute each mowing operation with a full charge of power.

[0108] While path planning algorithms such as A*, rapidly exploring random trees (RRTs), or probabilistic roadmaps have been described to be used to train the traversal and bypass routes, in other implementations, other algorithms, such as Floyd-Warshall algorithm, Johnson's algorithm, and Dijkstra's algorithm, can be used to reduce computational load. For example, in cases where the first set of points includes only one point or the second set of points includes only one point, a single source or single destination shortest path algorithm such as Dijkstra's algorithm can be used.

[0109] While the threshold mowing area coverage has been described to be 100% of the area of the lawn, in some implementations the threshold mowing area coverage can be greater. In other implementations, the threshold mowing area coverage can be greater than, for example, 150% of the area of the lawn area 102a.

[0110] In the manual mode, while the robot has been described to detect the handle via the sensor system, in some implementations, the user can manually instruct the robot that the handle has been attached. Also in the manual mode with automatic point storage, the robot has been described to store a point every second. In other implementations, the duration of time between storing points can be modified by the user to be more or less. For example, for larger lawn areas, it can be beneficial to store fewer points in order to reduce the amount of storage space dedicated to the lawn route data.

[0111] While the handle 675 has been described as detachable, in other implementations, the handle remains on the robot but is collapsible or stowable. For example, the handle can be telescoping so that the handle can be collapsed into a small form factor when not in use.

[0112] Although virtual characteristics are not shown to define the lawn area 102a-c, in some implementations, the user can use the application on the computing device to manually define general boundaries. The manually defined boundaries on the application can generate virtual markers that the robot follows to map the boundaries.

[0113] While the cells of the 2D grid of cells to represent the lawn have been described to represent a square area with side lengths between 1 and 100 cm, in other implementations the cells can be larger or smaller depending on the property. For example, for larger properties (e.g. a football field, a golf course), the side lengths could be between 1 and 10 m. In some implementations, the user manually sets the side lengths. In other implementations, the controller selects a cell size based on an input for the area of the lawn or property. In further examples, the controller implements an adaptive algorithm that determines the cell size based on the geometry of the lawn. For example, for amorphous lawn shapes, a larger number of cells can be used to reflect the amorphous geometry.

[0114] In some implementations, the user can select objective functions for the path planning algorithm. For example, instead of requesting a route with minimum distance between the traversal launch point and the traversal landing point, the user may select an objective function that the controller minimizes to select a route with the fewest number of turns, a route that begins and ends at specific points (e.g., the user pre-defines the traversal launch point and the traversal landing point). The user can also select more than one objective function to minimize. For example, the user may want to minimize the number of turns as well as the distance between the traversal launch point and the traversal landing point.

[0115] While the training method for the traversal routes 1500, 1600 and the bypass routes 1700, 1800 have been described to include one or less obstacles in between the respective launch and landing points, in some implementations, additional obstacles are detected during training. After generating the intermediate points and attempting the traversal or bypass route generated during the training, the controller determines the presence of an additional obstacle. The controller maps the additional obstacle and generates additional intermediate points to find an optimized path to avoid the obstacle. The controller continues to iterate through the training method until the controller directs the robot through a route without detecting an additional obstacle.

[0116] While the traversal launch points and traversal landing points have been described to selected in an automated manner or via the user application installed on the mobile device, in some implementations, the boundary markers placed along the boundary can also serve as traversal launch points and traversal landing points. In such implementations, as opposed to relying on virtual markers for the traversal launch and landing points, the user can place a physical marker (e.g., the boundary markers) that represent the traversal launch points and traversal landing points.

[0117] While the example of route segments shown in this disclosure focus on straight line segments between points, it should be understood that other curve geometries, such as arcs, can be generated with points on a route. Associating a polynomial with two points on a route can, for example, generate spline geometry connecting the two points. The controller, when the robot reaches one of the points of the spline geometry, can correlate the navigation system with the polynomial function such that the robot moves along the spline geometry. For example, for obstacles with geometries not easily defined by arcs, the controller can generate spline geometries to approximate a route to avoid the obstacle geometries.

[0118] While the first traversal launch points 1540, 1640 have been described as selected during the process training the traversal route, in other implementations, the default traversal launch point can be the charging dock.

[0119] While the lawn area 102c has been described not to have a corresponding trained bypass route, in some implementations, the last lawn can have a trained bypass route that can be used as part of the return route. For example, during bypass route training, a bypass route can be trained for lawn area such that the robot can take the reverse of the bypass route in order to return to the charging station. Instead of using a traversal launch point for a traversal region for the end point of the bypass route that bypasses lawn area, the bypass route can use the end point of the mowing pattern for lawn area.

[0120] While the mowing pattern of a lawn route has been described to be complete after the coverage of the lawn, in some implementations, the controller can be programmed such that the mowing pattern of a lawn route terminates at the traversal launch point. For example, the end point of the lawn route can terminate at the traversal launch point of the traversal route.

[0121] In some implementations, the return route that the robot takes at the conclusion of a mowing operation can be a composition of bypass routes and traversal routes. For example, referring briefly to FIG. 7A, to return to the charging station 50 from the end point of the lawn route 1900b, the robot 10 can follow the bypass route 1800, the traversal route 1500, and the bypass route 1700 in the reverse direction.

[0122] While the path behavior data 330 has been described to be assigned to the traversal route data 315 and the bypass route data 320 with respect to FIG. 7 after the lawn route data 325 has been generated, it should be understood that the path behavior data 330 can be generated as each route data is being generated. For example, as the points for the traversal route data and the bypass route data are being generated, the path behavior data associated with those routes can be set such that the drive system is set at a mid-range activation level and the cutting system is deactivated. In some implementations, the controller can be programmed such that training the bypass route data and the traversal route data automatically associates those route data with a deactivation of the cutting system, and training the lawn route data automatically associates the lawn route data to an activation of the cutting system.

[0123] While a lawn route described herein applies to a continuous lawn, in some implementations, a lawn can be segmented into two separate lawn regions contiguous lawn regions. The robot can be scheduled to mow the lawn regions at different times.

[0124] While the selection of the traversal launch point and traversal landing points have been described as an automated selection based on optimization of the distance of the traversal launch point from the traversal landing point, in some implementations, the modification of the traversal launch point and the traversal landing point can be a manual operation. For example, the user can view the boundary data stored for the lawn areas on the application of the mobile device and manually select locations for the traversal launch points and traversal landing points.

[0125] While the steps of the flow charts shown in FIGS. 9-10 have been described as occurring sequentially, it should be understood that some steps can be performed in a different order. For example, referring to FIG. 9, training the traversal route between the first area and the second area can occur after training the mowing operation for the first area and the second area. Training the bypass route can occur before training the second lawn route or training the traversal route.

[0126] A number of embodiments of the invention have been described. Nevertheless, it will be understood that various modifications may be made without departing from the spirit and scope of the invention.

Claims

What is claimed is:

1. A method of mowing at least two areas separated by a space, the method comprising:

training a robotic mower to mow at least a first area and a second area, the first area separated from the second area by the space, including moving the robotic mower about the first and second areas while storing data indicative of a location of boundaries of each area relative to boundary markers;

storing data indicative of a traversal route between the first area and the second area;

storing data indicative of a bypass route that provides a path for the robotic mower to follow to traverse the first area; and then

initiating a mowing operation causing the robotic mower to autonomously and in sequence:

disable a mowing function;

traverse the first area by following the bypass route without mowing the first area;

move from the first area to the second area across the space separating the first area from the second area by following the traversal route between the first area and the second area without mowing the traversal route;

activate the mowing function; and

mow the second area.

2. The method of claim 1, wherein initiating the mowing operation further comprises causing the robotic mower to

traverse the first area by following the bypass route at a first drive speed; and

mow the second area at a second drive speed,

wherein the first drive speed is greater than the second drive speed.

3. The method of claim 1, further comprising:

determining the data indicative of the bypass route by computing a shortest route between the first area and the second area.

4. The method of claim 1, wherein the data indicative of the traversal route comprises a traversal launch point and a traversal landing point, the traversal launch point being on a boundary of the first area, and the traversal landing point being on a boundary of the second area.

5. The method of claim 4, wherein initiating the mowing operation further comprises causing the robotic mower to move in a straight line from the traversal launch point to the traversal landing point.

6. The method of claim 1, wherein initiating the mowing operation further comprises causing the robotic mower to:

conclude the mowing operation after mowing the second area without mowing the first area.

7. The method of claim 1, wherein initiating the mowing operation further comprises causing the robotic mower to:

return to a charging dock after mowing the second area without mowing the first area.

8. The method of claim 1, wherein initiating the mowing operation further comprises causing the robotic mower to:

traverse the first area by moving from a charging dock along the bypass route without mowing the first area.

9. The method of claim 1, wherein initiating the mowing operation further comprises causing the robotic mower to:

disable the mowing function after mowing the second area;

move across another space separating the second area from a third area; and

mow the third area.

10. The method of claim 1, wherein the bypass route comprises a bypass launch point and a bypass landing point, and initiating the mowing operation further comprises causing the robotic mower to move along the bypass route from the bypass launch point to the bypass landing point.

11. A robotic mower, comprising:

a wheeled chassis;

a motorized grass cutter carried by the wheeled chassis; and

a controller carried by the chassis and configured to:

(i) store data indicative of a location of boundaries of each of at least two areas to be mowed, wherein the at least two areas are separated by a space;

(ii) store data indicative of a traversal route across the space;

(iii) store data indicative of a bypass route that provides a path for the robotic mower to follow to traverse a first of the areas;

(iv) control the robotic mower to perform a mowing operation in which the robotic mower autonomously and in sequence:

disables the grass cutter;

traverses the first of the areas by following the bypass route without mowing the first of the areas;

moves from the first of the areas to a second of the areas across the space by following the traversal route between the first of the areas and the second of the areas without mowing the traversal route;

activate the grass cutter; and

mows the second of the areas.

12. The robotic mower of claim 11, wherein, during the mowing operation, the robotic mower autonomously and in sequence:

traverses the first of the areas by following the bypass route at a first drive speed; and

mows the second of the areas at a second drive speed,

wherein the first drive speed is greater than the second drive speed.

13. The robotic mower of claim 11, wherein the controller is configured to determine the data indicative of the bypass route by computing a shortest route between the first of the areas and the second of the areas.

14. The robotic mower of claim 11, wherein the data indicative of the traversal route comprises a traversal launch point and a traversal landing point, the traversal launch point being on a boundary of the first of the areas, and the traversal landing point being on a boundary of the second of the areas.

15. The robotic mower of claim 14, wherein the controller is configured to move the robotic mower in a straight line from the traversal launch point to the traversal landing point.

16. The robotic mower of claim 11, wherein the controller is configured to control the robotic mower such that the robotic mower concludes the mowing operation after mowing the second of the areas without mowing the first of the areas.

17. The robotic mower of claim 11, wherein the controller is configured to control the robotic mower such that the robotic mower moves to a charging dock after mowing the second of the areas without mowing the first of the areas.

18. The robotic mower of claim 11, wherein the controller is configured to control the robotic mower such that the robotic mower traverses the first of the areas by moving from a charging dock along the bypass route without mowing the first of the areas.

19. The robotic mower of claim 11, wherein the controller is further configured to control the robotic mower such that the robotic mower:

disables the grass cutter after mowing the second of the areas;

moves across another space separating the second of the areas from a third of the areas to be mowed;

activates the grass cutter; and

mows the third of the areas to be mowed.

20. The mower of claim 11, wherein the bypass route comprises a bypass launch point and a bypass landing point, and the controller is configured to control the robotic mower such that the robotic mower moves along the bypass route from the bypass launch point to the bypass landing point.

21. The robotic mower of claim 11, further comprising a radiation detector to detect a location of a boundary marker, wherein the controller is configured to store the data indicative of the location of the boundaries of each of the at least two areas to be mowed relative to the location of the boundary marker.

22. The robotic mower of claim 21, further comprising a radiation source to emit a signal toward the boundary marker, wherein the radiation detector is configured to detect a response signal from the boundary marker, the response signal being indicative of the location of the boundary marker.

Patent Citations (426)

Patent	Date	Inventor	Cited By
US2751030(A)	1956-06-01	Null	Applicant
US3128840(A)	1964-04-01	Barrett	Applicant
US3385041(A)	1968-05-01	Douglas	Applicant
US3457575(A)	1969-07-01	Bienek	Applicant
US3550714(A)	1970-12-01	Bellinger	Applicant
US3674316(A)	1972-07-01	De Brey	Applicant
US3924389(A)	1975-12-01	Kita	Applicant
US3937174(A)	1976-02-01	Haaga	Applicant
US3946543(A)	1976-03-01	Templeton	Applicant
US4119900(A)	1978-10-01	Kremnitz	Applicant
US4133404(A)	1979-01-01	Griffin	Applicant
US4163977(A)	1979-08-01	Polstorff	Applicant
US4306329(A)	1981-12-01	Yokoi	Applicant
US4369543(A)	1983-01-01	Chen et al.	Applicant
US4513469(A)	1985-04-01	Godfrey et al.	Applicant
US4545453(A)	1985-10-01	Yoshimura et al.	Applicant
US4556313(A)	1985-12-01	Miller et al.	Applicant
US4603753(A)	1986-08-01	Yoshimura et al.	Applicant
US4626995(A)	1986-12-01	Lofgren et al.	Applicant
US4674048(A)	1987-06-01	Okumura	Applicant
US4679152(A)	1987-07-01	Perdue	Applicant
US4696074(A)	1987-09-01	Cavalli et al.	Applicant
US4700301(A)	1987-10-01	Dyke	Applicant
US4700427(A)	1987-10-01	Knepper	Applicant
US4716621(A)	1988-01-01	Zoni	Applicant
US4733431(A)	1988-03-01	Martin	Applicant
US4756049(A)	1988-07-01	Uehara	Applicant
US4767237(A)	1988-08-01	Cosman et al.	Applicant
US4777416(A)	1988-10-01	George, II et al.	Applicant
US4782550(A)	1988-11-01	Jacobs	Applicant
US4811228(A)	1989-03-01	Hyyppa	Applicant
US4854000(A)	1989-08-01	Takimoto	Applicant
US4887415(A)	1989-12-01	Martin	Applicant
US4893025(A)	1990-01-01	Lee	Applicant
US4909024(A)	1990-03-01	Jones et al.	Applicant
US4912643(A)	1990-03-01	Beirne	Applicant
US4918441(A)	1990-04-01	Bohman	Applicant
US4919224(A)	1990-04-01	Shyu et al.	Applicant
US4933864(A)	1990-06-01	Evans et al.	Applicant
US4962453(A)	1990-10-01	Pong et al.	Applicant
US4974283(A)	1990-12-01	Holsten et al.	Applicant
US5002145(A)	1991-03-01	Waqkaumi et al.	Applicant
US5017415(A)	1991-05-01	Cosman et al.	Applicant
US5086535(A)	1992-02-01	Grossmeyer et al.	Applicant
US5093955(A)	1992-03-01	Blehert et al.	Applicant
US5109566(A)	1992-05-01	Kobayashi et al.	Applicant
US5142985(A)	1992-09-01	Stearns et al.	Applicant
US5163202(A)	1992-11-01	Kawakami et al.	Applicant
US5163273(A)	1992-11-01	Wojtkowski et al.	Applicant
US5165064(A)	1992-11-01	Mattaboni	Applicant
US5204814(A)	1993-04-01	Noonan	Examiner
US5208521(A)	1993-05-01	Aoyama	Applicant
US5216777(A)	1993-06-01	Moro et al.	Applicant
US5239720(A)	1993-08-01	Wood et al.	Applicant
US5261139(A)	1993-11-01	Lewis	Applicant
US5279672(A)	1994-01-01	Betker et al.	Applicant
US5284522(A)	1994-02-01	Kobayashi et al.	Applicant
US5293955(A)	1994-03-01	Lee	Applicant
US5303448(A)	1994-04-01	Hennessey et al.	Applicant
US5319828(A)	1994-06-01	Waldhauser et al.	Applicant
US5321614(A)	1994-06-01	Ashworth	Applicant
US5324948(A)	1994-06-01	Dudar et al.	Applicant
US5341540(A)	1994-08-01	Soupert et al.	Applicant
US5353224(A)	1994-10-01	Lee et al.	Applicant
US5369347(A)	1994-11-01	Yoo	Applicant
US5410479(A)	1995-04-01	Coker	Applicant
US5438721(A)	1995-08-01	Pahno et al.	Applicant
US5440216(A)	1995-08-01	Kim	Applicant
US5444965(A)	1995-08-01	Colens	Applicant
US5446356(A)	1995-08-01	Kim	Applicant
US5454129(A)	1995-10-01	Kell	Applicant
US5455982(A)	1995-10-01	Armstrong et al.	Applicant
US5465525(A)	1995-11-01	Mifune et al.	Applicant
US5467273(A)	1995-11-01	Faibish et al.	Applicant
US5497529(A)	1996-03-01	Boesi	Applicant
US5507067(A)	1996-04-01	Hoekstra et al.	Applicant
US5515572(A)	1996-05-01	Hoekstra et al.	Applicant
US5528888(A)	1996-06-01	Miyamoto	Examiner
US5534762(A)	1996-07-01	Kim	Applicant
US5537017(A)	1996-07-01	Feiten et al.	Applicant
US5539953(A)	1996-07-01	Kurz	Applicant
US5542146(A)	1996-08-01	Hoekstra et al.	Applicant
US5548511(A)	1996-08-01	Bancroft	Applicant
US5553349(A)	1996-09-01	Kilstrom et al.	Applicant
US5555587(A)	1996-09-01	Guha	Applicant
US5560077(A)	1996-10-01	Crotchett	Applicant
US5568589(A)	1996-10-01	Hwang	Applicant
US5611106(A)	1997-03-01	Wulff	Applicant
US5611108(A)	1997-03-01	Knowlton et al.	Applicant
US5613261(A)	1997-03-01	Kawakami et al.	Applicant
US5621291(A)	1997-04-01	Lee	Applicant
US5622236(A)	1997-04-01	Azumi et al.	Applicant
US5634237(A)	1997-06-01	Paranjpe	Applicant
US5634239(A)	1997-06-01	Tuvin et al.	Applicant
US5650702(A)	1997-07-01	Azumi	Applicant
US5652489(A)	1997-07-01	Kawakami	Applicant
US5682213(A)	1997-10-01	Schmutz	Applicant
US5682313(A)	1997-10-01	Edlund et al.	Applicant
US5682839(A)	1997-11-01	Grimsley et al.	Applicant
US5709007(A)	1998-01-01	Chiang	Applicant
US5761762(A)	1998-06-01	Kubo et al.	Applicant
US5781960(A)	1998-07-01	Kilstrom et al.	Applicant
US5787545(A)	1998-08-01	Colens	Applicant
US5794297(A)	1998-08-01	Muta	Applicant
US5812267(A)	1998-09-01	Everett, Jr. et al.	Applicant
US5819008(A)	1998-10-01	Asama et al.	Applicant
US5825981(A)	1998-10-01	Matsuda	Applicant
US5839156(A)	1998-11-01	Park et al.	Applicant
US5841259(A)	1998-11-01	Kim et al.	Applicant
US5867800(A)	1999-02-01	Leif	Applicant
US5916111(A)	1999-06-01	Colens	Applicant
US5926909(A)	1999-07-01	McGee	Applicant
US5935179(A)	1999-08-01	Kleiner et al.	Applicant
US5940927(A)	1999-08-01	Haegermarck et al.	Applicant
US5940930(A)	1999-08-01	Oh et al.	Applicant
US5942869(A)	1999-08-01	Katou et al.	Applicant
US5943730(A)	1999-08-01	Boomgaarden	Applicant
US5943733(A)	1999-08-01	Tagliaferri	Applicant
US5959423(A)	1999-09-01	Nakanishi et al.	Applicant
US5974348(A)	1999-10-01	Rocks	Applicant
US6009358(A)	1999-12-01	Angott et al.	Applicant
US6041471(A)	2000-03-01	Charkey et al.	Applicant
US6049745(A)	2000-04-01	Douglas et al.	Applicant
US6073427(A)	2000-06-01	Nichols	Applicant
US6076025(A)	2000-06-01	Ueno et al.	Applicant
US6076227(A)	2000-06-01	Schalig et al.	Applicant
US6108076(A)	2000-08-01	Hanseder	Applicant
US6112143(A)	2000-08-01	Allen et al.	Applicant
US6124694(A)	2000-09-01	Bancroft et al.	Applicant
US6133730(A)	2000-10-01	Winn	Applicant
US6140146(A)	2000-10-01	Brady et al.	Applicant
US6166706(A)	2000-12-01	Gallagher et al.	Applicant
US6226830(B1)	2001-05-01	Hendriks et al.	Applicant
US6240342(B1)	2001-05-01	Fiegert et al.	Applicant
US6255793(B1)	2001-07-01	Peless	Examiner
US6259979(B1)	2001-07-01	Holmquist	Applicant
US6285930(B1)	2001-09-01	Dickson et al.	Applicant
US6300737(B1)	2001-10-01	Begvall et al.	Applicant
USD451931(S)	2001-12-01	Abramson et al.	Applicant
US6338013(B1)	2002-01-01	Ruffner	Examiner
US6339735(B1)	2002-01-01	Peless et al.	Applicant
US6374155(B1)	2002-04-01	Wallach et al.	Applicant
US6385515(B1)	2002-05-01	Dickson et al.	Applicant
US6408226(B1)	2002-06-01	Byrne et al.	Applicant
US6417641(B2)	2002-07-01	Peless et al.	Applicant
US6438456(B1)	2002-08-01	Feddema et al.	Applicant
US6442476(B1)	2002-08-01	Poropat	Applicant
US6443509(B1)	2002-09-01	Levin et al.	Applicant
US6444003(B1)	2002-09-01	Sutcliffe	Applicant
US6463368(B1)	2002-10-01	Feiten et al.	Applicant
US6465982(B1)	2002-10-01	Bergvall et al.	Applicant
US6493613(B2)	2002-12-01	Peless et al.	Applicant
US6496754(B2)	2002-12-01	Song et al.	Applicant
US6496755(B2)	2002-12-01	Wallach et al.	Applicant
US6507773(B2)	2003-01-01	Parker et al.	Applicant
US6525509(B1)	2003-02-01	Petersson et al.	Applicant
US6532404(B2)	2003-03-01	Colens	Applicant
US6535793(B2)	2003-03-01	Allard	Applicant
US6548982(B1)	2003-04-01	Papanikolopoulos et al.	Applicant
US6571415(B2)	2003-06-01	Gerber et al.	Applicant
US6574536(B1)	2003-06-01	Kawagoe et al.	Applicant
US6580246(B2)	2003-06-01	Jacobs	Applicant
US6580978(B1)	2003-06-01	McTamaney	Applicant
US6584376(B1)	2003-06-01	Kommer	Applicant
US6586908(B2)	2003-07-01	Petersson et al.	Applicant
US6594844(B2)	2003-07-01	Jones	Applicant
US6604022(B2)	2003-08-01	Parker	Applicant
US6605156(B1)	2003-08-01	Clark et al.	Applicant
US6611120(B2)	2003-08-01	Song et al.	Applicant
US6611734(B2)	2003-08-01	Parker et al.	Applicant
US6611738(B2)	2003-08-01	Ruffner	Examiner
US6615108(B1)	2003-09-01	Peless et al.	Applicant
US6658693(B1)	2003-12-01	Reed, Jr.	Applicant
US6661239(B1)	2003-12-01	Ozik	Applicant
US6671592(B1)	2003-12-01	Bisset et al.	Applicant
US6690134(B1)	2004-02-01	Jones et al.	Applicant
US6741054(B2)	2004-05-01	Koselka et al.	Applicant
US6748297(B2)	2004-06-01	Song et al.	Applicant
US6764373(B1)	2004-07-01	Osawa et al.	Applicant
US6781338(B2)	2004-08-01	Jones et al.	Applicant
US6809490(B2)	2004-10-01	Jones et al.	Applicant
US6830120(B1)	2004-12-01	Yashima et al.	Applicant
US6841963(B2)	2005-01-01	Song et al.	Applicant
US6845297(B2)	2005-01-01	Allard	Applicant
US6850024(B2)	2005-02-01	Peless et al.	Applicant
US6870792(B2)	2005-03-01	Chiappetta	Applicant
US6883201(B2)	2005-04-01	Jones et al.	Applicant
US6885912(B2)	2005-04-01	Peless et al.	Applicant
US6901624(B2)	2005-06-01	Mori et al.	Applicant
USD510066(S)	2005-09-01	Hickey et al.	Applicant
US6938298(B2)	2005-09-01	Aasen	Applicant
US6940291(B1)	2005-09-01	Ozik	Applicant
US6956348(B2)	2005-10-01	Landry et al.	Applicant
US6971140(B2)	2005-12-01	Kim	Applicant
US6984952(B2)	2006-01-01	Peless et al.	Applicant
US6999850(B2)	2006-02-01	McDonald	Applicant
US7024278(B2)	2006-04-01	Chiappetta et al.	Applicant
US7069124(B1)	2006-06-01	Whittaker et al.	Applicant
US7076348(B2)	2006-07-01	Bucher	Examiner
US7085624(B2)	2006-08-01	Aldred et al.	Applicant
US7103457(B2)	2006-09-01	Dean	Examiner
US7110881(B2)	2006-09-01	Gray	Examiner
US7155309(B2)	2006-12-01	Peless et al.	Applicant
US7203576(B1)	2007-04-01	Wilson et al.	Applicant
US7206677(B2)	2007-04-01	Hulden	Applicant
US7239944(B2)	2007-07-01	Dean	Examiner
USD559867(S)	2008-01-01	Abramson	Applicant
US7349759(B2)	2008-03-01	Peless et al.	Applicant
USD573610(S)	2008-07-01	Abramson	Applicant
US7441392(B2)	2008-10-01	Lilliestielke et al.	Applicant
US7481036(B2)	2009-01-01	Lilliestielke et al.	Applicant
US7525287(B2)	2009-04-01	Miyashita et al.	Applicant
US7729801(B2)	2010-06-01	Abramson	Applicant
US7756624(B2)	2010-07-01	Diekhans	Examiner
US8046103(B2)	2011-10-01	Abramson	Examiner
US8069639(B2)	2011-12-01	Fancher, III	Applicant
USD652431(S)	2012-01-01	Naslund	Applicant
USD656163(S)	2012-03-01	Johansson et al.	Applicant
US8136333(B1)	2012-03-01	Levin et al.	Applicant
US8204654(B2)	2012-06-01	Sachs	Examiner
US8239083(B2)	2012-08-01	Durkos	Examiner
US8306659(B2)	2012-11-01	Abramson et al.	Applicant
US8413616(B2)	2013-04-01	Bergquist	Applicant
US8532822(B2)	2013-09-01	Abramson et al.	Applicant
US8634960(B2)	2014-01-01	Sandin et al.	Applicant
US8635841(B2)	2014-01-01	Fiser et al.	Applicant
US8666550(B2)	2014-03-01	Anderson	Examiner
US8781627(B2)	2014-07-01	Sandin et al.	Applicant
US8868237(B2)	2014-10-01	Sandin et al.	Applicant
US8938318(B2)	2015-01-01	Bergstrom	Examiner
US8954193(B2)	2015-02-01	Sandin et al.	Applicant
US9008918(B2)	2015-04-01	Missotten	Examiner
US9020757(B2)	2015-04-01	Peake	Examiner
US9043951(B2)	2015-06-01	Tolstedt	Examiner
US9072218(B2)	2015-07-01	Johnson	Examiner
US9137943(B2)	2015-09-01	Einecke	Examiner
US9168922(B1)	2015-10-01	Martin	Examiner
US9181660(B2)	2015-11-01	Fritz	Examiner
US9258942(B2)	2016-02-01	Biber	Examiner
US2001/0022506(A1)	2001-09-01	Peless et al.	Applicant
US2001/0047231(A1)	2001-11-01	Peless et al.	Applicant
US2002/0011813(A1)	2002-01-01	Koselka et al.	Applicant
US2002/0016649(A1)	2002-02-01	Jones	Applicant
US2002/0120364(A1)	2002-08-01	Colens	Applicant
US2002/0140393(A1)	2002-10-01	Peless et al.	Applicant
US2002/0156556(A1)	2002-10-01	Ruffner	Applicant
US2002/0160845(A1)	2002-10-01	Simonsen	Applicant
US2002/0173877(A1)	2002-11-01	Zweig	Applicant
US2003/0018423(A1)	2003-01-01	Saller	Examiner
US2003/0019071(A1)	2003-01-01	Field et al.	Applicant
US2003/0023356(A1)	2003-01-01	Keable	Applicant
US2003/0025472(A1)	2003-02-01	Jones et al.	Applicant
US2003/0055337(A1)	2003-03-01	Lin	Applicant
US2003/0060928(A1)	2003-03-01	Abramson et al.	Applicant
US2003/0120389(A1)	2003-06-01	Abramson et al.	Applicant
US2003/0137268(A1)	2003-07-01	Papanikolopoulos et al.	Applicant
US2003/0144774(A1)	2003-07-01	Trissel	Examiner
US2003/0182914(A1)	2003-10-01	Shibata et al.	Applicant
US2003/0192144(A1)	2003-10-01	Song et al.	Applicant
US2003/0208304(A1)	2003-11-01	Peless et al.	Applicant
US2003/0216834(A1)	2003-11-01	Allard	Applicant
US2003/0233177(A1)	2003-12-01	Johnson et al.	Applicant
US2003/0234325(A1)	2003-12-01	Marino et al.	Applicant
US2004/0010343(A1)	2004-01-01	Dean	Examiner
US2004/0020000(A1)	2004-02-01	Jones	Applicant
US2004/0030448(A1)	2004-02-01	Solomon	Applicant
US2004/0030449(A1)	2004-02-01	Solomon	Applicant
US2004/0030450(A1)	2004-02-01	Solomon	Applicant
US2004/0030571(A1)	2004-02-01	Solomon	Applicant
US2004/0031113(A1)	2004-02-01	Wosewick et al.	Applicant
US2004/0036618(A1)	2004-02-01	Ku et al.	Applicant
US2004/0049877(A1)	2004-03-01	Jones et al.	Applicant
US2004/0068351(A1)	2004-04-01	Solomon	Applicant
US2004/0068415(A1)	2004-04-01	Solomon	Applicant
US2004/0068416(A1)	2004-04-01	Solomon	Applicant
US2004/0076324(A1)	2004-04-01	Burl et al.	Applicant
US2004/0088079(A1)	2004-05-01	Lavarec et al.	Applicant
US2004/0111184(A1)	2004-06-01	Chiappetta et al.	Applicant
US2004/0134336(A1)	2004-07-01	Solomon	Applicant
US2004/0134337(A1)	2004-07-01	Solomon	Applicant
US2004/0156541(A1)	2004-08-01	Jeon et al.	Applicant
US2004/0158357(A1)	2004-08-01	Lee et al.	Applicant
US2004/0187457(A1)	2004-09-01	Colens	Applicant
US2004/0193348(A1)	2004-09-01	Gray	Examiner
US2004/0200505(A1)	2004-10-01	Taylor et al.	Applicant
US2004/0204792(A1)	2004-10-01	Taylor et al.	Applicant
US2004/0211444(A1)	2004-10-01	Taylor et al.	Applicant
US2004/0220000(A1)	2004-11-01	Falone	Applicant
US2004/0236468(A1)	2004-11-01	Taylor et al.	Applicant
US2004/0244138(A1)	2004-12-01	Taylor et al.	Applicant
US2005/0000543(A1)	2005-01-01	Taylor et al.	Applicant
US2005/0007057(A1)	2005-01-01	Peless et al.	Applicant
US2005/0010331(A1)	2005-01-01	Taylor et al.	Applicant
US2005/0020374(A1)	2005-01-01	Wang	Applicant
US2005/0038578(A1)	2005-02-01	McMurtry	Examiner
US2005/0097952(A1)	2005-05-01	Steph	Applicant
US2005/0108999(A1)	2005-05-01	Bucher	Applicant
US2005/0113990(A1)	2005-05-01	Peless et al.	Applicant
US2005/0156562(A1)	2005-07-01	Cohen et al.	Applicant
US2005/0197766(A1)	2005-09-01	Flann	Examiner
US2005/0204717(A1)	2005-09-01	Colens	Applicant
US2005/0251292(A1)	2005-11-01	Casey et al.	Applicant
US2005/0278094(A1)	2005-12-01	Swinbanks et al.	Applicant
US2005/0287038(A1)	2005-12-01	Dubrovsky et al.	Applicant
US2006/0090438(A1)	2006-05-01	Hunt	Examiner
US2006/0175541(A1)	2006-08-01	Eglington	Examiner
US2006/0293794(A1)	2006-12-01	Harwig et al.	Applicant
US2007/0016328(A1)	2007-01-01	Ziegler et al.	Applicant
US2007/0142964(A1)	2007-06-01	Abramson	Applicant
US2007/0150109(A1)	2007-06-01	Peless et al.	Applicant
US2008/0039974(A1)	2008-02-01	Sandin et al.	Applicant
US2008/0039991(A1)	2008-02-01	May	Examiner
US2008/0049217(A1)	2008-02-01	Cappelletti	Examiner
US2008/0097645(A1)	2008-04-01	Abramson et al.	Applicant
US2008/0109126(A1)	2008-05-01	Sandin	Examiner
US2008/0167753(A1)	2008-07-01	Peless	Examiner
US2008/0183349(A1)	2008-07-01	Abramson et al.	Applicant
US2009/0254218(A1)	2009-10-01	Sandin et al.	Applicant
US2010/0059000(A1)	2010-03-01	Bergquist	Applicant
US2010/0102525(A1)	2010-04-01	Fancher	Applicant
US2010/0324731(A1)	2010-12-01	Letsky	Examiner
US2011/0130875(A1)	2011-06-01	Abramson	Applicant
US2011/0167574(A1)	2011-07-01	Stout	Examiner
US2011/0202224(A1)	2011-08-01	Thompson	Examiner
US2011/0234153(A1)	2011-09-01	Abramson	Applicant
US2011/0295424(A1)	2011-12-01	Johnson	Examiner
US2012/0041594(A1)	2012-02-01	Abramson et al.	Applicant
US2012/0212638(A1)	2012-08-01	Schepelmann	Examiner
US2012/0226381(A1)	2012-09-01	Abramson et al.	Applicant
US2013/0006419(A1)	2013-01-01	Bergstrom et al.	Applicant
US2013/0030609(A1)	2013-01-01	Jagenstedt	Applicant
US2013/0041526(A1)	2013-02-01	Ouyang	Applicant
US2013/0066484(A1)	2013-03-01	Markusson et al.	Applicant
US2013/0076304(A1)	2013-03-01	Andersson et al.	Applicant
US2013/0110322(A1)	2013-05-01	Jagenstedt et al.	Applicant
US2013/0152538(A1)	2013-06-01	Fiser et al.	Applicant
US2013/0184924(A1)	2013-07-01	Jagenstedt et al.	Applicant
US2013/0249179(A1)	2013-09-01	Burns	Applicant
US2013/0274920(A1)	2013-10-01	Abramson et al.	Applicant
US2014/0102061(A1)	2014-04-01	Sandin et al.	Applicant
US2014/0102062(A1)	2014-04-01	Sandin et al.	Applicant
US2014/0117892(A1)	2014-05-01	Coates	Applicant
US2015/0006015(A1)	2015-01-01	Sandin et al.	Applicant
DE19932552	2000-02-01		Applicant
EP774702	1997-05-01		Applicant
EP792726	1997-09-01		Applicant
EP1331537	2003-07-01		Applicant
EP1704766	2008-12-01		Applicant
FR2828589	2003-02-01		Applicant
GB2142447	1985-01-01		Applicant
GB2283838	1995-05-01		Applicant
GB2382157	2003-05-01		Applicant
JP62120510	1987-06-01		Applicant
JP62154008	1987-07-01		Applicant
JP63183032	1988-07-01		Applicant
JP63241610	1988-10-01		Applicant
JP2-6312(U)	1990-01-01		Applicant
JP3051023	1991-03-01		Applicant
JP4320612	1992-11-01		Applicant
JP6327598	1994-11-01		Applicant
JP7129239	1995-05-01		Applicant
JP7295636	1995-11-01		Applicant
JP816776	1996-01-01		Applicant
JP8089451	1996-04-01		Applicant
JP8152916	1996-06-01		Applicant
JP9179625	1997-07-01		Applicant
JP9185410	1997-07-01		Applicant
JP11-508810	1999-08-01		Applicant
JP11-510935	1999-09-01		Applicant
JP2001-258807	2001-09-01		Applicant
JP2001-275908	2001-10-01		Applicant
JP2001-525567	2001-12-01		Applicant
JP2002078650	2002-03-01		Applicant
JP2002-204768	2002-07-01		Applicant
JP2002-532178	2002-10-01		Applicant
JP3356170	2002-10-01		Applicant
JP2002-323925	2002-11-01		Applicant
JP3375843	2002-11-01		Applicant
JP2002-355206	2002-12-01		Applicant
JP2002-360471	2002-12-01		Applicant
JP2002-360482	2002-12-01		Applicant
JP2003005296	2003-01-01		Applicant
JP2003010076	2003-01-01		Applicant
JP2003-505127	2003-02-01		Applicant
JP2003036116	2003-02-01		Applicant
JP2003038401	2003-02-01		Applicant
JP2003038402	2003-02-01		Applicant
JP2003061882	2003-03-01		Applicant
JP2003-310489	2003-11-01		Applicant
WO95/26512	1995-10-01		Applicant
WO97/40734	1997-11-01		Applicant
WO97/41451	1997-11-01		Applicant
WO98/53456	1998-11-01		Applicant
WO99/16078	1999-04-01		Applicant
WO99/28800	1999-06-01		Applicant
WO99/38056	1999-07-01		Applicant
WO99/38237	1999-07-01		Applicant
WO99/59042	1999-11-01		Applicant
WO/04430	2000-01-01		Applicant
WO/36962	2000-06-01		Applicant
WO/38026	2000-06-01		Applicant
WO/38029	2000-06-01		Applicant
WO/78410	2000-12-01		Applicant
WO1/06904	2001-02-01		Applicant
WO1/06905	2001-02-01		Applicant
WO2/39864	2002-05-01		Applicant
WO2/39868	2002-05-01		Applicant
WO2/058527	2002-08-01		Applicant
WO2/062194	2002-08-01		Applicant
WO2/067744	2002-09-01		Applicant
WO2/067745	2002-09-01		Applicant
WO2/074150	2002-09-01		Applicant
WO2/075356	2002-09-01		Applicant
WO2/075469	2002-09-01		Applicant
WO2/075470	2002-09-01		Applicant
WO2/101477	2002-12-01		Applicant
WO3/026474	2003-04-01		Applicant
WO3/040845	2003-05-01		Applicant
WO3/040846	2003-05-01		Applicant
WO3/065140	2003-08-01		Applicant
WO2004/004533	2004-01-01		Applicant
WO2004/006034	2004-01-01		Applicant
WO2004/058028	2004-07-01		Applicant
WO2005/055795	2005-06-01		Applicant
WO2005/077244	2005-08-01		Applicant
WO2006/068403	2006-01-01		Applicant

Non-Patent Literature (46)

Kimura and Shimizu, “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, pp. 5087-5092.Applicant
Kozlowski and Pazderski. “Modeling and Control of a 4-wheel Skid-steering Mobile Robot,” International J. of Applied Mathematics and Computer Science, 2004, 14:477-496.Applicant
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.Applicant
‘ebay.com’ [online] “Zoombot Remote Controlled Vaccuum-RV-500 NEW Roomba 2,” Apr. 2005, Retrieved from the Internet at URL http://cgi.ebay.com/ws/eBayISAPI.dll?ViewItem&category=43526&item=4373497618&rd=1, accessed Apr. 2005, 7 pages.Applicant
‘Electroluxusa.com’ [online]. “Designed for the well-lived home,” Retrieved from the Internet: URL<http://www.electroluxusa.com/node57.as[?currentURL=nodel42.asp%3F >. Accessed Mar. 2005, 2 pages.Applicant
‘Everyday Robots.com’ [online]. “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>, accessed Sep. 2012, 4 pages.Applicant
‘i4u.com’ [online]. “Hitachi: News release: The home cleaning robot of the autonomous movement type (experimental machine),” May 2003, Retrieved from the Internet: URL<www.i4u.com./japanreleases/hitachirobot.htm>, accessed Mar. 2005, 5 pages.Applicant
‘therobomaid.com’ [online]. “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.Applicant
‘TrilobiteElectrolux’ [online]. “Facts on Trilobite,” Retrieved from the Internet: URL<http://trilobiteelectroluxse/presskit—en/model11335asp?print=yes&pressID=>, accessed Dec. 2003, 2 pages.Applicant
‘www.acomputeredge.com’ [online] “Put Your Roomba . . . On, ‘Automatic,’” Retrieved from the Internet at URL http://www.acomputeredge.com/roomba, accessed Apr. 2005, 3 pages.Applicant
‘www.karcherusa.com’ [online]. “Karcher USA, RC3000 Robotic Cleaner,” 2005, Retrieved from the internet: URL http://www.karcher-usa.com/showproducts.php?op=viewprod&paraml=143&param2=&param3=, accessed Mar. 2005, 3 pages.Applicant
‘www.onrobo.com’ [online] “On Robo, Robot Reviews Samsung Robot Vacuum (VC-RP30W),” 2005, Retrieved from the Internet: URL www.onrobo.com/reviews/AT—Home/vacuum—cleaners/on00vcrb30rosam/index.htm, accessed Mar. 2005, 2 pages.Applicant
‘www.robocleaner.de’ [online]. “Karcher RoboCleaner RC 3000,” Retrieved from the Internet: URLwww.robocleaner.de/english/screen3.html, accessed Dec. 2003, 4 pages.Applicant
‘www.sharperimage.com’ [online]. “Robotic Vacuum Cleaner-Blue,” 2005, Retrieved from the interne at URL http://www.sharperimage.com/us/en/catalog/productview.jhtml?sku=S1727BLU, accessed Mar. 2005, 2 pages.Applicant
‘www.therobotstore.com’ [online] “Friendly Robotics Robotic Vacuum RV400—The Robot Store,” Retrieved from the Internet at URL www.therobotstore.com/s.nl/sc.9/category.-109/it.A/id.43/.f, Apr. 2005, 1 page.Applicant
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.Applicant
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.Applicant
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, 113 pages.Applicant
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.Applicant
Domnitcheva “Smart Vacuum Cleaner an Autonomous Location-Aware Cleaning Device,” Proceedings of the International Conference on Ubiquitous Computing, Sep. 10, 2004, pp. 1-2.Applicant
Doty et al., “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.Applicant
eVac Robotic Vacuum S1727 Instruction Manual, Sharper Image Corp, Copyright 2004, 13 pages.Applicant
Evolution Robotics, “NorthStar—Low-cost Indoor Localiztion—How it Works,” E Evolution Robotics, 2 pages, 2005.Applicant
Final Office Action issued in U.S. Appl. No. 11/688,225, dated Nov. 10, 2011, 15 pages.Applicant
Gat, “Robust Low-Computation Sensor-driven Control for Task-Directed Navigation,” Proc of IEEE International Conference on Robotics and Automation , Sacramento, Apr. 1991, pp. 2484-2489.Applicant
Hicks et al., “A Survey of Robot Lawn Mowers,” 2000, accessed via http://www.robotics.uc.edu/papers/paper2000/lawnmower.pdf, accessed 2012, 8 pages.Applicant
International Preliminary Report on Patentability dated Sep. 23, 2008 from International Application No. PCT/US2007/064323, 10 pages.Applicant
International Preliminary Report on Patentability dated Sep. 23, 2008 from International Application No. PCT/US2007/064326, 10 pages.Applicant
International Search Report and Written Opinion issued in PCT/US2007/064326, dated Jul. 17, 2008, 6 pages.Applicant
International Search Report and Written Opinion issued in PCT/US2007/064323, dated Jun. 16, 2008, 14 pages.Applicant
Invitation to Pay Additional Fees issued in International Application No. PCT/US2007/064326, dated Apr. 18, 2008, 9 pages.Applicant
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.Applicant
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.Applicant
Karcher, “Product Manual Download ‘Karch’,” available at www.karcher.com, 16 pages, 2004.Applicant
KOOLVAC Robotic Vacuum Cleaner Owner's Manual, Koolatron, 2004, 13 pages.Applicant
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.Applicant
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.Applicant
Morland,“Autonomous Lawnmower Control, ” Downloaded from the internet at: http://cns.bu.edu/˜cjmorlan/robotics/lawnmower/report.pdf, Jul. 2002, 10 pages.Applicant
Non-final Office Action issued in U.S. Appl. No. 11/688,213, dated Jan. 27, 2011, 27 pages.Applicant
Non-final Office Action issued in U.S. Appl. No. 11/688,225, dated Feb. 24, 2011, 30 pages.Applicant
Non-final Office Action issued in U.S. Appl. No. 12/488,094, dated Jan. 26, 2011, 25 pages.Applicant
Non-final Office Action issued in U.S. Appl. No. 12/488,094, dated Jul. 28, 2011, 13 pages.Applicant
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.Applicant
Thrun, “Learning Occupancy Grid Maps With Forward Sensor Models,” Autonomous Robots 15, Sep. 1, 2003, 28 pages.Applicant
Wigley, “The Electric Lawn”, in The American Lawn, Princeton Architectural Press New York with Canadian Centre for Architecture Montreal, 1999, pp. 155-195.Applicant
International Search Report and Written Opinion in International Application No. PCT/US2015/050482, dated Dec. 14, 2015, 10 pages.Applicant

Abstract