Patent Publication Number: US-11656082-B1

Title: Method for constructing a map while performing work

Description:
CROSS-REFERENCE TO RELATED APPLICATIONS 
     This application is a Continuation of U.S. Non-Provisional patent application Ser. No. 17/581,497, filed Jan. 21, 2022, which is a Continuation of U.S. Non-Provisional patent application Ser. No. 16/724,328, filed Dec. 22, 2019, which is a Continuation in Part of U.S. Non-Provisional application Ser. No. 16/597,945, filed Oct. 10, 2019, which is Continuation of U.S. Non-Provisional application Ser. No. 16/163,562, filed Oct. 17, 2018, which claims the benefit of U.S. Provisional Patent Application Nos. 62/573,591, filed Oct. 17, 2017; 62/637,185, filed Mar. 1, 2018; 62/613,005, filed Jan. 2, 2018; 62/599,216, filed Dec. 15, 2017; 62/573,579, filed Oct. 17, 2017; 62/637,156, filed Mar. 1, 2018; 62/740,558, filed Oct. 3, 2018; 62/573,598, filed Oct. 17, 2017; 62/591,217, filed Nov. 28, 2017; 62/616,928, filed Jan. 12, 2018; 62/614,449, filed Jan. 7, 2018; 62/590,205, filed Nov. 22, 2017; 62/666,266, filed May 3, 2018; U.S. Pat. No. 62,661,802, filed Apr. 24, 2018; 62/631,050, filed Feb. 15, 2018; 62/746,688, filed Oct. 17, 2018; 62/740,573, filed Oct. 3, 2018; and 62/740,580, filed Oct. 3, 2018; 62/640,444, filed Mar. 8, 2018; 62/648,026, filed Mar. 26, 2018; 62/655,494, filed Apr. 10, 2018; 62/665,095, filed May 1, 2018; 62/674,173, filed May 21, 2018; 62/688,497, filed Jun. 22, 2018, each of which is hereby incorporated herein by reference. U.S. Non-Provisional application Ser. No. 16/597,945 claims the benefit of U.S. Provisional Patent Application Nos. 62/914,190, filed Oct. 11, 2019; 62/933,882, filed Nov. 11, 2019; 62/942,237, filed Dec. 2, 2019; 62/952,376, filed Dec. 22, 2019; and 62/952,384, filed Dec. 22, 2019, each of which is hereby incorporated by reference. 
    
    
     In this patent, certain U.S. patents, U.S. patent applications, or other materials (e.g., articles) have been incorporated by reference. Specifically, U.S. patent application Ser. Nos. 15/272,752, 15/949,708, 16/277,991, 16/048,179, 16/048,185, 16/163,541, 16/163,562, 16/163,508, 16/185,000, 16/051,328, 15/449,660, 16/041,286, 16/422,234, 15/406,890, 14/673,633, 15/676,888, 16/163,530, 16/297,508, 16/418,988, 15/614,284, 15/955,480, 15/425,130, 15/955,344, 15/243,783, 15/954,335, 15/954,410, 15/257,798, 15/674,310, 15/224,442, 15/683,255, 15/048,827, 14/817,952, 15/619,449, 16/198,393, 15/981,643, 15/986,670, 15/447,623, 15/951,096, 16/270,489, 16/130,880, 14/948,620, 16/239,410, 16/230,805, 15/447,122, 16/393,921, 16/389,797, 16/509,099, 16/389,797, 16/427,317, 62/208,791, and 16/109,617 are hereby incorporated by reference. The text of such U.S. patents, U.S. patent applications, and other materials is, however, only incorporated by reference to the extent that no conflict exists between such material and the statements and drawings set forth herein. In the event of such conflict, the text of the present document governs, and terms in this document should not be given a narrower reading in virtue of the way in which those terms are used in other materials incorporated by reference. 
     FIELD OF THE DISCLOSURE 
     The disclosure relates to autonomous robots. 
     BACKGROUND 
     Autonomous or semi-autonomous robotic devices are increasingly used within consumer homes and commercial establishments. Such devices may include a robotic vacuum cleaner, lawn mower, mop, or other similar devices. To operate autonomously or to operate with minimal (or less than fully manual) input and/or external control within a working environment, mapping, localization, and path planning methods may be such that robotic devices may autonomously create a map of the working environment, subsequently use the map for navigation, and devise intelligent path plans and task plans for efficient navigation and task completion. 
     SUMMARY 
     The following presents a simplified summary of some embodiments of the techniques described herein in order to provide a basic understanding of the invention. This summary is not an extensive overview of the invention. It is not intended to identify key/critical elements of the invention or to delineate the scope of the invention. Its sole purpose is to present some embodiments of the invention in a simplified form as a prelude to the more detailed description that is presented below. 
     Some aspects include a method for a tangible, non-transitory, machine readable medium storing instructions that when executed by a processor of a robot effectuates operations including: capturing, with at least one sensor of a plurality of sensors coupled to the robot, first data used in indicating a position of the robot in relation to a workspace and objects within the workspace; capturing, with at least one sensor of the plurality of sensors coupled to the robot, second data indicative of movement of the robot; recognizing, with the processor of the robot, a first area of the workspace based on at least one of: a first part of the first data and a first part of the second data; generating, with the processor of the robot, a first movement path covering at least part of the first recognized area of the workspace; actuating, with the processor of the robot, the robot to move along the first movement path; and generating, with the processor of the robot, a map of the workspace based on at least one of: the first data and the second data; wherein: actuating the robot to move along the first movement path comprises at least a repetitive iteration of: actuating, with the processor of the robot, the robot to traverse a first linear segment; actuating, with the processor of the robot, the robot to rotate 180 degrees in a first rotation comprising traversing a first distance in a direction perpendicular to the first linear segment after starting the first rotation and before finishing the first rotation; actuating, with the processor of the robot, the robot to traverse a second linear segment parallel to the first linear segment; and actuating, with the processor of the robot, the robot to rotate 180 degrees in a second rotation comprising traversing a second distance in a direction perpendicular to the second linear segment after starting the second rotation and before finishing the second rotation; the robot is paired with an application of a user device configured to: display the map of the workspace including dividers that divide the map into subareas; and receive at least one user input designating an addition, a modification, or a deletion of a divider in the map; an addition, a modification, or a deletion of a name of a subarea within the map; and a schedule for the robot to perform work within at least one subarea; and the processor of the robot or the application of the user device divides the map into subareas using dividers. 
     Some aspects include a method for mapping and covering a workspace, including: capturing, with at least one sensor of a plurality of sensors coupled to a robot, first data used in indicating of a position of the robot in relation to a workspace and objects within the workspace; capturing, with at least one sensor of the plurality of sensors coupled to the robot, second data indicative of movement of the robot; recognizing, with a processor of the robot, a first area of the workspace based on at least one of: a first part of the first data and a first part of the second data; generating, with the processor of the robot, a first movement path covering at least part of the first recognized area of the workspace; actuating, with the processor of the robot, the robot to move along the first movement path; generating, with the processor of the robot, a map of the workspace based on at least one of: the first data and the second data; wherein: the robot is paired with an application of a user device; a second robot is paired with the application of the user device; the robot executes a first cleaning task within the workspace; the second robot executes a second cleaning task within the workspace after the robot completes the first cleaning task; and the application of the user device is configured to display the map. 
     Some aspects include a method a tangible, non-transitory, machine readable medium storing instructions that when executed by a processor of a robot effectuates operations including: capturing, with at least one sensor of a plurality of sensors coupled to the robot, first data used in indicating a position of the robot in relation to the workspace and objects within the workspace; capturing, with at least one sensor of the plurality of sensors coupled to the robot, second data indicative of movement of the robot; recognizing, with the processor of the robot, a first area of the workspace based on at least one of: a first part of the first data and a first part of the second data; generating, with the processor of the robot, a first movement path covering at least part of the first recognized area of the workspace; and actuating, with the processor of the robot, the robot to move along the first movement path; monitoring, with the processor of the robot, a battery charge of a battery of the robot; actuating, with the processor of the robot, the robot to return to a charging station during a cleaning task to recharge the battery of the robot when the battery charge is below a predetermined threshold and resume the cleaning task from where the robot left off after recharging the battery; determining, with the processor of the robot, an object type of the object encountered based on the first data, wherein the possible object types comprise cords, clothing garments, socks, shoes, feces, and earphones; generating, with the processor of the robot, a map of the workspace based on at least one of: the first data and the second data; and storing, with the processor of the robot, the map in a memory accessible to the processor of the robot. 
     Some aspects include a system, including: a robot, including: a drive motor configured to actuate movement of the robot; a plurality of sensors coupled to the robot; a processor; and memory storing instructions that when executed by the processor effectuates operations including: capturing, with a first sensor coupled to the robot, in a first iteration of an iterative process, a first sequence of readings of a first data type; capturing, with a second sensor coupled to the robot, in a first iteration of an iterative process, a first sequence of readings of a second data type, the second data type indicative of movement of the robot; generating, with the processor of the robot, a map of the workspace based on at least one of: data of the first data type and data of the second data type; recognizing, with the processor of the robot, a first workable area of the workspace based on at least readings of the first data type captured up to a current iteration; generating, with the processor of the robot, a first movement path covering at least part of the first workable area; actuating, with the processor of the robot, the robot to perform work while navigating along the first movement path, wherein navigating along the first movement path comprises a repetition of: actuating, with the processor of the robot, the robot to traverse linear segments parallel to one another; determining, with the processor of the robot, areas of the workspace that work was performed in and areas of the workspace that work is yet to be performed in while concurrently performing work in a current work session; actuating, with the processor of the robot, the robot to maneuver around an object on a driving surface encountered by the robot during the current work session by adjusting a planned movement path to maneuver around the object then resume along the planned movement path; determining, with the processor of the robot, an object type of the object encountered based on readings of the first data type, wherein the possible object types comprise cords, clothing garments, socks, shoes, feces, and earphones; storing, with the processor of the robot, the map in a memory accessible to the processor in subsequent work sessions; monitoring, with the processor of the robot, a battery charge of a battery of the robot; actuating, with the processor of the robot, the robot to return to a charging station during a cleaning task to recharge the battery of the robot when the battery charge is below a predetermined threshold and resume the cleaning task from where the robot left off after recharging the battery; and tracking, with the processor of the robot, a preset configuration for emptying the bin of the robot, wherein: the robot empties the bin of the robot into the bin of the charging station based on the preset configuration; and the preset configuration comprises a preset volume of debris within the bin of the robot; and an application of a smartphone paired with the robot configured to: display a quantity of total area cleaned; a total area cleaned after completion of a work session; a battery level; a cleaning duration; an estimated cleaning duration required to clean the workspace or a subarea of the workspace; object and object type of the object; a cleaning history; and firmware information; and receive at least one input designating an addition, a modification, or a deletion of a divider within the map; a suction level to use within a subarea; a no-entry zone; a deletion or an addition of a robot paired with the application; an instruction to find the robot; an instruction to contact customer service; a name or object type of a mapped object; an instruction for the robot to empty a bin of the robot into a bin of a charging station; an instruction for the robot to dock at the charging station; an instruction to start cleaning; an instruction to clean the workspace or a subarea of the workspace; a type of coverage within the workspace or a subarea of the workspace; a cleaning schedule of the robot within the workspace or a subarea of the workspace; an addition, a modification, a deletion of a name of a subarea within the map; and an instruction for the robot to clean an area in close proximity to a particularly labelled object; and wherein: the processor of the robot or the application of the smartphone divides the map of the workspace into subareas using dividers; the robot further comprises a bin for collecting dust; the bin of the robot comprises a first mechanism for emptying the bin of the robot manually and a second mechanism for emptying the bin of the robot automatically to a second bin via an air path from the first bin to the second bin; a charging station of the robot houses the second bin; the robot charges its battery after emptying the bin of the robot or concurrently while emptying the bin of the robot; and the first mechanism is used to remove the bin of the robot from the robot. 
    
    
     
       BRIEF DESCRIPTION OF DRAWINGS 
         FIGS.  1 A and  1 B  illustrate an example of a robot, according to some embodiments. 
         FIG.  2    illustrates an example of an underside of a robotic cleaner, according to some embodiments. 
         FIGS.  3 A- 3 G and  4 A- 4 C  illustrate an example of robot, according to some embodiments. 
         FIGS.  5 A- 5 F  illustrate an example of a robot and charging station, according to some embodiments. 
         FIGS.  6 A- 6 I  illustrate an example of a robot and charging station, according to some embodiments. 
         FIGS.  7 A- 7 F  illustrate examples of peripheral brushes of a robot, according to some embodiments. 
         FIGS.  8 A- 8 D  illustrate examples of different positions and orientations of floor sensors, according to some embodiments. 
         FIGS.  9 A and  9 B  illustrate examples of different positions and types of floor sensors, according to some embodiments. 
         FIG.  10    illustrates an example of an underside of a robotic cleaner, according to some embodiments. 
         FIG.  11    illustrates an example of an underside of a robotic cleaner, according to some embodiments. 
         FIG.  12    illustrates an example of an underside of a robotic cleaner, according to some embodiments. 
         FIGS.  13 A- 13 H  illustrate an example of a brush compartment, according to some embodiments. 
         FIGS.  14 A and  14 B  illustrate an example of a brush compartment, according to some embodiments. 
         FIGS.  15 A- 15 C  illustrate an example of a robot and charging station, according to some embodiments. 
         FIGS.  16 A and  16 B  illustrate an example of a robotic mop, according to some embodiments. 
         FIG.  17    illustrates an example of a multidimensional map, according to some embodiments. 
         FIG.  18    illustrates replacing a value of a reading with an average of the values of neighboring readings, according to some embodiments. 
         FIGS.  19 A- 19 C  illustrate generating a map from a subset of measured points, according to some embodiments. 
         FIG.  20 A  illustrates the robot measuring the same subset of points over time, according to some embodiments. 
         FIG.  20 B  illustrates the robot identifying a single particularity as two particularities, according to some embodiments. 
         FIG.  21    illustrates a path of the robot, according to some embodiments. 
         FIGS.  22 A- 22 D  illustrate an example of determining a perimeter according to some embodiments. 
         FIG.  23    illustrates example of perimeter patterns according to some embodiments. 
         FIGS.  24 A and  24 B  illustrate how an overlapping area is detected in some embodiments using raw pixel intensity data and the combination of data at overlapping points. 
         FIGS.  25 A- 25 C  illustrate how an overlapping area is detected in some embodiments using raw pixel intensity data and the combination of data at overlapping points. 
         FIGS.  26 A and  26 B  illustrate a 2D map segment constructed from depth measurements taken within a first field of view, according to some embodiments. 
         FIG.  27 A  illustrates a robotic device with mounted camera beginning to perform work within a first recognized area of the working environment, according to some embodiments. 
         FIGS.  27 B and  27 C  illustrate a 2D map segment constructed from depth measurements taken within multiple overlapping consecutive fields of view, according to some embodiments. 
         FIGS.  28 A and  28 B  illustrate how a segment of a 2D map is constructed from depth measurements taken within two overlapping consecutive fields of view, according to some embodiments. 
         FIGS.  29 A and  29 B  illustrate a 2D map segment constructed from depth measurements taken within two overlapping consecutive fields of view, according to some embodiments. 
         FIG.  30    illustrates a complete 2D map constructed from depth measurements taken within consecutively overlapping fields of view, according to some embodiments. 
         FIGS.  31 A and  31 B  illustrate a robotic device repositioning itself for better observation of the environment, according to some embodiments. 
         FIG.  32    illustrates a map of a robotic device for alternative localization scenarios, according to some embodiments. 
         FIGS.  33 A- 33 F and  34 A- 34 D  illustrate a boustrophedon movement pattern that may be executed by a robotic device while mapping the environment, according to some embodiments. 
         FIG.  35    illustrates a flowchart describing an example of a method for finding the boundary of an environment, according to some embodiments. 
         FIGS.  36 A and  36 B  illustrate an example of a map of an environment, according to some embodiments. 
         FIGS.  37 A- 37 D,  38 A- 38 C, and  39    illustrate an example of approximating a perimeter, according to some embodiments. 
         FIGS.  40 ,  41 A and  41 B  illustrate an example of fitting a line to data points, according to some embodiments. 
         FIG.  42    illustrates an example of clusters, according to some embodiments. 
         FIG.  43    illustrates an example of a similarity measure, according to some embodiments. 
         FIGS.  44 ,  45 A- 45 C,  46 A and  46 B  illustrate examples of clustering, according to some embodiments. 
         FIGS.  47 A and  47 B  illustrate data points observed from two different fields of view, according to some embodiments. 
         FIG.  48    illustrates the use of a motion filter, according to some embodiments. 
         FIGS.  49 A and  49 B  illustrate vertical alignment of images, according to some embodiments. 
         FIG.  50    illustrates overlap of data at perimeters, according to some embodiments. 
         FIG.  51    illustrates overlap of data, according to some embodiments. 
         FIG.  52    illustrates the lack of overlap between data, according to some embodiments. 
         FIG.  53    illustrates a path of a robot and overlap that occurs, according to some embodiments. 
         FIG.  54    illustrates the resulting spatial representation based on the path in  FIG.  53   , according to some embodiments. 
         FIG.  55    illustrates the spatial representation that does not result based on the path in  FIG.  53   , according to some embodiments. 
         FIG.  56    illustrates a movement path of a robot, according to some embodiments. 
         FIGS.  57 - 59    illustrate a sensor of a robot observing the environment, according to some embodiments. 
         FIG.  60    illustrates an incorrectly predicted perimeter, according to some embodiments. 
         FIG.  61    illustrates an example of a connection between a beginning and end of a sequence, according to some embodiments. 
         FIG.  62 A  illustrates an example of an initial phase space probability density of a robotic device, according to some embodiments. 
         FIGS.  62 B- 62 D  illustrate examples of the time evolution of the phase space probability density, according to some embodiments. 
         FIGS.  63 A- 63 D  illustrate examples of initial phase space probability distributions, according to some embodiments. 
         FIGS.  64 A and  64 B  illustrate examples of observation probability distributions, according to some embodiments. 
         FIG.  65    illustrates an example of a map of an environment, according to some embodiments. 
         FIGS.  66 A- 66 C  illustrate an example of an evolution of a probability density reduced to the q 1 ,q 2  space at three different time points, according to some embodiments. 
         FIGS.  67 A- 67 C  illustrate an example of an evolution of a probability density reduced to the p 1 ,q 1  space at three different time points, according to some embodiments. 
         FIGS.  68 A- 68 C  illustrate an example of an evolution of a probability density reduced to the p 2 ,q 2  space at three different time points, according to some embodiments. 
         FIG.  69    illustrates an example of a map indicating floor types, according to some embodiments. 
         FIG.  70    illustrates an example of an updated probability density after observing floor type, according to some embodiments. 
         FIG.  71    illustrates an example of a Wi-Fi map, according to some embodiments. 
         FIG.  72    illustrates an example of an updated probability density after observing Wi-Fi strength, according to some embodiments. 
         FIG.  73    illustrates an example of a wall distance map, according to some embodiments. 
         FIG.  74    illustrates an example of an updated probability density after observing distances to a wall, according to some embodiments. 
         FIGS.  75 - 78    illustrate an example of an evolution of a probability density of a position of a robotic device as it moves and observes doors, according to some embodiments. 
         FIG.  79    illustrates an example of a velocity observation probability density, according to some embodiments. 
         FIG.  80    illustrates an example of a road map, according to some embodiments. 
         FIGS.  81 A- 81 D  illustrate an example of a wave packet, according to some embodiments. 
         FIGS.  82 A- 82 E  illustrate an example of evolution of a wave function in a position and momentum space with observed momentum, according to some embodiments. 
         FIGS.  83 A- 83 E  illustrate an example of evolution of a wave function in a position and momentum space with observed momentum, according to some embodiments. 
         FIGS.  84 A- 84 E  illustrate an example of evolution of a wave function in a position and momentum space with observed momentum, according to some embodiments. 
         FIGS.  85 A- 85 E  illustrate an example of evolution of a wave function in a position and momentum space with observed momentum, according to some embodiments. 
         FIGS.  86 A and  86 B  illustrate an example of an initial wave function of a state of a robotic device, according to some embodiments. 
         FIGS.  87 A and  87 B  illustrate an example of a wave function of a state of a robotic device after observations, according to some embodiments. 
         FIGS.  88 A and  88 B  illustrate an example of an evolved wave function of a state of a robotic device, according to some embodiments. 
         FIGS.  89 A,  89 B,  90 A- 90 H, and  91 A- 91 F  illustrate an example of a wave function of a state of a robotic device after observations, according to some embodiments. 
         FIGS.  92 A,  92 B,  93 A, and  93 B  illustrate point clouds representing walls in the environment, according to some embodiments. 
         FIG.  94    illustrates seed localization, according to some embodiments. 
         FIGS.  95 A and  95 B  illustrate examples of overlap between possible locations of the robot, according to some embodiments. 
         FIG.  96    illustrates a map, according to some embodiments. 
         FIGS.  97 A and  97 B  illustrate a path of a robot, according to some embodiments. 
         FIGS.  98 A- 98 E  illustrate a path of a robot, according to some embodiments. 
         FIGS.  99 A- 99 C  illustrate an example of EKF output, according to some embodiments. 
         FIGS.  100  and  101    illustrate an example of a coverage area, according to some embodiments. 
         FIG.  102    illustrates an example of a polymorphic path, according to some embodiments. 
         FIGS.  103  and  104    illustrate an example of a traversable path of a robot, according to some embodiments. 
         FIG.  105    illustrates an example of an untraversable path of a robot, according to some embodiments. 
         FIG.  106    illustrates an example of a traversable path of a robot, according to some embodiments. 
         FIG.  107    illustrates areas traversable by a robot, according to some embodiments. 
         FIG.  108    illustrates areas untraversable by a robot, according to some embodiments. 
         FIGS.  109 A- 109 D,  110 A,  110 B,  111 A, and  111 B  illustrate how risk level of areas change with sensor measurements, according to some embodiments. 
         FIG.  112 A  illustrates an example of a Cartesian plane used for marking traversability of areas, according to some embodiments. 
         FIG.  112 B  illustrates an example of a traversability map, according to some embodiments. 
         FIGS.  113 A- 113 E  illustrate an example of path planning, according to some embodiments. 
         FIGS.  114 A- 114 D  illustrate an example of collaborating robots, according to some embodiments. 
         FIG.  115    illustrates an example of CAIT, according to some embodiments. 
         FIG.  116    illustrates an example of a home network, according to some embodiments. 
         FIGS.  117 A and  117 B  illustrate examples of connection path of devices through the cloud, according to some embodiments. 
         FIG.  118    illustrates an example of local connection path of devices, according to some embodiments. 
         FIG.  119    illustrates direct connection path between devices, according to some embodiments. 
         FIG.  120    illustrates an example of local connection path of devices, according to some embodiments. 
         FIGS.  121 A- 121 C  illustrate an example of observations of a robot at two time points, according to some embodiments. 
         FIG.  122    illustrates a movement path of a robot, according to some embodiments. 
         FIGS.  123 A and  123 B  illustrate examples of flow paths for uploading and downloading a map, according to some embodiments. 
         FIG.  124    illustrates the use of cache memory, according to some embodiments. 
         FIG.  125    illustrates performance of a TSOP sensor under various conditions. 
         FIG.  126    illustrates an example of subsystems of a robot, according to some embodiments. 
         FIG.  127    illustrates an example of a robot, according to some embodiments. 
         FIG.  128 A  illustrates a plan view of an exemplary environment in some use cases, according to some embodiments. 
         FIG.  128 B  illustrates an overhead view of an exemplary two-dimensional map of the environment generated by a processor of a robot, according to some embodiments. 
         FIG.  128 C  illustrates a plan view of the adjusted, exemplary two-dimensional map of the workspace, according to some embodiments. 
         FIGS.  129 A and  129 B  illustrate an example of the process of adjusting perimeter lines of a map, according to some embodiments. 
         FIG.  130    illustrates an example of a movement path of a robot, according to some embodiments. 
         FIG.  131    illustrates an example of a system notifying a user prior to passing another vehicle, according to some embodiments. 
         FIG.  132    illustrates an example of a log during a firmware update, according to some embodiments. 
         FIGS.  133 A- 133 C  illustrate an application of a communication device paired with a robot, according to some embodiments. 
         FIG.  134    illustrates an example of a computer code for generating an error log, according to some embodiments. 
         FIG.  135    illustrates an example of a diagnostic test method for a robot, according to some embodiments. 
         FIGS.  136 A- 136 E  illustrate an example of a smart fridge, according to some embodiments. 
         FIGS.  137 A- 137 D  illustrate an example of a food delivery robot, according to some embodiments. 
         FIGS.  138 A- 138 C  illustrate an example of a hospital bed robot, according to some embodiments. 
         FIGS.  139 A- 139 D  illustrate an example of a tire replacing robot, according to some embodiments. 
         FIGS.  140 A- 140 C  illustrate an example of a battery replacing robot, according to some embodiments. 
     
    
    
     DETAILED DESCRIPTION OF SOME EMBODIMENTS 
     The present inventions will now be described in detail with reference to a few embodiments thereof as illustrated in the accompanying drawings. In the following description, numerous specific details are set forth in order to provide a thorough understanding of the present inventions. It will be apparent, however, to one skilled in the art, that the present inventions, or subsets thereof, may be practiced without some or all of these specific details. In other instances, well known process steps and/or structures have not been described in detail in order to not unnecessarily obscure the present inventions. Further, it should be emphasized that several inventive techniques are described, and embodiments are not limited to systems implanting all of those techniques, as various cost and engineering trade-offs may warrant systems that only afford a subset of the benefits described herein or that will be apparent to one of ordinary skill in the art. 
     In some embodiments, a robot may include one or more autonomous or semi-autonomous robotic devices having communication, mobility, actuation and/or processing elements. In some embodiments, a robot includes a vehicle, such as a car or truck, with an electric motor. For example, the robot may include an electric car with an electric motor. In some embodiments, a vehicle, such as a car or truck, with an electric motor includes a robot. For example, an electric car with an electric motor may include a robot powered by an electric motor. In some embodiments, a robot may include, but is not limited to include, one or more of a casing, a chassis including a set of wheels, a motor to drive the wheels, a receiver that acquires signals transmitted from, for example, a transmitting beacon, a transmitter for transmitting signals, a processor, a memory, a controller, tactile sensors, obstacle sensors, network or wireless communications, radio frequency communications, power management such as a rechargeable battery or solar panels or fuel, one or more clock or synchronizing devices, temperature sensors, imaging sensors, and at least one cleaning tool (e.g., impeller, brush, mop, scrubber, steam mop, polishing pad, UV sterilizer, etc.). The processor may, for example, receive and process data from internal or external sensors, execute commands based on data received, control motors such as wheel motors, map the environment, localize the robot, determine division of the environment into zones, and determine movement paths. In some embodiments, at least a portion of the sensors of the robot are provided in a sensor array, wherein the at least a portion of sensors are coupled to a flexible, semi-flexible, or rigid frame. In some embodiments, the frame is fixed to a chassis or casing of the robot. In some embodiments, the sensors are positioned along the frame such that the field of view of the robot is maximized while the cross-talk or interference between sensors is minimized. In some cases, a component may be placed between adjacent sensors to minimize cross-talk or interference. In some embodiments, the robot may include sensors to detect or sense acceleration, angular and linear movement, temperature, humidity, water, pollution, particles in the air, supplied power, proximity, external motion, device motion, sound signals, ultrasound signals, light signals, fire, smoke, carbon monoxide, global-positioning-satellite (GPS) signals, radio-frequency (RF) signals, other electromagnetic signals or fields, visual features, textures, optical character recognition (OCR) signals, spectrum meters, and the like. In some embodiments, a microprocessor or a microcontroller of the robot may poll a variety of sensors at intervals. 
     In some embodiments, the robot may include a camera sensor that may be communicatively coupled with a microprocessor or microcontroller. In some embodiments, images captured by the camera may be processed to identify objects or faces, as further described below. For example, the microprocessor may identify a face in an image and perform an image search in a database on the cloud to identify an owner of the robot. In some embodiments, the camera may include an integrated processor. For example, object detection and face recognition may be executed on an integrated processor of a camera. In some embodiments, the camera may capture still images and record videos and may be a depth camera. For example, a camera may be used to capture images or videos in a first time interval and may be used as a depth camera emitting structured light in a second time interval. Given high frame rates of cameras some frame captures may be time multiplexed into two or more types of sensing. In some embodiments, the camera may be used to capture still images and video by a user of the robot. For example, a user may use the camera of the robot to perform a video chat, wherein the robot may optimally position itself to face the user. In embodiments, various configurations (e.g., types of camera, number of cameras, internal or external cameras, etc.) that allow for desired types of sensing (e.g., distance, obstacle, presence) and desired functions (e.g., sensing and capturing still images and videos) may be used to provide a better user experience. In some embodiments, the camera of the robot may have different fields of view (FOV). For example, a camera may have a horizontal FOV up to or greater than 90 degrees and a vertical FOV up to or greater than 20 degrees. In another example, the camera may have a horizontal FOV between 60-120 degrees and a vertical FOV between 10-80 degrees. In some embodiments, the camera may include lenses and optical arrangements of lenses to increase the FOV vertically or horizontally. For example, the camera may include fish eye lenses to achieve a greater field of view. In some embodiments, the robot may include more than one camera and each camera may be used for a different function. For example, one camera may be used in establishing a perimeter of the environment, a second camera may be used for obstacle sensing, and a third camera may be used for presence sensing. In another example, a depth camera may be used in addition to a main camera. The depth camera may be of various forms. In some embodiments, the camera output may be provided to an image processor for use by a user and to a microcontroller of the camera for depth sensing, obstacle detection, presence detection, etc. In some embodiments, the camera output may be processed locally on the robot by a processor that combine standard image processing functions and user presence detection functions. Alternatively, in some embodiments, the video/image output from the camera may be streamed to a host for processing further or visual usage. In some embodiments, there may be different options for communication and data processing between a dedicated image processor and an obstacle detecting co-processor. For example, a presence of an obstacle in the FOV of a camera may be detected, then a distance to the obstacle may be determined, then the type of obstacle may be determined (e.g., human, pet, table, wire, or another object), then, in the case where the obstacle type is a human, facial recognition may be performed to identify the human. All the information may be processed in multiple layers of abstraction. In embodiments, information may be processed by local microcontrollers, microprocessors, GPUs, on the cloud, or on a central home control unit. 
     In some embodiments, additional sensors of the robot, such as a proximity sensor may be used to provide additional data points to further enhance accuracy of estimations or predictions. In some embodiments, the additional sensors of the robot may be connected to the microprocessor or microcontroller. In some embodiments, the additional sensors may be complementary to other sensing methods of the robot. For example, in some sensor types, the active emitted lights may be in the form of square waves or other waveforms. The light may be mixed with a sine wave and a cosine wave that may be synchronized with the LED modulation. Then, a first and a second object present in the FOV of the sensor, each of which is positioned at a different distance, may produce a different phase shift that may be associated with their respective distance. 
     In some embodiments, the robot may include a controller, a multiplexer, and an array of light emitting diodes (LEDs) that may operate in a time division multiplex to create a structured light which the camera may capture at a desired time slot. In some embodiments, a suitable software filter may be used at each time interval to instruct the LED lights to alternate in a particular order or combination and the camera to capture images at a desirable time slot. In some embodiments, a micro electrical-mechanical device may be used to multiplex one or more of the LEDs such that fields of view of one or more cameras may be covered. In some embodiments, the LEDs may operate in any suitable range of wavelengths and frequencies, such as a near-infrared region of the electromagnetic spectrum. In some embodiments, pulses of light may be emitted at a desired frequency and the phase shift of the reflected light signal may be measured. 
     In some embodiments, the robot may include a tiered sensing system, wherein data of a first sensor may be used to initially infer a result and data of a second sensor, complementary to the first sensor, may be used to confirm the inferred result. In some embodiments, the robot may include a conditional sensing system, wherein data of a first sensor may be used to initially infer a result and a second sensor may be operated based on the result being successful or unsuccessful. Additionally, in some embodiments, data collected with the first sensor may be used to determine if data collected with the second sensor is needed or preferred. In some embodiments, the robot may include a state machine sensing system, wherein data from a first sensor may be used to initially infer a result and if a condition is met, a second sensor may be operated. In some embodiments, the robot may include a poll based sensing system wherein data from a first sensor may be used to initially infer a result, and if a condition is met, a second sensor may be operated. In some embodiments, the robot may include a silent synapse activator sensing system, wherein data from a first a sensor may be used to make an observation but the observation does not cause an actuation. In some embodiments, an actuation occurs when a second similar sensing occurs within a predefined time period. In some embodiments, there may be variations wherein a microcontroller may ignore a first sensor reading and may allow processing of a second (or third) sensor reading. For example, a missed light reflection from the floor may not be interpreted to be a cliff unless a second light reflection from the floor is missed. In some embodiments, a Hebbian based sensing method may be used to create correlations between different types of sensing. For example, in Hebb&#39;s theory, any two cells repeatedly active at the same time may become associated such that activity in one neuron facilitates activity in the other. When one cell repeatedly assists in firing another cell, an axon of the first cell may develop (or enlarge) synaptic knobs in contact with the soma of the second cell. In some embodiments, Hebb&#39;s principle may be used to determine how to alter the weights between artificial neurons (i.e., nodes) of an artificial neural network. In some embodiments, the weight between two neurons increases when two neurons activate simultaneously and decreases when they activate at different times. For example, two nodes that are both positive or negative may have strong positive weights while nodes with opposite sign may have strong negative weights. In some embodiments, the weight ω ij =x i x j  may be determined, wherein ω ij  is the weight of the connection from neuron j to neuron i and x i  the input for neuron i. For binary neurons, connections may be set to one when connected neurons have the same activation for a pattern. In some embodiments, the weight ω ij  may be determined using 
                       1   p       ∑     k   =   1     p                 x   i   k     ⁢     x   j   k       ,                     
wherein p is the number of training patterns, and x i   k  is input k for neuron i. In some embodiments, Hebb&#39;s rule Δω i =ηx i y may be used, wherein Δω i  is the change in synaptic weight i, η is a learning rate, and y a postsynaptic response. In some embodiments, the postsynaptic response may be determined using y=Σ y ω j x j . In some embodiments, other methods such as BCM theory, Oja&#39;s rule, or generalized Hebbian algorithm may be used.
 
     In some embodiments, the arrangement of LEDs, proximity sensors, and cameras of the robot may be directed towards a particular FOV. In some embodiments, at least some adjacent sensors of the robot may have overlapping FOVs. In some embodiments, at least some sensors may have a FOV that does not overlap with a FOV of another sensor. In some embodiments, sensors may be coupled to a curved structure to form a sensor array wherein sensors have diverging FOVs. Given the geometry of the robot is known, implementation and arrangement of sensors may be chosen based on the purpose of the sensors and the application. 
       FIG.  1 A  illustrates an example of a robot including sensor windows  100  behind which sensors are positioned, sensors  101  (e.g., camera, laser emitter, TOF sensor, IR sensors, range finders, LIDAR, depth cameras, etc.), user interface  102 , and bumper  103 .  FIG.  1 B  illustrates internal components of the robot including sensors  101  of sensor array  104 , PCB  105 , wheel modules each including suspension  106 , battery  107 , floor sensor  108 , and wheel  109 . In some embodiments, a processor of the robot may use data collected by various sensors to devise, through various phases of processing, a polymorphic path plan.  FIG.  2    illustrates another example of a robot, specifically an underside of a robotic cleaner including rotating screw compressor type dual brushes  200 , drive wheels  201 , castor wheel  202 , peripheral brush  203 , sensors on an underside of the robot  204 , USB port  205 , power port  206 , power button  207 , speaker  208 , and a microphone  209 . Indentations  210  may be indentations for fingers of a user for lifting the robot. In some embodiments, the indentations may be coated with a material different than the underside of the robot such that a user may easily distinguish the indentations. In this example, there are three sensors, one in the front and two on the side. The sensors may be used to sense presence and a type of driving surface. In some embodiments, some sensors are positioned on the front, sides, and underneath the robot. In some embodiments, the robot may include one or more castor wheels. In some embodiments, the wheels of the robot include a wheel suspension system. In some embodiments, the wheel suspension includes a trailing arm suspension coupled to each wheel and positioned between the wheel and perimeter of the robot chassis. An example of a dual wheel suspension system is described in U.S. patent application Ser. Nos. 15/951,096 and 16/270,489, the entire contents of which are hereby incorporated by reference. Other examples of wheel suspension systems that may be used are described in U.S. patent application Ser. No. 16/389,797, the entire contents of which is hereby incorporated by reference. In some embodiments, the different wheel suspension systems may be used independently or in combination. In some embodiments, one or more wheels of the robot may be driven by one or more electric motors. In some embodiments, the wheels of the robot are mecanum wheels. 
       FIG.  3 A  illustrates another example of a robot with vacuuming and mopping capabilities. The robot includes a module  300  that is removable from the robot, as illustrated in  FIG.  3 B .  FIG.  3 C  illustrates the module  300  with a dustbin lid  301  that interfaces with an intake path of debris, module connector  302  for connecting the module  300  to the robot, water intake tab  303  that may be opened to insert water into a water container, and a mopping pad (or cloth)  304 .  FIG.  3 D  illustrates internal components of the module  300  including a gasket  305  of the dustbin lid  301  to prevent the contents of dustbin  306  from escaping, opening  307  of the dustbin lid  301  that allows debris collected by the robot to enter the dustbin  306 , and a water pump  308  positioned outside of the water tank  309  that pumps water from the water tank  309  to water dispensers  310 . Mopping pad  304  receives water from water dispensers  310  which moistens the mopping pad  304  for cleaning a floor.  FIG.  3 E  illustrates debris path  311  from the robot into the dustbin  306  and water  312  within water tank  309 . Both the dustbin  306  and the water tank  309  may be washed as the impeller is not positioned within the dustbin  306  and the water pump  308  is not positioned within the water tank  309 .  FIG.  3 F  illustrates a bottom of module  300  including water dispensers  310  and Velcro strips  311  that may be used to secure mopping pad  304  to the bottom of module  300 .  FIG.  3 G  illustrates an alternative embodiment for dustbin lid  301 , wherein dustbin lid  301  opens from the top of module  300 .  FIGS.  4 A and  4 B  illustrates alternative embodiment of the robot in  FIGS.  3 A- 3 E . In  FIG.  4 A  the water pump  400  is positioned within the dustbin of module  401  and in  FIG.  4 B  the water pump  400  is positioned outside the module  401  and is connected to the module via connecting tube  402  with gasket  403  to seal fluid and prevent it from escaping at the connection point.  FIG.  4 C  illustrates a module  403  for converting water into hydrogen peroxide and water pump  400  positioned within module  401 . In some cases, module  403  may suction water (or may be provided water using a pump) from the water tank of the module  401 , convert the water into hydrogen peroxide, and dispense the hydrogen peroxide into an additional container for storing the hydrogen peroxide. The container storing hydrogen peroxide may use similar methods as described for dispensing the fluid onto the mopping pad. In some embodiments, the process of water electrolysis may be used to generate the hydrogen peroxide. In some embodiments, the process of converting water to hydrogen peroxide may include water oxidation over an electrocatalyst in an electrolyte, that results in hydrogen peroxide dissolved in the electrolyte which may be directly applied to the surface or may be further processed before applying it to the surface. 
     In some embodiments, the robot may be built into an area of an environment (e.g., kitchen, living room, laundry room, mud room, etc.). In some embodiments, the bin of the surface cleaner may directly connect to and may be directly emptied into the central vacuum system of the environment. In some embodiments, the robot may be docked at a charging station while simultaneously connected to the central vacuum system. In some embodiments, the contents of a dustbin of a robot may be emptied at a charging station of the robot. For example,  FIG.  5 A  illustrates robot  500  docked at charging station  501 . Robot  500  charges by a connection between charging nodes (not shown) of robot  500  with charging pads  502  of charging station  501 . When docked, a soft hose  503  may connect to a port of robot  500  with a vacuum motor  504  connected to a disposable trash bag (or detachable reusable container)  505 . Vacuum motor  504  may suction debris  506  from a dustbin of robot  500  into disposable trash bag  505 , as illustrated in  FIG.  5 B . Robot  500  may align itself during docking based on signals received from signal transmitters  507  positioned on the charging station  501 .  FIG.  5 C  illustrates components of rear-docking robot  500  including charging nodes  508 , port  509  to which soft hose  503  may connect, and presence sensors  510  used during docking to achieve proper alignment.  FIG.  5 D  illustrates magnets  511  that may be coupled to soft hose  503  and port  509 . Magnets  511  may be used in aligning and securing a connection between soft hose  503  and port  509  of robot  500 .  FIG.  5 E  illustrates an alternative embodiment wherein the vacuum motor  504  is connected to an outdoor bin  512  via a soft plastic hose  513 .  FIG.  5 F  illustrates another embodiment, wherein the vacuum motor  504  and soft plastic hose  513  are placed on top of charging station  501 . In some cases, the vacuum motor may be connected to a central vacuum system of a home or a garbage disposal system of a home. In embodiments, the vacuum motor may be placed on either side of the charging station. 
       FIG.  6 A  illustrates another example of a charging station of a robot. The charging station includes charging pads  600 , area  601  behind which signal transmitters are positioned, plug  602 , and button  603  for retracting plug  602 . Plug  602  may be pulled from hole  604  to a desired length and button  603  may be pushed to retract plug  602  back within hole  604 .  FIG.  6 B  illustrates plug  602  extended from hole  604 .  FIG.  6 C  illustrates a robot with charging nodes  605  that may interface with charging pads  600  to charge the robot. The robot includes sensor windows  606  behind which sensors (e.g., camera, time of flight sensor, LIDAR, etc.) are positioned, bumper  607 , brush  608 , wheels  609 , and tactile sensors  610 . Each tactile sensor may be triggered when pressed and may notify the robot of contact with an object.  FIG.  6 D  illustrates panel  611 , printed buttons  612  and indicators  613 , and the actual buttons  614  and LED indicators  615  positioned within the robot that are aligned with the printed buttons  612  and indicators  613  on the panel  611 .  FIG.  6 E  illustrates the robot positioned on the charging station and a connection between charging nodes  605  of the robot and charging pads  600  of the charging station. The charging pads  600  may be spring loaded such that the robot does not mistake them as an obstacle.  FIG.  6 F  illustrates an alternative embodiment of the charging station wherein the charging pads  616  are circular and positioned in a different location.  FIG.  6 G  illustrates an alternative embodiment of the robot wherein sensors window  617  is continuous.  FIG.  6 H  illustrates an example of an underside of the robot including UV lamp  618 .  FIG.  6 I  illustrates a close up of the UV lamp an internal reflective surface  619  to maximize lamp coverage and a bumpy glass cover  620  to scatter UV rays. 
     In some embodiments, peripheral brushes of a robotic cleaner, such as peripheral brush  203  of the robotic cleaner in  FIG.  2   , may implement strategic methods for bristle attachment to reduce the loss of bristles during operation. For example,  FIGS.  7 A and  7 B  illustrate one method for bristle attachment wherein each bristle bundle  700  may be wrapped around a cylinder  701  coupled to a main body  702  of the peripheral brush. Each bristle bundle  700  may be wrapped around the cylinder  701  at least once and then knotted with itself to secure its attachment to the main body  702  of the peripheral brush.  FIG.  7 C  illustrates another method for bristle attachment wherein each bristle bundle  703  may be threaded in and out of main body  702  to create two adjacent bristle bundles which may reduce the loss of bristles during operation. In some cases, the portion of each bristle bundle within the main body  702  may attached to the inside of main body  702  using glue, stitching, or another means.  FIGS.  7 D,  7 E, and  7 F  illustrate another method for bristle attachments wherein bristle bundles  704  positioned opposite to one another are hooked together, as illustrated in  FIG.  7 F . In all embodiments, the number of bristles in each bristle bundle may vary. 
     In embodiments, floor sensors may be positioned in different locations on an underside of the robotic cleaner and may also have different orientations and sizes. FIGS.  8 A- 8 D illustrate examples of alternative positions (e.g., displaced at some distance from the wheel or immediately adjacent to the wheel) and orientations (e.g., vertical or horizontal) for floor sensors  800 . The specific arrangement of sensors may depend on the geometry of the robot. 
     In some embodiments, floor sensors may be infrared (IR) sensors, ultrasonic sensors, laser sensors, time-of-flight (TOF) sensors, distance sensors, 3D or 2D range finders, 3D or 2D depth cameras, etc. For example, the floor sensor positioned on the front of the robot in  FIG.  2    may be an IR sensor while the floor sensors positioned on the sides of the robot may be TOF sensors. In another example,  FIGS.  9 A and  9 B  illustrate examples of alternative positions (e.g., displaced at some distance from the wheel so there is time for the robot to react, wherein the reaction time depends on the speed of the robot and the sensor position) of IR floor sensors  900  positioned on the sides of the underside of the robot. In these examples, the floor sensors are positioned in front of the wheel (relative to a forward moving direction of the wheel) to detect a cliff as the robot moves forward within the environment. Floor sensors positioned in front of the wheel may detect cliffs faster than floor sensors positioned adjacent to or further away from the wheel. 
     In embodiments, the number of floor sensors coupled to the underside of the robotic cleaner may vary depending on the functionality. For example, some robots may rarely drive backwards while others may drive backwards more often. Some robots may only turn clockwise while some may turn counterclockwise while some may do both. Some robots may execute a coastal drive or navigation from one side of the room. For example,  FIG.  10    illustrates an example of an underside of a robotic cleaner with four floor sensors  1000 .  FIG.  11    illustrates an example of an underside of a robotic cleaner with five floor sensors  1100 .  FIG.  12    illustrates an example of an underside of a robotic cleaner with six floor sensors  1200 . 
     In some embodiments, the robot is a robotic cleaner. In some embodiments, the robot includes a removable brush compartment with roller brushes designed to avoid collection of hair and debris at a connecting point of the roller brushes and a motor rotating the roller brushes. In some embodiments, the component powering rotation of the roller brushes may be masked from a user, the brush compartment, and the roller brushes by separating the power transmission from the brush compartment. In some embodiments, the roller brushes may be cleaned without complete removal of the roller brushes thereby avoiding tedious removal and realignment and replacement of the brushes after cleaning. 
       FIG.  13 A  illustrates an example of a brush compartment of a robotic cleaner including frame  1300 , gear box  1301 , and brushes  1302 . The robotic cleaner includes a motor  1303  and gearbox  1304  that interfaces with gear box  1301  of the brush compartment when it is fully inserted into the underside of the robotic cleaner, as illustrated in  FIG.  13 B . In some embodiments, the motor is positioned above the brush compartment such that elements like hair and debris cannot become entangled at the point of connection between the power transmission and brushes. In some embodiments, the motor and gearbox of the robot is positioned adjacent to the brush compartment or in another position. In some embodiments, the power generating motion in the motor is normal to the axis of rotation the brushes. In some embodiments, the motor and gearbox of the robot and the gearbox of the brush compartment may be positioned on either end of the brush compartment. In some embodiments, more than one motor and gearbox interface with the brush compartment. In some embodiments, more than one motor and gearbox of the robot may each interface with a corresponding gearbox of the brush compartment.  FIG.  13 C  illustrates brush  1302  comprised of two portions, one portion of which is rotatably coupled to frame  1300  on an end opposite the gear box  1301  of the brush compartment such that the rotatable portion of the brush may rotate about an axis parallel to the width of the frame. In some embodiments, the two portions of brush  1302  may be separated when the brushes are non-operable. In some embodiments, the two portions of brush  1302  are separated such that brush blade  1305  may be removed from brush  1302  by sliding brush blade  1305  in direction  1306 . In some embodiments, brush blades may be replaced when worn out or may be removed for cleaning. In some instances, this eliminates the tedious task of realigning brushes when they are completely removed from the robot. In some embodiments, a brush may be a single piece that may be rotatably coupled to the frame on one end such that the brush may rotate about an axis parallel to the width of the frame. In some embodiments, the brush may be fixed to the module such there is no need for removal of the brush during cleaning and may be put back together by simply clicking the brush into place. In some embodiments, separation of the brush from the module may not be a necessity for fully cleaning the brush but separation may be possible. In some embodiments, either end of a brush may be rotatably coupled to either end of the frame of the brush compartment. In some embodiments, the brushes may be directly attached to the chassis of the robotic cleaner, without the use of the frame. In some embodiments, brushes of the brush compartment may be configured differently from one another. For example, one brush may only rotate about an axis of the brush during operation while the other may additionally rotate about an axis parallel to the width of the frame when the brush is non-operable for removal of brush blades.  FIG.  13 E  illustrates brush blade  1305  completely removed from brush  1302 .  FIG.  13 F  illustrates motor  1303  and gearbox  1304  of the robotic cleaner that interfaces with gearbox  1301  of the brush compartment through insert  1307 .  FIG.  13 G  illustrates brushes  1302  of the brush compartment, each brush including two portions. To remove brush blades  1305  from brushes  1302 , the portions of brushes  1302  opposite gearbox  1301  rotate about an axis perpendicular to rotation axes of brushes  1302  and brush blades  1305  may be slid off of the two portions of brushes  1302  as illustrated in  FIGS.  13 D and  13 E .  FIG.  13 H  illustrates an example of a locking mechanism that may be used to lock the two portions of each brush  1302  together including locking core  1308  coupled to one portion of each brush and lock cavity  1309  coupled to a second portion of each brush. Locking core  1308  and lock  1309  interface with another to lock the two portions of each brush  1302  together. 
       FIG.  14 A  illustrates another example of a brush compartment of a robotic cleaner with similar components as described above including motor  2400  and gearbox  1401  of the robotic cleaner interfacing with gearbox  1402  of the brush compartment. Component  1403  of gearbox  1401  of the robotic cleaner interfacing with gearbox  1402  of the brush compartment differs from that shown in  FIG.  13 A .  FIG.  14 B  illustrates that component  1403  of gearbox  1401  of the robotic cleaner is accessible by the brush compartment when inserted into the underside of the robotic cleaner, while motor  1400  and gearbox  1401  of the robotic cleaner are hidden within a chassis of the robotic cleaner. 
     In some instances, the robotic cleaner may include a mopping module including at least a reservoir and a water pump driven by a motor for delivering water from the reservoir indirectly or directly to the driving surface. In some embodiments, the water pump may autonomously activate when the robotic cleaner is moving and deactivate when the robotic cleaner is stationary. In some embodiments, the water pump may include a tube through which fluid flows from the reservoir. In some embodiments, the tube may be connected to a drainage mechanism into which the pumped fluid from the reservoir flows. In some embodiments, the bottom of the drainage mechanism may include drainage apertures. In some embodiments, a mopping pad may be attached to a bottom surface of the drainage mechanism. In some embodiments, fluid may be pumped from the reservoir, into the drainage mechanism and fluid may flow through one or more drainage apertures of the drainage mechanism onto the mopping pad. In some embodiments, flow reduction valves may be positioned on the drainage apertures. In some embodiments, the tube may be connected to a branched component that delivers the fluid from the tube in various directions such that the fluid may be distributed in various areas of a mopping pad. In some embodiments, the release of fluid may be controlled by flow reduction valves positioned along one or more paths of the fluid prior to reaching the mopping pad.  FIG.  15 A  illustrates an example of a charging station  1500  including signal transmitters  1501  that transmit signals that the robot  1502  may use to align itself with the charging station  1500  during docking, vacuum motor  1503  for emptying debris from the dustbin of the robot  1502  into disposable trash bag (or reusable trash container)  1504  via tube and water pump  1505  for refilling a water tank of robot  1502  via tube  1506  using water from the house supply coming through piping  1507  into water pump  1505 . In some cases, the trash bag  1504  of charging station  1500  may be removed by pressing a button on the charging station  1500 .  FIG.  15 B  illustrates debris collection path  1508  and charging pads  1509  and  FIG.  15 C  illustrates water flow path  1510  and charging pads  1509  (robot not shown for visualization of the debris path and water flow path). Charging pads of the robot interface with charging pads  1509  during charging. Charging station  1500  may be used for a robot with combined vacuuming and mopping capabilities. In some instances, the dustbin is emptied or the water tank is refilled when the dustbin or the water tank reaches a particular volume, after a certain amount of surface coverage by the robot, after a certain number of operational hours, after a predetermined amount of time, after a predetermined number of working sessions, or based on another metric. In some instances, the processor of the robot may communicate with the charging station to notify the charging station that the dustbin needs to be emptied or the water tank needs to be refilled. In some cases, a user may use an application paired with the robot to instruct the robot to empty its dustbin or refill its water tank. The application may communicate the instruction to the robot and/or the charging station. In some cases, the charging station may be separate from the dustbin emptying station or the water refill station. 
     Some embodiments may provide a mopping extension unit for the robotic cleaner to enable simultaneous vacuuming and mopping of a driving surface and reduce (or eliminate) the need for a dedicated robotic mopping to run after a dedicated robotic vacuum. In some embodiments, a mopping extension may be installed in a dedicated compartment of or built into the chassis of the robotic cleaner. In some embodiments, the mopping extension may be detachable by, for example, activating a button or latch. In some embodiments, a cloth positioned on the mopping extension may contact the driving surface as the robotic cleaner drives through an area. In some embodiments, nozzles may direct fluid from a fluid reservoir to a mopping cloth. In some embodiments, the nozzles may continuously deliver a constant amount of cleaning fluid to the mopping cloth. In some embodiments, the nozzles may periodically deliver predetermined quantities of cleaning fluid to the cloth. In some embodiments, a water pump may deliver fluid from a reservoir to a mopping cloth, as described above. In some embodiments, the mopping extension may include a set of ultrasonic oscillators that vaporize fluid from the reservoir before it is delivered through the nozzles to the mopping cloth. In some embodiments, the ultrasonic oscillators may vaporize fluid continuously at a low rate to continuously deliver vapor to the mopping cloth. In some embodiments, the ultrasonic oscillators may turn on at predetermined intervals to deliver vapor periodically to the mopping cloth. In some embodiments, a heating system may alternatively be used to vaporize fluid. For example, an electric heating coil in direct contact with the fluid may be used to vaporize the fluid. The electric heating coil may indirectly heat the fluid through another medium. In other examples, radiant heat may be used to vaporize the fluid. In some embodiments, water may be heated to a predetermined temperature then mixed with a cleaning agent, wherein the heated water is used as the heating source for vaporization of the mixture. In some embodiments, water may be placed within the reservoir and the water may be reacted to produce hydrogen peroxide for cleaning and disinfecting the floor. In such embodiments, the process of water electrolysis may be used to generate hydrogen peroxide. In some embodiments, the process may include water oxidation over an electrocatalyst in an electrolyte, that results in hydrogen peroxide dissolved in the electrolyte which may be directly applied to the driving surface or mopping pad or may be further processed before applying it to the driving surface. In some embodiments, the robotic cleaner may include a means for moving the mopping cloth (and a component to which the mopping cloth may be attached) back and forth (e.g., forward and backwards or left and right) in a horizontal plane parallel to the driving surface during operation (e.g., providing a scrubbing action) such that the mopping cloth may pass over an area more than once as the robot drives. In some embodiments, the robot may pause for a predetermined amount of time while the mopping cloth moves back and forth in a horizontal plane, after which, in some embodiments, the robot may move a predetermined distance before pausing again while the mopping cloth moves back and forth in the horizontal plane again. In some embodiments, the mopping cloth may move back and forth continuously as the robot navigates within the environment. In some embodiments, the mopping cloth may be positioned on a front portion of the robotic cleaner. In some embodiments, a dry cloth may be positioned on a rear portion of the robotic cleaner. In some embodiments, as the robot navigates, the dry cloth may contact the driving surface and because of its position on the robot relative to the mopping cloth, dries the driving surface after the driving surface is mopped with the mopping cloth. For example,  FIG.  16 A  illustrates a robot including sensor windows  1600  behind which sensors are positioned, sensors  1601  (e.g., camera, laser emitter, TOF sensor, etc.), user interface  1602 , a battery  1603 , a wet mop movement mechanism  1604 , a PCB and processing unit  1605 , a wheel motor and gearbox  1606 , wheels  1607 , a wet mop tank  1608 , a wet mop cloth  1609 , and a dry mop cloth  1610 .  FIG.  16 B  illustrates the robot driving in a direction  1611 . While driving, or while pausing, wet mop cloth  1609  moves back and forth in a forward direction  1612  and backward direction  1613 , respectively. As the robot drives forward, dry cloth  1610  dries the driving surface that has been cleaned by wet mop cloth  1609 . In some embodiments, the mopping extension may include a means to vibrate the mopping extension during operation (e.g., eccentric rotating mass vibration motors). In some embodiments, the mopping extension may include a means to engage and disengage the mopping extension during operation by moving the mopping extension up and down in a vertical plane perpendicular to the work surface. In some embodiments, engagement and disengagement may be manually controlled by a user. In some embodiments, engagement and disengagement may be controlled automatically by the processor based on sensory input. For example, the processor may actuate the mopping extension to move in an upwards direction away from the driving surface upon detecting carpet using sensor data. 
     In some embodiments, the processor of the robot may generate a global and local map of the environment using data collected by sensors of the robot. In some embodiments, the sensors may include at least one imaging sensor. In one embodiment, an imaging sensor may measure vectors from the imaging sensor to objects in the environment and the processor may calculate the L2 norm of the vectors using ∥x∥ P =(Σ i |x i | P ) 1/P  with P=2 to estimate depths to objects. In some embodiments, the processor may adjust previous data to account for a measured movement of the robot as it moves from observing one field of view to the next (e.g., differing from one another due to a difference in sensor pose). In some embodiments, a movement measuring device such as an odometer, optical tracking sensor (OTS), gyroscope, inertial measurement unit (IMU), optical flow sensor, etc. may measure movement of the robot and hence the sensor (assuming the two move as a single unit). In some instances, the processor matches a new set of data with data previously captured. In some embodiments, the processor compares the new data to the previous data and identifies a match when a number of consecutive readings from the new data and the previous data are similar. In some embodiments, identifying matching patterns in the value of readings in the new data and the previous data may also be used in identifying a match. In some embodiments, thresholding may be used in identifying a match between the new and previous data wherein areas or objects of interest within an image may be identified using thresholding as different areas or objects have different ranges of pixel intensity. In some embodiments, the processor may determine a cost function and may minimize the cost function to find a match between the new and previous data. In some embodiments, the processor may create a transform and may merge the new data with the previous data and may determine if there is a convergence. In some embodiments, the processor may determine a match between the new data and the previous data based on translation and rotation of the sensor between consecutive frames measured by an IMU. For example, overlap of data may be deduced based on interoceptive sensor measurements. In some embodiments, the translation and rotation of the sensor between frames may be measured by two separate movement measurement devices (e.g., optical encoder and gyroscope) and the movement of the robot may be the average of the measurements from the two separate devices. In some embodiments, the data from one movement measurement device is the movement data used and the data from the second movement measurement device is used to confirm the data of the first movement measurement device. In some embodiments, the processor may use movement of the sensor between consecutive frames to validate the match identified between the new and previous data. Or, in some embodiments, comparison between the values of the new data and previous data may be used to validate the match determined based on measured movement of the sensor between consecutive frames. For example, the processor may use data from an exteroceptive sensor (e.g., image sensor) to determine an overlap in data from an IMU, encoder, or OTS. In some embodiments, the processor may stitch the new data with the previous data at overlapping points to generate or update the map. In some embodiments, the processor may infer the angular disposition of the robot based on a size of overlap of the matching data and may use the angular disposition to adjust odometer information to overcome inherent noise of an odometer. 
     In some embodiments, the map may be a state space with possible values for x, y, z. In some embodiments, a value of x and y may be a point on a Cartesian plane on which the robot drives and the value of z may be a height of obstacles or depth of cliffs. In some embodiments, the map may include additional dimensions (e.g., debris accumulation, floor type, obstacles, cliffs, stalls, etc.). For example,  FIG.  17    illustrates an example of a map that represents a driving surface with vertical undulations (e.g., indicated by measurements in x-, y-, and z-directions). In some embodiments, a map filler may assign values to each cell in a map (e.g., Cartesian). In some embodiments, the value associated with each cell may be used to determine a location of the cell in a planar surface along with a height from a ground zero plane. In some embodiments, a plane of reference (e.g., x-y plane) may be positioned such that it includes a lowest point in the map. In this way, all vertical measurements (e.g., z values measured in a z-direction normal to the plane of reference) are always positive. In some embodiments, the processor of the robot may adjust the plane of reference each time a new lower point is discovered and all vertical measurements accordingly. In some embodiments, the plane of reference may be positioned at a height of the work surface at a location where the robot begins to perform work and data may be assigned a positive value when an area with an increased height relative to the plane of reference is discovered (e.g., an inclination or bump) and assigned a negative value when an area with a decreased height relative to the plane of reference is observed. In some embodiments, a map may include any number of dimensions. For example, a map may include dimensions that provide information indicating areas that were previously observed to have a high level of debris accumulation or areas that were previously difficult to traverse or areas that were previously identified by a user (e.g., using an application of a communication device), such as areas previously marked by a user as requiring a high frequency of cleaning. In some embodiments, the processor may identify a frontier (e.g., corner) and may include the frontier in the map. 
     In some embodiments, the processor may generate or update the map based at least on the L2 norm of vectors measured by sensors to objects within the environment. In some embodiments, each L2 norm of a vector may be replaced with an average of the L2 norms corresponding with neighboring vectors. In some embodiments, the processor may use more sophisticated methods to filter sudden spikes in the sensor readings. In some embodiments, sudden spikes may be deemed as outliers. In some embodiments, sudden spikes or drops in the sensor readings may be the result of a momentary environmental impact on the sensor. In some embodiments, the processor may generate or update a map using captured images of the environment. In some embodiments, a captured image may be processed prior to using the image in generating or updating the map. In some embodiments, processing may include replacing readings corresponding to each pixel with averages of the readings corresponding to neighboring pixels.  FIG.  18    illustrates an example of replacing a reading  1800  corresponding with a pixel with an average of the readings  1801  of corresponding neighboring pixels  1802 . In some embodiments, pixel values of an image may be read into an array or any data structure or container capable of indexing elements of the pixel values. In some embodiments, the data structure may provide additional capabilities such as insertion or deletion in the middle, start, or end by swapping pointers in memory. In some embodiments, indices such as i, j, and k may be used to access each element of the pixel values. In some embodiments, negative indices count from the last element backwards. In some embodiments, the processor of the robot may transform the pixel values into grayscale. In some embodiments, the grayscale may range from black to white and may be divided into a number of possibilities. For example, numbers ranging from 0 to 256 may be used to describe 256 buckets of color intensities. Each element of the array may have a value that corresponds with one of buckets of color intensities. In some embodiments, the processor may create a chart showing the popularity of each color bucket within the image. For example, the processor may iterate through the array and may increase a popularity vote of the 0 color intensity bucket for each element of the array having a value of 0. This may be repeated for each of the 256 buckets of color intensities. In some embodiments, characteristics of the environment at the time the image is captured may affect the popularity of the 256 buckets of color intensities. For example, an image captured on a bright day may have increased popularity for color buckets corresponding with less intense colors. In some embodiments, principal component analysis may be used to reduce the dimensionality of an image as the number of pixels increases with resolution. For example, dimensions of a megapixel image are in the millions. In some embodiments, singular value decomposition may be used to find principal components. 
     In some embodiments, the processor of the robot stores a portion of the L2 norms, such as L2 norms to critical points within the environment. In some embodiments, critical points may be second or third derivatives of a function connecting the L2 norms. In some embodiments, critical points may be second or third derivatives of raw pixel values. In some embodiments, the simplification may be lossy. In some embodiments, the lost information may be retrieved and pruned in each tick of the processor as the robot collects more information. In some embodiments, the accuracy of information may increase as the robot moves within the environment. For example, a critical point may be discovered to include two or more critical points over time. In some embodiments, loss of information may not occur or may be negligible when critical points are extracted with high accuracy. 
     In some embodiments, depths may be measured to all objects within the environment. In some embodiments, depths may be measured to particular landmarks (e.g., some identified objects) or a portion of the objects within the environment (e.g., a subset of walls). In some embodiments, the processor may generate a map based on depths to a portion of objects within the environment.  FIG.  19 A  illustrates an example of a robot  1900  with a sensor collecting data that is indicative of depth to a subset of points  1901  along the walls  1902  of the environment.  FIG.  19 B  illustrates an example of a spatial model  1903  generated based on the depths to the subset of points  1901  of the environment shown in  FIG.  119 A , assuming the points are connected by lines. As robot  1900  moves from a first position at time t 0  to a second position at time t 10  within the environment and collects more data, the spatial model  1903  may be updated to more accurately represent the environment, as illustrated in  FIG.  19 C . 
     In some embodiments, the sensor of the robot  1900  continues to collect data to the subset of points  1901  along the walls  1902  as the robot  1900  moves within the environment. For example,  FIG.  20 A  illustrates the sensor of the robot  1900  collecting data to the same subset of points  1901  at three different times  2000 ,  2001 , and  2002  as the robot moves within the environment. In some cases, depending on the position of the robot, two particularities may appear as a single feature (or characteristic). For example,  FIG.  20 B  illustrates the robot  1900  at a position s 1  collecting data indicative of depths to points A and B. From position s 1  points A and B appear to be the same feature. As the robot  1900  travels to a position s 2  and observes the edge on which points A and B lie from a different angle, the processor of the robot  1900  may differentiate points A and B as separate features. In some embodiments, the processor of the robot gains clarity on features as it navigates within the environment and observes the features from different positions and may be able to determine if a single feature is actually two features combined. 
     In some embodiments, the path of the robot may overlap while mapping. For example,  FIG.  21    illustrates a robot  2100 , a path of the robot  2101 , an environment  2102 , and an initial area mapped  2103  while performing work. In some embodiments, the path of the robot may overlap resulting in duplicate coverage of areas of the environment. For instance, the path  2101  illustrated in  FIG.  21    includes overlapping segment  2104 . In some cases, the processor of the robot may discard some overlapping data from the map. In some embodiments, the processor of the robot may determine overlap in the path based on images captured with a camera of the robot as the robot moves within the environment. 
     In some embodiments, the processor may extract lines that may be used to construct the environment of the robot. In some cases, there may be uncertainty associated with each reading of a noisy sensor measurement and there may be no single line that passes through the measurement. In such cases, the processor may select the best possible match, given some optimization criterion. In some cases, sensor measurements may be provided in polar coordinates, wherein x i =(ρ i ,θ i ). The processor may model uncertainty associated with each measurement with two random variables, X i =(P i ,Q i ). To satisfy the Markovian requirement, the uncertainty with respect to the actual value of P and Q must be independent, wherein E[P i ·P j ]=E[P i ]E[P j ], E[Q i ·Q j ]=E[Q i ]E[Q j ], and E[P i ·Q j ]=E[P i ]E[Q j ], ∀i,j=1, . . . , n. In some embodiments, each random variable may be subject to a Gaussian probability, wherein P i ˜N(ρ i ,(σ 2 ) ρi ) and Q i ˜N(θ i ,(σ 2 ) θi ). In some embodiments, the processor may determine corresponding Euclidean coordinates x=ρ cos θ and y=ρ sin θ of a polar coordinate. In some embodiments, the processor may determine a line on which all measurements lie, i.e., ρ cos θ cos α+ρ sin θ sin α−r=ρ cos cos(θ−α)−r=0. However, obtaining a value of zero represents an ideal situation wherein there is no error. In actuality, this is a measure of the error between a measurement point (ρ,θ) and the line, specifically in terms of the minimum orthogonal distance between the point and the line. In some embodiments, the processor may minimize the error. In some embodiments, the processor may minimize the sum of square of all the errors using S=Σ i d i   2 =Σ i (ρ i  cos cos(i−α)−r) 2 , wherein 
                 ∂   S       ∂   α       =       0   ⁢         and   ⁢             ∂   S       ∂   r         =     0   .             
In some instances, measurements may not have the same errors. In some embodiments, a measurement point of the spatial representation of the environment may represent a mean of the measurement and a circle around the point may indicate the variance of the measurement. The size of circle may be different for different measurements and may be indicative of the amount of influence that each point may have in determining where the perimeter line fits. For example, in  FIG.  22 A , three measurements A, B, and C are shown, each with a circle  2200  indicating variance of the respective measurement. The perimeter line  2201  is closer to measurement B as it has a higher confidence and less variance. In some instances, the perimeter line may not be a straight line depending on the measurements and their variance. While this method of determining a position of a perimeter line may result in a perimeter line  2201  shown in  FIG.  22 B , the perimeter line of the environment may actually look like the perimeter line  2202  or  2203  illustrated in  FIG.  22 C  or  FIG.  22 D . In some embodiments, the processor may search for particular patterns in the measurement points. For example, it may be desirable to find patterns that depict any of the combinations in  FIG.  23   .
 
     In some embodiments, the processor (or a SLAM algorithm executed by the processor) may obtain scan data collected by sensors of the robot during rotation of the robot. In some embodiments, a subset of the data may be chosen for building the map. For example, 49 scans of data may be obtained for map building and four of those may be identified as scans of data that are suitable for matching and building the map. In some embodiments, the processor may determine a matching pose of data and apply a correction accordingly. For example, a matching pose may be determined to be (−0.994693, −0.105234, −2.75821) and may be corrected to (−1.01251, −0.0702046, −2.73414) which represents a heading error of 1.3792 degrees and a total correction of (−0.0178176, 0.0350292, 0.0240715) having traveled (0.0110555, 0.0113022, 6.52475). In some embodiments, a multi map scan matcher may be used to match data. In some embodiments, the multi map scan matcher may fail if a matching threshold is not met. In some embodiments, a Chi-squared test may be used. 
     Some embodiments may afford the processor of the robot constructing a map of the environment using data from one or more cameras while the robot performs work within recognized areas of the environment. The working environment may include, but is not limited to (a phrase which is not here or anywhere else in this document to be read as implying other lists are limiting), furniture, obstacles, static objects, moving objects, walls, ceilings, fixtures, perimeters, items, components of any of the above, and/or other articles. The environment may be closed on all sides or have one or more openings, open sides, and/or open sections and may be of any shape. In some embodiments, the robot may include an on-board camera, such as one with zero-degrees of freedom of actuated movement relative to the robot (which may itself have three degrees of freedom relative to an environment), or some embodiments may have more or fewer degrees of freedom; e.g., in some cases, the camera may scan back and forth relative to the robot. 
     A camera as described herein may include, but is not limited to, various optical and non-optical imaging devices, like a depth camera, stereovision camera, time-of-flight camera, or any other type of camera that outputs data from which depth to objects can be inferred over a field of view, or any other type of camera capable of generating a pixmap, or any device whose output data may be used in perceiving the environment. A camera may also be combined with an infrared (IR) illuminator (such as a structured light projector), and depth to objects may be inferred from images captured of objects onto which IR light is projected (e.g., based on distortions in a pattern of structured light). Examples of methods for estimating depths to objects using at least one IR laser, at least one image sensor, and an image processor are detailed in U.S. patent application Ser. Nos. 15/243,783, 62/208,791, 15/224,442, and 15/674,310, the entire contents of each of which are hereby incorporated by reference. Other imaging devices capable of observing depth to objects may also be used, such as ultrasonic sensors, sonar, LIDAR, and LADAR devices. Thus, various combinations of one or more cameras and sensors may be used. 
     In some embodiments, a camera, installed on the robot, for example, measures the depth from the camera to objects within a first field of view. In some embodiments, a processor of the robot constructs a first segment of the map from the depth measurements taken within the first field of view. The processor may establish a first recognized area within the working environment, bound by the first segment of the map and the outer limits of the first field of view. In some embodiments, the robot begins to perform work within the first recognized area. As the robot with attached camera rotates and translates within the first recognized area, the camera continuously takes depth measurements to objects within the field of view of the camera. Assuming the frame rate of the camera is fast enough to capture more than one frame of data in the time it takes the robot to rotate the width of the frame, a portion of data captured within each field of view overlaps with a portion of data captured within the preceding field of view. As the robot moves to observe a new field of view, in some embodiments, the processor adjusts measurements from previous fields of view to account for movement of the robot. The processor, in some embodiments, uses data from devices such as an odometer, gyroscope and/or optical encoder to determine movement of the robot with attached camera. 
     In some embodiments, the processor compares depth measurements taken within the second field of view to those taken within the first field of view in order to find the overlapping measurements between the two fields of view. The processor may use different methods to compare measurements from overlapping fields of view. An area of overlap between the two fields of view is identified (e.g., determined) when (e.g., during evaluation a plurality of candidate overlaps) a number of consecutive (e.g., adjacent in pixel space) depths from the first and second fields of view are equal or close in value. Although the value of overlapping depth measurements from the first and second fields of view may not be exactly the same, depths with similar values, to within a tolerance range of one another, can be identified (e.g., determined to correspond based on similarity of the values). Furthermore, identifying matching patterns in the value of depth measurements within the first and second fields of view can also be used in identifying the area of overlap. For example, a sudden increase then decrease in the depth values observed in both sets of measurements may be used to identify the area of overlap. Examples include applying an edge detection algorithm (like Haar or Canny) to the fields of view and aligning edges in the resulting transformed outputs. Other patterns, such as increasing values followed by constant values or constant values followed by decreasing values or any other pattern in the values of the perceived depths, can also be used to estimate the area of overlap. A Jacobian and Hessian matrix can be used to identify such similarities. 
     In some embodiments, thresholding may be used in identifying overlap wherein areas or objects of interest within an image may be identified using thresholding as different areas or objects have different ranges of pixel intensity. For example, an object captured in an image, the object having high range of intensity, can be separated from a background having low range of intensity by thresholding wherein all pixel intensities below a certain threshold are discarded or segmented, leaving only the pixels of interest. In some embodiments, a metric such as the Szymkiewicz-Simpson coefficient can be used to indicate how good of an overlap there is between the two sets of depth measurements. In some embodiments, the angular speed and time between consecutive fields of view may be used to estimate the area of overlap. Or some embodiments may determine an overlap with a convolution. Some embodiments may implement a kernel function that determines an aggregate measure of differences (e.g., a root mean square value) between some or all of a collection of adjacent depth readings in one image relative to a portion of the other image to which the kernel function is applied. Some embodiments may then determine the convolution of this kernel function over the other image, e.g., in some cases with a stride of greater than one pixel value. Some embodiments may then select a minimum value of the convolution as an area of identified overlap that aligns the portion of the image from which the kernel function was formed with the image to which the convolution was applied. 
     In some embodiments, the processor may identify overlap using raw pixel intensity values.  FIGS.  24 A and  24 B  illustrate an example of identifying an area of overlap using raw pixel intensity data and the combination of data at overlapping points. In  FIG.  24 A , the overlapping area between overlapping image  2400  captured in a first field of view and image  2401  captured in a second field of view may be determined by comparing pixel intensity values of each captured image (or transformation thereof, such as the output of a pipeline that includes normalizing pixel intensities, applying Gaussian blur to reduce the effect of noise, detecting edges in the blurred output (such as Canny or Haar edge detection), and thresholding the output of edge detection algorithms to produce a bitmap like that shown) and identifying matching patterns in the pixel intensity values of the two images, for instance by executing operations by which some embodiments determine an overlap with a convolution. Lines  2402  represent pixels with high pixel intensity value (such as those above a certain threshold) in each image. Area  2403  of image  2400  and area  2404  of image  2401  capture the same area of the environment and, as such, the same pattern for pixel intensity values is sensed in area  2403  of image  2400  and area  2404  of image  2401 . After identifying matching patterns in pixel intensity values in image  2400  and  2401 , a matching overlapping area between both images may be determined. In  FIG.  24 B , the images are combined at overlapping area  2405  to form a larger image  2406  of the environment. In some cases, data corresponding to the images may be combined. For instance, depth values may be aligned based on alignment determined with the image. 
       FIGS.  25 A- 25 C  illustrate another example of identifying an area of overlap using raw pixel intensity data and the combination of data at overlapping points.  FIG.  25 A  illustrates a top (plan) view of an object, such as a wall, with uneven surfaces wherein, for example, surface  2500  is further away from an observer than surface  2501  or surface  2502  is further away from an observer than surface  2503 . In some embodiments, at least one infrared line laser positioned at a downward angle relative to a horizontal plane coupled with at least one camera may be used to determine the depth of multiple points across the uneven surfaces from captured images of the line laser projected onto the uneven surfaces of the object. Since the line laser is positioned at a downward angle, the position of the line laser in the captured image will appear higher for closer surfaces and will appear lower for further surfaces. Similar approaches may be applied with lasers offset from a camera in the horizontal plane. The position of the laser line (or feature of a structured light pattern) in the image may be detected by finding pixels with intensity above a threshold. The position of the line laser in the captured image may be related to a distance from the surface upon which the line laser is projected. In  FIG.  25 B , captured images  2504  and  2505  of the laser line projected onto the object surface for two different fields of view are shown. Projected laser lines with lower position, such as laser lines  2506  and  2507  in images  2504  and  2505  respectively, correspond to object surfaces  2500  and  2502 , respectively, further away from the infrared illuminator and camera. Projected laser lines with higher position, such as laser lines  2508  and  2509  in images  2504  and  2505  respectively, correspond to object surfaces  2501  and  2503 , respectively, closer to the infrared illuminator and camera. Captured images  2504  and  2505  from two different fields of view may be combined into a larger image of the environment by finding an overlapping area between the two images and stitching them together at overlapping points. The overlapping area may be found by identifying similar arrangement of pixel intensities in both images, wherein pixels with high intensity may be the laser line. For example, areas of images  2504  and  2505  bound within dashed lines  2510  have similar arrangement of pixel intensities as both images captured a same portion of the object within their field of view. Therefore, images  2504  and  2505  may be combined at overlapping points to construct larger image  2511  of the environment shown in  FIG.  25 C . The position of the laser lines in image  2511 , indicated by pixels with intensity value above a threshold intensity, may also be used to infer depth of surfaces of objects from the infrared illuminator and camera (see, U.S. patent application Ser. No. 15/674,310, the entire contents of which is hereby incorporated by reference). 
     In some embodiments, the processor uses measured movement of the robot with attached camera to find the overlap between depth measurements taken within the first field of view and the second field of view. In other embodiments, the measured movement is used to verify the identified overlap between depth measurements taken within overlapping fields of view. In some embodiments, the area of overlap identified is verified if the identified overlap is within a threshold angular distance of the overlap identified using at least one of the method described above. In some embodiments, the processor uses the measured movement to choose a starting point for the comparison between measurements from the first field of view and measurements from the second field of view. For example, the processor uses the measured movement to choose a starting point for the comparison between measurements from the first field of view and measurements from the second field of view. The processor iterates using a method such as that described above to determine the area of overlap. The processor verifies the area of overlap if it is within a threshold angular distance of the overlap estimated using measured movement. 
     Some embodiments may implement DB-SCAN on depths and related values like pixel intensity, e.g., in a vector space that includes both depths and pixel intensities corresponding to those depths, to determine a plurality of clusters, each corresponding to depth measurements of the same feature of an object. Some embodiments may execute a density-based clustering algorithm, like DBSCAN, to establish groups corresponding to the resulting clusters and exclude outliers. To cluster according to depth vectors and related values like intensity, some embodiments may iterate through each of the depth vectors and designate a depth vectors as a core depth vector if at least a threshold number of the other depth vectors are within a threshold distance in the vector space (which may be higher than three dimensional in cases where pixel intensity is included). Some embodiments may then iterate through each of the core depth vectors and create a graph of reachable depth vectors, where nodes on the graph are identified in response to non-core corresponding depth vectors being within a threshold distance of a core depth vector in the graph, and in response to core depth vectors in the graph being reachable by other core depth vectors in the graph, where to depth vectors are reachable from one another if there is a path from one depth vector to the other depth vector where every link and the path is a core depth vector and is it within a threshold distance of one another. The set of nodes in each resulting graph, in some embodiments, may be designated as a cluster, and points excluded from the graphs may be designated as outliers that do not correspond to clusters. 
     Some embodiments may then determine the centroid of each cluster in the spatial dimensions of an output depth vector for constructing floor plan maps. In some cases, all neighbors have equal weight and in other cases the weight of each neighbor depends on its distance from the depth considered or (i.e., and/or) similarity of pixel intensity values. In some embodiments, the k-nearest neighbors algorithm is only applied to overlapping depths with discrepancies. In some embodiments, a first set of readings is fixed and used as a reference while the second set of readings, overlapping with the first set of readings, is transformed to match the fixed reference. In some embodiments, the transformed set of readings is combined with the fixed reference and used as the new fixed reference. In another embodiment, only the previous set of readings is used as the fixed reference. Initial estimation of a transformation function to align the newly read data to the fixed reference is iteratively revised in order to produce minimized distances from the newly read data to the fixed reference. The transformation function may be the sum of squared differences between matched pairs from the newly read data and prior readings from the fixed reference. For example, in some embodiments, for each value in the newly read data, the closest value among the readings in the fixed reference is found. In a next step, a point to point distance metric minimization technique is used such that it will best align each value in the new readings to its match found in the prior readings of the fixed reference. One point to point distance metric minimization technique that may be used estimates the combination of rotation and translation using a root mean square. The process is iterated to transform the newly read values using the obtained information. These methods may be used independently or may be combined to improve accuracy. In some embodiments, the adjustment applied to overlapping depths within the area of overlap is applied to other depths beyond the identified area of overlap, where the new depths within the overlapping area are considered ground truth when making the adjustment. 
     In some embodiments, due to measurement noise, discrepancies between the value of overlapping depth measurements from a first field of view and a second field of view may exist and the values of the overlapping depths may not be the exact same. In such cases, new depths may be calculated, or some of the depths may be selected as more accurate than others. For example, the overlapping depths from the first field of view and the second field of view (or more fields of view where more images overlap, like more than three, more than five, or more than 10) may be combined using a moving average (or some other measure of central tendency may be applied, like a median or mode) and adopted as the new depths for the area of overlap. The minimum sum of errors may also be used to adjust and calculate new depths for the overlapping area to compensate for the lack of precision between overlapping depths perceived within the first and second fields of view. By way of further example, the minimum mean squared error may be used to provide a more precise estimate of depths within the overlapping area. Other mathematical methods may also be used to further process the depths within the area of overlap, such as split and merge algorithm, incremental algorithm, Hough Transform, line regression, Random Sample Consensus, Expectation-Maximization algorithm, or curve fitting, for example, to estimate more realistic depths given the overlapping depths perceived within the first and second fields of view. The calculated depths are used as the new depth values for the overlapping depths identified. In another embodiment, the k-nearest neighbors algorithm can be used where each new depth is calculated as the average of the values of its k-nearest neighbors. These mathematical methods are not an exhaustive list of methods which may be used to process depth measurements, but provide an example of types of methods which may be used. Furthermore, mathematical methods may be combined. 
     In some cases, a confidence score is calculated for overlap determinations, e.g., based on an amount of overlap and aggregate amount of disagreement between depth vectors in the area of overlap in the different fields of view, and the above Bayesian techniques down-weight updates to priors based on decreases in the amount of confidence. In some embodiments, the size of the area of overlap is used to determine the angular movement and is used to adjust odometer information to overcome inherent noise of the odometer (e.g., by calculating an average movement vector for the robot based on both a vector from the odometer and a movement vector inferred from the fields of view). The angular movement of the robot from one field of view to the next may, for example, be determined based on the angular increment between vector measurements taken within a field of view, parallax changes between fields of view of matching objects or features thereof in areas of overlap, and the number of corresponding depths overlapping between the two fields of view. 
     In some embodiments, the processor expands the number of overlapping depth measurements to include a predetermined (or dynamically determined) number of depth measurements recorded immediately before and after (or spatially adjacent) the identified overlapping depth measurements. Once an area of overlap is identified (e.g., as a bounding box of pixel positions or threshold angle of a vertical plane at which overlap starts in each field of view), the processor constructs a larger field of view by combining the two fields of view using the overlapping depth measurements as attachment points. Combining may include transforming vectors with different origins into a shared coordinate system with a shared origin, e.g., based on an amount of translation or rotation of a depth sensing device between frames, for instance, by adding a translation or rotation vector to depth vectors. The transformation may be performed before, during, or after combining. The method of using the camera to perceive depths within consecutively overlapping fields of view and the processor to identify and combine overlapping depth measurements is repeated, e.g., until all areas of the environment are discovered and a map is constructed. 
     In some embodiments, the processor assigns a weight to each depth measurement. The value of the weight is determined based on various factors, such as the degree of similarity between depth measurements recorded from separate fields of view, the quality of the measurements, the weight of neighboring depth measurements, or the number of neighboring depth measurements with high weight. In some embodiments, the processor ignores depth measurements with weight less than as amount (such as a predetermined or dynamically determined threshold amount) as depth measurements with higher weight are considered to be more accurate. In some embodiments, increased weight is given to overlapping depths belonging to a larger number of overlapping depths between two sets of data, and less weight is given to overlapping depths belonging to a smaller number of overlapping depths between two sets of data. In some embodiments, the weight assigned to readings is proportional to the number of overlapping depth measurements. 
     In some embodiments, more than two consecutive fields of view overlap, resulting in more than two sets of depths falling within an area of overlap. This may happen when the amount of angular movement between consecutive fields of view is small, especially if the frame rate of the camera is fast such that several frames within which vector measurements are taken are captured while the robot makes small movements, or when the field of view of the camera is large or when the robot has slow angular speed and the frame rate of the camera is fast. Higher weight may be given to depths overlapping with more depths measured within other fields of view, as increased number of overlapping sets of depths provide a more accurate ground truth. In some embodiments, the amount of weight assigned to measured depths is proportional to the number of depths from other sets of data overlapping with it. Some embodiments may merge overlapping depths and establish a new set of depths for the overlapping depths with a more accurate ground truth. The mathematical method used can be a moving average or a more complex method. 
     In some embodiments, more than one camera may be used to improve accuracy of the map. For example, a plurality of depth measuring cameras (e.g., carried by the robot) may be used simultaneously (or concurrently) where depth measurements from each camera are used to more accurately map the environment. The use of a plurality of depth measuring cameras is expected to allow for the collection of depth measurements from different perspectives and angles, for example. Where more than one depth measuring camera is used, triangulation or others suitable methods may be used for further data refinement and accuracy. In some embodiments, a 360-degree LIDAR is used to create a map of the environment. It should be emphasized, though, that embodiments are not limited to techniques that construct a map in this way, as the present techniques may also be used for plane finding in augmented reality, barrier detection in virtual reality applications, outdoor mapping with autonomous drones, and other similar applications, which is not to suggest that any other description is limiting. 
     In some embodiments, images may be preprocessed before determining overlap. For instance, some embodiments may infer an amount of displacement of the robot between images, e.g., by integrating readings from an inertial measurement unit or odometer (in some cases after applying a Kalman filter), and then transform the origin for vectors in one image to match an origin for vectors in the other image based on the measured displacement, e.g., by subtracting a displacement vector from each vector in the subsequent image. Further, some embodiments may down-res images to afford faster matching, e.g., by selecting every other, every fifth, or more or fewer vectors, or by averaging adjacent vectors to form two lower-resolution versions of the images to be aligned. The resulting alignment may then be applied to align the two higher resolution images. 
     In some embodiments, a modified RANSAC approach is used where any two points, one from each data set, are connected by a line. A boundary is defined with respect to either side of the line. Any points from either data set beyond the boundary are considered outliers and are excluded. The process is repeated using another two points. The process is intended to remove outliers to achieve a higher probability of being the true distance to the perceived wall. Consider an extreme case where a moving object is captured in two frames overlapping with several frames captured without the moving object. The approach described or RANSAC method may be used to reject data points corresponding to the moving object. This method or a RANSAC method may be used independently or combined with other processing methods described above. 
     In some embodiments, computations may be expedited based on a type of movement of the robot between images. For instance, some embodiments may determine if the robot&#39;s displacement vector between images has less than a threshold amount of vertical displacement (e.g., is zero). In response, some embodiments may apply the above described convolution in with a horizontal stride and less or zero vertical stride, e.g., in the same row of the second image from which vectors are taken in the first image to form the kernel function. 
     In some embodiments, the processor (or set thereof) on the robot, a remote computing system in a data center, or both in coordination, may translate depth measurements from on-board sensors of the robot from the robot&#39;s (or the sensor&#39;s, if different) frame of reference, which may move relative to a room, to the room&#39;s frame of reference, which may be static. In some embodiments, vectors may be translated between the frames of reference with a Lorentz transformation or a Galilean transformation. In some cases, the translation may be expedited by engaging a basic linear algebra subsystem (BLAS) of a processor of the robot. In some instances where linear algebra is used, Basic Linear Algebra Subprograms (BLAS) are implemented to carry out operations such as vector addition, vector norms, scalar multiplication, matrix multiplication, matric transpose, matrix-vector multiplication, linear combinations, dot products, cross products, and the like. 
     In some embodiments, the robot&#39;s frame of reference may move with one, two, three, or more degrees of freedom relative to that of the room, e.g., some frames of reference for some types of sensors may both translate horizontally in two orthogonal directions as the robot moves across a floor and rotate about an axis normal to the floor as the robot turns. The “room&#39;s frame of reference” may be static with respect to the room, or as designation and similar designations are used herein, may be moving, as long as the room&#39;s frame of reference serves as a shared destination frame of reference to which depth vectors from the robot&#39;s frame of reference are translated from various locations and orientations (collectively, positions) of the robot. Depth vectors may be expressed in various formats for each frame of reference, such as with the various coordinate systems described above. (A data structure need not be labeled as a vector in program code to constitute a vector, as long as the data structure encodes the information that constitutes a vector.) In some cases, scalars of vectors may be quantized, e.g., in a grid, in some representations. Some embodiments may translate vectors from non-quantized or relatively granularly quantized representations into quantized or coarser quantizations, e.g., from a sensor&#39;s depth measurement to 16 significant digits to a cell in a bitmap that corresponds to 8 significant digits in a unit of distance. In some embodiments, a collection of depth vectors may correspond to a single location or pose of the robot in the room, e.g., a depth image, or in some cases, each depth vector may potentially correspond to a different pose of the robot relative to the room. 
     In embodiments, the constructed map may be encoded in various forms. For instance, some embodiments may construct a point cloud of two dimensional or three dimensional points by transforming each of the vectors into a vector space with a shared origin, e.g., based on the above-described displacement vectors, in some cases with displacement vectors refined based on measured depths. Or some embodiments may represent maps with a set of polygons that model detected surfaces, e.g., by calculating a convex hull over measured vectors within a threshold area, like a tiling polygon. Polygons are expected to afford faster interrogation of maps during navigation and consume less memory than point clouds at the expense of greater computational load when mapping. Vectors need not be labeled as “vectors” in program code to constitute vectors, which is not to suggest that other mathematical constructs are so limited. In some embodiments, vectors may be encoded as tuples of scalars, as entries in a relational database, as attributes of an object, etc. Similarly, it should be emphasized that images need not be displayed or explicitly labeled as such to constitute images. Moreover, sensors may undergo some movement while capturing a given image, and the pose of a sensor corresponding to a depth image may, in some cases, be a range of poses over which the depth image is captured. 
     In some embodiments, maps may be three dimensional maps, e.g., indicating the position of walls, furniture, doors, and the like in a room being mapped. In some embodiments, maps may be two dimensional maps, e.g., point clouds or polygons or finite ordered list indicating obstructions at a given height (or range of height, for instance from zero to 5 or 10 centimeters or less) above the floor. Two dimensional maps may be generated from two dimensional data or from three dimensional data where data at a given height above the floor is used and data pertaining to higher features are discarded. Maps may be encoded in vector graphic formats, bitmap formats, or other formats. 
     The robot may, for example, use the map to autonomously navigate the environment during operation, e.g., accessing the map to determine that a candidate route is blocked by an obstacle denoted in the map, to select a route with a route-finding algorithm from a current point to a target point, or the like. In some embodiments, the map is stored in memory for future use. Storage of the map may be in temporary memory such that a stored map is only available during an operational session or in more permanent forms of memory such that the map is available at the next session or startup. In some embodiments, the map is further processed to identify rooms and other segments. In some embodiments, a new map is constructed at each use, or an extant map is updated based on newly acquired data. 
     Some embodiments may reference previous maps during subsequent mapping operations. For example, embodiments may apply Bayesian techniques to simultaneous localization and mapping and update priors in existing maps based on mapping measurements taken in subsequent sessions. Some embodiments may reference previous maps and classifying objects in a field of view as being moveable objects upon detecting a difference of greater than a threshold size. 
     In some embodiments, gaps in the plotted boundary of the enclosure may be identified by one or more processors of the robot and further explored by one or more processors of the robot directing the camera until a complete (or more complete) closed loop boundary of the enclosure is plotted. In some embodiments, beacons are not required and the methods and apparatuses work with minimal or reduced processing power in comparison to traditional methods, which is not to suggest that any other described feature is required. 
       FIG.  26 A  illustrates camera  2600  mounted on robot  2601  measuring depths  2602  at predetermined increments within a first field of view  2603  of working environment  2604 . Depth measurements  2602  taken by camera  2600  measure the depth from camera  2600  to object  2605 , which in this case is a wall. Referring to  FIG.  26 B , a processor of the robot constructs 2D map segment  2606  from depth measurements  2602  taken within first field of view  2603 . Dashed lines  2607  demonstrate that resulting 2D map segment  2606  corresponds to depth measurements  2602  taken within field of view  2603 . The processor establishes first recognized area  2608  of working environment  2604  bounded by map segment  2606  and outer limits  2609  of first field of view  2603 . Robot  2601  begins to perform work within first recognized area  2608  while camera  2600  continuously takes depth measurements. 
       FIG.  27 A  illustrates robot  2601  translating forward in direction  2700  to move within recognized area  2608  of working environment  2604  while camera  2600  continuously takes depth measurements within the field of view of camera  2600 . Since robot  2601  translates forward without rotating, no new areas of working environment  2604  are captured by camera  2600 , however, the processor combines depth measurements  2701  taken within field of view  2702  with overlapping depth measurements previously taken within area  2608  to further improve accuracy of the map. As robot  2601  begins to perform work within recognized area  2608  it positions to move in vertical direction  2703  by first rotating in direction  2704 . 
       FIG.  27 B  illustrates robot  2601  rotating in direction  2704  while camera  2600  takes depth measurements  2701 ,  2705  and  2706  within fields of view  2707 ,  2708 , and  2709 , respectively. The processor combines depth measurements taken within these fields of view with one another and with previously taken depth measurements  2602  ( FIG.  26 A ), using overlapping depth measurements as attachment points. The increment between fields of view  2707 ,  2708 , and  2709  is trivial and for illustrative purposes. 
     In  FIG.  27 C  the processor constructs larger map segment  2710  from depth measurements  2602 ,  2701 ,  2705  and  2706  taken within fields of view  2603 ,  2707 ,  2708  and  209 , respectively, combining them by using overlapping depth measurements as attachment points. Dashed lines  2711  demonstrate that resulting 2D map segment  2710  corresponds to combined depth measurements  2602 ,  2701 ,  2705 , and  2706 . Map segment  2710  has expanded from first map segment  2606  ( FIG.  26 B ) as plotted depth measurements from multiple fields of view have been combined to construct larger map segment  2710 . The processor also establishes larger recognized area  2712  of working environment  2604  (compared to first recognized area  2608  ( FIG.  26 B )) bound by map segment  2710  and outer limits of fields of view  2603  and  2710  represented by dashed line  2713 . 
       FIG.  28 A  illustrates robot  2601  continuing to rotate in direction  2704  before beginning to move vertically in direction  2703  within expanded recognized area  2712  of working environment  2604 . Camera  2600  measures depths  2800  from camera  2600  to object  2605  within field of view  2801  overlapping with preceding depth measurements  2706  taken within field of view  2709  ( FIG.  27 B ). Since the processor of robot  2601  is capable of tracking its position (using devices such as an odometer or gyroscope) the processor can estimate the approximate overlap with previously taken depth measurements  2706  within field of view  2709 . Depth measurements  2802  represent the overlap between previously taken depth measurements  2706  and depth measurements  2800 .  FIG.  28 B  illustrates 2D map segment  2710  resulting from previously combined depth measurements  2602 ,  2701 ,  2705  and  2706  and map segment  2803  resulting from depth measurements  2800 . Dashed lines  2711  and  2804  demonstrate that resulting 2D map segments  2710  and  2803  correspond to previously combined depth measurements  2602 ,  2701 ,  2705 ,  2706  and to depth measurements  2800 , respectively. The processor constructs 2D map segment  2805  from the combination of 2D map segments  2710  and  2803  bounded by the outermost dashed lines of  2711  and  2804 . The camera takes depth measurements  2800  within overlapping field of view  2801 . The processor compares depth measurements  2800  to previously taken depth measurements  2706  to identify overlapping depth measurements bounded by the innermost dashed lines of  2711  and  2804 . The processor uses one or more of the methods for comparing depth measurements and identifying an area of overlap described above. The processor estimates new depth measurements for the overlapping depth measurements using one or more of the combination methods described above. To construct larger map segment  2805 , the processor combines previously constructed 2D map segment  2710  and 2D map segment  2803  by using overlapping depth measurements, bound by innermost dashed lines of  2711  and  2804 , as attachment points. The processor also expands recognized area  2712  within which robot  2601  operates to recognized area  2808  of working environment  2604  bounded by map segment  2805  and dashed line  2809 . 
       FIG.  29 A  illustrates robot  2601  rotating in direction  2900  as it continues to perform work within working environment  2604 . The processor expanded recognized area  308  to area  2901  bound by wall  2605  and dashed line  2902 . Camera  2600  takes depth measurements  2903  from camera  2600  to object  2605  within field of view  2904  overlapping with preceding depth measurements  2905  taken within field of view  2906 . Depth measurements  2907  represent overlap between previously taken depth measurements  2905  and depth measurements  2903 .  FIG.  29 B  illustrates expanded map segment  2908  and expanded recognized area  2909  resulting from the processor combining depth measurements  2903  and  2905  at overlapping depth measurements  2907 . This method is repeated as camera  2600  takes depth measurements within consecutively overlapping fields of view as robot  2601  moves within the environment and the processor combines the depth measurements at overlapping points until a 2D map of the environment is constructed. 
       FIG.  30    illustrates an example of a complete 2D map  3000  with bound area  3001 . The processor of robot  2601  constructs map  3000  by combining depth measurements taken within consecutively overlapping fields of view of camera  2600 . 2D map  3000  can, for example, be used by robot  2601  with mounted depth camera  2600  to autonomously navigate throughout the working environment during operation. In some embodiments, the robot is in a position where observation of the environment by sensors is limited. This may occur when, for example, the robot is positioned at one end of an environment and the environment is very large. In such a case, the processor of the robot constructs a temporary partial map of its surroundings as it moves towards the center of the environment where its sensors are capable of observing the environment. This is illustrated in  FIG.  31 A , where robot  2601  is positioned at a corner of large room  3100 , approximately 20 centimeters from each wall. Observation of the environment by sensors is limited due to the size of room  3100  wherein field of view  3101  of the sensor does not capture any features of environment  3100 . A large room, such as room  3100 , may be 8 meters long and 6 meters wide for example. The processor of robot  2601  creates a temporary partial map using sensor data as it moves towards center  3102  of room  3100  in direction  3103 . In  FIG.  31 B  robot  2601  is shown at the center of room  3100  where sensors are able to observe features of environment  3100 . 
     Feature and location maps as described herein are understood to be the same. For example, in some embodiments a feature-based map includes multiple location maps, each location map corresponding with a feature and having a rigid coordinate system with origin at the feature. Two vectors X and X′, correspond to rigid coordinate systems S and S′ respectively, each describe a different feature in a map. The correspondences of each feature may be denoted by C and C′, respectively. Correspondences may include, angle and distance, among other characteristics. If vector X is stationary or uniformly moving relative to vector X′, the processor of the robot may assume that a linear function U(X′) exists that may transform vector X′ to vector X and vice versa, such that a linear function relating vectors measured in any two rigid coordinate systems exists. 
     In some embodiments, the processor determines transformation between the two vectors measured. In some embodiments, the processor uses Galilean Group Transformation to determine the transformations between the two vectors, each measured relative to a different coordinate system. Galilean transformation may be used to transform between coordinates of two coordinate systems that only differ by constant relative motion. These transformations combined with spatial rotations and translations in space and time form the inhomogeneous Galilean Group, for which the equations are only valid at speeds much less than the speed of light. In some embodiments, the processor uses the Galilean Group for transformation between two vectors X and X′, measured relative to coordinate systems S and  5 ′, respectively, the coordinate systems with spatial origins coinciding at t=t′=0 and in uniform relative motion in their common directions. 
     In some embodiments, the processor determines the transformation X′=RX+a+νt between vector X′ measured relative to coordinate system  5 ′ and vector X measured relative to coordinate system S to transform between coordinate systems, wherein R is a rotation matrix acting on vector X, X is a vector measured relative to coordinate system S, X′ is a vector measured relative to coordinate system  5 ′, a is a vector describing displacement of coordinate system  5 ′ relative to coordinate system S, ν is a vector describing uniform velocity of coordinate system  5 ′ and t is the time. After displacement, the time becomes t′=t+s where s is the time over which the displacement occurred. 
     If T 1 =T 1 (R 1 ; a 1 ; ν 1 ; s 1 ) and T 2 =T 2  (R 1 ; a 1 ; ν 1 ; s 1 ) denote a first and second transformation, the processor of the robot may apply the first transformation to vector X at time t resulting in T 1 {X,t}={X′, t′} and apply the second transformation to resulting vector X′ at time t′ giving T 2 {X′, t′}={X″, t″}. Assuming T 3 =T 2 T 1 , wherein the transformations are applied in reverse order, is the only other transformation that yields the same result of {X″, t″}, then the processor may denote the transformations as T 3  {X,t}={X″, t″}. The transformation may be determined using X″=R 2 (R 1 X+a 1 +ν 1 t)+a 2 +ν 2 (t+s 1 ) and t″=t+s 1 +s 2 , wherein (R 1 X+a 1 +ν 1 t) represents the first transformation T 1 {X,t}={X′, t′}. Further, R 3 =R 2 R 1 , a 3 =a 2 +R 2 +a 1 +ν 2 s 1 , ν 3 =ν 2 +R 2 ν 1 , and s 3 =s 2 +s 1  hold true. 
     In some embodiments, the Galilean Group transformation is three dimensional, there are ten parameters used in relating vectors X and X′. There are three rotation angles, three space displacements, three velocity components and one time component, with the three rotation matrices) R 1 (θ)=[1 0 0 0 cos θ−sin θ0 sin θ cos θ], R 2 (θ)=[cos θ 0 sin θ0 1 0−sin θ0 cos θ], and R 3 (θ)=[cos θ−sin θ0 sin θ cos θ0 0 0 1]. The vector X and X′ may for example be position vectors with components (x,y,z) and (x′,y′,z′) or (x,y,θ) and (x′,y′,θ′), respectively. The method of transformation described herein allows the processor to transform vectors measured relative to different coordinate systems and describing the environment to be transformed into a single coordinate system. 
     In some embodiments, the processor of the robot uses sensor data to estimate its location within the environment prior to beginning and during the mapping process. In some embodiments, sensors of the robot capture data and the processor initially estimates the location of the robot based on the data and measured movement (e.g., using devices such as a gyroscope, optical encoder, etc.) of the robot. As more data is collected, the processor increases the confidence in the estimated location of the robot, and when movement occurs the processor decreases the confidence due to noise in measured movement. 
     In some embodiments, IMU measurements in a multi-channel stream indicative of acceleration along three or six axes may be integrated over time to infer a change in pose of the robot, e.g., with a Kalman filter. In some cases, the change in pose may be expressed as a movement vector in the frame of reference of the room through which the robot moves. Some embodiments may localize the robot or map the room based on this movement vector (and contact sensors in some cases) even if the image sensor is inoperative or degraded. In some cases, IMU measurements may be combined with image-based (or other exteroceptive) mapping data in a map or localization determination, e.g., with techniques like those described in Chen et. al “Real-time 3D mapping using a 2D laser scanner and IMU-aided visual SLAM,” 2017 IEEE International Conference on Real-time Computing and Robotics (RCAR), DOI: 10.1109/RCAR.2017.8311877, or in Ye et. al, LiDAR and Inertial Fusion for Pose Estimation by Non-linear Optimization, arXiv:1710.07104 [cs.RO], the contents of each of which are hereby incorporated by reference. Or in some cases, data from one active sensor may be used at a time for localization or mapping, and the other sensor may remain passive, e.g., sensing data, but that data may not be used for localization or mapping while the other sensor is active. Some embodiments may maintain a buffer of sensor data from the passive sensor (e.g., including measurements over a preceding duration, like one second or ten seconds), and upon failover from the active sensor to the passive sensor, which may then become active, some embodiments may access the buffer to infer a current position or map features based on both currently sensed data and buffered data. In some embodiments, the buffered data may be calibrated to the location or mapped features from the formerly active sensor, e.g., with the above-described sensor fusion techniques. 
     In embodiments, the constructed map of the robot may only be valid with accurate localization of the robot. For example, in  FIG.  32   , accurate localization of robot  3200  at location  3201  with position x 1 , y 1  may result in map  3202  while inaccurate localization of robot  3200  at location  3203  with position x 2 , y 2  may result in inaccurate map  3204  wherein perimeters of the map incorrectly appearing closer to robot  3200  as robot  3200  is localized to incorrect location  3203 . To eliminate or reduce such occurrences, in some embodiments, the processor constructs a map for each or a portion of possible locations of robot  3200  and evaluates the alternative scenarios of possible locations of robot  3200  and corresponding constructed maps of such locations. The processor determines the number of alternative scenarios to evaluate in real-time or it is predetermined. In some embodiments, each new scenario considered adds a new dimension to the environment of robot  3200 . Over time, the processor discards less likely scenarios. For example, if the processor considers a scenario placing robot  3200  at the center of a room and yet robot  3200  is observed to make contact with a perimeter, the processor determines that the considered scenario is an incorrect interpretation of the environment and the corresponding map is discarded. In some embodiments, the processor substitutes discarded scenarios with more likely scenarios or any other possible scenarios. In some embodiments, the processor uses a Fitness Proportionate Selection technique wherein a fitness function is used to assign a fitness to possible alternative scenarios and the fittest locations and corresponding maps survive while those with low fitness are discarded. In some embodiments, the processor uses the fitness level of alternative scenarios to associate a probability of selection with each alternative scenario that may be determined using the fitness function 
                 p   i     =       f   i               ∑     j   =   1     N           f   j                     ,         
wherein ƒ i  is the fitness of alternative scenario i of N possible scenarios and p i  is the probability of selection of alternative scenario i. In some embodiments, the processor is less likely to eliminate alternative scenarios with higher fitness level from the alternative scenarios currently considered. In some embodiments, the processor interprets the environment using a combination of a collection of alternative scenarios with high fitness level.
 
     In some embodiments, the movement pattern of the robot during the mapping process is a boustrophedon movement pattern. This can be advantageous for mapping the environment. For example, if the robot begins in close proximity to a wall of which it is facing and attempts to map the environment by rotating 360 degrees in its initial position, areas close to the robot and those far away may not be observed by the sensors as the areas surrounding the robot are too close and those far away are too far. Minimum and maximum detection distances may be, for example, 30 and 400 centimeters, respectively. Instead, in some embodiments, the robot moves backwards (i.e., opposite the forward direction as defined below) away from the wall by some distance and the sensors observe areas of the environment that were previously too close to the sensors to be observed. The distance of backwards movement is, in some embodiments, not particularly large, it may be 40, 50, or 60 centimeters for example. In some cases, the distance backward is larger than the minimal detection distance. In some embodiments, the distance backward is more than or equal to the minimal detection distance plus some percentage of a difference between the minimal and maximal detection distances of the robot&#39;s sensor, e.g., 5%, 10%, 50%, or 80%. 
     The robot, in some embodiments, (or sensor thereon if the sensor is configured to rotate independently of the robot) then rotates 180 degrees to face towards the open space of the environment. In doing so, the sensors observe areas in front of the robot and within the detection range. In some embodiments, the robot does not translate between the backward movement and completion of the 180 degree turn, or in some embodiments, the turn is executed while the robot translates backward. In some embodiments, the robot completes the 180 degree turn without pausing, or in some cases, the robot may rotate partially, e.g., degrees, move less than a threshold distance (like less than 10 cm), and then complete the other 90 degrees of the turn. 
     References to angles should be read as encompassing angles between plus or minus 20 degrees of the listed angle, unless another tolerance is specified, e.g., some embodiments may hold such tolerances within plus or minus 15 degrees, 10 degrees, 5 degrees, or 1 degree of rotation. References to rotation may refer to rotation about a vertical axis normal to a floor or other surface on which the robot is performing a task, like cleaning, mapping, or cleaning and mapping. In some embodiments, the robot&#39;s sensor by which a workspace is mapped, at least in part, and from which the forward direction is defined, may have a field of view that is less than 360 degrees in the horizontal plane normal to the axis about which the robot rotates, e.g., less than 270 degrees, less than 180 degrees, less than 90 degrees, or less than 45 degrees. In some embodiments, mapping may be performed in a session in which more than 10%, more than 50%, or all of a room is mapped, and the session may start from a starting position, is where the presently described routines start, and may correspond to a location of a base station or may be a location to which the robot travels before starting the routine. 
     The robot, in some embodiments, then moves in a forward direction (defined as the direction in which the sensor points, e.g., the centerline of the field of view of the sensor) by some first distance allowing the sensors to observe surroundings areas within the detection range as the robot moves. The processor, in some embodiments, determines the first forward distance of the robot by detection of an obstacle by a sensor, such as a wall or furniture, e.g., by making contact with a contact sensor or by bringing the obstacle closer than the maximum detection distance of the robot&#39;s sensor for mapping. In some embodiments, the first forward distance is predetermined or in some embodiments the first forward distance is dynamically determined, e.g., based on data from the sensor indicating an object is within the detection distance. 
     The robot, in some embodiments, then rotates another 180 degrees and moves by some second distance in a forward direction (from the perspective of the robot), returning back towards its initial area, and in some cases, retracing its path. In some embodiments, the processor may determine the second forward travel distance by detection of an obstacle by a sensor, such moving until a wall or furniture is within range of the sensor. In some embodiments, the second forward travel distance is predetermined or dynamically determined in the manner described above. In doing so, the sensors observe any remaining undiscovered areas from the first forward distance travelled across the environment as the robot returns back in the opposite direction. In some embodiments, this back and forth movement described is repeated (e.g., with some amount of orthogonal offset translation between iterations, like an amount corresponding to a width of coverage of a cleaning tool of the robot, for instance less than 100% of that width, 95% of that width, 90% of that width, 50% of that width, etc.) wherein the robot makes two 180 degree turns separated by some distance, such that movement of the robot is a boustrophedon pattern, travelling back and forth across the environment. In some embodiments, the robot may not be initially facing a wall of which it is in close proximity with. The robot may begin executing the boustrophedon movement pattern from any area within the environment. In some embodiments, the robot performs other movement patterns besides boustrophedon alone or in combination. 
     In other embodiments, the boustrophedon movement pattern (or other coverage path pattern) of the robot during the mapping process differs. For example, in some embodiments, the robot is at one end of the environment, facing towards the open space. From here, the robot moves in a first forward direction (from the perspective of the robot as defined above) by some distance then rotates 90 degrees in a clockwise direction. The processor determines the first forward distance by which the robot travels forward by detection of an obstacle by a sensor, such as a wall or furniture. In some embodiments, the first forward distance is predetermined (e.g., and measured by another sensor, like an odometer or by integrating signals from an inertial measurement unit). The robot then moves by some distance in a second forward direction (from the perspective of the room, and which may be the same forward direction from the perspective of the robot, e.g., the direction in which its sensor points after rotating); and rotates another 90 degrees in a clockwise direction. The distance travelled after the first 90-degree rotation may not be particularly large and may be dependent on the amount of desired overlap when cleaning the surface. For example, if the distance is small (e.g., less than the width of the main brush of a robotic vacuum), as the robot returns back towards the area it began from, the surface being cleaned overlaps with the surface that was already cleaned. In some cases, this may be desirable. If the distance is too large (e.g., greater than the width of the main brush) some areas of the surface may not be cleaned. For example, for small robots, like a robotic vacuum, the brush size typically ranges from 15-30 cm. If 50% overlap in coverage is desired using a brush with 15 cm width, the travel distance is 7.5 cm. If no overlap in coverage and no coverage of areas is missed, the travel distance is 15 cm and anything greater than 15 cm would result in coverage of area being missed. For larger commercial robots brush size can be between 50-60 cm. The robot then moves by some third distance in forward direction back towards the area of its initial starting position, the processor determining the third forward distance by detection of an obstacle by a sensor, such as wall or furniture. In some embodiments, the third forward distance is predetermined. In some embodiments, this back and forth movement described is repeated wherein the robot repeatedly makes two 90-degree turns separated by some distance before travelling in the opposite direction, such that movement of the robot is a boustrophedon pattern, travelling back and forth across the environment. In other embodiments, the directions of rotations are opposite to what is described in this exemplary embodiment. In some embodiments, the robot may not be initially facing a wall of which it is in close proximity. The robot may begin executing the boustrophedon movement pattern from any area within the environment. In some embodiments, the robot performs other movement patterns besides boustrophedon alone or in combination. 
       FIGS.  33 A- 33 D  illustrate an example of a boustrophedon movement pattern of the robot. In  FIG.  33 A  robot  3300  begins near wall  3301 , docked at its charging or base station  3302 . Robot  3300  rotates 360 degrees in its initial position to attempt to map environment  3303 , however, areas  3304  are not observed by the sensors of robot  3300  as the areas surrounding robot  3300  are too close, and the areas at the far end of environment  3303  are too far to be observed. Minimum and maximum detection distances may be, for example, 30 and 400 centimeters, respectively. Instead, in  FIG.  33 B , robot  3300  initially moves backwards in direction  3305  away from charging or base station  3302  by some distance  3306  where areas  3307  are observed. Distance  3306  is not particularly large, it may be 40 centimeters, for example. In  FIG.  33 C , robot  3300  then rotates 180 degrees in direction  3308  resulting in observed areas  3307  expanding. Areas immediately to either side of robot  3300  are too close to be observed by the sensors while one side is also unseen, the unseen side depending on the direction of rotation. In  FIG.  33 D , robot  3300  then moves in forward direction  3309  by some distance  3310 , observed areas  3307  expanding further as robot  3300  explores undiscovered areas. The processor of robot  3300  determines distance  3310  by which robot  3300  travels forward by detection of an obstacle, such as wall  3311  or furniture or distance  3310  is predetermined. In  FIG.  33 E , robot  3300  then rotates another 180 degrees in direction  3308 . In  FIG.  33 F , robot  3300  moves by some distance  3312  in forward direction  3313  observing remaining undiscovered areas. The processor determines distance  3312  by which the robot  3300  travels forward by detection of an obstacle, such as wall  3301  or furniture or distance  3312  is predetermined. The back and forth movement described is repeated wherein robot  3300  makes two 180 degree turns separated by some distance, such that movement of robot  3300  is a boustrophedon pattern, travelling back and forth across the environment while mapping. In other embodiments, the direction of rotations may be opposite to what is illustrated in this exemplary embodiment. 
       FIGS.  34 A- 34 D  illustrate another embodiment of a boustrophedon movement pattern of the robot during the mapping process.  FIG.  34 A  illustrates robot  3300  beginning the mapping process facing wall  3400 , when for example, it is docked at charging or base station  3401 . In such a case, robot  3300  initially moves in backwards direction  3402  away from charging station  3401  by some distance  3403 . Distance  3403  is not particularly large, it may be 40 centimeters for example. In  FIG.  34 B , robot  3300  rotates 180 degrees in direction  3404  such that robot  3300  is facing into the open space of environment  3405 . In  FIG.  34 C , robot  3300  moves in forward direction  3406  by some distance  3407  then rotates 90 degrees in direction  3404 . The processor determines distance  3407  by which robot  3300  travels forward by detection of an obstacle, such as wall  3408  or furniture or distance  3407  is predetermined. In  FIG.  34 D , robot  3300  then moves by some distance  3409  in forward direction  3410  and rotates another 90 degrees in direction  3404 . Distance  3409  is not particularly large and depends on the amount of desired overlap when cleaning the surface. For example, if distance  3409  is small (e.g., less than the width of the main brush of a robotic vacuum), as robot  3300  returns in direction  3412 , the surface being cleaned may overlap with the surface that was already cleaned when robot  3300  travelled in direction  3406 . In some cases, this may be desirable. If distance  3409  is too large (e.g., greater than the width of the main brush) some areas of the surface may not be cleaned. For example, for small robots, like a robotic vacuum, the brush size typically ranges from 15-30 cm. If 50% overlap in coverage is desired using a brush with 15 cm width, the travel distance is 7.5 cm. If no overlap in coverage and no coverage of areas is missed, the travel distance is 15 cm and anything greater than 15 cm would result in coverage of area being missed. For larger commercial robots brush size can be between 50-60 cm. Finally, robot  3300  moves by some distance  3411  in forward direction  3412  towards charging station  3401 . The processor determines distance  3411  by which robot  3300  travels forward may be determined by detection of an obstacle, such as wall  3400  or furniture or distance  3411  is predetermined. This back and forth movement described is repeated wherein robot  3300  repeatedly makes two 90-degree turns separated by some distance before travelling in the opposite direction, such that movement of robot  3300  is a boustrophedon pattern, travelling back and forth across the environment while mapping. Repeated movement  3413  is shown in  FIG.  34 D  by dashed lines. In other embodiments, the direction of rotations may be opposite to what is illustrated in this exemplary embodiment. 
       FIG.  35    illustrates a flowchart describing embodiments of a path planning method of a robot  3500 ,  3501 ,  3502  and  3503  corresponding with steps performed in some embodiments. 
     In some embodiments, the map of the area, including but not limited to doorways, sub areas, perimeter openings, and information such as coverage pattern, room tags, order of rooms, etc. is available to the user through a graphical user interface (GUI) such as a smartphone, computer, tablet, dedicated remote control, or any device that may display output data from the robot and receive inputs from a user. Through the GUI, a user may review, accept, decline, or make changes to, for example, the map of the environment and settings, functions and operations of the robot within the environment, which may include, but are not limited to, type of coverage algorithm of the entire area or each subarea, correcting or adjusting map boundaries and the location of doorways, creating or adjusting subareas, order of cleaning subareas, scheduled cleaning of the entire area or each subarea, and activating or deactivating tools such as UV light, suction and mopping. User inputs are sent from the GUI to the robot for implementation. Data may be sent between the robot and the user interface through one or more network communication connections. Any type of wireless network signals may be used, including, but not limited to, Wi-Fi signals, or Bluetooth signals. These techniques are further described in U.S. patent application Ser. Nos. 15/949,708 and 15/272,752, the entirety of each of which is incorporated herein by reference. 
     In some embodiments, the processor may manipulate the map by cleaning up the map for navigation purposes or aesthetics purposes (e.g., displaying the map to a user). For example,  FIG.  36 A  illustrates a perimeter  3600  of an environment that may not be aesthetically pleasing to a user.  FIG.  36 B  illustrates an alternative version of the map illustrated in  FIG.  36 A  wherein the perimeter  3601  may be more aesthetically pleasing to the user. In some embodiments, the processor may use a series of techniques, a variation of each technique, and/or a variation in order of applying the techniques to reach the desired outcome in each case. For example,  FIG.  37 A  illustrates a series of measurements  3700  to perimeter  3701  of an environment. In some cases, it may be desirable that the perimeter  3701  of the environment is depicted. In embodiments, different methods may be used in processing the data to generate a perimeter line. In some embodiments, the processor may generate a line from all the data points using least square estimation, such as in  FIG.  37 A . In some embodiments, the processor may determine the distances from each point to the line and may select local maximum and minimum L2 norm values.  FIG.  37 B  illustrates the series of measurements  3700  to line  3701  generated based on least square estimation of all data points and selected local maximum and minimum L2 norm values  3702 . In some embodiments, the processor may connect local maximum and minimum L2 norm values. For example,  FIG.  37 C  illustrates local maximum and minimum L2 norm values  3702  connected to each other. In some embodiments, the connected local maximum and minimum L2 norm values may represent the perimeter of the environment.  FIG.  37 D  illustrates a possible depiction of the perimeter  3703  of the environment. 
     In another method, the processor may initially examine a subset of the data. For example,  FIG.  38 A  illustrates data points  3800 . Initially, the processor may examine data points falling within columns one to three or area  3801 . In some embodiments, the processor may fit a line to the subset of data using, for example, least square method.  FIG.  38 B  illustrates a line  3802  fit to data points falling within columns one to three. In some embodiments, the processor may examine data points adjacent to the subset of data and may determine whether the data points belong with the same line fitted to the subset of data. For example, in  FIG.  38 C , the processor may consider data points falling within column four  3803  and may determine if the data points belong with the line  3802  fitted to the data points falling with columns one to three. In some embodiments, the processor may repeat the process of examining data adjacent to the last set of data points examined. For example, after examining data points falling with column four in  FIG.  38 C , the processor may examine data points falling with column five. In some embodiments, other variations of this technique may be used. For example, the processor may initially examine data falling within the first three columns, then may examine the next three columns. The processor may compare a line fitted to the first three columns to a line fitted to the next three columns. This variation of the technique may result in a perimeter line such as that illustrated in  FIG.  39   . In another variation, the processor examines data points falling within the first three columns, then examines data points falling within another three columns, some of which overlap with the first three columns. For example, the first three columns may be columns one to three and the other three columns may be columns three to five or two to four. The processor may compare a line fitted to the first three columns to a line fitted to the other three columns. In other embodiments, other variations may be used. 
     In another method, the processor may choose a first data point A and a second data point B from a set of data points. In some embodiments, data point A and data point B may be next to each other or close to one another. In some embodiments, the processor may choose a third data point C from the set of data points that is spatially positioned in between data point A and data point B. In some embodiments, the processor may connect data point A and data point B by a line. In some embodiments, the processor may determine if data point C fits the criteria of the line connecting data points A and B. In some embodiments, the processor determines that data points A and B within the set of data points are not along a same line. For example,  FIG.  40    illustrates a set of data points  4000 , chosen data points A, B, and C, and line  4001  connecting data point A and B. Since data point C does not fit criteria of lines  4001 , it may be determined that data points A and B within the set of data point  4000  do not fall along a same line. In another variation, the processor may choose a first data point A and a second data point B from a set of data points and may connect data points A and B by a line. In some embodiments, the processor may determine a distance between each data point of the set of data points to the line connecting data points A and B. In some embodiments, the processor may determine the number of outliers and inliers. In some embodiments, the processor may determine if data points A and B fall along the same line based on the number of outliers and inliers. In some embodiments, the processor may choose another two data points C and D if the number of outliers or the ratio of outliers to inliers is greater than a predetermined threshold and may repeat the processor with data points C and D.  FIG.  41 A  illustrates a set of data points  4100 , data points A and B and line  4101  connecting data points A and B. The processor determines distances  4102  from each of the data points of the set of data points  4100  to line  4101 . The processor determines the number of data points with distances falling within region  4103  as the number of inlier data points and the number of data points with distances falling outside of region  4103  as the number of outlier points. In this example, there are too many outliers. Therefore,  FIG.  41 B  illustrates another two selected data points C and D. The process is repeated and less outliers are found in this case as there are less data points with distances  4104  falling outside of region  4105 . In some embodiments, the processor may continue to choose another two data points and repeat the process until a minimum number of outliers is found or the number of outliers or the ratio of outliers to inliers is below a predetermined threshold. In some embodiments, there may be too may data points within the set of data points to select data points in sets of two. In some embodiments, the processor may probabilistically determine the number of data points to select and check based on the accuracy or minimum probability required. For example, the processor may iterate the method 20 times to achieve a 99% probability of success. Any of the methods and techniques described may be used independently or sequentially, one after another, or may be combined with other methods and may be applied in different orders. 
     In some embodiments, the processor may use image derivative techniques. Image derivative techniques may be used with data provided in various forms and are not restricted to being used with images. For example, image derivative techniques may be used with an array of distance readings (e.g., a map) or other types of readings just as well work well with a combination of these methods. In some embodiments, the processor may use a discrete derivative as an approximation of a derivative of an image I. In some embodiments, the processor determines a derivative in an x-direction for a pixel x 1  as the difference between the value of pixel x 1  and the values of the pixels to the left and right of the pixel x 1 . In some embodiments, the processor determines a derivative in a y-direction for a pixel y 1  as the difference between the value of pixel y 1  and the values of the pixels above and below the pixel y 1 . In some embodiments, the processor determines an intensity change I x  and I y  for a grey scale image as the pixel derivatives in the x- and y-directions, respectively. In some embodiments, the techniques described may be applied to color images. Each RGB of a color image may add an independent pixel value. In some embodiments, the processor may determine derivatives for each of the RGB or color channels of the color image. More colors and channels may be used for better quality. In some embodiments, the processor determines an image gradient ∇I, a 2D vector, as the derivative in the x- and y-direction. In some embodiments, the processor may determine a gradient magnitude, 
                   ❘   &#34;\[LeftBracketingBar]&#34;       ∇   I       ❘   &#34;\[RightBracketingBar]&#34;       =       (       I   x   2     +     I   y   2       )         ,         
which may indicate the strength of intensity change. In some embodiments, the processor may determine a gradient angle, α=arctan 2(I x ,I y ), which may indicate the angle at which the image intensity change is more dominant. Since the derivatives of an image are discrete values, there is no mathematical derivative, therefore the processor may employ approximations for the derivatives of an image using discrete differentiation operators. For example, the processor may use the Prewitt operator which convolves the image with a small, separable, and integer valued filter in horizontal and vertical directions. The Prewitt operator may use two 3×3 kernels, [−1 0 1−1 0 1−1 0 1] and [−1−1−1 0 0 0 1 1 1], that may be convolved with the original image I to determine approximations of the derivatives in an x- and y-direction, i.e., I x =I*[−1 0 1−1 0 1−1 0 1] and I y =I*[−1−1−1 0 0 0 1 1 1]. In another example, the processor may use the Sobel-Feldman operator, an isotropic 3×3 image gradient operator which at each point in the image returns either the corresponding gradient vector or the norm of the gradient vector, which convolves the image with a small, separable, and integer valued filter in horizontal and vertical directions. The Sobel-Feldman operator may use two 3×3 kernels, [−1 0 1−2 0 2−1 0 1] and [−1−2−1 0 0 0 1 2 1], that may be convolved with the original image I to determine approximations of the derivatives in an x- and y-direction, i.e., I x =I*[−1 0 1−2 0 2−1 0 1] and I y =I*[−1−2−1 0 0 0 1 2 1]. The processor may use other operators, such as Kayyali operator, Laplacian operator, and Robert Cross operator.
 
     In some embodiments, the processor may use image denoising methods image in one or more processing steps to remove noise from an image while maintaining the integrity, detail, and structure of the. In some embodiments, the processor may determine the total variation of an image as the sum of the gradient norm, J(I)=∫|∇I|dxdy or J(I)=Σ xy |∇I|, wherein the integral is taken over all pixels of the image. In some embodiments, the processor may use Gaussian filters to determine derivatives of an image, I x =I*G σx  and I y =I*G σy , wherein G σx  and G σy  are the x and y derivatives of a Gaussian function G a  with standard deviation σ. In some embodiments, the processor may use total variation denoising or total variation regularization to remove noise while preserving edges. In some embodiments, the processor may determine a total variation norm of 2D signals y (e.g., images) using V(y)=Σ i,j √{square root over (|y i+1,j −y i,j | 2 +|y i,j+1 −y i,j | 2 )}, which is isotropic and not differentiable. In some embodiments, the processor may use an alternative anisotropic version, V(y)=Σ i,j √{square root over (|y i+1,j −y i,j | 2 )}+√{square root over (|y i,j+1 −y i,j | 2 )}=Σ i,j |y i+1,j −y i,j |+|y i,j+1 −y i,j |. In some embodiments, the processor may solve the standard total variation denoising problem [E(x,y)+λV(y)], wherein E is the 2D L2 norm. In some embodiments, different algorithms may be used to solve the problem, such as prime dual method or split-Bergman method. In some embodiments, the processor may employ Rudin-Osher-Fatemi (ROF) denoising technique to a noisy image ƒ to determine a denoised image u over a 2D space. In some embodiments, the processor may solve the ROF minimization problem 
                      u          TV   ⁡   (   Ω   )       +           λ   2     ∫     Ω     ⁢       (     f   -   u     )     2     ⁢   dx       ,         
wherein BV(Ω) is the bounded variation over the domain Ω, TV(Ω) is the total variation over the domain, and λ is a penalty term. In some embodiments, u may be smooth and the processor may determine the total variation using ∥u∥ TV(Ω) =ƒ Ω ∥∇u∥dx and the minimization problem becomes
 
               ∫   Ω           [            ∇   u          +       λ   2     ⁢     (     f   -   u     )         ]     2     ⁢     dx   .             
Assuming no time dependence, the Euler-Lagrange equation for minimization may provide the nonlinear elliptic partial differential equation
 
             {           ∇   ·     (       ∇   u            ∇   u            )       +     λ   ⁡   (     f   -   u     )       =   0     ,       u   ∈     Ω   ⁢       ∂   u       ∂   n           =   0     ,     u   ∈       ∂   Ω     .               
In some embodiments, the processor may instead solve the time-dependent version of the ROF problem,
 
                 ∂   u       ∂   t       =       ∇   ·     (       ∇   u            ∇   u            )       +       λ   ⁡   (     f   -   u     )     .             
In some embodiments, the processor may use other denoising techniques, such as chroma noise reduction, luminance noise reduction, anisotropic diffusion, Rudin-Osher-Fatemi, and Chambolle. Different noise processing techniques may provide different advantages and may be used in combination and in any order.
 
     In some embodiments, the processor may determine correlation in x- and y-directions, C (I     1     I     2     )     xy   =Σ xy ƒ(I 1 (xy),I 2 (xy)) between two neighborhoods, wherein points in a first image I 1  correspond with points in a second image I 2  and ƒ is a cross location function. In some embodiments, the processor takes the summation over all pixels in neighboring windows in x- and y-directions. In some embodiments, the size of neighboring windows may be a one-pixel radius, a two-pixel radius, or an n-pixels radius. In some embodiments, the window geometry may be a triangle, square, rectangle, or another geometrical shape. In some embodiments, the processor may use a transform to associate an image with another image by identifying points of similarities. Various transformation methods may be used (e.g., linear or more complex). For example, an affine map ƒ: A→B between two affine spaces A and B may be a map on the points that acts linearly on the vectors, wherein ƒ determines a linear transformation φ such that for any pair of points P, Q∈A, ƒ{right arrow over ((P)ƒ(Q))}=φ{right arrow over ((PQ))} or ƒ(Q)−ƒ(P)=φ(Q−P). Other interpretations may be used. For example, for an origin O∈A and when B denotes its image ƒ(O)∈B, then for any vector {right arrow over (x)}, ƒ:(O+{right arrow over (x)})→(B+φ({right arrow over (x)})). And a chosen origin O′∈B may be decomposed as an affine transformation g: A→B that sends O→O′, i.e., g: (O+{right arrow over (x)})→(O′+φ({right arrow over (x)})) followed by the translation by a vector {right arrow over (b)}={right arrow over (O′B)}. In this example, ƒ includes a translation and a linear map. 
     In some embodiments, the processor may employ unsupervised learning or clustering to organize unlabeled data into groups based on their similarities. Clustering may involve assigning data points to clusters wherein data points in the same cluster are as similar as possible. In some embodiments, clusters may be identified using similarity measures, such as distance. In some embodiments, the processor may divide a set of data points into clusters. For example,  FIG.  42    illustrates a set of data points  4200  divided into four clusters  4201 . In some embodiments, the processor may split or merge clusters. In some embodiments, the processor may use proximity or similarity measures. A similarity measure may be a real-valued function that may quantify similarity between two objects. In some embodiments, the similarity measure may be the inverse of distance metrics, wherein they are large in magnitude when the objects are similar and small in magnitude (or negative) when the objects are dissimilar. For example, the processor may use a similarity measure s(x i ,x j ) which may be large in magnitude if x i ,x j  are similar, or a dissimilarity (or distance) measure d(x i ,x j ) which may be small in magnitude if x i ,x j  are similar. This is visualized in  FIG.  43   . Examples of a dissimilarity measure include Euclidean distance, 
                 d   ⁡   (       x   i     ,     x   j       )     =         ∑     k   =   1     d             (       x   i     (   k   )       -     x   j     (   k   )         )     2           ,         
which is translation invariant, Manhattan distance,
 
                 d   ⁡   (       x   i     ,     x   j       )     =       ∑     k   =   1     d             ❘   &#34;\[LeftBracketingBar]&#34;       (       x   i     (   k   )       -     x   j     (   k   )         )       ❘   &#34;\[RightBracketingBar]&#34;           ,         
which is an approximation to the Euclidean distance, Minkowski distance,
 
                   d   p     (       x   i     ,     x   j       )     =       ∑     k   =   1     m             (         ❘   &#34;\[LeftBracketingBar]&#34;       (       x   ik     -     x   jk       )       ❘   &#34;\[RightBracketingBar]&#34;       p     )       1   p           ,         
wherein p is a positive integer. An example of a similarity measure includes Tanimoto similarity,
 
                 T   s     =         ∑     j   =   1     k       (       a   j     ×     b   j       )               ∑     j   =   1     k             a   j   2     +     ∑     j   =   1     k               b   j   2     -     ∑     j   =   1     k               a   j     ×     b   j                 ,         
between two points a j , b j , with k dimensions. The Tanimoto similarity may only be applicable for a binary variable and ranges from zero to one, wherein one indicates a highest similarity. In some cases, Tanimoto similarity may be applied over a bit vector (where the value of each dimension is either zero or one) wherein the processor may use
 
               f   ⁡   (     A   ,   B     )     =       A   ·   B             ❘   &#34;\[LeftBracketingBar]&#34;     A     ❘   &#34;\[RightBracketingBar]&#34;       2     +         ❘   &#34;\[LeftBracketingBar]&#34;     B     ❘   &#34;\[RightBracketingBar]&#34;       2     -     A   ·   B               
to determine similarity. This representation relies on A·B=Σ i  A i B i =Σ i  A i ∧B i  and |A| 2 =Σ i A i   2 =Σ i A i . Note that the properties of T s  do not necessarily apply to ƒ. In some cases, other variations of the Tanimoto similarity may be used. For example, a similarity ratio,
 
                 T   s     =       ∑   i               X   i     ∧     Y   i           ∑   i           (       X   i     ∨     Y   i       )             ,         
wherein X and Y are bitmaps and X i  is bit i of X. A distance coefficient, T d (X,Y)=−(T s (X,Y)), based on the similarity ratio may also be used for bitmaps with non-zero similarity. Other similarity or dissimilarity measures may be used, such as RBF kernel in machine learning. In some embodiments, the processor may use a criterion for evaluating clustering, wherein a good clustering may be distinguished from a bad clustering. For example,  FIG.  44    illustrates a bad clustering. In some embodiments, the processor may use a similarity measure that provides an n×n sized similarity matrix for a set of n data points, wherein the entry i,j may be the negative of the Euclidean distance between i and j or may me a more complex measure such as the Gaussian
 
     
       
         
           
             
               e 
               
                 - 
                 
                   
                     
                        
                       
                         
                           s 
                           1 
                         
                         - 
                         
                           s 
                           2 
                         
                       
                        
                     
                     2 
                   
                   
                     2 
                     ⁢ 
                     
                       σ 
                       2 
                     
                   
                 
               
             
             . 
           
         
       
     
     In some embodiments, the processor may employ fuzzy clustering wherein each data point may belong to more than one cluster. In some embodiments, the processor may employ fuzzy c-means (FCM) clustering wherein a number of clusters are chosen, coefficients are randomly assigned to each data point for being in the clusters, and the process is repeated until the algorithm converges, wherein the change in the coefficients between two iterations is less than a sensitivity threshold. The process may further include determining a centroid for each cluster and determining the coefficient of each data point for being in the clusters. In some embodiments, the processor determines the centroid of a cluster using 
                 c   k     =         ∑   x                 ω   k     (   x   )     m     ⁢   x           ∑   k               ω   k     (   x   )     m           ,         
wherein a point x has a set of coefficients ω k (x) giving the degree of being in the cluster k, wherein m is the hyperparameter that controls how fuzzy the cluster will be. In some embodiments, the processor may use an FCM algorithm that partitions a finite collection of n elements X={x 1 , . . . , x n } into a collection of c fuzzy clusters with respect to a given criterion. In some embodiments, given a finite set of data, the FCM algorithm may return a list of c cluster centers C={c 1 , . . . , c 2 } and a partition matrix W=ω i,j ∈[0,1] for i=1, . . . , n and j=1, . . . , c, wherein each element ω ij  indicates the degree to which each element x i  belongs to cluster c j . In some embodiments, the FCM algorithm minimizes the objective functions argmin c 
 
                 ∑     i   =   1     n             ∑     j   =   1     c             ω     i   ⁢   j     m     ⁢         ❘   &#34;\[LeftBracketingBar]&#34;         ❘   &#34;\[LeftBracketingBar]&#34;         x   i     -     c   j         ❘   &#34;\[RightBracketingBar]&#34;         ❘   &#34;\[RightBracketingBar]&#34;       2           ,             wherein   ⁢           ω   ij       =       1       ∑     k   =   1     c         (         ❘   &#34;\[LeftBracketingBar]&#34;         ❘   &#34;\[LeftBracketingBar]&#34;         x   i     -     c   j         ❘   &#34;\[RightBracketingBar]&#34;         ❘   &#34;\[RightBracketingBar]&#34;           ❘   &#34;\[LeftBracketingBar]&#34;         ❘   &#34;\[LeftBracketingBar]&#34;         x   i     -     c   k         ❘   &#34;\[RightBracketingBar]&#34;         ❘   &#34;\[RightBracketingBar]&#34;         )       2     m   -   1             .             
In some embodiments, the processor may use k-means clustering, which also minimizes the same objective function. The difference with c-means clustering is the additions of ω ij  and m∈R, for m≥1. A large m results in smaller ω ij  values as clusters are fuzzier, and when m=1, ω ij  converges to zero or one, implying crisp partitioning. For example,  FIG.  45 A  illustrates one dimensional data points  4500  along an x-axis. The data may be grouped into two clusters. In  FIG.  45 B , a threshold  4501  along the x-axis may be chosen to group data points  4500  into clusters A and B. Each data point may have membership coefficient w with a value of zero or one that may be represented along the y-axis. In fuzzy clustering, each data point may have may a membership to multiple clusters and the membership coefficient may be any value between zero and one.  FIG.  45 C  illustrates fuzzy clustering of data points X00, wherein a new threshold  4502  and membership coefficients w for each data point may be chosen based on the centroids of the clusters and a distance from each cluster centroid. The data point intersecting with the threshold  4502  belongs to both clusters A and B and has a membership coefficient of 0.4 for clusters A and B.
 
     In some embodiments, the processor may use spectral clustering techniques. In some embodiments, the processor may use a spectrum (or eigenvalues) of a similarity matrix of data to reduce the dimensionality before clustering in fewer dimensions. In some embodiments, the similarity matrix may indicate the relative similarity of each pair of points in a set of data. For example, the similarity matrix for a set of data points may be a symmetric matrix A, wherein A ij ≥0 indicates a measure of similarity between data points with indices i and j. In some embodiments, the processor may use a general clustering method, such a k-means, on relevant eigenvectors of a Laplacian matrix of A. In some embodiments, the relevant eigenvectors are those corresponding to smallest several eigenvalues of the Laplacian except for the eigenvalue with a value of zero. In some embodiments, the processor determines the relevant eigenvectors as the eigenvectors corresponding to the largest several eigenvalues of a function of the Laplacian. In some embodiments, spectral clustering may be compared to partitioning a mass-spring system, wherein each mass may be associated with a data point and each spring stiffness may correspond to a weight of an edge describing a similarity of two related data points. In some embodiments, the eigenvalue problem of transversal vibration modes of a mass spring system may be the same as the eigenvalue problem of the graph Laplacian matric, L:=D−A, wherein D is the diagonal matrix D ii =Σ j A ij . The masses tightly connected by springs move together from the equilibrium position in low frequency vibration modes, such that components of the eigenvectors corresponding to the smallest eigenvalues of the graph Laplacian may be used for clustering of the masses. In some embodiments, the processor may use normalized cuts algorithm for spectral clustering, wherein points may be partitioned into two sets (B 1 ,B 2 ) based on an eigenvector ν corresponding to the second smallest eigenvalue of the symmetric normalized Laplacian, 
               L     n   ⁢   o   ⁢   r   ⁢   m       :=     I   -       D     -     1   2         ⁢   A   ⁢       D     -     1   2         .               
Alternatively, the processor may determine the eigenvector corresponding to the largest eigenvalue of the random walk normalized adjacency matrix, P=D −1 A. In some embodiments, the processor may partition the data by determining a median m of the components of the smallest eigenvector ν and placing all data points whose component in ν is greater than m in B 1  and the rest in B 2 . In some embodiments, the processor may use such an algorithm for hierarchical clustering by repeatedly partitioning subsets of data using the partitioning method described.
 
     In some embodiments, the clustering techniques described may be used to obtain insight into data (which may be fine-tuned using other methods) with relatively low computational cost. However, in some cases, generic classification may be challenging as the initial number of classes may be unknown and a supervised learning algorithm may require the number of classes beforehand. In some embodiments, a classification algorithm may be provided with a fixed number of classes to which data may be grouped into, however, determining the fixed number of classes may be difficult. For example, upon examining  FIG.  46 A  it may be determined that data points  4600  organized into four classes  4601  may result in a best outcome. Or that organizing data points  4600  into five classes  4602 , as illustrated in  FIG.  46 B , may result in a good classification. However, for an unknown image or an unknown environment, determining the fixed number of classes beforehand is more challenging. Further, prior probabilities for each class P(ω j ) for j=1, 2, . . . may need to be known as well. In some embodiments, the processor may approximate how many of a total number of data points scanned belong to each class based on the angular resolution of sensors, the number of scans per second, and the angular displacement of the robot relative to the size of the environment. In some embodiments, the processor may assume class conditional probability densities P(ω j ,θ j ) are known for j=1, . . . , c. In some embodiments, the values of c parameter vectors θ 1 , . . . , θ c  and class labels may be unknown. In some embodiments, the processor may use the mixture density function 
                 P   ⁡   (   θ   )     =       ∑     j   =   1     c         P   ⁡   (       x   |     ω   j       ,     θ   j       )     ⁢     P   ⁡   (     ω   j     )           ,         
wherein θ=(θ 1 , . . . , θ c ) t , conditional density P(x|ω j ,θ j ) is a component density, and priori P(ω j ) is a mixing parameter, to estimate the parameter vector θ. In some embodiments, the processor may draw samples from the mixture densities to estimate the parameter vector θ. In some embodiments, given that θ is known, the processor may decompose the mixture densities into components and may use a maximum a posteriori classifier on the derived densities. In some embodiments, for a set of data D={x 1 , . . . , x n } with n unlabeled data points independently drawn from a mixture density
 
                 P   ⁡   (   θ   )     =       ∑     j   =   1     c         P   ⁡   (       x   |     ω   j       ,     θ   j       )     ⁢     P   ⁡   (     ω   j     )           ,         
wherein the parameter vector θ is unknown but fixed, the processor may determine the likelihood of the observed sample as the joint density P(θ)=Π k=1   n P(x k |θ). In some embodiments, the processor determines the maximum likelihood estimate {circumflex over (θ)} for θ as the value of θ that maximizes the probability of D given θ. In some embodiments, it may be assumed that the joint density P(θ) is differentiable from θ. In some embodiments, the processor may determine the logarithm of the likelihood,
 
               l   =       ∑     k   =   1     n           ln   ⁢     P   ⁡   (       x   k     |   θ     )           ,         
and the gradient of l with respect to
 
               θ   i     ,         ∇     θ   i       l     =       ∑     k   =   1     n         1     P   ⁡   (       x   k     |   θ     )       ⁢         ∇     θ   i         [       ∑     j   =   1     c         P   ⁡   (         x   k     |     ω   j       ,     θ   j       )     ⁢     P   ⁡   (     ω   j     )         ]       .                 
If θ i  and θ j  are independent and i≠j then
 
               P   ⁡   (         ω   i     |     x   k       ,   θ     )     =         P   ⁡   (       ω   i     ,     θ   i       )     ⁢     P   ⁡   (     ω   i     )         P   ⁡   (   θ   )             
and the processor may determine the gradient of the log likelihood using
 
                 ∇     θ   i       l     =       ∑     k   =   1     n         P   ⁡   (         ω   i     |     x   k       ,   θ     )     ⁢       ∇     θ   i       ln     ⁢       P   ⁡   (         x   k     |     ω   i       ,     θ   i       )     .               
Since the gradient must vanish as the value of θ i  that maximizes l, the maximum likelihood estimate {circumflex over (θ)} i  must satisfy the conditions
 
                   ∑     k   =   1     n             P   ⁡   (         ω   i     |     x   k       ,       θ     )     ⁢       ∇     θ   i       ln     ⁢     P   ⁡   (         x   k     |     ω   i       ,         θ   i       )         =       0   ⁢         for   ⁢         i     =   1       ,   …         ,     c   .           
In some embodiments, the processor finds the maximum likelihood solution among the solutions the equations for {circumflex over (θ)} i . In some embodiments, the results may be generalized to include prior probabilities P(ω i ) among the unknown quantities. In such a case, the search for the maximum values of P(θ) extends over θ and P(ω i ), wherein P(ω i )≥0 for i=1, . . . , c and
 
                 ∑     i   =   1     c           P   ⁡   (     ω   i     )       =   1.         
In some embodiments, {circumflex over (P)}(ω i ) may be the maximum likelihood estimate for P(ω i ) and {circumflex over (θ)} i  may be the maximum likelihood estimate for θ i . If the likelihood function is differentiable and if
 
                   P   ˆ     (     ω   i     )     ≠     0   ⁢         for   ⁢         any   ⁢                ⁢   i       ,             then   ⁢             P   ˆ     (     ω   i     )     ⁢         and   ⁢             θ   ˆ     i     ⁢         satisfy   ⁢             P   ˆ     (     ω   i     )       =         1   n     ⁢       ∑     k   =   1     n           P   ˆ     (         ω   i     |     x   k       ,     θ   ˆ       )     ⁢         and   ⁢             ∑     k   =   1     n           P   ˆ     (         ω   i     |     x   k       ,     θ   ˆ       )     ⁢       ∇     θ   i       ln     ⁢     P   ⁡   (         x   k     |     ω   i       ,       θ   ˆ     i       )               =   0       ,         
wherein
 
                 P   ˆ     (         ω   i     |     x   k       ,     θ   ˆ       )     =           P   ⁡   (       ω   i     ,       θ   ^     i       )     ⁢       P   ˆ     (     ω   i     )           ∑     j   =   1     c         P   ⁡   (         x   k     |     ω   j       ,       θ   ^     i       )     ⁢       P   ˆ     (     ω   j     )           .           
This states that the maximum likelihood estimate of the probability of a category is the average over the entire data set of the estimate derived from each same, wherein each sample is weighted equally. The latter equation is related to Bayes Theorem, however the estimate for the probability for class ω i  depends on {circumflex over (θ)} i  and not the full {circumflex over (θ)} directly. Since {circumflex over (P)}≠0, and for the case wherein n=1,
 
                 ∑     k   =   1     n               P   ˆ     (         ω   i     |     x   k       ,     θ   ˆ       )     ⁢       ∇     θ   i       ln     ⁢     P   ⁡   (         x   k     |     ω   i       ,       θ   ˆ     i       )         =   0         
states that the probability density is maximized as a function of θ i .
 
     In some embodiments, clustering may be challenging due to the continuous collection data that may differ at different instances and changes in the location from which data is collected. For example,  FIG.  47 A  illustrates data points  4700  observed from a point of view  4701  of a sensor and  FIG.  47 B  illustrates data points  4700  observed from a different point of view  4702  of the sensor. This exemplifies that data points  4700  appear differently depending on the point of view of the sensor. In some embodiments, the processor may use stability-plasticity trade-off to help in solving such challenges. The stability-plasticity dilemma is a known constraint for artificial neural systems as a neural network must learn new inputs from the environment without being disrupted by them. The neural network may require plasticity for the integration of new knowledge, but also stability to prevent forgetting previous knowledge. In some embodiments, too much plasticity may result in catastrophic forgetting, wherein a neural network may completely forget previously learned information when exposed to new information. Neural networks, such as backpropagation networks, may be highly sensitive to catastrophic forgetting because of highly distributed internal representations of the network. In such cases, catastrophic forgetting may be minimized by reducing the overlap among internal representations stored in the neural network. Therefore, when learning input patterns, such networks may alternate between them and adjust corresponding weights by small increments to correctly associate each input vector with the related output vector. In some embodiments, a dual-memory system, i.e., a short-term and a long-term memory, may be used to avoid catastrophic forgetting, wherein information may be initially consolidated on a short-term memory within a long-term memory. In some embodiments, too much stability may result in the entrenchment effect which may contribute to age-limited learning effects. In some embodiments, the entrenchment effect may be minimized by varying the loss of plasticity as a function of the transfer function and the error. In some embodiments, the processor may use Fahlman offset to modulate the plasticity of neural networks by adding a constant number to the derivative of the sigmoid function such that it does not go to zero and avoids the flat spots in the sigmoid function where weights may become entrenched. 
     In some embodiments, distance measuring devices used in observing the environment may have different field of views (FOVs) and angular resolutions may be used. For example, a depth sensor may provide depth readings within a FOV ranging from zero to 90 degrees with a one degree angular resolution. Another distance sensor may provide distance readings within a FOV ranging from zero to 180 degrees, with a 0.5 degrees angular resolution. In another case, a LIDAR may provide a 270 or 360 degree FOV. 
     In some embodiments, the immunity of a distance measuring device may be related to an illumination power emitted by the device and a sensitivity of a receiver of the device. In some instances, an immunity to ambient light may be defined by lux. For example, a LIDAR may have a typical immunity of 500 lux and a maximum immunity of 1500 lux. Another LIDAR may have a typical immunity of 2000 lux and a maximum immunity of 4500 lux. In some embodiments, scan frequency, given in Hz, may also influence immunity of distance measuring devices. For example, a LIDAR may have a minimum scan frequency of 4 Hz, typical scan frequency of 5 Hz, and a maximum scan frequency of 10 Hz. In some instances, Class I laser safety standards may be used to cap the power emitted by a transmitter. In some embodiments, a laser and optical lens may be used for the transmission and reception of a laser signal to achieve high frequency ranging. In some cases, laser and optical lens cleanliness may have some adverse effects on immunity as well. In some embodiments, the processor may use particular techniques to distinguish the reflection of illumination light from ambient light, such as various software filters. For example, once depth data is received it may be processed to distinguish the reflection of illumination light from ambient light. 
     In some embodiments, the center of the rotating core of a LIDAR used to observe the environment may be different than the center of the robot. In such embodiments, the processor may use a transform function to map the readings of the LIDAR sensor to the physical dimension of the robot. In some embodiments, the LIDAR may rotate clockwise or counterclockwise. In some embodiments, the LIDAR readings may be different depending on the motion of the robot. For example, the readings of the LIDAR may be different when the robot is rotating in a same direction as a LIDAR motor than when the robot is moving straight or rotating in an opposite direction to the LIDAR motor. In some instances, a zero angle of the LIDAR may not be the same as a zero angle of the robot. 
     In some embodiments, data may be collected using a proprioceptive sensor and an exteroceptive sensor. In some embodiments, the processor may use data from one of the two types of sensors to generate or update the map and may use data from the other type of sensor to validate the data used in generating or updating the map. In some embodiments, the processor may enact both scenarios, wherein the data of the proprioceptive sensor is used to validate the data of the exteroceptive sensor and vice versa. In some embodiments, the data collected by both types of sensors may be used in generating or updating the map. In some embodiments, the data collected by one type of sensor may be used in generating or updating a local map while data from the other type of sensor may be used for generating or updating a global map. In some embodiments, data collected by either type of sensor may include depth data (e.g., depth to perimeters, obstacles, edges, corners, objects, etc.), raw image data, or a combination. 
     In some embodiments, there may be possible overlaps in data collected by an exteroceptive sensor. In some embodiments, a motion filter may be used to filter out small jitters the robot may experience while taking readings with an image sensor or other sensors.  FIG.  48    illustrates a flow path of an image, wherein the image is passed through a motion filter before processing. In some embodiments, the processor may vertically align captured images in cases where images may not be captured at an exact same height.  FIG.  49 A  illustrates unaligned images  4900  due to the images being captured at different heights.  FIG.  49 B  illustrates the images  4900  after alignments. In some embodiments, the processor detects overlap between data at a perimeter of the data. Such an example is illustrated in  FIG.  50   , wherein an area of overlap  5000  at a perimeter of the data  5001  is indicated by the arrow  5002 . In some embodiments, the processor may detect overlap between data in other ways. An example of an alternative area of overlap  3403  between data  5001  is illustrated in  FIG.  51   . In some embodiments, there may be no overlap between data  5001  and the processor may use a transpose function to create a virtual overlap based on an optical flow or an inertia measurement.  FIG.  52    illustrates a lack of overlap between data. 
     In some embodiments, the movement of the robot may be measured and tracked by an encoder, IMU, and/or optical tracking sensor (OTS) and images captured by an image sensor may be combined together to form a spatial representation based on overlap of data and/or measured movement of the robot. In some embodiments, the processor determines a logical overlap between data and does not represent data twice in a spatial representation output. For example,  FIG.  53    illustrates a path  5300  of the robot and an amount of overlap  5301 . In some embodiments, overlapping parts may be used for combining images, however, the spatial representation may only include one set (or only some sets) of the overlapping data or in other cases may include all sets of the overlapping data. In some embodiments, the processor may employ a convolution to obtain a single set of data from the two overlapping sets of data. In such cases, the spatial representation after collecting data during execution of the path  5300  in  FIG.  53    may appear as in  FIG.  54   , as opposed to the spatial representation in  FIG.  55    wherein spatial data is represented twice. During discovery, a path of the robot may overlap frequently, as in the example of  FIG.  56   , however, the processor may not use each of the overlapping data collected during those overlapping paths when creating the spatial representation. 
     In some embodiments, sensors of the robot used in observing the environment may have a limited FOV. In some embodiments, the FOV is 360 or 180 degrees. In some embodiments, the FOV of the sensor may be limited vertically or horizontally or in another direction or manner. In some embodiments, sensors with larger FOVs may be blind to some areas. In some embodiments, blind spots of robots may be provided with complementary types of sensors that may overlap and may sometimes provide redundancy. For example, a sonar sensor may be better at detecting a presence or a lack of presence of an obstacle within a wider FOV whereas a camera may provide a location of the obstacle within the FOV. In one example, a sensor of a robot with a 360 degree linear FOV may observe an entire plane of an environment up to the nearest objects (e.g., perimeters or furniture) at a single moment, however some blind spots may exist. While a 360 degree linear FOV provides an adequate FOV in one plane, the FOV may have vertical limitations.  FIG.  57    illustrates a robot  5700  observing an environment  5701 , with blind spot  5702  that sensors of robot  5700  cannot observe. With a limited FOV, there may be areas that go unobserved as the robot moves. For example,  FIG.  58    illustrates robot  5800  and fields of view  5801  and  5802  of a sensor of the robot as the robot moves from a first position to a second position, respectively. Because of the small FOV or blind spot, object  5803  within area  5804  goes unnoticed as the robot moves from observing FOV  5801  to  5802 . In some cases, the processor of the robot fits a line  5805  and  5806  to the data captured in FOVs  5801  and  5802 , respectively. In some embodiments, the processor fits a line  5807  to the data captured in FOVs  5801  and  5802  that aligns with lines  5805  and  5806 , respectively. In some embodiments, the processor aligns the data observed in different FOVs to generate a map. In some embodiments, the processor connects lines  5805  and  5806  by a connecting line or by a line fitted to the data captured in FOVs  5801  and  5802 . In some embodiments, the line connecting lines  5805  and  5806  has lower certainty as it corresponds to an unobserved area  5804 . For example,  FIG.  59    illustrates estimated perimeter  5900 , wherein perimeter line  5900  is fitted to the data captured in FOVs  5801  and  5802 . The portion of perimeter line  5900  falling within area  5804 , to which sensors of the robot were blind, may be estimated based on a line that connects lines  5805  and  5806  as illustrated in  FIG.  58   . However, since area  5804  is unobserved by sensors of the robot, the processor is less certain of the portion of the perimeter  5900  falling within area  5804 . For example, the processor is uncertain if the portion of perimeter  5900  falling within area  5804  is actually perimeter  5901 . Such a perimeter estimation approach may be used when the speed of data acquisition is faster than the speed of the robot. 
     In some embodiments, layered maps may be used in avoiding blind spots. In some embodiments, the processor may generate a map including multiple layers. In some embodiments, one layer may include areas with high probability of being correct (e.g., areas based on observed data) while another may include areas with lower probability of being correct (e.g., areas unseen and predicted based on observed data). In some embodiments, a layer of the map or another map generated may only include areas unobserved and predicted by the processor of the robot. At any time, the processor may subtract maps from one another, add maps with one another (e.g., by layering maps), or may hide layers. 
     In some embodiments, a layer of a map may be a map generated based solely on the observations of a particular sensor type. For example, a map may include three layers and each layer may be a map generated based solely on the observations of a particular sensor type. In some embodiments, maps of various layers may be superimposed vertically or horizontally, deterministically or probabilistically, and locally or globally. In some embodiments, a map may be horizontally filled with data from one (or one class of) sensor and vertically filled using data from a different sensor (or class of sensor). 
     In some embodiments, different layers of the map may have different resolutions. For example, a long range limited FOV sensor of a robot may not observe a particular obstacle. As a result, the obstacle is excluded from a map generated based on data collected by the long range limited FOV sensor. However, as the robot approaches the obstacle, a short range obstacle sensor may observe the obstacle and add it to a map generated based on the data of the obstacle sensor. The processor may layer the two maps and the obstacle may therefore be observed. In some cases, the processor may add the obstacle to a map layer corresponding to the obstacle sensor or to a different map layer. In some embodiments, the resolution of the map (or layer of a map) depends on the sensor from which the data used to generate the map came from. In some embodiments, maps with different resolutions may be constructed for various purposes. In some embodiments, the processor chooses a particular resolution to use for navigation based on the action being executed or settings of the robot. For example, if the robot is travelling at a slow driving speed, a lower resolution map layer may be used. In another example, the robot is driving in an area with high obstacle density at an increased speed therefore a higher resolution map layer may be used. In some cases, the data of the map is stored in a memory of the robot. In some embodiments, data is used with less accuracy or some floating points may be excluded in some calculations for lower resolution maps. In some embodiments, maps with different resolutions may all use the same underlying raw data instead of having multiple copies of that raw information stored. 
     In some embodiments, the processor executes a series of procedures to generate layers of a map used to construct the map from stored values in memory. In some embodiments, the same series of procedures may be used construct the map at different resolutions. In some embodiments, there may be dedicated series of procedures to construct various different maps. In some embodiments, a separate layer of a map may be stored in a separate data structure. In some embodiments, various layers of a map or various different types of maps may be at least partially constructed from the same underlying data structures. 
     In some embodiments, the processor identifies gaps in the map (e.g., due to areas blind to a sensor or a range of a sensor). In some embodiments, the processor may actuate the robot to move towards and investigates the gap, collecting observations and mapping new areas by adding new observations to the map until the gap is closed. However, in some instances, the gap or an area blind to a sensor may not be detected. In some embodiments, a perimeter may be incorrectly predicted and may thus block off areas that were blind to the sensor of the robot. For example,  FIG.  60    illustrates actual perimeter  6000 , blind spot  6001 , and incorrectly predicted perimeter  6002 , blocking off blind spot  6001 . A similar issue may arise when, for example, a bed cover or curtain initially appears to be a perimeter when in reality, the robot may navigate behind the bed cover or curtain. 
     Issues related to incorrect perimeter prediction may be eradicated with thorough inspection of the environment and training. For example, data from a second type of sensor may be used to validate a first map constructed based on data collected by a first type of sensor. In some embodiments, additional information discovered by multiple sensors may be included in multiple layers or different layers or in the same layer. In some embodiments, a training period of the robot may include the robot inspecting the environment various times with the same sensor or with a second (or more) type of sensor. In some embodiments, the training period may occur over one session (e.g., during an initial setup of the robot) or multiple sessions. In some embodiments, a user may instruct the robot to enter training at any point. In some embodiments, the processor of the robot may transmit the map to the cloud for validation and further machine learning processing. For example, the map may be processed on the cloud to identify rooms within the map. In some embodiments, the map including various information may be constructed into a graphic object and presented to the user (e.g., via an application of a communication device). In some embodiments, the map may not be presented to the user until it has been fully inspected multiple times and has high accuracy. In some embodiments, the processor disables a main brush and/or a side brush of the robot when in training mode or when searching and navigating to a charging station. 
     In some embodiments, a gap in the perimeters of the environment may be due to an opening in the wall (e.g., a doorway or an opening between two separate areas). In some embodiments, exploration of the undiscovered areas within which the gap is identified may lead to the discovery of a room, a hallway, or any other separate area. In some embodiments, identified gaps that are found to be, for example, an opening in the wall may be used in separating areas into smaller subareas. For example, the opening in the wall between two rooms may be used to segment the area into two subareas, where each room is a single subarea. This may be expanded to any number of rooms. In some embodiments, the processor of the robot may provide a unique tag to each subarea and may use the unique tag to order the subareas for coverage by the robot, choose different work functions for different subareas, add restrictions to subareas, set cleaning schedules for different subareas, and the like. In some embodiments, the processor may detect a second room beyond an opening in the wall detected within a first room being covered and may identify the opening in the wall between the two rooms as a doorway. Methods for identifying a doorway are described in U.S. patent application Ser. Nos. 16/163,541 and 15/614,284, the entire contents of which are hereby incorporated by reference. For example, in some embodiments, the processor may fit depth data points to a line model and any deviation from the line model may be identified as an opening in the wall by the processor. In some embodiments, the processor may use the range and light intensity recorded by the depth sensor for each reading to calculate an error associated with deviation of the range data from a line model. In some embodiments, the processor may relate the light intensity and range of a point captured by the depth sensor using 
                 I   ⁡   (   n   )     =     a       r   ⁡   (   n   )     4         ,         
wherein I(n) is the intensity of point n, r(n) is the distance of the particular point on an object and a=E(I(n)r(n) 4 ) is a constant that is determined by the processor using a Gaussian assumption.
 
     Given d min , the minimum distance of all readings taken, the processor may calculate the distance 
               r   ⁡   (   n   )     =       d   min       sin   ⁢   sin   ⁢     (     -     θ   ⁡   (   n   )       )               
corresponding to a point n on an object at any angular resolution θ(n). In some embodiments, the processor may determine the horizon α=asin d min /d max  of the depth sensor given d min  and d max , the minimum and maximum readings of all readings taken, respectively. The processor may use a combined
 
               error   ⁢                        ⁢   e     =       ∑       (         I   ⁡   (   n   )     ⁢       r   ⁡   (   n   )     4       -   a     )     2       +       (       r   ⁡   (   n   )     -     (       d   min       sin   ⁢   sin   ⁢     (     -     θ   ⁡   (   n   )       )         )       )     2             
of the range and light intensity output by the depth sensor to identify deviation from the line model and hence detect an opening in the wall. The error e is minimal for walls and significantly higher for an opening in the wall, as the data will significantly deviate from the line model. In some embodiments, the processor may use a threshold to determine whether the data points considered indicate an opening in the wall when, for example, the error exceeds some threshold value. In some embodiments, the processor may use an adaptive threshold wherein the values below the threshold may be considered to be a wall.
 
     In some embodiments, the processor may not consider openings with width below a specified threshold as an opening in the wall, such as openings with a width too small to be considered a door or too small for the robot to fit through. In some embodiments, the processor may estimate the width of the opening in the wall by identifying angles φ with a valid range value and with intensity greater than or equal to 
               a     d   max       .         
The difference between the smallest and largest angle among all
 
             φ   =     {       θ   ⁡   (   n   )     ∨       (     {       r   ⁡   (   n   )     ≠   ∞     }     )     ∧     (       I   ⁡   (   n   )     ≥       (     a     d   max       )     4       )         }           
angles may provide an estimate of the width of the opening. In some embodiments, the processor may also determine the width of an opening in the wall by identifying the angle at which the measured range noticeably increases and the angle at which the measured range noticeably decreases and taking the difference between the two angles.
 
     In some embodiments, the processor may detect a wall or opening in the wall using recursive line fitting of the data. The processor may compare the error (y−(ax+b)) 2  of data points n 1  to n 2  to a threshold T 1  and summates the number of errors below the threshold. The processor may then compute the difference between the number of points considered (n 2 −n 1 ) and the number of data points with errors below threshold T 1 . If the difference is below a threshold 
                           T   2     ,     i   .   e   .     ,     (       (       n   2     -     n   1       )     -     ∑     n   1       n   2                       (     γ   -     (       a   ⁢   x     +   b     )       )     2     &lt;     T   1             )     &lt;     T   2       ,              
then the processor assigns the data points to be a wall and otherwise assigns the data points to be an opening in the wall.
 
     In another embodiment, the processor may use entropy to predict an opening in the wall, as an opening in the wall results in disordered measurement data and hence larger entropy value. In some embodiments, the processor may mark data with entropy above a certain threshold as an opening in the wall. In some embodiments, the processor determines entropy of data using 
                       H   ⁢     (   X   )       =     -     ∑     i   =   1     n                 P   ⁡   (     x   i     )     ⁢         log   ⁢          log   ⁢          P   ⁡   (     x   i     )                       
wherein X=(x 1 , x 2 , . . . , x n ) is a collection of possible data, such as depth measurements. P(x i ) is the probability of a data reading having value x i . P(x i ) may be determined by, for example, counting the number of measurements within a specified area of interest with value x i  and dividing that number by the total number of measurements within the area considered. In some embodiments, the processor may compare entropy of collected data to entropy of data corresponding to a wall. For example, the entropy may be computed for the probability density function (PDF) of the data to predict if there is an opening in the wall in the region of interest. In the case of a wall, the PDF may show localization of readings around wall coordinates, thereby increasing certainty and reducing entropy.
 
     In some embodiments, the processor may apply a probabilistic method by pre-training a classifier to provide a priori prediction. In some embodiments, the processor may use a supervised machine learning algorithm to identify features of openings and walls. A training set of, for example, depth data may be used by the processor to teach the classifier common features or patterns in the data corresponding with openings and walls such that the processor may identify walls and openings in walls with some probability distribution. In this way, a priori prediction from a classifier combined with real-time data measurement may be used together to provide a more accurate prediction of a wall or opening in the wall. In some embodiments, the processor may use Bayes theorem to provide probability of an opening in the wall given that the robot is located near an opening in the wall 
               P   ⁡   (   B   )     =           P   ⁡   (     B   |   A     )     ⁢     P   ⁡   (   A   )         P   ⁡   (   B   )       .           
P(A|B) is the probability of an opening in the wall given that the robot is located close to an opening in the wall, P(A) is the probability of an opening in the wall, P(B) is the probability of the robot being located close to an opening in the wall, and P(B|A) is the probability of the robot being located close to an opening in the wall given that an opening in the wall is detected.
 
     The different methods described for detecting an opening in the wall above may be combined in some embodiments and used independently in others. Examples of methods for detecting a doorway are described in, for example, U.S. patent application Ser. Nos. 15/615,284 and 16/163,541, the entire contents of which are hereby incorporated by reference. In some embodiments, the processor may mark the location of doorways within a map of the environment. In some embodiments, the robot may be configured to avoid crossing an identified doorway for a predetermined amount of time or until the robot has encountered the doorway a predetermined number of times. In some embodiments, the robot may be configured to drive through the identified doorway into a second subarea for cleaning before driving back through the doorway in the opposite direction. In some embodiments, the robot may finish cleaning in the current area before crossing through the doorway and cleaning the adjacent area. In some embodiments, the robot may be configured to execute any number of actions upon identification of a doorway and different actions may be executed for different doorways. In some embodiments, the processor may use doorways to segment the environment into subareas. For example, the robot may execute a wall-follow coverage algorithm in a first subarea and rectangular-spiral coverage algorithm in a second subarea, or may only clean the first subarea, or may clean the first subarea and second subarea on particular days and times. In some embodiments, unique tags, such as a number or any label, may be assigned to each subarea. In some embodiments, the user may assign unique tags to each subarea, and embodiments may receive this input and associate the unique tag (such as a human-readable name of a room, like “kitchen”) with the area in memory. Some embodiments may receive instructions that map tasks to areas by these unique tags, e.g., a user may input an instruction to the robot in the form of “vacuum kitchen,” and the robot may respond by accessing the appropriate map in memory that is associated with this label to effectuate the command. In some embodiments, the robot may assign unique tags to each subarea. The unique tags may be used to set and control the operation and execution of tasks within each subarea and to set the order of coverage of each subarea. For example, the robot may cover a particular subarea first and another particular subarea last. In some embodiments, the order of coverage of the subareas is such that repeat coverage within the total area is minimized. In another embodiment, the order of coverage of the subareas is such that coverage time of the total area is minimized. The order of subareas may be changed depending on the task or desired outcome. The example provided only illustrates two subareas for simplicity but may be expanded to include multiple subareas, spaces, or environments, etc. In some embodiments, the processor may represent subareas using a stack structure, for example, for backtracking purposes wherein the path of the robot back to its starting position may be found using the stack structure. 
     In some embodiments, a map may be generated from data collected by sensors coupled to a wearable item. For example, sensors coupled to glasses or lenses of a user walking within a room may, for example, record a video, capture images, and map the room. For instance, the sensors may be used to capture measurements (e.g., depth measurements) of the walls of the room in two or three dimensions and the measurements may be combined at overlapping points to generate a map using SLAM techniques. In such a case, a step counter may be used instead of an odometer (as may be used with the robot during mapping, for example) to measure movement of the user. In some embodiments, the map may be generated in real-time. In some embodiments, the user may visualize a room using the glasses or lenses and may draw virtual objects within the visualized room. In some embodiments, the processor of the robot may be connected to the processor of the glasses or lenses. In some embodiments, the map is shared with the processor of the robot. In one example, the user may draw a virtual confinement line in the map for the robot. The processor of the glasses may transmit this information to the processor of the robot. Or, in another case, the user may draw a movement path of the robot or choose areas for the robot to operate within. 
     In some embodiments, the processor may determine an amount of time for building the map. In some embodiments, an Internet of Things (IoT) subsystem may create and/or send a binary map to the cloud and an application of a communication device. In some embodiments, the IoT subsystem may store unknown points within the map. In some embodiments, the binary maps may be an object with methods and characteristics such as capacity, raw size, etc. having data types such as a byte. In some embodiments, a binary map may include the number of obstacles. In some embodiments, the map may be analyzed to find doors within the room. In some embodiments, the time of analysis may be determined. In some embodiments, the global map may be provided in ASCII format. In some embodiments, a Wi-Fi command handler may push the map to the cloud after compression. In some embodiments, information may be divided into packet format. In some embodiments, compressions such as zlib may be used. In some embodiments, each packet may be in ASCII format and compressed with an algorithm such as zlib. In some embodiments, each packet may have a timestamp and checksum. In some embodiments, a handler such as a Wi-Fi command handler may gradually push the map to the cloud in intervals and increments. In some embodiments, the map may be pushed to the cloud after completion of coverage wherein the robot has examined every area within the map by visiting each area implementing any required corrections to the map. In some embodiments, the map may be provided after a few runs to provide an accurate representation of the environment. In some embodiments, some graphic processing may occur on the cloud or on the communication device presenting the map. In some embodiments, the map may be presented to a user after an initial training round. In some embodiments, a map handle may render an ASCII map. Rendering time may depend on resolution and dimension. In some embodiments, the map may have a tilt value in degrees. 
     In some embodiments, images or other sensor readings may be stitched and linked at both ends such that there is no end to the stitched images, such as in  FIG.  61   , wherein data A 1  to A 5  are stitched as are data A 1  and data A 5 . For example, a user may use a finger to swipe in a leftwards direction across a screen of a mobile phone displaying a panorama image to view and pass past the right side of the panorama image and continue on to view the opposite side of the panorama image, in a continuous manner. In some embodiments, the images or other sensor readings may be two dimensional or three dimensional. For example, three dimensional readings may provide depth and hence spatial reality. 
     The robot may, for example, use the map to autonomously navigate the environment during operation, e.g., accessing the map to determine that a candidate route is blocked by an obstacle denoted in the map, to select a path with a path planning algorithm from a current point to a target point, or the like. It should be emphasized, though, that embodiments are not limited to techniques that construct maps in the ways described herein, as the present techniques may also be used for plane finding in augmented reality, barrier detection in virtual reality applications, outdoor mapping with autonomous drones, and other similar applications, which is not to suggest that any other description is limiting. Further details of mapping methods that may be used are described in U.S. patent application Ser. Nos. 16/048,179, 16/048,185, 16/163,541, 16/163,562, 16/163,508, and 16/185,000, the entire contents of which are hereby incorporated by reference. 
     In some embodiments, the processor localizes the robot during mapping or during operation. In some embodiments, methods of localization are inherently independent from mapping and path planning but may be used in tandem with any mapping or path planning method or may be used independently to localize the robot irrespective of the path or map of the environment. In some embodiments, the processor uses quantum SLAM. 
     In some embodiments, the processor may localize the robot within the environment represented by a phase space or Hilbert space. In some embodiments, the space may include all possible states of the robot within the space. In some embodiments, a probability distribution may be used by the processor of the robot to approximate the likelihood of the state of the robot being within a specific region of the space. In some embodiments, the processor of the robot may determine a phase space probability distribution over all possible states of the robot within the phase space using a statistical ensemble including a large collection of virtual, independent copies of the robot in various states of the phase space. In some embodiments, the phase space may consist of all possible values of position and momentum variables. In some embodiments, the processor may represent the statistical ensemble by a phase space probability density function ρ(p,q,t), q and p denoting position and velocity vectors. In some embodiments, the processor may use the phase space probability density function ρ(p,q,t) to determine the probability ρ(p,q,t)dqdp that the robot at time t will be found in the infinitesimal phase space volume dqdp. In some embodiments, the phase space probability density function ρ(p,q,t) may have the properties ρ(p,q,t)≥0 and ∫ρ(ρ,q,t)d(p,q)=1, ∀t≥0, and the probability of the position q lying within a position interval a,b is P[a≤q≤b]=∫ a   b ∫ρ(p,q,t)dpdq. Similarly, the probability of the velocity p lying within a velocity interval c,d is P[c≤q≤d]=∫ c   d ∫ρ(p,q,t)dqdp. In some embodiments, the processor may determine values by integration over the phase space. For example, the processor may determine the expectation value of the position q by  q =∫qρ(p,q,t)d(p,q). 
     In some embodiments, the processor may evolve each state within the ensemble over time t according to an equation of motion. In some embodiments, the processor may model the motion of the robot using a Hamiltonian dynamical system with generalized coordinates q, p wherein dynamical properties may be modeled by a Hamiltonian function H. In some embodiments, the function may represent the total energy of the system. In some embodiments, the processor may represent the time evolution of a single point in the phase space using Hamilton&#39;s equations 
                 dp   dt     =     -       ∂   H       ∂   q           ,       dq   dt     =         ∂   H       ∂   p       .             
In some embodiments, the processor may evolve the entire statistical ensemble of phase space density function ρ(p,q,t) under a Hamiltonian H using the Liouville equation
 
                   ∂   ρ       ∂   t       =     -     {     ρ   ,   H     }         ,         
wherein {⋅,⋅} denotes the Poisson bracket and H is the Hamiltonian of the system. For two functions ƒ, g on the phase space, the Poisson bracket may be given by
 
               {     f   ,   g     }     =       ∑     i   =   1     n         (           ∂   f       ∂     q   i         ⁢       ∂   g       ∂     p   i           -         ∂   f       ∂     p   i         ⁢       ∂   g       ∂     q   i             )     .             
In this approach, the processor may evolve each possible state in the phase space over time instead of keeping the phase space density constant over time, which is particularly advantageous if sensor readings are sparse in time.
 
     In some embodiments, the processor may evolve the phase space probability density function ρ(p,q,t) over time using the Fokker-Plank equation which describes the time evolution of a probability density function of a particle under drag and random forces. In comparison to the behavior of the robot modeled by both the Hamiltonian and Liouville equations, which are purely deterministic, the Fokker-Planck equation includes stochastic behaviour. Given a stochastic process with dX t =μ(X t ,t)dt+σ(X t ,t)dW t , wherein X t  and μ(X t ,t) are M-dimensional vectors, σ(X t ,t) is a M×P matrix, and W t  is a P-dimensional standard Wiener process, the probability density ρ(x,t) for X t  satisfies the Fokker-Planck equation 
                 ∂     ρ   ⁡   (     x   ,   t     )         ∂   t       =       -       ∑     i   =   1     M             ∂     ∂     x     t   ˙             [         μ   i     (     x   ,   t     )     ⁢     ρ   ⁡   (     x   ,   t     )       ]           +       ∑     i   =   1     M         ∑     j   =   1     M           ∂   2         ∂     x   i       ⁢     ∂     x   j             [         D     i   ⁢   j       (     x   ,       t     )     ⁢     ρ   ⁡   (     x   ,   t     )       ]                   
with drift vector μ=(μ 1 , . . . , μ M ) and diffusion tensor
 
             D   =       1   2     ⁢   σ   ⁢       σ   T     .             
In some embodiments, the processor may add stochastic forces to the motion of the robot governed by the Hamiltonian H and the motion of the robot may then be given by the stochastic differential equation
 
                 d   ⁢     X   t       =       (         dq       dp         )     =         (       +       ∂   H       ∂   p         -       ∂   H       ∂   q         )     ⁢   dt     =       (       0   N     ⁢       σ   N     (     p   ,   q   ,   t     )       )     ⁢   d   ⁢     W   t             ,         
wherein α N  is a N×N matrix and dW t  is a N-dimensional Wiener process. This leads to the Fokker-Plank equation
 
                   ∂   ρ       ∂   t       =       -     {     ρ   ,   H     }       +       ∇   p     ·     (     D   ⁢       ∇   p     ρ       )           ,         
wherein ∇p denotes the gradient with respect to position p, ∇ denotes divergence, and
 
               D   =       1   2     ⁢     σ   N     ⁢     σ   N   T         ⁢         is         
the diffusion tensor.
 
     In other embodiments, the processor may incorporate stochastic behaviour by modeling the dynamics of the robot using Langevin dynamics, which models friction forces and perturbation to the system, instead of Hamiltonian dynamics. The Langevin equations may be given by M{umlaut over (q)}=−∇ q U(q)−γp+√{square root over (2γk B TM)}R(t), wherein (−γp) are friction forces, R(t) are random forces with zero-mean and delta-correlated stationary Gaussian process, T is the temperature, k B  is Boltzmann&#39;s constant, γ is a damping constant, and M is a diagonal mass matrix. In some embodiments, the Langevin equation may be reformulated as a Fokker-Planck equation 
                 ∂   ρ       ∂   t       =       -     {     ρ   ,   H     }       +       ∇   p     ·     (     γ   ⁢   p   ⁢   ρ     )       +       k   B     ⁢   T   ⁢       ∇   p     ·     (     γ   ⁢   M   ⁢       ∇   p     ρ       )                 
that the processor may use to evolve the phase space probability density function over time. In some embodiments, the second order term ∇ p ·(γM∇ p ρ) is a model of classical Brownian motion, modeling a diffusion process. In some embodiments, partial differential equations for evolving the probability density function over time may be solved by the processor of the robot using, for example, finite difference and/or finite element methods.
 
       FIG.  62 A  illustrates an example of an initial phase space probability density of a robot, a Gaussian in (q,p) space.  FIG.  62 B  illustrates an example of the time evolution of the phase space probability density after four time units when evolved using the Liouville equation incorporating Hamiltonian dynamics, 
                 ∂   ρ       ∂   t       =     -     {     ρ   ,   H     }             
with Hamiltonian
 
             H   =       1   2     ⁢       p   2     .               FIG.  62 C  illustrates an example of the time evolution of the phase space probability density after four time units when evolved using the Fokker-Planck equation incorporating Hamiltonian dynamics,
 
                 ∂   ρ       ∂   t       =       -     {     ρ   ,   H     }       +       ∇   p     ·     (     D   ⁢       ∇   p     ρ       )               
with D=0.1.  FIG.  62 D  illustrates an example of the time evolution of the phase space probability density after four time units when evolved using the Fokker-Planck equation incorporating Langevin dynamics,
 
                 ∂   ρ       ∂   t       =       -     {     ρ   ,   H     }       +       ∇   p     ·     (     γ   ⁢   p   ⁢   ρ     )       +       k   B     ⁢   T   ⁢       ∇   p     ·     (     γ   ⁢   M   ⁢       ∇   p     ρ       )                 
with γ=0.5, T=0.2, and k B =1.  FIG.  62 B  illustrates that the Liouville equation incorporating Hamiltonian dynamics conserves momentum over time, as the initial density in  FIG.  62 A  is only distorted in the q-axis (position). In comparison,  FIGS.  62 C and  62 D  illustrate diffusion along the p-axis (velocity) as well, as both evolution equations account for stochastic forces. With the Fokker-Planck equation incorporating Hamiltonian dynamics the density spreads more equally ( FIG.  62 C ) as compared to the Fokker-Planck equation incorporating Langevin dynamics where the density remains more confined ( FIG.  62 D ) due to the additional friction forces.
 
     In some embodiments, the processor of the robot may update the phase space probability distribution when the processor receives readings (or measurements or observations). Any type of reading that may be represented as a probability distribution that describes the likelihood of the state of the robot being in a particular region of the phase space may be used. Readings may include measurements or observations acquired by sensors of the robot or external devices such as a Wi-Fi™ camera. Each reading may provide partial information on the likely region of the state of the robot within the phase space and/or may exclude the state of the robot from being within some region of the phase space. For example, a depth sensor of the robot may detect an obstacle in close proximity to the robot. Based on this measurement and using a map of the phase space, the processor of the robot may reduce the likelihood of the state of the robot being any state of the phase space at a great distance from an obstacle. In another example, a reading of a floor sensor of the robot and a floor map may be used by the processor of the robot to adjust the likelihood of the state of the robot being within the particular region of the phase space coinciding with the type of floor sensed. In an additional example, a measured Wi-Fi™ signal strength and a map of the expected Wi-Fi™ signal strength within the phase space may be used by the processor of the robot to adjust the phase space probability distribution. As a further example, a Wi-Fi™ camera may observe the absence of the robot within a particular room. Based on this observation the processor of the robot may reduce the likelihood of the state of the robot being any state of the phase space that places the robot within the particular room. In some embodiments, the processor generates a simulated representation of the environment for each hypothetical state of the robot. In some embodiments, the processor compares the measurement against each simulated representation of the environment (e.g., a floor map, a spatial map, a Wi-Fi map, etc.) corresponding with a perspective of each of the hypothetical states of the robot. In some embodiments, the processor chooses the state of the robot that makes the most sense as the most feasible state of the robot. In some embodiments, the processor selects additional hypothetical states of the robot as a backup to the most feasible state of the robot. 
     In some embodiments, the processor of the robot may update the current phase space probability distribution ρ(p,q, t i ) by re-weighting the phase space probability distribution with an observation probability distribution m(p,q, t i ) according to 
                 ρ   ¯     (     p   ,   q   ,     t   i       )     =           ρ   ⁡   (     p   ,   q   ,     t   i       )     ·     m   ⁡   (     p   ,   q   ,     t   i       )         ∫       ρ   ⁡   (     p   ,   q   ,     t   i       )     ⁢     m   ⁡   (     p   ,   q   ,     t   i       )     ⁢     d   ⁡   (     p   ,   q     )           .           
In some embodiments, the observation probability distribution may be determined by the processor of the robot for a reading at time t i  using an inverse sensor model. In some embodiments, wherein the observation probability distribution does not incorporate the confidence or uncertainty of the reading taken, the processor of the robot may incorporate the uncertainty into the observation probability distribution by determining an updated observation probability distribution
 
               m   ˆ     =         1   -   α     c     +     α   ⁢   m             
that may be used in re-weighting the current phase space probability distribution, wherein α is the confidence in the reading with a value of 0≤α≤1 and c=∫∫dpdq. At any given time, the processor of the robot may estimate a region of the phase space within which the state of the robot is likely to be given the phase space probability distribution at the particular time.
 
     To further explain the localization methods described, examples are provided. In a first example, the processor uses a two-dimensional phase space of the robot, including position q and velocity p. The processor confines the position of the robot q to an interval [0, 10] and the velocity p to an interval [−5, +5], limited by the top speed of the robot, therefore the phase space (p,q) is the rectangle D=[−5,5]×[0,10]. The processor uses a Hamiltonian function 
               H   =       p   2       2   ⁢   m         ,         
with mass m and resulting equations of motion {dot over (p)}=0 and
 
               q   ˙     =     p   m           
to delineate the motion of the robot. The processor adds Langevin-style stochastic forces to obtain motion equations
 
                 p   .     =           -   γ     ⁢   p     +         2   ⁢   γ   ⁢   m   ⁢     k   B     ⁢   T       ⁢     R   ⁡   (   t   )     ⁢         and   ⁢           q   .         =     p   m         ,         
wherein R(t) denotes random forces and m=1. The processor of the robot initially generates a uniform phase space probability distribution over the phase space D.  FIGS.  63 A- 63 D  illustrate examples of initial phase space probability distributions the processor may use.  FIG.  63 A  illustrates a Gaussian distribution over the phase space, centered at q=5, p=0. The robot is estimated to be in close proximity to the center point with high probability, the probability decreasing exponentially as the distance of the point from the center point increases.  FIG.  63 B  illustrates uniform distribution for q∈[4.75, 5.25], p∈[−5, 5] over the phase space, wherein there is no assumption on p and q is equally likely to be in [4.75, 5.25].  FIG.  63 C  illustrates multiple Gaussian distributions and  FIG.  63 D  illustrates a confined spike at q=5, p=0, indicating that the processor is certain of the state of the robot.
 
     In this example, the processor of the robot evolves the phase space probability distribution over time according to Langevin equation 
                   ∂   ρ       ∂   t       =       -     {     ρ   ,   H     }       +       (     γ     ∂     ∂   p         )     ·     (     p   ⁢   ρ     )       +     γ   ⁢     k   B     ⁢   T   ⁢         ∂   2     ρ       ∂     p   2               ,         
wherein
 
               {     ρ   ,   H     }     =     p   ⁢       ∂   ρ       ∂   q               
and m=1. Thus, the processor solves
 
                 ∂   ρ       ∂   t       =           -   p     ⁢       ∂   ρ       ∂   q         +     γ   ⁡   (     ρ   +     p   ⁢       ∂   ρ       ∂   p           )     +     γ   ⁢     k   B     ⁢   T   ⁢         ∂   2     ρ       ∂     p   2         ⁢         for   ⁢         t       &gt;   0           
with initial condition ρ(p,q,0)=ρ 0  and homogenous Neumann perimeters conditions. The perimeter conditions govern what happens when the robot reaches an extreme state. In the position state, this may correspond to the robot reaching a wall, and in the velocity state, it may correspond to the motor limit. The processor of the robot may update the phase space probability distribution each time a new reading is received by the processor.  FIGS.  64 A and  64 B  illustrate examples of observation probability distributions for odometry measurements and distance measurements, respectively.  FIG.  64 A  illustrates a narrow Gaussian observation probability distribution for velocity p, reflecting an accurate odometry sensor. Position q is uniform as odometry data does not indicate position.  FIG.  64 B  illustrates a bimodal observation probability distribution for position q including uncertainty for an environment with a wall at q=0 and q=10. Therefore, for a distance measurement of four, the robot is either at q=4 or q=6, resulting in the bi-modal distribution. Velocity p is uniform as distance data does not indicate velocity. In some embodiments, the processor may update the phase space at periodic intervals or at predetermined intervals or points in time. In some embodiments, the processor of the robot may determine an observation probability distribution of a reading using an inverse sensor model and the phase space probability distribution may be updated by the processor by re-weighting it with the observation probability distribution of the reading.
 
     The example described may be extended to a four-dimensional phase space with position q=(x,y) and velocity p=(p x ,p y ). The processor solves this four dimensional example using the Fokker-Planck equation 
                 ∂   ρ       ∂   t       =       -     {     ρ   ,   H     }       +       ∇   p     ·     (     γ   ⁢   p   ⁢   ρ     )       +       k   B     ⁢   T   ⁢       ∇   p     ·     (     γM   ⁢       ∇   p     ρ       )                 
with M=I 2  (2D identity matrix), T=0.1, γ=0.1, and k B =1. In alternative embodiments, the processor uses the Fokker-Planck equation without Hamiltonian and velocity and applies velocity drift field directly through odometry which reduces the dimension by a factor of two. The map of the environment for this example is given in  FIG.  65   , wherein the white space is the area accessible to the robot. The map describes the domain for q 1 ,q 2 ∈D. In this example, the velocity is limited to p 1 ,p 2 ∈[−1,1]. The processor models the initial probability density ρ(p,q,0) as Gaussian, wherein p is a four-dimensional function.  FIGS.  66 A- 66 C  illustrate the evolution of ρ reduced to the q 1 ,q 2  space at three different time points (i.e., the density integrated over p 1 ,p 2 ,ρ red =∫∫ρ(p 1 ,p 2 ,q 1 ,q 2 )dp 1 dp 2 ). With increased time, the initial density focused in the middle of the map starts to flow into other rooms.  FIGS.  67 A- 67 C  illustrate the evolution of ρ reduced to the p 1 ,q 1  space and  68 A- 68 C illustrate the evolution of ρ reduced to the p 2 ,q 2  space at the same three different time points to show how velocity evolves over time with position. The four-dimensional example is repeated but with the addition of floor sensor data observations.  FIG.  69    illustrates a map of the environment indicating different floor types  6900 ,  6901 ,  6902 , and  6903  with respect to q 1 ,q 2 . Given that the sensor has no error, the processor may strongly predict the area within which the robot is located based on the measured floor type, at which point all other hypothesized locations of the robot become invalid. For example, the processor may use the distribution m(p 1 ,p 2 ,q 1 ,q 2 )={const&gt;0,q 1 ,q 2  with the observed floor type 0, else. If the sensor has an average error rate ϵ, the processor may use the distribution m(p 1 ,p 2 ,q 1 ,q 2 )={c 1 &gt;0, q 1 ,q 2  with the observed floor type c 2 &gt;0, else with c 1 ,c 2  chosen such that ∫ p ∫ D     obs   md(q 1 ,q 2 )d(p 1 ,p 2 )=1−ϵ and ∫ p ∫ D     obs       c   md(q 1 ,q 2 )d(p 1 ,p 2 )=ϵ. D obs  is the q 1 ,q 2  with the observed floor type and D obs   c  is its complement. By construction, the distribution m has a probability 1−ϵ for q 1 ,q 2 ∈D obs  and probability ϵ for q 1 ,q 2 ∈D obs   c . Given that the floor sensor measures floor type  5302 , the processor updates the probability distribution for position as shown in  FIG.  70   . Note that the corners of the distribution were smoothened by the processor using a Gaussian kernel, which corresponds to an increased error rate near the borders of an area. Next, Wi-Fi signal strength observations are considered. Given a map of the expected signal strength, such as that in  FIG.  71   , the processor may generate a density describing the possible location of the robot based on a measured Wi-Fi signal strength. The darker areas in  FIG.  71    represent stronger Wi-Fi signal strength and the signal source is at q 1 ,q 2 =4.0, 2.0. Given that the robot measures a Wi-Fi signal strength of 0.4, the processor generates the probability distribution for position shown in  FIG.  72   . The likely area of the robot is larger since the Wi-Fi signal does not vary much. A wall distance map, such as that shown in  FIG.  73    may be used by the processor to approximate the area of the robot given a distance measured. Given that the robot measures a distance of three distance units, the processor generates the probability distribution for position shown in  FIG.  74   . For example, the processor evolves the Fokker-Planck equation over time and as observations are successively taken, the processor re-weights the density function with each observation wherein parts that do not match the observation are considered less likely and parts that highly match the observations relatively increase in probability. An example of observations over time may be, t=1: observe p 2 =0.75; t=2: observe p 2 =0.95 and Wi-Fi signal strength 0.56; t=3: observe wall distance 9.2; t=4: observe floor type 2; t=5: observe floor type 2 and Wi-Fi signal strength 0.28; t=6: observe wall distance 3.5; t=7: observe floor type 4, wall distance 2.5, and Wi-Fi signal strength 0.15; t=8: observe floor type 4, wall distance 4, and Wi-Fi signal strength 0.19; t=8.2: observe floor type 4, wall distance 4, and Wi-Fi signal strength 0.19.
 
     In another example, the robot navigates along a long floor (e.g., x-axis, one-dimensional). The processor models the floor using Liouville&#39;s equator 
                 ∂   ρ       ∂   t       =     -     {     ρ   ,   H     }             
with Hamiltonian
 
             H   =       1   2     ⁢     p   2             
wherein q∈[−10,10] and p∈[−5,5]. The floor has three doors at q 0 =−2.5, q 1 =0, and q 2 =5.0 and the processor of the robot is capable of determining when it is located at a door based on sensor data observed and the momentum of the robot is constant, but unknown. Initially the location of the robot is unknown, therefore the processor generates an initial state density such as that in  FIG.  75   . When the processor determines the robot is in front of a door, the possible location of the robot is narrowed down, but not the momentum. Therefore, the processor may update the probability density to that shown in  FIG.  76   . The processor evolves the probability density, and after five seconds the probability is as shown in  FIG.  77   , wherein the uncertainty in the position space has spread out again given that the momentum is unknown. However, the evolved probability density keeps track of the correlation between position and momentum. When the processor determines the robot is in front of a door again, the probability density is updated to  FIG.  78   , wherein the density has significantly narrowed down, indicating a number of peaks representing possible location and momentum combinations of the robot. For the left door, there is equal likelihood for p=0, p=−0.5, and p=−1.5. These momentum values correspond with the robot travelling from one of the three doors in five seconds. This is seen for the other two doors as well.
 
     In some embodiments, the processor may model motion of the robot using equations {dot over (x)}=ν cos cos ω, {dot over (γ)}=ν sin sin ω, and {dot over (θ)}=ω, wherein ν and ω are translational and rotational velocities, respectively. In some embodiments, translational and rotational velocities of the robot may be computed using observed wheel angular velocities ω l  and ω r  using (νω)=J(ω l ω r )=(r l /2r r /2−r l /br r /b), wherein J is the Jacobian, r l  and r r  are the left and right wheel radii, respectively and b is the distance between the two wheels. Assuming there are stochastic forces on the wheel velocities, the processor of the robot may evolve the probability density ρ=(x,y,θ,ω l ,ω r ) r  using ∂ρ/∂t=−(ν cos θ ν cos θ ω)·∇ q ρ+∇ p ·(D∇ p ρ) wherein D=½σ N σ N   T  is a 2-by-2 diffusion tensor, q=(x,y,θ) and p=(ω l ,ω r ). In some embodiments, the domain may be obtained by choosing x, y in the map of the environment, θ∈[0,2π), and ω l ,ω r  as per the robot specifications. In some embodiments, solving the equation may be a challenge given it is five-dimensional. In some embodiments, the model may be reduced by replacing odometry by Gaussian density with mean and variance. This reduces the model to a three-dimensional density ρ=(x,y,θ). In some embodiments, independent equations may be formed for ω l ,ω r  by using odometry and inertial measurement unit observations. For example, taking this approach may reduce the system to one three-dimensional partial differential equation and two ordinary differential equations. The processor may then evolve the probability density over time using 
                   ∂   ρ       ∂   t       =         -     (       v   ¯     ⁢   cos   ⁢   θ   ⁢     v   ¯     ⁢   cos   ⁢   θ   ⁢     ω   ¯       )       ·     ∇   ρ       +     ∇   ·     (     D   ⁢     ∇       ρ       )           ,     t   &gt;   0           
wherein D=(dν 2 θdν 2  sin θ cos θ0dν 2  sin θ cos θdν 2  θ 0 0 0 dω 2 ),  ν ,  ω  represent the current mean velocities, and dν, dω the current deviation. In some embodiments, the processor may determine  ν ,  ω  from the mean and deviation of the left and right wheel velocities ω L  and ω R  using ( ν   ω )=J(ω L ω R ). In some embodiments, the processor may use Neumann perimeters conditions for x,y and periodic perimeters conditions for θ.
 
     In one example, the processor localizes the robot with position coordinate q=(x,y) and momentum coordinate p=(p x ,p y ). For simplification, the mass of the robot is 1.0, the earth is assumed to be planar, and q is a position with reference to some arbitrary point and distance. Thus, the processor evolves the probability density ρ over time according to 
                   ∂   ρ       ∂   t       =         -   p     ·       ∇   q     ρ       +       ∇   p     ·     (     D   ⁢       ∇   p     ρ       )           ,         
wherein D is as defined above. The processor uses a moving grid, wherein the general location of the robot is only known up to a certain accuracy (e.g., 100 m) and the grid is only applied to the known area. The processor moves the grid along as the probability density evolves over time, centering the grid at the approximate center in the q space of the current probability density every couple time units. Given that momentum is constant over time, the processor uses an interval [−15,15]×[−15,15], corresponding to maximum speed of 15 m/s in each spatial direction. The processor uses velocity and GPS position observations to increase accuracy of approximated localization of the robot. Velocity measurements provide no information on position, but provide information on p x   2 +p y   2 , the circular probability distribution in the p space, as illustrated in  FIG.  79    with |p|=10 and large uncertainty. GPS position measurements provide no direct momentum information but provide a position density. The processor further uses a map to exclude impossible states of the robot. For instance, it is impossible to drive through walls and if the velocity is high there is a higher likelihood that the robot is in specific areas.  FIG.  80    illustrates a map used by the processor in this example, wherein white areas  8000  indicate low obstacle density areas and gray areas  8001  indicate high obstacle density areas and the maximum speed in high obstacle density areas is ±5 m/s. Position  8002  is the current probability density collapsed to the q 1 ,q 2  space. In combining the map information with the velocity observations, the processor determines that it is highly unlikely that with an odometry measurement of |p|=10 that the robot is in a position with high obstacle density. In some embodiments, other types of information may be used to improve accuracy of localization. For example, a map to correlate position and velocity, distance and probability density of other robots using similar technology, Wi-Fi map to extract position, and video footage to extract position.
 
     In some embodiments, the processor may use finite differences methods (FDM) to numerically approximate partial differential equations of the form 
                 ∂   ρ       ∂   t       =       -     {     ρ   ,   H     }       +         ∇   p     ·     (     D   ⁢       ∇   p     ρ       )       .             
Numerical approximation may have two components, discretization in space and in time. The finite difference method may rely on discretizing a function on a uniform grid. Derivatives may then be approximated by difference equations. For example, a convection-diffusion equation in one dimension and u(x,t) with velocity ν, diffusion coefficient a,
 
                 ∂   u       ∂   t       =       a   ⁢         ∂   2     u       ∂     x   2           -     v   ⁢       ∂   u       ∂   x                 
on a mesh x 0 , . . . , x J , and times t 0 , . . . , t N  may be approximated by a recurrence equation of the form
 
                   u   j     n   +   1       -     u   j   n       k     =       a   ⁢         u     j   +   1     n     -     2   ⁢     u   j   n       +     u     j   -   1     n         h   2         -     v   ⁢         u     j   +   1     n     -     u     j   -   1     n         2   ⁢   h                 
with space grid size h and time step k and u j   n ≈u(x j , t n ). The left hand side of the recurrence equation is a forward difference at time t n , and the right hand side is a second-order central difference and a first-order central difference for the space derivatives at x j , wherein
 
                     u   j     n   +   1       -     u   j   n       k     ≈       ∂     u   ⁡   (       x   j     ,     t   n       )         ∂   t         ,           u     j   +   1     n     -     2   ⁢     u   j   n       +     u     j   -   1     n         h   2       ≈         ∂   2       u   ⁡   (       x   j     ,     t   n       )         ∂     x   2           ,   
       and   ⁢                ⁢         u     j   +   1     n     -     u     j   -   1     n         2   ⁢   h         ≈         ∂     u   ⁡   (       x   j     ,     t   n       )         ∂   x       .             
This is an explicit method, since the processor may obtain the new approximation u j   n+1  without solving any equations. This method is known to be stable for
 
             h   &lt;         2   ⁢   a     v     ⁢         and   ⁢         k     &lt;         h   2       2   ⁢   a       .           
The stability conditions place limitations on the time step size k which may be a limitation of the explicit method scheme. If instead the processor uses a central difference at time t n+1/2 , the recurrence equation is
 
                     u   j     n   +   1       -     u   j   n       k     =       1   2     ⁢     (       a   ⁢         u     j   +   1       n   +   1       -     2   ⁢     u   j     n   +   1         +     u     j   -   1       n   +   1           h   2         -     v   ⁢         u     j   +   1       n   +   1       -     u     j   -   1       n   +   1           2   ⁢   h         +     a   ⁢         u     j   +   1     n     -     2   ⁢     u   j   n       +     u     j   -   1     n         h   2         -     v   ⁢         u     j   +   1     n     -     u     j   -   1     n         2   ⁢   h           )         ,         
known as the Crank-Nicolson method. The processor may obtain the new approximation u j   n+1  by solving a system of linear equations, thus, the method is implicit and is numerically stable if
 
             k   &lt;         h   2     a     .           
In a similar manner, the processor may use a backward difference in time, obtaining a different implicit method
 
                     u   j     n   +   1       -     u   j   n       k     =           u     j   +   1       n   +   1       -     2   ⁢     u   j     n   +   1         +     u     j   -   1       n   +   1           h   2       -     v   ⁢         u     j   +   1       n   +   1       -     u     j   -   1       n   +   1           2   ⁢   h             ,         
which is unconditionally stable for a timestep, however, the truncation error may be large. While both implicit methods are less restrictive in terms of timestep size, they usually require more computational power as they require solving a system of linear equations at each timestep. Further, since the difference equations are based on a uniform grid, the FDM places limitations on the shape of the domain.
 
     In some embodiments, the processor may use finite element methods (FEM) to numerically approximate partial differential equations of the form 
     
       
         
           
             
               
                 ∂ 
                 ρ 
               
               
                 ∂ 
                 t 
               
             
             = 
             
               
                 - 
                 
                   { 
                   
                     ρ 
                     , 
                     H 
                   
                   } 
                 
               
               + 
               
                 
                   
                     ∇ 
                     p 
                   
                   · 
                   
                     ( 
                     
                       D 
                       ⁢ 
                       
                         
                           ∇ 
                           p 
                         
                         ρ 
                       
                     
                     ) 
                   
                 
                 . 
               
             
           
         
       
     
     In general, the finite element method formulation of the problem results in a system of algebraic equations. This yields approximate values of the unknowns at discrete number of points over the domain. To solve the problem, it subdivides a large problem into smaller, simpler parts that are called finite elements. The simple equations that model these finite elements are then assembled into a larger system of equations that model the entire problem. The method may involve constructing a mesh or triangulation of the domain, finding a weak formulation of the partial differential equation (i.e., integration by parts and Green&#39;s identity), and deciding for solution space (e.g., piecewise linear on mesh elements). This leads to a discretized version in form of a linear equation. Some advantages over FDM includes complicated geometries, more choice in approximation leads, and, in general, a higher quality of approximation. For example, the processor may use the partial differential equation 
                   ∂   ρ       ∂   t       =     L   ⁢   ρ       ,         
with differential operator, e.g., L=−(⋅,H)+∇ p ·(D∇ p ). The processor may discretize the abstract equation in space (e.g., by FEM or FDM)
 
                   ∂     ρ   ¯         ∂   t       =       L   ¯     ⁢     ρ   ¯         ,         
wherein  ρ , L  are the projections of ρ,L on the discretized space. The processor may discretize the equation in time using a numerical time integrator (e.g., Crank-Nicolson)
 
                     ρ       -   n     +   1       -     ρ     -   n         h     =       1   2     ⁢     (         L   ¯     ⁢       ρ   ¯         -   n     +   1         +       L   ¯     ⁢       ρ   ¯       -   n           )         ,         
leading to the equation
 
                   (     I   -       h   2     ⁢     L   ¯         )     ⁢       ρ   ¯         -   n     +   1         =       (     I   +       h   2     ⁢     L   ¯         )     ⁢       ρ   ¯       -   n           ,         
which the processor may solve. In a fully discretized system, this is a linear equation. Depending on the space and discretization, this will be a banded, sparse matrix. In some embodiments, the processor may employ alternating direction implicit (ADI) splitting to ease the solving process. In FEM, the processor may discretize the space using a mesh, construct a weak formulation involving a test space, and solve its variational form. In FDM, the processor may discretize the derivatives using differences on a lattice grid of the domain. In some instances, the processor may implement FEM/FDM with backward differential formulation (BDF)/Radau (Marlis recommendation), for example mesh generation then construct and solve variational problem with backwards Euler. In other instances, the processor may implement FDM with ADI, resulting in a banded, tri-diagonal, symmetric, linear system. The processor may use an upwind scheme if Peclet number (i.e., ratio advection to diffusion) is larger than 2 or smaller than −2.
 
     Perimeter conditions may be essential in solving the partial differential equations. Perimeter conditions are a set of constraints that determine what happens at the perimeters of the domain while the partial differential equation describe the behaviour within the domain. In some embodiments, the processor may use one or more the following perimeters conditions: reflecting, zero-flux (i.e., homogenous Neumann perimeters conditions) 
                 ∂   ρ       ∂     n   →         =   0         
for p,q∈d∂D,{right arrow over (n)} unit normal vector on perimeters; absorbing perimeter conditions (i.e., homogenous Dirichlet perimeters conditions) ρ=0 for p,q∈∂D; and constant concentration perimeter conditions (i.e., Dirichlet) ρ=ρ 0  for p,q∈∂D. To integrate the perimeter conditions into FDM, the processor modifies the difference equations on the perimeters, and when using FEM, they become part of the weak form (i.e., integration by parts) or are integrated in the solution space. In some embodiments, the processor may use Fenics for an efficient solution to partial differential equations.
 
     In some embodiments, the processor may use quantum mechanics to localize the robot. In some embodiments, the processor of the robot may determine a probability density over all possible states of the robot using a complex-valued wave function for a single-particle system Ψ({right arrow over (r)},t), wherein {right arrow over (r)} may be a vector of space coordinates. In some embodiments, the wave function Ψ({right arrow over (r)},t) may be proportional to the probability density that the particle will be found at a position {right arrow over (r)}, i.e. ρ({right arrow over (r)},t)=|Ψ({right arrow over (r)},t)| 2 . In some embodiments, the processor of the robot may normalize the wave function which is equal to the total probability of finding the particle, or in this case the robot, somewhere. The total probability of finding the robot somewhere may add up to unity ∫|Ψ({right arrow over (r)},t)| 2 dr=1. In some embodiments, the processor of the robot may apply Fourier transform to the wave function Ψ({right arrow over (r)},t) to yield the wave function Φ({right arrow over (p)},t) in the momentum space, with associated momentum probability distribution σ({right arrow over (p)},t)=Φ({right arrow over (p)},t)| 2 . In some embodiments, the processor may evolve the wave function Ψ({right arrow over (r)},t) using Schrödinger equation 
                 i   ⁢   ℏ   ⁢       ∂     ∂   t         Ψ   ⁡   (       r   →     ,   t     )         =       [       -       ℏ   2       2   ⁢   m         ⁢       ∇   2       +     V   ⁡   (     r   →     )           ]     ⁢     Ψ   ⁡   (       r   →     ,   t     )         ,         
wherein the bracketed object is the Hamilton operator
 
                 H   ˆ     =       -       ℏ   2       2   ⁢   m         ⁢       ∇   2       +     V   ⁡   (     r   →     )             ,         
i is the imaginary unit, ℏ is the reduced Planck constant, ∇ 2  is the Laplacian, and V({right arrow over (r)}) is the potential. An operator is a generalization of the concept of a function and transforms one function into another function. For example, the momentum operator {circumflex over (p)}=−iℏ∇ explaining why
 
               -       ℏ   2       2   ⁢   m           ∇   2           
corresponds to kinetic energy. The Hamiltonian function
 
             H   =         p   2       2   ⁢   m       +     V   ⁡   (     r   →     )             
has corresponding Hamilton operator
 
               H   ˆ     =       -       ℏ   2       2   ⁢   m         ⁢       ∇   2       +       V   ⁡   (     r   →     )     .                 
For conservative systems (constant energy), the time-dependent factor may be separated from the wave function
 
             (       e   .   g   .     ,       Ψ   ⁡   (       r   →     ,   t     )     =       Φ   ⁡   (     r   →     )     ⁢     e     -     iEt   ℏ             ,           
giving the time-independent Schrodinger equation
 
                   [       -       ℏ   2       2   ⁢   m         ⁢       ∇   2       +     V   ⁡   (     r   →     )           ]     ⁢   Φ   ⁢     (     r   →     )       =     E   ⁢   Φ   ⁢     (     r   →     )         ,         
or otherwise ĤΦ=EΦ, an eigenvalue equation with eigenfunctions and eigenvalues. The eigenvalue equation may provide a basis given by the eigenfunctions {ϕ} of the Hamiltonian. Therefore, in some embodiments, the wave function may be given by Ψ({right arrow over (r)},t)=Σ k c k (t)φ k ({right arrow over (r)}), corresponding to expressing the wave function in the basis given by energy eigenfunctions. Substituting this equation into the Schrodinger equation
 
                 c   k     (   t   )     =         c   k     (   0   )     ⁢     e     -         ι   ˙     ⁢     E   k     ⁢   t     ℏ                 
is obtained, wherein E k  is the eigen-energy to the eigenfunction φ k . For example, the probability of measuring a certain energy E k  at time t may be given by the coefficient of the eigenfunction
 
               φ   k     ,           ❘   &#34;\[LeftBracketingBar]&#34;         c   k     (   t   )       ❘   &#34;\[RightBracketingBar]&#34;       2     =           ❘   &#34;\[LeftBracketingBar]&#34;           c   k     (   0   )     ⁢     e     -         iE   k     ⁢   t     ℏ             ❘   &#34;\[RightBracketingBar]&#34;       2     =           ❘   &#34;\[LeftBracketingBar]&#34;         c   k     (   0   )       ❘   &#34;\[RightBracketingBar]&#34;       2     .               
Thus, the probability for measuring the given energy is constant over time. However, this may only be true for the energy eigenvalues, not for other observables. Instead, the probability of finding the system at a certain position ρ({right arrow over (r)})=|Ψ({right arrow over (r)},t)| 2  may be used.
 
     In some embodiments, the wave function ψ may be an element of a complex Hilbert space H, which is a complete inner product space. Every physical property is associated with a linear, Hermitian operator acting on that Hilbert space. A wave function, or quantum state, may be regarded as an abstract vector in a Hilbert space. In some embodiments, ψ may be denoted by the symbol |ψ  (i.e., ket), and correspondingly, the complex conjugate ϕ* may be denoted by  ϕ| (i.e., bra). The integral over the product of two functions may be analogous to an inner product of abstract vectors, ∫ϕ*ψdτ= ϕ|·|ψ ≡ ϕ|ψ . In some embodiments,  ϕ| and |ψ  may be state vectors of a system and the processor may determine the probability of finding  ϕ| in state |ψ  using p( ϕ|,|ψ )=| ϕ|ψ | 2 . For a Hermitian operator Â eigenkets and eigenvalues may be denoted A|n =a n |n , wherein |n  is the eigenket associated with the eigenvalue a n . For a Hermitian operator, eigenvalues are real numbers, eigenkets corresponding to different eigenvalues are orthogonal, eigenvalues associated with eigenkets are the same as the eigenvalues associated with eigenbras, i.e.  n|A= n|a n . For every physical property (energy, position, momentum, angular momentum, etc.) there may exist an associated linear, Hermitian operator Â (called am observable) which acts on the Hilbert space H. Given A has eigenvalues a n  and eigenvectors |n , and a system in state |ϕ , the processor may determine the probability of obtaining a n  as an outcome of a measurement of A using p (a n )=| n|ϕ | 2 . In some embodiments, the processor may evolve the time-dependent Schrodinger equation using 
                   i   ⁢   ℏ   ⁢         ∂       ❘   &#34;\[LeftBracketingBar]&#34;     ψ       〉       ∂   t         =       H   ˆ     |   ψ       〉     .         
Given a state |ϕ  and a measurement of the observable A, the processor may determine the expectation value of A using  A = ϕ|A|ϕ , corresponding to
 
               〈   〉     =       ∫     ϕ   ⋆     Â   ⁢   ϕ   ⁢   d   ⁢   τ           ∫     ϕ   ⋆     ϕ   ⁢   d   ⁢   τ                 
for observation operator Â and wave function ϕ. In some embodiments, the processor may update the wave function when observing some observable by collapsing the wave function to the eigenfunctions, or eigenspace, corresponding to the observed eigenvalue.
 
     As described above, for localization of the robot, the processor may evolve the wave function Ψ({right arrow over (r)},t) using the Schrödinger equation 
               i   ⁢   ℏ   ⁢       ∂     ∂   t         ψ   ⁡   (       r   →     ,   t     )         =       [       -       ℏ   2       2   ⁢   m         ⁢       ∇   2       +     V   ⁡   (     r   →     )           ]     ⁢       ψ   ⁡   (       r   →     ,       t     )     .             
In some embodiments, a solution may be written in terms of eigenfunctions ψ n  with eigenvalues E n  of the time-independent Schrödinger equation Hψ n =E n ψ n , wherein Ψ({right arrow over (r)},t)=Σ c     n   c n e −iE     n     t/h ψ n  and c n =∫Ψ({right arrow over (r)},0)ψ n *dr. In some embodiments, the time evolution may be expressed as a time evolution via a unitary operator U(t), Ψ({right arrow over (r)},t)=U(t)Ψ({right arrow over (r)},0) wherein U(t)=e −Ht/h . In some embodiments, the probability density of the Hilbert space may be updated by the processor of the robot each time an observation or measurement is received by the processor of the robot. For each observation with observation operator A the processor of the robot may perform an eigen-decomposition Aω n =a n ω n , wherein the eigenvalue corresponds to the observed quantity. In some embodiments, the processor may observe a value a with probability 0≤p≤1. In some embodiments, wherein the operator has a finite spectrum or a single eigenvalue is observed, the processor of the robot may collapse to the eigenfunction(s) with corresponding probability
 
                 Ψ   ⁡   (       r   →     ,       t     )     →     γ   ⁢       ∑     n   =   1     N             p   ⁡   (     a   n     )     ⁢     d   n     ⁢     ω   n             ,             wherein   ⁢           d   n       =     ∫       ω   n   *     ⁢   Ψ   ⁢   d   ⁢   r         ,         
p(a) is the probability of observing value a, and γ is a normalization constant. In some embodiments, wherein the operator has continuous spectrum, the summation may be replaced by an integration Ψ({right arrow over (r)},t)→γ∫p(a)d n ω n da, wherein d n =∫ω n *Ψdr.
 
     For example, consider a robot confined to move within an interval 
               [       -     1   2       ,     1   2       ]     .         
For simplicity, the processor sets ℏ=m=1, and an infinite well potential and the regular kinetic energy term are assumed. The processor solves the time-independent Schrodinger equations, resulting in wave functions
 
               ψ   n     =     {         2     ⁢   sin   ⁢           sin   ⁡   (       k   n     (     x   -     1   2       )     )     ⁢     e       -   i     ⁢     ω   n     ⁢   t         ,       -     1   2       &lt;   x   &lt;       1   2     ⁢   0       ,             
otherwise, wherein k n =nπ and E n =ω n =n 2 π 2 . In the momentum space this corresponds to the wave functions
 
                 ϕ   n     (     p   ,       t     )     =         1       2   ⁢   π         ⁢       ∫     -   ∞     ∞           ψ   n     (     x   ,       t     )     ⁢     e       -   i     ⁢   p   ⁢   x       ⁢   dx         =       1     π       ⁢       n   ⁢   π         n   ⁢   π     +   p       ⁢   sin   ⁢       c   ⁡   (       1   2     ⁢     (       n   ⁢   π     -   p     )       )     .               
The processor takes suitable functions and computes an expansion in eigenfunctions. Given a vector of coefficients, the processor computes the time evolution of that wave function in eigenbasis. In another example, consider a robot free to move on an x-axis. For simplicity, the processor sets ℏ=m=1. The processor solves the time-independent Schrodinger equations, resulting in wave functions
 
                   ψ   E     (     x   ,       t     )     =     Ae       i   ⁡   (     px   -     E   ⁢   t       )     ℏ         ,         
wherein energy
 
             E   =         ℏ   2     ⁢     k   2         2   ⁢   m             
and momentum p=ℏk. For energy E there are two independent, valid functions with ±p. Given the wave function in the position space, in the momentum space, the corresponding wave functions are
 
                   ϕ   E     (     p   ,       t     )     =     e       i   ⁡   (     px   -     E   ⁢   t       )     ℏ         ,         
which are the same as the energy eigenfunctions. For a given initial wave function ψ(x,0), the processor expands the wave function into momentum/energy
 
                 ϕ   ⁡   (   p   )     =       1       2   ⁢   πℏ             ⁢     ∫       ψ   ⁡   (     x   ,   0     )     ⁢     e     -     ipx   ℏ         ⁢   dx           ,         
then the processor gets time dependence by taking the inverse Fourier resulting in
 
               ψ   ⁡   (     x   ,   t     )     =       1       2   ⁢   πℏ             ⁢     ∫       ϕ   ⁡   (   p   )     ⁢     e     ipx   ℏ       ⁢     e     -     iEt   ℏ         ⁢   d   ⁢     p   .                 
An example of a common type of initial wave function is a Gaussian wave packet, consisting of a momentum eigenfunctions multiplied by a Gaussian in position space
 
                 ψ   ⁡   (   x   )     =     A   ⁢     e     -       (     x   a     )     2         ⁢     e       ip     0   x       ℏ           ,         
wherein p 0  is the wave function&#39;s average momentum value and a is a rough measure of the width of the packet. In the momentum space, this wave function has the form
 
                 ϕ   ⁡   (   p   )     =         B     ⁢   e       -       (       a   ⁡   (     p   -     p   0       )       2   ⁢   h       )     2           ,         
which is a Gaussian function of momentum, centered on p 0  with approximate width
 
                 2   ⁢   ℏ     a     .         
Note Heisenberg&#39;s uncertainty principle wherein in the position space width is ˜a, and in the momentum space is ˜1/a.  FIGS.  81 A and  81 B  illustrate an example of a wave packet at a first time point for ψ(x) and ϕ(p), respectively, with x 0 , p 0 =0, 2, ℏ=0.1, m=1, and a=3, wherein  8100  are real parts and  8101  are imaginary parts. As time passes, the peak moves with constant velocity p 0 /m and the width of the wave packet in the position space increases. This happens because the different momentum components of the packet move with different velocities. In the momentum space, the probability density |ϕ(p,t)| 2  stays constant over time. See  FIGS.  81 C and  81 D  for the same wave packet at time t=2.
 
     When modeling the robot using quantum physics, and the processor observes some observable, the processor may collapse the wave function to the subspace of the observation. For example, consider the case wherein the processor observes the momentum of a wave packet. The processor expresses the uncertainty of the measurement by a function ƒ(p) (i.e., the probability that the system has momentum p), wherein ƒ is normalized. The probability distribution of momentum in this example is given by a Gaussian distribution centered around p=2.5 with σ=0.05, a strong assumption that the momentum is 2.5. Since the observation operator is the momentum operator, the wave function expressed in terms of the eigenfunctions of the observation operator is ϕ(p,t). The processor projects ϕ(p,t) into the observation space with probability ƒ by determining {tilde over (ϕ)}(p,t)=ƒ(p)ϕ(p,t). The processor normalizes the updated {tilde over (ϕ)} and takes the inverse Fourier transform to obtain the wave function in the position space.  FIGS.  82 A,  82 B,  82 C,  82 D, and  82 E  illustrate the initial wave function in the position space ψ(x), the initial wave function in the momentum space ϕ(p), the observation density in the momentum space, the updated wave function in the momentum space {tilde over (ϕ)}(p,t) after the observation, and the wave function in the position space ψ(x) after observing the momentum, respectively, at time t=2, with x 0 ,p 0 =0, 2, ℏ=0.1, m=1, and a=3. Note that in each figure the darker plots are the real parts while the lighter plots are the imaginary parts. The resulting wave function in the position space ( FIG.  82 D ) may be unexpected after observing a very narrow momentum density ( FIG.  82 C ) as it concludes that the position must have spread further out from the original wave function in the position space ( FIG.  82 A ). This effect may be due to Heisenberg&#39;s uncertainty principle. With decreasing h this effect diminishes, as can be seen in  FIGS.  83 A- 83 E  and  FIGS.  84 A- 84 E , illustrating the same as  FIGS.  82 A- 82 E  but with ℏ=0.05 and ℏ=0.001, respectively. Similar to observing momentum, position may also be observed and incorporated as illustrated in  FIGS.  85 A- 85 E  which illustrate the initial wave function in the position space ψ(x), the initial wave function in the momentum space ϕ(p), the observation density in the position space, the updated wave function in the momentum space {tilde over (ϕ)}(x,t) after the observation, and the wave function in the position space ψ(p) after observing the position, respectively, at time t=2, with x 0 ,p 0 =0,2, ℏ=0.1, m=1, and a=3. 
     In quantum mechanics, wave functions represent probability amplitude of finding the system in some state. Physical pure states in quantum mechanics may be represented as unit-norm vectors in a special complex Hilbert space and time evolution in this vector space may be given by application of the evolution operator. Further, in quantum mechanics, any observable should be associated with a self-adjoint linear operator which must yield real eigenvalues, e.g. they must be Hermitian. The probability of each eigenvalue may be related to the projection of the physical state on the subspace related to that eigenvalue and observables may be differential operators. For example, a robot navigates along a one-dimensional floor that includes three doors at doors at x 0 =−2.5, x 1 =0, and x 2 =5.0. The processor of the robot is capable of determining when it is located at a door based on sensor data observed and the momentum of the robot is constant, but unknown. Initially the location of the robot is unknown, therefore the processor generates initial wave functions of the state shown in  FIGS.  86 A and  86 B . When the processor determines the robot is in front of a door, the possible position of the robot is narrowed down to three possible positions, but not the momentum, resulting in wave functions shown in  FIGS.  87 A and  87 B . The processor evolves the wave functions with a Hamiltonian operator, and after five seconds the wave functions are as shown in  FIGS.  88 A and  88 B , wherein the position space has spread out again given that the momentum is unknown. However, the evolved probability density keeps track of the correlation between position and momentum. When the processor determines the robot is in front of a door again, the wave functions are updated to  FIGS.  89 A and  89 B , wherein the wave functions have significantly narrowed down, indicating a number of peaks representing possible position and momentum combinations of the robot. And in fact, if the processor observes another observation, such as momentum p=1.0 at t=5.0, the wave function in the position space also collapses to the only remaining possible combination, the location near x=5.0, as shown in  FIGS.  90 A and  90 B . The processor collapses the momentum wave function accordingly. Also, the processor reduces the position wave function to a peak at x=5.0. Given constant momentum, the momentum observation of p=1.0, and that the two door observations were 5 seconds apart, the position x=5.0 is the only remaining valid position hypothesis.  FIGS.  90 C and  90 D  illustrate the resulting wave function for a momentum observation of p=0.0 at t=5.0 instead.  FIGS.  90 E and  90 F  illustrate the resulting wave function for a momentum observation of p=−1.5 at t=5.0 instead.  FIGS.  90 G and  90 H  illustrate the resulting wave function for a momentum observation of p=0.5 at t=5.0 instead. Similarly, the processor collapses the momentum wave function when position is observed instead of momentum.  FIGS.  91 A and  91 B  illustrate the resulting wave function for a position observation of x=0.0 at t=5.0 instead.  FIGS.  91 C and  91 D  illustrate the resulting wave function for a position observation of x=−2.5 at t=5.0 instead.  FIGS.  91 E and  91 F  illustrate the resulting wave function for a position observation of x=5.0 at t=5.0 instead. 
     In some embodiments, the processor may simulate multiple robots located in different possible locations within the environment. In some embodiments, the processor may view the environment from the perspective of each different simulated robot. In some embodiments, the collection of simulated robots may form an ensemble. In some embodiments, the processor may evolve the location of each simulated robot or the ensemble over time. In some embodiments, the range of movement of each simulated robot may be different. In some embodiments, the processor may view the environment from the FOV of each simulated robot, each simulated robot having a slightly different map of the environment based on their simulated location and FOV. In some embodiments, the collection of simulated robots may form an approximate region within which the robot is truly located. In some embodiments, the true location of the robot is one of the simulated robots. In some embodiments, when a measurement of the environment is taken, the processor may check the measurement of the environment against the map of the environment of each of the simulated robots. In some embodiments, the processor may predict the robot is truly located in the location of the simulated robot having a map that best matches the measurement of the environment. In some embodiments, the simulated robot which the processor believes to be the true robot may change or may remain the same as new measurements are taken and the ensemble evolves over time. In some embodiments, the ensemble of simulated robots may remain together as the ensemble evolves over time. In some embodiments, the overall energy of the collection of simulated robots may remain constant in each timestamp, however the distribution of energy to move each simulated robot forward during evolution may not be distributed evenly among the simulated robots. For example, in one instance a simulated robot may end up much further away than the remaining simulated robots or too far to the right or left, however in future instances and as the ensemble evolves may become close to the group of simulated robots again. In some embodiments, the ensemble may evolve to most closely match the sensor readings, such as a gyroscope or optical sensor. In some embodiments, the evolution of the location of simulated robots may be limited based on characteristics of the physical robot. For example, a robot may have limited speed and limited rotation of the wheels, therefor it would be impossible for the robot to move two meters, for example, in between time steps. In another example, the robot may only be located in certain areas of an environment, where it may be impossible for the robot to be located in areas where an obstacle is located for example. In some embodiments, this method may be used to hold back certain elements or modify the overall understanding of the environment. For example, when the processor examines a total of ten simulated robots one by one against a measurement, and selects one simulated robot as the true robot, the processor filters out nine simulated robots. 
     In some embodiments, the FOV of each simulated robot may not include the exact same features as one another. In some embodiments, the processor may save the FOV of each of the simulated robots in memory. In some embodiments, the processor may combine the FOVs of each simulated robot to create a FOV of the ensemble using methods such as least squares methods. In some embodiments, the processor may track the FOV of each of the simulated robots individually and the FOV of the entire ensemble. In some embodiments, other methods may be used to create the FOV of the ensemble (or a portion of the ensemble). For example, a classifier AI algorithm may be used, such as naive Bayes classifier, least squares support vector machines, k-nearest neighbor, decision trees, and neural networks. In some embodiments, more than one FOV of the ensemble (or a portion of the ensemble) may be generated and tracked by the processor, each FOV created using a different method. For example, the processor may track the FOV of ten simulated robots and ten differently generated FOVs of the ensemble. At each measurement timestamp, the processor may examine the measurement against the FOV of the ten simulated robots and/or the ten differently generated FOVs of the ensemble and may choose any of these 20 possible FOVs as the ground truth. In some embodiments, the processor may examine the 20 FOVs instead of the FOVs of the simulated robots and choose a derivative as the ground truth. The number of simulated robots and/or the number of generated FOVs may vary. During mapping for example, the processor may take a first field of view of the sensor and calculate a FOV for the ensemble or each individual observer (simulated robot) inside the ensemble and combine it with the second field of view captured by the sensor for the ensemble or each individual observer inside the ensemble. The may processor switch between the FOV of each observer (e.g., like multiple CCTV cameras in an environment that an operator may switch between) and/or one or more FOVs of the ensemble (or a portion of the ensemble) and chooses the FOVs that are more probable to be close to ground truth. At each time iteration, the FOV of each observer and/or ensemble may evolve into being closer to ground truth. 
     In some embodiments, simulated robots may be divided in two or more classes. For example, simulated robots may be classified based on their reliability, such as good reliability, bad reliability, or average reliability or based on their speed, such as fast and slow. Classes that move to a side a lot may be used. Any classification system may be created, such as linear classifiers like Fisher&#39;s linear discriminant, logistic regression, naive Bayes classifier and perceptron, support vector machines like least squares support vector machines, quadratic classifiers, kernel estimation like k-nearest neighbor, boosting (meta-algorithm), decision trees like random forests, neural networks, and learning vector quantization. In some embodiments, each of the classes may evolve differently. For example, for fast speed and slow speed classes, each of the classes may move differently wherein the simulated robots in the fast class will move very fast and will be ahead of the other simulated robots in the slow class that move slower and fall behind. The kind and time of evolution may have different impact on different simulated robots within the ensemble. The evolution of the ensemble as a whole may or may not remain the same. The ensemble may be homogenous or non-homogenous. 
     In some embodiments, samples may be taken from the phase space. In some embodiments, the intervals at which samples are taken may be fixed or dynamic or machine learned. In a fixed interval sampling system, a time may be preset. In a dynamic interval system, the sampling frequency may depend on factors such as speed or how smooth the floor is and other parameters. For example, as the speed of the robot increases, more samples may be taken. Or more samples may be taken when the robot is traveling on rough terrain. In a machine learned system, the frequency of sampling may depend on predicted drift. For example, if in previous timestamps the measurements taken indicate that the robot has reached the intended position fairly well, the frequency of sampling may be reduced. In some embodiments, the above explained dynamic system may be equally used to determine the size of the ensemble. If, for example, in previous timestamps the measurements taken indicate that the robot has reached the intended position fairly well, a smaller ensemble may be used to correct the knowledge of where the robot is. In some embodiments, the ensemble may be regenerated at each interval. In some embodiments, a portion of the ensemble may be regenerated. In some embodiments, a portion of the ensemble that is more likely to depict ground truth may be preserved and the other portion regenerated. In some embodiments, the ensemble may not be regenerated but one of the observers (simulated robots) in the ensemble that is more likely to be ground truth may be chosen as the most feasible representation of the true robot. In some embodiments, observers (simulated robots) in the ensemble may take part in becoming the most feasible representation of the true robot based on how their individual description of the surrounding fits with the measurement taken. 
     In some embodiments, the processor may generate an ensemble of hypothetical positions of various simulated robots within the environment. In some embodiments, the processor may generate a simulated representation of the environment for each hypothetical position of the robot from the perspective corresponding with each hypothetical position. In some embodiments, the processor may compare the measurement against each simulated representation of the environment (e.g., a floor type map, a spatial map, a Wi-Fi map, etc.) corresponding with a perspective of each of the hypothetical positions of the robot. In some embodiments, the processor may choose the hypothetical position of the robot that makes the most sense as the most feasible position of the robot. In some embodiments, the processor may select additional hypothetical positions of the robot as a backup to the most feasible position of the robot. In some embodiments, the processor may nominate one or more hypothetical positions as a possible leader or otherwise a feasible position of the robot. In some embodiments, the processor may nominates a hypothetical position of the robot as a possible leader when the measurement fits well with the simulated representation of the environment corresponding with the perspective of the hypothetical position. In some embodiments, the processor may defer a nomination of a hypothetical position to other hypothetical positions of the robot. In some embodiments, the hypothetical positions with the highest numbers of deferrals may be chosen as possible leaders. In some embodiments, the process of comparing measurements to simulated representations of the environment corresponding with the perspectives of different hypothetical positions of the robot, nominating hypothetical positions as possible leaders, and choosing the hypothetical position that is the most feasible position of the robot may be iterative. In some cases, the processor may select the hypothetical position with the lowest deviation between the measurement and the simulated representation of the environment corresponding with the perspective of the hypothetical position as the leader. In some embodiments, the processor may store one or more hypothetical positions that are not elected as leader for another round of iteration after another movement of the robot. In other cases, the processor may eliminate one or more hypothetical positions that are not elected as leader or eliminates a portion and stores a portion for the next round of iteration. In some cases, the processor may choose the portion of the one or more hypothetical positions that are stored based on one or more criteria. In some cases, the processor may choose the portion of hypothetical positions that are stored randomly and based on one or more criteria. In some cases, the processor may eliminate some of the hypothetical positions of the robot that pass the one or more criteria. In some embodiments, the processor may evolve the ensemble of hypothetical positions of the robot similar to a genetic algorithm. In some embodiments, the processor may use a MDP to reduce the error between the measurement and the representation of the environment corresponding with each hypothetical position over time, thereby improving the chances of each hypothetical position in becoming or remaining leader. In some cases, the processor may apply game theory to the hypothetical positions of the robots, such that hypothetical positions compete against one another in becoming or remaining leader. In some embodiments, hypothetical positions may compete against one another and the ensemble becomes an equilibrium wherein the leader following a policy (π) remains leader while the other hypothetical positions maintain their current positions the majority of the time. 
     In some embodiments, the robot undocks to execute a task. In some embodiments, the processor performs a seed localization while the robot perceives the surroundings. In some embodiments, the processor uses a Chi square test to select a subset of data points that may be useful in localizing the robot or generating the map. In some embodiments, the processor of the robot generates a map of the environment after performing a seed localization. In some embodiments, the localization of the robot is improved iteratively. In some embodiments, the processor aggregates data into the map as it is collected. In some embodiments, the processor transmits the map to an application of a communication device (e.g., for a user to access and view) after the task is complete. 
     In some embodiments, the processor generates a spatial representation of the environment in the form of a point cloud of sensor data. In some embodiments, the processor of the robot may approximate perimeters of the environment by determining perimeters that fit all constraints. For example,  FIG.  92 A  illustrates point cloud  9200  based on data from sensors of robot  9201  and approximated perimeter  9202  fitted to point cloud  9200  for walls  9203  of an environment  9204 . In some embodiments, the processor of the robot may employ a Monte Carlo method. In some embodiments, more than one possible perimeter  9202  corresponding with more than one possible position of the robot  9201  may be considered as illustrated in  FIG.  92 B . This process may be computationally expensive. In some embodiments, the processor of the robot may use a statistical test to filter out points from the point cloud that do not provide statistically significant information. For example,  FIG.  93 A  illustrates a point cloud  9300  and  FIG.  93 B  illustrates points  9301  that may be filtered out after determining that they do not provide significant information. In some embodiments, some points may be statistically insignificant when overlapping data is merged together. In some embodiments, the processor of the robot localizes the robot against the subset of points remaining after filtering out points that may not provide significant information. In some embodiments, after localization, the processor creates the map using all points from the point cloud. Since the subset of points used in localizing the robot results in a lower resolution map the area within which the robot may be located is larger than the actual size of the robot.  FIG.  94    illustrates a low resolution point cloud map  9400  with an area  9401  including possible locations of the robot, which collectively from an larger area than the actual size of the robot. In some embodiments, after seed localization, the processor creates a map including all points of the point cloud from each of the possible locations of the robot. In some embodiments, the precise location of the robot may be chosen as a location common to all possible locations of the robot. In some embodiments, the processor of the robot may determine the overlap of all the approximated locations of the robot and may approximate the precise location of the robot as a location corresponding with the overlap.  FIG.  95 A  illustrates two possible locations (A and B) of the robot and the center of overlap  9500  between the two may be approximated as the precise location of the robot.  FIG.  95 B  illustrates an example of three locations of the robot  9501 ,  9502 , and  9503  approximated based on sensor data and overlap  7904  of the three locations  9501 ,  9502 , and  9503 . In some embodiments, after determining a precise location of the robot, the processor creates the map using all points from the point cloud based on the location of the robot relative to the subset of points. In some embodiments, the processor examines all points in the point cloud. In some embodiments, the processor chooses a subset of points from the point cloud to examine when there is high confidence that there are enough points to represent the ground truth and avoid any loss. In some embodiments, the processor of the robot may regenerate the exact original point cloud when loss free. In some embodiments, the processor accepts a loss as a trade-off. In some embodiments, this process may be repeated at a higher resolution. 
     In some embodiments, the processor of the robot loses the localization of the robot when facing difficult areas to navigate. For example, the processor may lose localization of the robot when the robot gets stuck on a floor transition or when the robot struggles to release itself from an object entangled with a brush or wheel of the robot. In some embodiments, the processor may expect a difficult climb and may increase the driving speed of the robot prior to approaching the climb. In some embodiments, the processor increases the driving speed of all the motors of the robot when an unsuccessful climb occurs. For example, if a robot gets stuck on a transition, the processor may increase the speed of all the motors of the robot to their respective maximum speeds. In some embodiments, motors of the robot may include at least one of a side brush motor and a main brush motor. In some embodiments, the processor may reverse a direction of rotation of at least one motor of the robot (e.g., clockwise or counterclockwise) or may alternate the direction of rotation of at least one motor of the robot. In some embodiments, adjusting the speed or direction of rotation of at least one motor of the robot may move the robot and/or items around the robot such that the robot may transition to an improved situation. 
     In some embodiments, the processor of the robot may attempt to regain its localization after losing the localization of the robot. In some embodiments, the processor of the robot may attempt to regain localization multiple times using the same method or alternative methods consecutively. In some embodiments, the processor of the robot may attempt methods that are highly likely to yield a result before trying other, less successful methods. In some embodiments, the processor of the robot may restart mapping and localization if localization cannot be regained. 
     In some embodiments, the processor associates properties with each room as the robot discovers rooms one by one. In some embodiments, the properties are stored in a graph or a stack, such the processor of the robot may regain localization if the robot becomes lost within a room. For example, if the processor of the robot loses localization within a room, the robot may have to restart coverage within that room, however as soon as the robot exits the room, assuming it exits from the same door it entered, the processor may know the previous room based on the stack structure and thus regain localization. In some embodiments, the processor of the robot may lose localization within a room but still have knowledge of which room it is within. In some embodiments, the processor may execute a new re-localization with respect to the room without performing a new re-localization for the entire environment. In such scenarios, the robot may perform a new complete coverage within the room. Some overlap with previously covered areas within the room may occur, however, after coverage of the room is complete the robot may continue to cover other areas of the environment purposefully. In some embodiments, the processor of the robot may determine if a room is known or unknown. In some embodiments, the processor may compare characteristics of the room against characteristics of known rooms. For example, location of a door in relation to a room, size of a room, or other characteristics may be used to determine if the robot has been in an area or not. In some embodiments, the processor adjusts the orientation of the map prior to performing comparisons. In some embodiments, the processor may use various map resolutions of a room when performing comparisons. For example, possible candidates may be short listed using a low resolution map to allow for fast match finding then may be narrowed down further using higher resolution maps. In some embodiments, a full stack including a room identified by the processor as having been previously visited may be candidates of having been previously visited as well. In such a case, the processor may use a new stack to discover new areas. In some instances, graph theory allows for in depth analytics of these situations. 
     In some embodiments, the robot may not begin performing work from a last location saved in the stored map. Such scenarios may occur when, for example, the robot is not located within a previously stored map. For example, a robot may clean a first floor of a two-story home, and thus the stored map may only reflect the first floor of the home. A user may place the robot on a second floor of the home and the processor may not be able to locate the robot within the stored map. The robot may begin to perform work and the processor may build a new map. Or in another example, a user may lend the robot to another person. In such a case, the processor may not be able to locate the robot within the stored map as it is located within a different home than that of the user. Thus, the robot begins to perform work. In some cases, the processor of the robot may begin building a new map. In some embodiments, a new map may be stored as a separate entry when the difference between a stored map and the new map exceeds a certain threshold. In some embodiments, a cold-start operation includes fetching N maps from the cloud and localizing (or trying to localize) the robot using each of the N maps. In some embodiments, such operations are slow, particularly when performed serially. In some embodiments, the processor uses a localization regain method to localize the robot when cleaning starts. In some embodiments, the localization regain method may be modified to be a global localization regain method. In some embodiments, fast and robust localization regain method may be completed within seconds. In some embodiments, the processor loads a next map after regaining localization fails on a current map and repeats the process of attempting to regain localization. In some embodiments, the saved map may include a bare minimum amount of useful information and may have a lowest acceptable resolution. This may reduce the footprint of the map and may thus reduce computational, size (in terms of latency), and financial (e.g., for cloud services) costs. 
     In some embodiments, the processor may ignore at least some elements (e.g., confinement line) added to the map by a user when regaining localization in a new work session. In some embodiments, the processor may not consider all features within the environment to reduce confusion with the walls within the environment while regaining localization. 
     In some embodiments, the processor may use odometry, IMU, and OTS information to update an EKF. In some embodiments, arbitrators may be used. For example, a multiroom arbitrator state. In some embodiments, the robot may initialize the hardware and then other software. In some embodiments, a default parameter may be provided as a starting value when initialization occurs. In some embodiments, the default value may be replaced by readings from a sensor. In some embodiments, the robot may make an initial circulation of the environment. In some embodiments, the circulation may be 180 degrees, 360 degrees, or a different amount. In some embodiments, odometer readings may be scaled to the OTS readings. In some embodiments, an odometer/OTS corrector may create an adjusted value as its output. In some embodiments, heading rotation offset may be calculated. 
     Further details of localization methods that may be used are described in U.S. patent application Ser. Nos. 16/297,508, 15/955,480, 15/425,130, 15/955,344, 16/509,099, the entire contents of which are hereby incorporated by reference. 
     In some embodiments, SLAM methods described herein may be used for recreating a virtual spatial reality. In some embodiments, a 360 degree capture of the environment may be used to create a virtual spatial reality of the environment within which a user may move. In some embodiments, a virtual spatial reality may be used for games. For example, a virtual or augmented spatial reality of a room moves at a walking speed of a user experiencing the virtual spatial reality. In some embodiments, the walking speed of the user may be determined using a pedometer worn by the user. In some embodiments, a spatial virtual reality may be created and later implemented in a game wherein the spatial virtual reality moves based on a displacement of a user measured using a SLAM device worn by the user. In some instances, a SLAM device may be more accurate than a pedometer as pedometer errors are adjusted with scans. In some current virtual reality games a user may need to use an additional component, such as a chair synchronized with the game (e.g., moving to imitate the feeling of riding a roller coaster), to have a more realistic experience. In the spatial virtual reality described herein, a user may control where they go within the virtual spatial reality (e.g., left, right, up, down, remain still). In some embodiments, the movement of the user measured using a SLAM device worn by the user may determine the response of a virtual spatial reality video seen by the user. For example, if a user runs, a video of the virtual spatial reality may play faster. If the user turns right, the video of the virtual spatial reality shows the areas to the right of the user. 
     In some embodiments, the processor of the robot may identify areas that may be easily covered by the robot (e.g., areas without or with minimal obstacles). For example,  FIG.  96    illustrates an area  9600  that may be easily covered by the robot  9601  by following along boustrophedon path  9602 . In some embodiments, the path of the robot may be a boustrophedon path. In some embodiments, boustrophedon paths may be slightly modified to allow for a more pleasant path planning structure. For example,  FIGS.  97 A and  97 B  illustrate examples of a boustrophedon path  9700 . Assuming the robot travels in direction  9701 , the robot moves in a straight line, and at the end of the straight line, denoted by circles  9703 , follows along a curved path to rotate 180 degrees and move along a straight line in the opposite direction. In some instances, the robot follows along a smoother path plan to rotate 180 degrees, denoted by circle  9704 . In some embodiments, the processor of the robot increases the speed of the robot as it approaches the end of a straight right line prior to rotating as the processor is highly certain there are no obstacles to overcome in such a region. In some embodiments, the path of the robot includes driving along a rectangular path (e.g., by wall following) and cleaning within the rectangle. In some embodiments, the robot may begin by wall following and after the processor identifies two or three perimeters, for example, the processor may then actuate the robot to cover the area inside the perimeters before repeating the process. 
     In some embodiments, the robot may drive along the perimeter or surface of an object  9800  with an angle such as that illustrated in  FIG.  98 A . In some embodiments, the robot may be driving with a certain speed and as the robot drives around the sharp angle the distance of the robot from the object may increase, as illustrated in  FIG.  98 B  with object  9801  and path  9802  of the robot. In some embodiments, the processor may readjust the distance of the robot from the object. In some embodiments, the robot may drive along the perimeter or surface of an object with an angle such as that illustrated in  FIG.  98 C  with object  9803  and path  9804  of the robot. In some embodiments, the processor of the robot may smoothen the path of the robot, as illustrated in  FIG.  98 D  with object  9803  and smoothened path  9805  of the robot. In some cases, such as in  FIG.  98 E , the robot may drive along a path  9806  adjacent to the perimeter or surface of the object  9803  and suddenly miss the perimeter or surface of the object at a point  9807  where the direction of the perimeter or surface changes. In such cases, the robot may have momentum and a sudden correction may not be desired. Smoothening the path may avoid such situations. In some embodiments, the processor may smoothen a path with systematic discrepancies between odometry (Odom) and an OTS due to momentum of the robot (e.g., when the robot stops rotating).  FIGS.  99 A- 99 C  illustrate an example of an output of an EKF (Odom: ν x ,ν w , timestamp; OTS: ν x ,ν w , timestamp (in OTS coordinates); and IMU: ν w , timestamp) for three phases. In phase one, shown in  FIG.  99 A , the odometer, OTS, and IMU agree that the robot is rotating. In phase two, shown in  FIG.  99 B , the odometer reports 0,0 without ramping down and with ˜150 ms delay while the OTS and IMU agree that the robot is moving. The EKF rejects the odometer. Such discrepancies may be resolved by smoothening the slowing down phase of the robot to compensate for the momentum of the robot.  FIG.  99 C  illustrates phase three wherein the odometer, OTS, and IMU report low (or no) movement of the robot. 
     In some embodiments, a TSSP or LED IR event may be detected as the robot traverses along a path within the environment. For example, a TSSP event may be detected when an obstacle is observed on a right side of the robot and may be passed to a control module as (L: 0 R: 1). In some embodiments, the processor may add newly discovered obstacles (e.g., static and dynamic obstacles) and/or cliffs to the map when unexpectedly (or expectedly) encountered during coverage. In some embodiments, the processor may adjust the path of the robot upon detecting an obstacle. 
     In some embodiments, a path executor may command the robot to follow a straight or curved path for a consecutive number of seconds. In some cases, the path executor may exit for various reasons, such as having reached the goal. In some embodiments, a curve to point path may be planned to drive the robot from a current location to a desired location while completing a larger path. In some embodiments, traveling along a planned path may be infeasible. For example, traversing a next planned curved or straight path by the robot may be infeasible. In some embodiments, the processor may use various feasibility conditions to determine if a path is traversable by the robot. In some embodiments, feasibility may be determined for the particular dimensions of the robot. 
     In some embodiments, the processor of the robot may use the map (e.g., locations of rooms, layout of areas, etc.) to determine efficient coverage of the environment. In some embodiments, the processor may choose to operate in closer rooms first as traveling to distant rooms may be burdensome and/or may require more time and battery life. For example, the processor of a robot may choose to clean a first bedroom of a home upon determining that there is a high probability of a dynamic obstacle within the home office and a very low likelihood of a dynamic obstacle within the first bedroom. However, in a map layout of the home, the first bedroom is several rooms away from the robot. Therefore, in the interest of operating at peak efficiency, the processor may choose to clean the hallway, a washroom, and a second bedroom, each on the way to the first bedroom. In an alternative scenario, the processor may determine that the hallway and the washroom have a low probability of a dynamic obstacle and that second bedroom has a higher probability of a dynamic obstacle and may therefore choose to clean the hallway and the washroom before checking if there is a dynamic obstacle within the second bedroom. Alternatively, the processor may skip the second bedroom after cleaning the hallway and washroom, and after cleaning the first bedroom, may check if second bedroom should be cleaned. 
     In some embodiments, the processor may use obstacle sensor readings to help in determining coverage of an environment. In some embodiments, obstacles may be discovered using data of a depth sensor as the depth sensor approaches the obstacles from various points of view and distances. In some embodiments, the depth sensor may use active or passive depth sensing methods, such as focusing and defocusing, IR reflection intensity (i.e., power), IR (or close to IR or visible) structured light, IR (or close to IR or visible) time of flight (e.g., 2D measurement and depth), IR time of flight single pixel sensor, or any combination thereof. In some embodiments, the depth sensor may use passive methods, such as those used in motion detectors and IR thermal imaging (e.g., in 2D). In some embodiments, stereo vision, polarization techniques, a combination of structured light and stereo vision and other methods may be used. In some embodiments, the robot covers areas with low obstacle density first and then performs a robust coverage. In some embodiments, a robust coverage includes covering areas with high obstacle density. In some embodiments, the robot may perform a robust coverage before performing a low density coverage. In some embodiments, the robot covers open areas (or areas with low obstacle density) one by one, executes a wall follow, covers areas with high obstacle density, and then navigates back to its charging station. In some embodiments, the processor of the robot may notify a user (e.g., via an application of a communication device) if an area is too complex for coverage and may suggest the user skip that area or manually operate navigation of the robot (e.g., manually drive an autonomous vehicle or manually operate a robotic surface cleaner using a remote). 
     In some embodiments, the processor may use an observed level of activity within areas of the environment when determining coverage. For example, a processor of a surface cleaning robot may prioritize consistent cleaning of a living room when a high level of human activity is observed within the living room as it is more likely to become dirty as compared to an area with lower human activity. In some embodiments, the processor of the robot may detect when a house or room is occupied by a human (or animal). In some embodiments, the processor may identify a particular person occupying an area. In some embodiments, the processor may identify the number of people occupying an area. In some embodiments, the processor may detect an area as occupied or identify a particular person based on activity of lights within the area (e.g., whether lights are turned on), facial recognition, voice recognition, and user pattern recognition determined using data collected by a sensor or a combination of sensors. In some embodiments, the robot may detect a human (or other objects having different material and texture) using diffraction. In some cases, the robot may use a spectrometer, a device that harnesses the concept of diffraction, to detect objects, such as humans and animals. A spectrometer uses diffraction (and the subsequent interference) of light from slits to separate wavelengths, such that faint peaks of energy at specific wavelengths may be detected and recorded. Therefore, the results provided by a spectrometer may be used to distinguish a material or texture and hence a type of object. For example, output of a spectrometer may be used to identify liquids, animals, or dog incidents. In some embodiments, detection of a particular event by various sensors of the robot or other smart devices within the area in a particular pattern or order may increase the confidence of detection of the particular event. For example, detecting an opening or closing of doors may indicate a person entering or leaving a house while detecting wireless signals from a particular smartphone attempting to join a wireless network may indicate a particular person of the household or a stranger entering the house. In some embodiments, detecting a pattern of events within a time window or a lack thereof may trigger an action of the robot. For example, detection of a smartphone MAC address unknown to a home network may prompt the robot to position itself at an entrance of the home to take pictures of a person entering the home. The picture may be compared to a set of features of owners or people previously met by the robot, and in some cases, may lead to identification of a particular person. If a user is not identified, features may be further analyzed for commonalities with the owners to identify a sibling or a parent or a sibling of a frequent visitor. In some cases, the image may be compared to features of local criminals stored in a database. 
     In some embodiments, the processor may use an amount of debris historically collected or observed within various locations of the environment when determining a prioritization of rooms for cleaning. In some embodiments, the amount of debris collected or observed within the environment may be catalogued and made available to a user. In some embodiments, the user may select areas for cleaning based on debris data provided to the user. 
     In some embodiments, the processor may use a traversability algorithm to determine different areas that may be safely traversed by the robot, from which a coverage plan of the robot may be taken. In some embodiments, the traversability algorithm obtains a portion of data from the map corresponding to areas around the robot at a particular moment in time. In some embodiments, the multidimensional and dynamic map includes a global and local map of the environment, constantly changing in real-time as new data is sensed. In some embodiments, the global map includes all global sensor data (e.g., LIDAR data, depth sensor data) and the local map includes all local sensor data (e.g., obstacle data, cliff data, debris data, previous stalls, floor transition data, floor type data, etc.). In some embodiments, the traversability algorithm may determine a best two-dimensional coverage area based on the portion of data taken from the map. The size, shape, orientation, position, etc. of the two-dimensional coverage area may change at each interval depending on the portion of data taken from the map. In some embodiments, the two-dimensional coverage area may be a rectangle or another shape. In some embodiments, a rectangular coverage area is chosen such that it aligns with the walls of the environment.  FIG.  100    illustrates an example of a coverage area  10000  for robot  10001  within environment  10002 . In some embodiments, coverage areas chosen may be of different shapes and sizes. For example,  FIG.  101    illustrates a coverage area  10100  for robot  10001  with a different shape within environment  10002 . 
     In some embodiments, the traversability algorithm employs simulated annealing technique to evaluate possible two-dimensional coverage areas (e.g., different positions, orientations, shapes, sizes, etc. of two-dimensional coverage areas) and choose a best two-dimensional coverage area (e.g., the two-dimensional coverage area that allows for easiest coverage by the robot). In embodiments, simulated annealing may model the process of heating a system and slowly cooling the system down in a controlled manner. When a system is heated during annealing, the heat may provide a randomness to each component of energy of each molecule. As a result, each component of energy of a molecule may temporarily assume a value that is energetically unfavorable and the full system may explore configurations that have high energy. When the temperature of the system is gradually lowered the entropy of the system may be gradually reduced as molecules become more organized and take on a low-energy arrangement. Also, as the temperature is lowered, the system may have an increased probability of finding an optimum configuration. Eventually the entropy of the system may move towards zero wherein the randomness of the molecules is minimized and an optimum configuration may be found. 
     In simulated annealing, a goal may be to bring the system from an initial state to a state with minimum possible energy. Ultimately, the simulation of annealing, may be used to find an approximation of a global minimum for a function with many variables, wherein the function may be analogous to the internal energy of the system in a particular state. Annealing may be effective because even at moderately high temperatures, the system slightly favors regions in the configuration space that are overall lower in energy, and hence are more likely to contain the global minimum. At each time step of the annealing simulation, a neighboring state of a current state may be selected and the processor may probabilistically determine to move to the neighboring state or to stay at the current state. Eventually, the simulated annealing algorithm moves towards states with lower energy and the annealing simulation may be complete once an adequate state (or energy) is reached. 
     In some embodiments, the traversability algorithm classifies the map into areas that the robot may navigate to, traverse, and perform work. In some embodiments, the traversability algorithm may use stochastic or other methods for to classify an X, Y, Z, K, L, etc. location of the map into a class of a traversability map. For lower dimension maps, the processor of the robot may use analytic methods, such as derivatives and solving equations, in finding optimal model parameters. However, as models become more complicated, the processor of the robot may use local derivatives and gradient methods, such as in neural networks and maximum likelihood methods. In some embodiments, there may be multiple maxima, therefore the processor may perform multiple searches from different starting conditions. Generally, the confidence of a decision increases as the number of searches or simulations increases. In some embodiments, the processor may use naïve approaches. In some embodiments, the processor may bias a search towards regions within which the solution is expected to fall and may implement a level of randomness to find a best or near to best parameter. In some embodiments, the processor may use Boltzman learning or genetic algorithms, independently or in combination. 
     In some embodiments, the processor may model the system as a network of nodes with bi-directional links. In some embodiments, bi-directional links may have corresponding weights w ij =w ji . In some embodiments, the processor may model the system as a collection of cells wherein a value assigned to a cell indicates traversability to a particular adjacent cell. In some embodiments, values indicating traversability from the cell to each adjacent cell may be provided. The value indicating traversability may be binary or may be a weight indicating a level (or probability) of traversability. In some embodiments, the processor may model each node as a magnet, the network of N nodes modeled as N magnets and each magnet having a north pole and a south pole. In some embodiments, the weights wij are functions of the separation between the magnets. In some embodiments, a magnet i pointing upwards, in the same direction as the magnetic field, contributes a small positive energy to the total system and has a state value s i =+1 and a magnet i pointing downwards contributes a small negative energy to the total system and has a state value s i =−1. Therefore, the total energy of the collection of N magnets is proportional to the total number of magnets pointing upwards. The probability of the system having a particular total energy may be related to the number of configurations of the system that result in the same positive energy or the same number of magnets pointing upwards. The highest level of energy has only a single possible configuration, i.e., 
               (     N     N   i       )     =       (     N   0     )     =   1           
wherein N i  is the number of magnets pointing downwards. In the second highest level of energy, a single magnet is pointing downwards. Any single magnet of the collection of magnets may be the one magnet pointing downwards. In the third highest level of energy, two magnets are pointing downwards. The probability of the system having the third highest level of energy is related to the number of system configurations having only two magnets pointing downwards, i.e.
 
               (     N   2     )     =         N   ⁡   (     N   -   1     )     2     .           
The number of possible configurations declines exponentially as the number of magnets pointing downwards increases, as does the Boltzman factor.
 
     In some embodiments, the system modeled has a large number of magnets N, each having a state s i  for i=1, . . . , N. In some embodiments, the value of each state may be one of two Boolean values, such as ±1 as described above. In some embodiments, the processor determines the values of the states s i  that minimize a cost or energy function. In some embodiments, the energy function may be 
               E   =       -     1   2       ⁢       ∑     i   ,     j   =   1       N             w     i   ⁢   j       ⁢     s   i     ⁢     s   j             ,         
wherein the weight w ij  may be positive or negative. In some embodiments, the processor eliminates self-feedback terms (i.e., w ii =0) as non-zero values for w ii  add a constant to the function E which has no significance, independent of s i . In some embodiments, the processor determines an interaction energy
 
                 E     i   ⁢   j       =       -     1   2       ⁢     w   ij     ⁢     s   i     ⁢     s   j         ,         
between neighboring magnets based on their states, separation, and other physical properties. In some embodiments, the processor determines an energy of an entire system by the integral of all the energies that interact within the system. In some embodiments, the processor determines the configuration of the states of the magnets that has the lowest level of energy and thus the most stable configuration. In some embodiments, the space has 2 N  possible configurations. Given the high number of possible configuration, determining the configuration with the lowest level of energy may be computationally expensive. In some cases, employing a greedy algorithm may result in becoming stuck in a local energy minima or never converging. In some embodiments, the processor determines a probability
 
               P   ⁡   (   γ   )     =       e       -     E   γ       /   T         Z   ⁡   (   T   )             
of the system having a (discrete) configuration γ with energy Eγ at temperature T, wherein Z(T) is a normalization constant. The numerator of the probability P(γ) is the Boltzmann factor and the denominator Z(T) is given by the partition function Σe −E     γ     /T . The sum of the Boltzmann constant for all possible configurations Z(T)=Σe −E     γ     /T  guarantees the equation represents a true probability. Given the large number of possible configurations, 2 N , Z(T) may only be determined for simple cases.
 
     In some embodiments, the processor may fit a boustrophedon path to the two-dimensional coverage area chosen by shortening or lengthening the longer segments of the boustrophedon path that cross from one side of the coverage area to the other and by adding or removing some of the longer segments of the boustrophedon path while maintaining a same distance between the longer segments regardless of the two-dimensional coverage area chosen (e.g., or by adjusting parameters defining the boustrophedon path). Since the map is dynamic and constantly changing based on real-time observations, the two-dimensional coverage area is polymorphic and constantly changing as well (e.g., shape, size, position, orientation, etc.). Hence, the boustrophedon movement path is polymorphic and constantly changing as well (e.g., orientation, segment length, number of segments, etc.). In some embodiments, a coverage area may be chosen and a boustrophedon path may be fitted thereto in real-time based on real-time observations. As the robot executes the path plan (i.e., coverage of the coverage area via boustrophedon path) and discovers additional areas, the path plan may be polymorphized wherein the processor overrides the initial path plan with an adjusted path plan (e.g., adjusted coverage area and boustrophedon path). For example,  FIG.  102    illustrates a path plan that is polymorphized three times. Initially, a small rectangle  10200  is chosen as the coverage area and a boustrophedon path  10201  is fitted to the small rectangle  10200 . However, after obtaining more information, an override of the initial path plan (e.g., coverage area and path) is executed and thus polymorphized, resulting in the coverage area  10200  increasing in size to rectangle  10202 . Hence, the second boustrophedon row  10203  is adjusted to fit larger coverage area  10202 . This occurs another time, resulting in larger coverage area  10204  and larger boustrophedon path  10205  executed by robot  10206 . 
     In some embodiments, the processor may use a feasibility function, a probabilistic method, to evaluate possible coverage areas to determine areas in which the robot may have a reasonable chance of encountering a successful traverse (or climb). In some embodiments, the feasibility function may be determined for the particular wheel dimensions and other mechanical characteristics of the robot. In some embodiments, the mechanical characteristics may be configurable. For example,  FIG.  103    illustrates a path  10300  traversable by the robot as all the values of z (indicative of height) within the cells are five and the particular wheel dimensions and mechanical characteristics of the robot allow the robot to overcome areas with a z value of five.  FIG.  104    illustrates another example of a traversable path  10400 . In this case, the path is traversable as the values of z increase gradually, making the area climbable (or traversable) by the robot.  FIG.  105    illustrates an example of a path  10500  that is not traversable by the robot because of the sudden increase in the value of z between two adjacent cells.  FIG.  106    illustrates an adjustment to the path  10500  illustrated in  FIG.  105    that is traversable by the robot.  FIG.  107    illustrates examples of areas traversable by the robot  10700  because of gradual incline/decline or the size of the wheel  10701  of the robot  10700  relative to the area in which a change in height is observed.  FIG.  108    illustrates examples of areas that are not traversable by the robot  10700  because of gradual incline/decline or the size of the wheel  10701  of the robot  10700  relative to the area in which a change in height is observed. In some embodiments, the z value of each cell may be positive or negative and represent a distance relative to a ground zero plane. 
     In some embodiments, an algorithm may be trained in advance through a neural network to identify areas with high chances of being traversable and areas with low chances of being traversable. In some embodiments, the processor may use a real-time classifier to identify the chance of traversing an area. In some embodiments, bias and variance may be adjusted to allow the processor of the robot to learn on the go or use previous teachings. In some embodiments, the machine learned algorithm may be used to learn from mistakes and enhance the information used in path planning for a current and future work sessions. In some embodiments, traversable areas may initially be determined in a training work sessions and a path plan may be devised at the end of training and followed in following work sessions. In some embodiments, traversable areas may be adjusted and built upon in consecutive work sessions. In some embodiments, bias and variance may be adjusted to determine how reliant the algorithm is on the training and how reliant the algorithm is on new findings. A low bias-variance ratio value may be used to determine no reliance on the newly learned data, however, this may lead to the loss of some valuable information learned in real time. A high bias-variance ration may indicate total reliance on the new data, however, this may lead to new learning corrupting the initial classification training. In some embodiments, a monitoring algorithm constantly receiving data from the cloud and/or from robots in a fleet (e.g., real-time experiences) may dynamically determine a bias-variance ratio. 
     In some embodiments, data from multiple classes of sensors may be used in determining traversability of an area. In some embodiments, an image captured by a camera may be used in determining traversability of an area. In some embodiments, a single camera that may use different filters and illuminations in different timestamps may be used. For example, one image may be captured without active illumination and may use atmospheric illumination. This image may be used to provide some observations of the surroundings. Many algorithms may be used to extract usable information from an image captured of the surroundings. In a next timestamp, the image of the environment captured may be illuminated. In some embodiments, the processor may use a difference between the two images to extract additional information. In some embodiments, structured illumination may be used and the processor may extract depth information using different methods. In some embodiments, the processor may use an image captured (e.g., with or without illumination or with structured light illumination) at a first timestamp as a priori in a Bayesian system. Any of the above mentioned methods may be used as a posterior. In some embodiments, the processor may extract a driving surface plane from an image without illumination. In some embodiments, the driving surface plane may be highly weighted in the determination of the traversability of an area. In some embodiments, a flat driving surface may appear as a uniform color in captured images. In some embodiments, obstacles, cliffs, holes, walls, etc. may appear as different textures in captured images. In some embodiments, the processor may distinguish the driving surface from other objects, such as walls, ceilings, and other flat and smooth surfaces, given the expected angle of the driving surface with respect to the camera. Similarly, ceilings and walls may be distinguished from other surfaces as well. In some embodiments, the processor may use depth information to confirm information or provide further granular information once a surface is distinguished. In some embodiments, this may be done by illuminating the FOV of the camera with a set of preset light emitting devices. In some embodiments, the set of preset light emitting devices may include a single source of light turned into a pattern (e.g., a line light emitter with an optical device, such as a lens), a line created with multiple sources of lights (such as LEDs) organized in an arrangement of dots that appear as a line, or a single source of light manipulated optically with one or more lenses and an obstruction to create a series of points in a line, in a grid, or any desired pattern. 
     In some embodiments, data from an IMU (or gyroscope) may also be used to determine traversability of an area. In some embodiments, an IMU may be used to measure the steepness of a ramp and a timer synchronized with the IMU may measure the duration of the steepness measured. Based on this data, a classifier may determine the presence of a ramp (or a bump, a cliff, etc. in other cases). Other classes of sensors that may be used in determining traversability of an area may include depth sensors, range finders, or distance measurement sensors. In one example, one measurement indicating a negative height (e.g., cliff) may slightly decreases the probability of traversability of an area. However, after a single measurement, the probability of traversability may not be low enough for the processor to mark the coverage area as untraversable. A second sensor may measure a small negative height for the same area that may increase the probability of traversability of the area and the area may be marked as traversable. However, another sensor reading indicating a high negative height at the same area decreases the probability of traversability of the area. When a probability of traversability of an area reaches below a threshold the area may be marked as a high risk coverage area. In some embodiments, there may be different thresholds for indicating different risk levels. In some embodiments, a value may be assigned to coverage areas to indicate a risk severity. 
       FIG.  109 A  illustrates a sensor of the robot  10900  measuring a first height relative to a driving plane  10901  of the robot  10900 .  FIG.  109 B  illustrates a low risk level at this instant due to only a single measurement indicating a high height. The probability of traversability decreases slightly and the area is marked as higher risk but not enough for it to be marked as an untraversable area.  FIG.  109 C  illustrates the sensor of the robot  10900  measuring a second height relative to the driving plane  10901  of the robot  10900 .  FIG.  109 D  illustrates a reduction in the risk level at this instant due to the second measurement indicating a small or no height difference. In some embodiments, the risk level may reduce gradually. In some embodiments, a dampening value may be used to reduce the risk gradually.  FIG.  110 A  illustrates sensors of robot  11000  taking a first  11001  and second  11002  measurement to driving plane  11003 .  FIG.  110 B  illustrates an increase in the risk level to a medium risk level after taking the second measurement as both measurements indicate a high height. Depending on the physical characteristics of the robot and parameters set, the area may be untraversable by the robot.  FIG.  111 A  illustrates sensors of robot  11100  taking a first  11101  and second  11102  measurement to driving plane  11103 .  FIG.  111 B  illustrates an increase in the risk level to a high risk level after taking the second measurement as both measurements indicate a very high height. The area may be untraversable by the robot due to the high risk level. 
     In some embodiments, in addition to raw distance information, a second derivative of a sequence of distance measurements may be used to monitor the rate of change in the z values (i.e., height) of connected cells in a Cartesian plane. In some embodiments, second and third derivatives indicating a sudden change in height may increase the risk level of an area (in terms of traversability).  FIG.  112 A  illustrates a Cartesian plane, with each cell having a coordinate with value (x,y,T), wherein T is indicative of traversability.  FIG.  112 B  illustrates a visual representation of a traversability map, wherein different patterns indicate the traversability of the cell by the robot. In this example, cells with higher density of black areas correspond with a lower probability of traversability by the robot. In some embodiments, traversability T may be a numerical value or a label (e.g., low, medium, high) based on real-time and prior measurements. For example, an area in which an entanglement with a brush of the robot previously occurred or an area in which a liquid was previously detected or an area in which the robot was previously stuck or an area in which a side brush of the robot was previously entangled with tassels of a rug may increase the risk level and reduce the probability of traversability of the area. In another example, the presence of a hidden obstacle or a sudden discovery of a dynamic obstacle (e.g., a person walking) in an area may also increase the risk level and reduce the probability of traversability of the area. In one example, a sudden change in a type of driving surface in an area or a sudden discovery of a cliff in an area may impact the probability of traversability of the area. In some embodiments, traversability may be determined for each path from a cell to each of its neighboring cells. In some embodiments, it may be possible for the robot to traverse from a current cell to more than one neighboring cell. In some embodiments, a probability of traversability from a cell to each one or a portion of its neighboring cells may be determined. In some embodiments, the processor of the robot chooses to actuate the robot to move from a current cell to a neighboring cell based on the highest probability of traversability from the current cell to each one of its neighboring cells. 
     In some embodiments, the processor of the robot (or the path planner, for example) may instruct the robot to return to a center of a first two-dimensional coverage area when the robot reaches an end point in a current path plan before driving to a center of a next path plan.  FIG.  113 A  illustrates the robot  11300  at an end point of one polymorphic path plan with coverage area  11301  and boustrophedon path  11302 .  FIG.  113 B  illustrates a subsequent moment wherein the processor decides a next polymorphic rectangular coverage area  11303 . The dotted line  11304  indicates a suggested L-shape path back to a central point of a first polymorphic rectangular coverage area  11301  and then to a central point of the next polymorphic rectangular coverage area  11303 . Because of the polymorphic nature of these path planning methods, the path may be overridden by a better path, illustrated by the solid line  11305 . The path defined by the solid line  11305  may override the path defined by the dotted line  11304 . The act of overriding may be a characteristic that may be defined in the realm of polymorphism.  FIG.  113 C  illustrates a local planner  11306  (i.e., the grey rectangle) with a partially filled map.  FIG.  113 D  illustrates that over time more readings are filled within the local map  11306 . In some embodiments, local sensing may be superimposed over the global map and may create a dynamic and constantly evolving map. In some embodiments, the processor updates the global map as the global sensors provide additional information throughout operation. For example,  FIG.  113 E  illustrates that data sensed by global sensors are integrated into the global map  11307 . As the robot approaches obstacles, they may fall within the range of range sensor and the processor may gradually add the obstacles to the map. 
     In embodiments, the path planning methods described herein are dynamic and constantly changing. In some embodiments, the processor determines, during operation, areas within which the robot operates and operations the robot partakes in using machine learning. In some embodiments, information such as driving surface type and presence or absence of dynamic obstacles, may be used in forming decisions. In some embodiments, the processor uses data from prior work sessions in determining a navigational plan and a task plan for conducting tasks. In some embodiments, the processor may use various types of information to determine a most efficient navigational and task plan. In some embodiments, sensors of the robot collect new data while the robot executes the navigational and task plan. The processor may alter the navigational and task plan of the robot based on the new data and may store the new data for future use. 
     Other path planning methods that may be used are described in U.S. patent application Ser. Nos. 16/041,286, 16/422,234, 15/406,890, 15/676,888, and 14/673,633, the entire contents of which are hereby incorporated by reference. For example, in some embodiments, the processor of the robot may generate a movement path in real-time based on the observed environment. In some embodiments, a topological graph may represent the movement path and may be described with a set of vertices and edges, the vertices being linked by edges. Vertices may be represented as distinct points while edges may be lines, arcs or curves. The properties of each vertex and edge may be provided as arguments at run-time based on real-time sensory input of the environment. The topological graph may define the next actions of the robot as it follows along edges linked at vertices. While executing the movement path, in some embodiments, rewards may be assigned by the processor as the robot takes actions to transition between states and uses the net cumulative reward to evaluate a particular movement path comprised of actions and states. A state-action value function may be iteratively calculated during execution of the movement path based on the current reward and maximum future reward at the next state. One goal may be to find optimal state-action value function and optimal policy by identifying the highest valued action for each state. As different topological graphs including vertices and edges with different properties are executed over time, the number of states experienced, actions taken from each state, and transitions increase. The path devised by the processor of the robot may iteratively evolve to become more efficient by choosing transitions that result in most favorable outcomes and by avoiding situations that previously resulted in low net reward. After convergence, the evolved movement path may be determined to be more efficient than alternate paths that may be devised using real-time sensory input of the environment. In some embodiments, a MDP may be used. 
     In some embodiments, the processor of the robot may determine optimal (e.g., locally or globally) division and coverage of the environment by minimizing a cost function or by maximizing a reward function. In some embodiments, the overall cost function C of a zone or an environment may be calculated by the processor of the robot based on a travel and cleaning cost K and coverage L. In some embodiments, other factors may be inputs to the cost function. The processor may attempt to minimize the travel and cleaning cost K and maximize coverage L. In some embodiments, the processor may determine the travel and cleaning cost K by computing individual cost for each zone and adding the required driving cost between zones. The driving cost between zones may depend on where the robot ended coverage in one zone, and where it begins coverage in a following zone. The cleaning cost may be dependent on factors such as the path of the robot, coverage time, etc. In some embodiments, the processor may determine the coverage based on the square meters of area covered (or otherwise area operated on) by the robot. In some embodiments, the processor of the robot may minimize the total cost function by modifying zones of the environment by, for example, removing, adding, shrinking, expanding, moving and switching the order of coverage of zones. For example, in some embodiments the processor may restrict zones to having rectangular shape, allow the robot to enter or leave a zone at any surface point and permit overlap between rectangular zones to determine optimal zones of an environment. In some embodiments, the processor may include or exclude additional conditions. In some embodiments, the cost accounts for additional features other than or in addition to travel and operating cost and coverage. Examples of features that may be inputs to the cost function may include, coverage, size, and area of the zone, zone overlap with perimeters (e.g., walls, buildings, or other areas the robot cannot travel), location of zones, overlap between zones, location of zones, and shared boundaries between zones. In some embodiments, a hierarchy may be used by the processor to prioritize importance of features (e.g., different weights may be mapped to such features in a differentiable weighted, normalized sum). For example, tier one of a hierarchy may be location of the zones such that traveling distance between sequential zones is minimized and boundaries of sequential zones are shared, tier two may be to avoid perimeters, tier three may be to avoid overlap with other zones and tier four may be to increase coverage. 
     In some embodiments, the processor may use various functions to further improve optimization of coverage of the environment. These functions may include, a discover function wherein a new small zone may be added to large and uncovered areas, a delete function wherein any zone with size below a certain threshold may be deleted, a step size control function wherein decay of step size in gradient descent may be controlled, a pessimism function wherein any zone with individual operating cost below a certain threshold may be deleted, and a fast grow function wherein any space adjacent to a zone that is predominantly unclaimed by any other zone may be quickly incorporated into the zone. 
     In some embodiments, to optimize division of zones of an environment, the processor may proceed through the following iteration for each zone of a sequence of zones, beginning with the first zone: expansion of the zone if neighbor cells are empty, movement of the robot to a point in the zone closest to the current position of the robot, addition of a new zone coinciding with the travel path of the robot from its current position to a point in the zone closest to the robot if the length of travel from its current position is significant, execution of a coverage pattern (e.g. boustrophedon) within the zone, and removal of any uncovered cells from the zone. 
     In some embodiments, the processor may determine optimal division of zones of an environment by modeling zones as emulsions of liquid, such as bubbles. In some embodiments, the processor may create zones of arbitrary shape but of similar size, avoid overlap of zones with static structures of the environment, and minimize surface area and travel distance between zones. In some embodiments, behaviors of emulsions of liquid, such as minimization of surface tension and surface area and expansion and contraction of the emulsion driven by an internal pressure may be used in modeling the zones of the environment. To do so, in some embodiments, the environment may be represented by a grid map and divided into zones by the processor. In some embodiments, the processor may convert the grid map into a routing graph G consisting of nodes N connected by edges E. The processor may represent a zone A using a set of nodes of the routing graph wherein A⊂N. The nodes may be connected and represent an area on the grid map. In some embodiments, the processor may assign a zone A a set of perimeters edges E wherein a perimeters edge e=(n 1 ,n 2 ) connects a node n 1 ∈A with a node n 2 ∉A. Thus, the set of perimeters edges clearly defines the set of perimeters nodes ∂A, and gives information about the nodes, which are just inside zone A as well as the nodes just outside zone A. Perimeters nodes in zone A may be denoted by ∂A in  and perimeters nodes outside zone A by ∂A out . The collection of ∂A in  and ∂A out  together are all the nodes in ∂A. In some embodiments, the processor may expand a zone A in size by adding nodes from ∂A out  to zone A and reduce the zone in size by removing nodes in ∂A in  from zone A, allowing for fluid contraction and expansion. In some embodiments, the processor may determine a numerical value to assign to each node in ∂A, wherein the value of each node indicates whether to add or remove the node from zone A. 
     In some embodiments, the processor may determine the best division of an environment by minimizing a cost function defined as the difference between theoretical (e.g., modeled with uncertainty) area of the environment and the actual area covered. The theoretical area of the environment may be determined by the processor using a map of the environment. The actual area covered may be determined by the processor by recorded movement of the robot using, for example, an odometer or gyroscope. In some embodiments, the processor may determine the best division of the environment by minimizing a cost function dependent on a path taken by the robot comprising the paths taken within each zone and in between zones. The processor may restrict zones to being rectangular (or having some other defined number of vertices or sides) and may restrict the robot to entering a zone at a corner and to driving a serpentine routine (or other driving routine) in either x- or y-direction such that the trajectory ends at another corner of the zone. The cost associated with a particular division of an environment and order of zone coverage may be computed as the sum of the distances of the serpentine path travelled for coverage within each zone and the sum of the distances travelled in between zones (corner to corner). To minimize cost function and improve coverage efficiency zones may be further divided, merged, reordered for coverage and entry/exit points of zones may be adjusted. In some embodiments, the processor of the robot may initiate these actions at random or may target them. In some embodiments, wherein actions are initiated at random (e.g., based on a pseudorandom value) by the processor, the processor may choose a random action such as, dividing, merging or reordering zones, and perform the action. The processor may then optimize entry/exit points for the chosen zones and order of zones. A difference between the new cost and old cost may be computed as Δ=new cost−old cost by the processor wherein an action resulting in a difference&lt;0 is accepted while a difference&gt;0 is accepted with probability exp(−Δ/T) wherein T is a scaling constant. Since cost, in some embodiments, strongly depends on randomly determined actions the processor of the robot, embodiments may evolve ten different instances and after a specified number of iterations may discard a percentage of the worst instances. 
     In some embodiments, the processor may actuate the robot to execute the best or a number of the best instances and calculate actual cost. In embodiments, wherein actions are targeted, the processor may find the greatest cost contributor, such as the largest travel cost, and initiate a targeted action to reduce the greatest cost contributor. In embodiments, random and targeted action approaches to minimizing the cost function may be applied to environments comprising multiple rooms by the processor of the robot. In embodiments, the processor may directly actuate the robot to execute coverage for a specific division of the environment and order of zone coverage without first evaluating different possible divisions and orders of zone coverage by simulation. In embodiments, the processor may determine the best division of the environment by minimizing a cost function comprising some measure of the theoretical area of the environment, the actual area covered, and the path taken by the robot within each zone and in between zones. 
     In some embodiments, the processor may determine a reward and assigns it to a policy based on performance of coverage of the environment by the robot. In some embodiments, the policy may include the zones created, the order in which they were covered, and the coverage path (i.e., it may include data describing these things). In some embodiments, the policy may include a collection of states and actions experienced by the robot during coverage of the environment as a result of the zones created, the order in which they were covered, and coverage path. In some embodiments, the reward may be based on actual coverage, repeat coverage, total coverage time, travel distance between zones, etc. In some embodiments, the process may be iteratively repeated to determine the policy that maximizes the reward. In some embodiments, the processor determines the policy that maximizes the reward using a MDP as described above. In some embodiments, a processor of a robot may evaluate different divisions of an environment while offline. Examples of methods for dividing an environment into zones for coverage are described in U.S. patent application Ser. Nos. 14/817,952, 15/619,449, 16/198,393, 14/673,633, and 15/676,888, the entire contents of which are hereby incorporated by reference. 
     The Bayesian or probabilistic methods described herein may provide several practical advantages. For instance, a robot that functions behaviorally by reacting to everything sensed by the sensors of the robot may result in the robot reacting to many false positive observations. For example, a sensor of the robot may sense the presence of a person quickly walking past the robot and the processor may instruct the robot to immediately stop even though it may not be necessary as the presence of the person is short and momentary. Further, the processor may falsely mark this location as a untraversable area. In another example, brushes and scrubbers may lead to false positive sensor observations due to the occlusion of the sensor positioned on an underside of the robot and adjacent to a brush coupled to the underside of the robot. In some cases, compromises may be made in the shape of the brushes. In some cases, brushes are required to include gaps between sets of bristles such that there are time sequences where sensors positioned on the underside of the robot are not occluded. With a probabilistic method, a single occlusion of a sensor may not amount to a false positive. 
     In some embodiments, the probabilistic methods described may employ Bayesian methods wherein probability may represent a degree of belief in an event. In some embodiments, the degree of belief may be based on prior knowledge of the event or on assumptions about the event. In some embodiments, Bayes&#39; theorem may be used to update probabilities after obtaining new data. Bayes&#39; theorem may describe the conditional probability of an event based on data as well as prior information or beliefs about the event or conditions related to the event. In some embodiments, the processor may determine the conditional probability 
               P   ⁡   (   B   )     =         P   ⁡   (     B   ⁢       ❘   &#34;\[LeftBracketingBar]&#34;     A       )     ⁢     P   ⁡   (   A   )         P   ⁡   (   B   )             
of an event A given that B is true, wherein P(B)≠0. In Bayesian statistics, A may represent a proposition and B may represent new data or prior information. P(A), the prior probability of A, may be taken the probability of A being true prior to considering B. P(B|A), the likelihood function, may be taken as the probability of the information B being true given that A is true. P(A|B), the posterior probability, may be taken as the probability of the proposition A being true after taking information B into account. In embodiments, Bayes&#39; theorem may update prior probability P(A) after considering information B. In some embodiments, the processor may determine the probability of the evidence
 
               P   ⁡   (   B   )     =       ∑   i              ■   ⁢     P   ⁡   (     A   i     )     ⁢     P   ⁡   (     A   i     )               
using the law of total probability, wherein {A 1 , A 2 , . . . , A n } is the set of all possible outcomes. In some embodiments, P(B) may be difficult to determine as it may involve determining sums and integrals that may be time consuming and computationally expensive. Therefore, in some embodiments, the processor may determine the posterior probability as P(B)∝P(B|A)P(A). In some embodiments, the processor may approximate the posterior probability without computing P(B) using methods such as Markov Chain Monte Carlo or variational Bayesian methods.
 
     In some embodiments, the processor may use Bayesian inference wherein uncertainty in inferences may be quantified using probability. For instance, in a Bayesian approach, an action may be executed based on an inference for which there is a prior and a posterior. For example, a first reading from a sensor of a robot indicating an obstacle or a untraversable area may be considered a priori information. The processor of the robot may not instruct the robot to execute an action solely based on a priori information. However, when a second observation occurs, the inference of the second observation may confirm a hypothesis based on the a priori information and the processor may then instruct the robot to execute an action. In some embodiments, statistical models that specify a set of statistical assumptions and processes that represent how the sample data is generated may be used. For example, for a situation modeled with a Bernoulli distribution, only two possibilities may be modeled. In Bayesian inference, probabilities may be assigned to model parameters. In some embodiments, the processor may use Bayes&#39; theorem to update the probabilities after more information is obtained. Statistical models employing Bayesian statistics require that prior distributions for any unknown parameters are known. In some cases, parameters of prior distributions may have prior distributions, resulting in Bayesian hierarchical modeling, or may be interrelated, resulting in Bayesian networks. 
     In employing the Bayesian methods described herein, a false positive sensor reading does not cause harm in functionality of the robot as the processor uses an initial sensor reading to only form a prior belief. In some embodiments, the processor may require a second or third observation to form a conclusion and influence of prior belief. If a second observation does not occur within a timely manner (or after a number of counts) the second observation may not be considered a posterior and may not influence a prior belief. In some embodiments, other statistical interpretations may be used. For example, the processor may use a frequentist interpretation wherein a certain frequency of an observation may be required to form a belief. In some embodiments, other simpler implementations for formulating beliefs may be used. In some embodiments, a probability may be associated with each instance of an observation. For example, each observation may count as a 50% probability of the observation being true. In this implementation, a probability of more than 50% may be required for the robot to take action. 
     In some embodiments, the processor converts Partial Differential Equations (PDEs) to conditional expectations based on Feynman-Kac theorem. For example, for a PDE 
                       ∂   u       ∂   t       ⁢     (     x   ,   t     )       +       μ   ⁡   (     x   ,   t     )     ⁢       ∂   u       ∂   x       ⁢     (     x   ,   t     )       +       1   2     ⁢       σ   2     (     x   ,   t     )     ⁢         ∂   2     u       ∂     x   2         ⁢     (     x   ,   t     )       -       V   ⁡   (     x   ,   t     )     ⁢     u   ⁡   (     x   ,   t     )       +     f   ⁡   (     x   ,   t     )       =   0     ,         
for all x∈R and t∈[0,T], and subject to terminal condition u(x,t)=ψ(x), wherein μ,σ, ψ, V, ƒ are known functions, T is a parameter, and u: R×[0,T]→R is the unknown, the Feyman-Kac formula provides a solution that may be written as a conditional expectation u(x,t)=E Q [∫ t   T e −∫     t       r     V(X     τ     ,τ)dτ ƒ(X r ,r)dr+e −ƒ     t       T     V(X     τ     τ)dτ ψ(X T )|X t =x] under a probability measure Q such that X is an I to process driven by dX=μ(x,t)dt+σ(x,t)dW Q , wherein W Q (t) is a Weiner process or Brownian motion under Q and initial condition X(t)=x. In some embodiments, the processor may use mean field interpretation of Feynman-Kac models or Diffusion Monte Carlo methods.
 
     In some embodiments, the processor may use a mean field selection process or other branching or evolutionary algorithms in modeling mutation or selection transitions to predict the transition of the robot from one state to the next. In some embodiments, during a mutation transition, walkers evolve randomly and independently in a landscape. Each walker may be seen as a simulation of a possible trajectory of a robot. In some embodiments, the processor may use quantum teleportation or population reconfiguration to address a common problem of weight disparity leading to weight collapse. In some embodiments, the processor may control extinction or absorption probabilities of some Markov processes. In some embodiments, the processor may use a fitness function. In some embodiments, the processor may use different mechanisms to avoid extinction before weights become too uneven. In some embodiments, the processor may use adaptive resampling criteria, including variance of the weights and relative entropy with respect to a uniform distribution. In some embodiments, the processor may use spatial branching processes combined with competitive selection. 
     In some embodiments, the processor may use a prediction step given by the Chapman-Kolmogrov transport equation, an identity relating the joint probability distribution of different sets of coordinates on a stochastic process. For example, for a stochastic process given by an indexed collection of random variables {ƒ i }, p i     1   , . . . , i n (ƒ 1 , . . . , ƒ n ) may be the joint probability density function of the values of random variables ƒ 1  to ƒ n . In some embodiments, the processor may use the Chapman-Kolmogrov equation given by p i     1   , . . . , i n−1 (ƒ 1 , . . . , ƒ n−1 )=∫ −∞   ∞ ▪p i     1   , . . . , (ƒ 1 , . . . , ƒ n )dƒ n , a marginalization over the nuisance variable. If the stochastic process is Markovian, the Chapman-Kolmogrov equation may be equivalent to an identity on transition densities wherein i 1 &lt; . . . &lt;i n  for a Markov chain. Given the Markov property, p i     1   , . . . , i n (ƒ 1 , . . . , ƒ n )=p i     1   (ƒ 1 )p i     2     ;i     1   (ƒ 2 |ƒ 1 ) . . . p i     n     ;i     n−1   (ƒ n |ƒ n−1 ), wherein the conditional probability p i;j (ƒ i |ƒ j ) is a transition probability between the times i&gt;j. Therefore, the Chapman-Kolmogrov equation may be given by p i     3     ;i     1   (ƒ 3 |ƒ 1 )=∫ −∞   ∞ ▪p i     3     ;i▪     2   (ƒ 3 |ƒ 2 )p i     2     ;i     1   (ƒ 2 |ƒ 1 )dƒ 2 , wherein the probability of transitioning from state one to state three may be determined by summating the probabilities of transitioning from state one to intermediate state two and intermediate state two to state three. If the probability distribution on the state space of a Markov chain is discrete and the Markov chain is homogenous, the processor may use the Chapman-Kolmogrov equation given by P(t+s)=P(t)P(s), wherein P(t) is the transition matrix of jump t, such that entry (i,j) of the matrix includes the probability of the chain transitioning from state i to j in t steps. To determine the transition matrix of jump t the transition matrix of jump one may be raised to the power of t, i.e., P(t)=P t . In some instances, the differential form of the Chapman-Kolmogrov equation may be known as the master equation. 
     In some embodiments, the processor may use a subset simulation method. In some embodiments, the processor may assign a small probability to slightly failed or slightly diverted scenarios. In some embodiments, the processor of the robot may monitor a small failure probability over a series of events and introduce new possible failures and prune recovered failures. For example, a wheel intended to rotate at a certain speed for 20 ms may be expected to move the robot by a certain amount. However, if the wheel is on carpet, grass, or hard surface, the amount of movement of the robot resulting from the wheel rotating at a certain speed for 20 ms may not be the same. In some embodiments subset simulation methods may be used to achieve high reliability systems. In some embodiments, the processor may adaptively generate samples conditional on failure instances to slowly populate ranges from the frequent to more occasional event region. 
     In some embodiments, the processor may use a complementary cumulative distribution function (CCDF) of the quantity of interest governing the failure in question to cover the high and low probability regions. In some embodiments, the processor may use stochastic search algorithms to propagate a population of feasible candidate solutions using mutation and selection mechanisms with introduction of routine failures and recoveries. 
     In multi-agent interacting systems, the processor may monitor the collective behavior of complex systems with interacting individuals. In some embodiments, the processor may monitor a continuum model of agents with multiple players over multiple dimensions. In some embodiments, the above methods may also be used for investigating the cause, the exact time of occurrence, and consequence of failure. 
     In some embodiments, dynamic obstacles and floor type may be detected by the processor during operation of the robot. As the robot operates within the environment, sensors arranged on the robot may collect information such as a type of driving surface. In some instances, the type of driving surface may be important, such as in the case of a surface cleaning robot. For example, information indicating that a room has a thick pile rug and wood flooring may be important for the operation of a surface cleaning robot as the presence of the two different driving surfaces may require the robot to adjust settings when transitioning from operating on the thick pile rug, with higher elevation, to the wood flooring with lower elevation, or vice versa. Settings may include cleaning type (e.g., vacuuming, mopping, steam cleaning, UV sterilization, etc.) and settings of robot (e.g., driving speed, elevation of the robot or components thereof from the driving surface, etc.) and components thereof (e.g., main brush motor speed, side brush motor speed, impeller motor speed, etc.). For example, the surface cleaning robot may perform vacuuming on the thick pile rug and may perform vacuuming and mopping on the wood flooring. In another example, a higher suctioning power may be used when the surface cleaning robot operates on the thick pile rug as debris may be easily lodged within the fibers of the rug and a higher suctioning power may be necessary to collect the debris from the rug. In one example, a faster main brush speed may be used when the robot operates on thick pile rug as compared to wood flooring. In another example, information indicating types of flooring within an environment may be used by the processor to operate the robot on particular flooring types indicated by a user. For instance, a user may prefer that a package delivering robot only operates on tiled surfaces to avoid tracking dirt on carpeted surfaces. 
     In some embodiments, a user may use an application of a communication device paired with the robot to indicate driving surface types (or other information such as floor type transitions, obstacles, etc.) within a diagram of the environment to assist the processor with detecting driving surface types. In such instances, the processor may anticipate a driving surface type at a particular location prior to encountering the driving surface at the particular location. In some embodiments, the processor may autonomously learn the location of boundaries between varying driving surface types. 
     In some embodiments, the processor may mark the locations of obstacles (e.g., static and dynamic) encountered in the map. In some embodiments, the map may be a dedicated obstacle map. In some embodiments, the processor may mark a location and nature of an obstacle on the map each time an obstacle is encountered. In some embodiments, the obstacles marked may be hidden. In some embodiments, the processor may assign each obstacle a decay factor and obstacles may fade away if they are not continuously observed over time. In some embodiments, the processor may mark an obstacle as a permanent obstacle if the obstacle repeatedly appears over time. This may be controlled through various parameters. In some embodiments, the processor may mark an obstacle as a dynamic obstacle if the obstacle is repeatedly not present in an expected location. Alternatively, the processor may mark a dynamic obstacle in a location wherein an unexpected obstacle is repeatedly observed at the location. In some embodiments, the processor may mark a dynamic obstacle at a location if such an obstacle appears on some occasions but not others at the location. In some embodiments, the processor may mark a dynamic obstacle at a location where an obstacle is unexpectedly observed, has disappeared, or has unexpectedly appeared. In some embodiments, the processor implements the above methods of identifying dynamic obstacles in a single work session. In some embodiments, the processor applies a dampening time to observed obstacles, wherein an observed obstacle is removed from the map or memory after some time. In some embodiments, the robot slows down and inspects a location of an observed obstacle another time. 
     In some embodiments, the memory of the robot may include an internal database of obstacles likely to be encountered within the environment. In some embodiments, an obstacle encountered in the environment may be identified using various sensors to capture features of the obstacle and the processor may determine the type of obstacle based on the internal database. The processor may note the increased likelihood of that type of obstacle being located in the region of the environment in which it was encountered. In some embodiments, the processor may mark the location in the map. In some embodiments, the processor may further determine if an obstacle may be overcome by the robot. If so, the robot may attempt to drive over the obstacle. If, however, the robot encounters a large obstacle, such as a chair or table, the processor may determine that it cannot overcome the obstacle and may attempt to maneuver around the obstacle and continue along its path. In some embodiments, regions wherein obstacles are consistently encountered may be classified by the processor as a high obstacle density area and may be marked in the map of the environment. In some embodiments, the processor may attempt to alter its path to avoid high obstacle density areas. In some embodiments, the processor may alert a user when an unanticipated obstacle blocking the path of the robot is encountered, particularly when the robot may not overcome the obstacle by maneuvering around or driving over the obstacle. The robot may alert the user by generating a noise, sending a message to an application of a communication device, displaying a message on a screen of the robot, illuminating lights, and the like. 
     In some embodiments, data from a sensor may be used to provide a L2 norm to a nearest obstacle in a field of view of the sensor. The accuracy of such observation may be limited to the resolution or application of the sensor or may be intrinsic to the atmosphere. In some embodiments, intrinsic limitations may be overcome by training the processor to provide better estimation from the observations based on a specific context of the application of the receiver. In some embodiments, a variation of gradient descent may be used to improve the observations. In some embodiments, the problem may be further processed to transform from an intensity to a classification problem wherein the processor may map a current observation to one or more of a set of possible labels. For example, an observation may be mapped to 12 millimeters and another observation may be mapped to 13 millimeters. In some embodiments, the processor may use a table look up technique to improve performance. In some embodiments, the processor may map each observation to an anticipated possible state determined through a table lookup. In some embodiments, a triangle or Gaussian methods may be used to map the state to an optimized nearest possibility instead of rounding up or down to a next state defined by a resolution. In some embodiments, a short reading may occur when the space between the receiver (or transmitter) and the intended surface (or object) to be measured is interfered with by an undesired presence. For example, when agitated particles and debris are present between a receiver and a floor, short readings may occur. In another example, presence of a person or pet walking in front of a robot may trigger short readings. Such noises may also be modelled and optimized with statistical methods. For example, presence of an undesirable object decreases as the range of a sensor decreases. 
     In some embodiments, a short reading may occur when the space between the receiver (or transmitter) and the intended surface (or object) to be measured is interfered with by an undesired presence. For example, when agitated particles and debris are present between a receiver and a floor, short readings may occur. In another example, presence of a person or pet walking in front of a robot may trigger short readings. Such noises may also be modelled and optimized with statistical methods. For example, presence of an undesirable object decreases as the range of a sensor decreases. 
     In some cases, traditional obstacle detection may be a reactive method and prone to false positives and false negatives. For example, in a traditional method, a single sensor reading may result in a reactive behavior of the robot without validation of the sensor reading which may lead to a reaction to a false positive. In some embodiments, probabilistic and Bayesian methods may be used for obstacle detection, allowing obstacle detection to be treated as a classification problem. In some embodiments, the processor may use a machined learned classification algorithm that may use all evidence available to reach a conclusion based on the likelihood of each element considered suggesting a possibility. In some embodiments, the classification algorithm may use a logistical classifier or a linear classifier Wx+b=y, wherein W is weight and b is bias. In some embodiments, the processor may use a neural network to evaluate various cost functions before deciding on a classification. In some embodiments, the neural network may use a softmax activation function 
               S   ⁡   (     y   i     )     =         e     y   i           ∑   j       e     y   j           .           
In some embodiments, the softmax function may receive numbers (e.g., logits) as input and output probabilities that sum to one. In some embodiments, the softmax function may output a vector that represents the probability distributions of a list of potential outcomes. In some embodiments, the softmax function may be equivalent to the gradient of the LogSumExp function LSE(x 1 , . . . , x n )=log (e x     1   + . . . +e x     n   . In some embodiments, the LogSumExp, with the first argument set to zero, may be equivalent to the multivariable generalization of a single-variable softplus function. In some instances, the softplus function ƒ(x)=log(1+e x ) may be used as a smooth approximation to a rectifier. In some embodiments, the derivative of the softplus function
 
               f     ′   ⁡   (   x   )       =         e   x       1   +     e   x         =     1     1   +     e     -   x                   
may be equivalent to the logistic function and the logistic sigmoid function may be used as a smooth approximation of the derivative of the rectifier, the Heaviside step function. In some embodiments, the softmax function, with the first argument set to zero, may be equivalent to the multivariable generalization of the logistic function. In some embodiments, the neural network may use a rectifier activation function. In some embodiments, the rectifier may be the positive of its argument ƒ(x)=x + =max(0,x), wherein x is the input to a neuron. In embodiments, different ReLU variants may be used. For example, ReLUs may incorporate Gaussian noise, wherein ƒ(x)=(0,x+Y) with Y˜N(0,σ(x)), known as Noisy ReLU. In one example, ReLUs may incorporate a small, positive gradient when the unit is inactive, wherein ƒ(x)={x if x&gt;0,0.01x otherwise, known as Leaky ReLU. In some instances, Parametric ReLUs may be used, wherein the coefficient of leakage is a parameter that is learned along with other neural network parameters, i.e. ƒ(x)={x if x&gt;0, ax otherwise. For a≤1, ƒ(x)=max(x,ax). In another example, Exponential Linear Units may be used to attempt to reduce the mean activations to zero, and hence increase the speed of learning, wherein ƒ(x)={x if x&gt;0, a(e x −1) otherwise, a is a hyperparameter, and a≥0 is a constraint. In some embodiments, linear variations may be used. In some embodiments, linear functions may be processed in parallel. In some embodiments, the task of classification may be divided into several subtasks that may be computed in parallel. In some embodiments, algorithms may be developed such that they take advantage of parallel processing built into some hardware.
 
     In some embodiments, the classification algorithm (described above and other classification algorithms described herein) may be pre-trained or pre-labeled by a human observer. In some embodiments, the classification algorithm may be tested and/or validated after training. In some embodiments, training, testing, validation, and/or classification may continue as more sensor data is collected. In some embodiments, sensor data may be sent to the cloud. In some embodiments, training, testing, validation, and/or classification may be executed on the cloud. In some embodiments, labeled data may be used to establish ground truth. In some embodiments, ground truth may be optimized and may evolve to be more accurate as more data is collected. In some embodiments, labeled data may be divided into a training set and a testing set. In some embodiments, the labeled data may be used for training and/or testing the classification algorithm by a third party. In some embodiments, labeling may be used for determining the nature of objects within an environment. For example, data sets may include data labeled as objects within a home, such as a TV and a fridge. In some embodiments, a user may choose to allow their data to be used for various purposes. For example, a user may consent for their data to be used for troubleshooting purposes but not for classification. In some embodiments, a set of questions or settings (e.g., accessible through an application of a communication device) may allow the user to specifically define the nature of their consent. 
     In some embodiments, the processor of the robot may mark areas in which issues were encountered within the map, and in some cases, may determine future decisions relating to those areas based on the issues encountered. In some embodiments, the processor aggregates debris data and generates a new map that marks areas with a higher chance of being dirty. In some embodiments, the processor of the robot may mark areas with high debris density within the current map. In some embodiments, the processor may mark unexpected events within the map. For example, the processor of the robot marks an unexpected event within the map when a TSSP sensor detects an unexpected event on the right side or left side of the robot, such as an unexpected climb. 
     In some cases, the processor may use concurrency control which defines the rules that provide consistency of data. In some embodiments, the processor may ignore data a sensor reads when it is not consistent with the preceding data read. For example, when a robot driving towards a wall drives over a bump the pitch angle of the robot temporarily increases with respect to the horizon. At that particular moment, the spatial data may indicate a sudden increase in the L2 norm readings to the wall, however, since the processor knows the robot has a positive velocity and the magnitude of the velocity, the processor marks the spatial data indicating the sudden increase as an outlier. 
     In some embodiments, the processor may determine decisions based on data from more than one sensor. For example, the processor may determine a choice or state or behavior based on agreement or disagreement between more than one sensor. For example, an agreement between some number of those sensors may result in a more reliable decision (e.g. there is high certainty of an edge existing at a location when data of N of M floor sensors indicate so). In some embodiments, the sensors may be different types of sensors (e.g. initial observation may be by a fast sensor, and final decision may be based on observation of a slower, more reliable sensor). In some embodiments, various sensors may be used and a trained AI algorithm may be used to detect certain patterns that may indicate further details, such as, a type of an edge (e.g., corner versus straight edge). 
     In some embodiments, the processor of the robot autonomously adjusts settings based on environmental characteristics observed using one or more environmental sensors (e.g., sensors that sense attributes of a driving surface, a wall, or a surface of an obstacle in an environment). Examples of methods for adjusting settings of a robot based on environmental characteristics observed are described in U.S. Patent Application No. 62/735,137 and Ser. No. 16/239,410. For example, processor may increase the power provided to the wheels when driving over carpet as compared to hardwood such that a particular speed may be maintained despite the added friction from the carpet. The processor may determine driving surface type using sensor data, wherein, for example, distance measurements for hard surface types are more consistent over time as compared to soft surface types due to the texture of grass. In some embodiments, the environmental sensor is communicatively coupled to the processor of the robot and the processor of the robot processes the sensor data (a term which is used broadly to refer to information based on sensed information at various stages of a processing pipeline). In some embodiments, the sensor includes its own processor for processing the sensor data. Examples of sensors include, but are not limited to (which is not to suggest that any other described component of the robotic cleaning device is required in all embodiments), floor sensors, debris sensors, obstacle sensors, cliff sensors, acoustic sensors, cameras, optical sensors, distance sensors, motion sensors, tactile sensors, electrical current sensors, and the like. In some embodiments, the optoelectronic system described above may be used to detect floor types based on, for example, the reflection of light. For example, the reflection of light from a hard surface type, such as hardwood flooring, is sharp and concentrated while the reflection of light from a soft surface type, such as carpet, is dispersed due to the texture of the surface. In some embodiments, the floor type may be used by the processor to identify the rooms or zones created as different rooms or zones include a particular type of flooring. In some embodiments, the optoelectronic system may simultaneously be used as a cliff sensor when positioned along the sides of the robot. For example, the light reflected when a cliff is present is much weaker than the light reflected off of the driving surface. In some embodiments, the optoelectronic system may be used as a debris sensor as well. For example, the patterns in the light reflected in the captured images may be indicative of debris accumulation, a level of debris accumulation (e.g., high or low), a type of debris (e.g., dust, hair, solid particles), state of the debris (e.g., solid or liquid) and a size of debris (e.g., small or large). In some embodiments, Bayesian techniques are applied. In some embodiments, the processor may use data output from the optoelectronic system to make a priori measurement (e.g., level of debris accumulation or type of debris or type of floor) and may use data output from another sensor to make a posterior measurement to improve the probability of being correct. For example, the processor may select possible rooms or zones within which the robot is located a priori based on floor type detected using data output from the optoelectronic sensor, then may refine the selection of rooms or zones posterior based on door detection determined from depth sensor data. In some embodiments, the output data from the optoelectronic system is used in methods described above for the division of the environment into two or more zones. 
     The one or more environmental sensors may sense various attributes of one or more of these features of an environment, e.g., particulate density, rolling resistance experienced by robot wheels, hardness, location, carpet depth, sliding friction experienced by robot brushes, hardness, color, acoustic reflectivity, optical reflectivity, planarity, acoustic response of a surface to a brush, and the like. In some embodiments, the sensor takes readings of the environment (e.g., periodically, like more often than once every 5 seconds, every second, every 500 ms, every 100 ms, or the like) and the processor obtains the sensor data. In some embodiments, the sensed data is associated with location data of the robot indicating the location of the robot at the time the sensor data was obtained. In some embodiments, the processor infers environmental characteristics from the sensory data (e.g., classifying the local environment of the sensed location within some threshold distance or over some polygon like a rectangle as being with a type of environment within a ontology, like a hierarchical ontology). In some embodiments, the processor infers characteristics of the environment in real-time (e.g., during a cleaning or mapping session, with 10 seconds of sensing, within 1 second of sensing, or faster) from real-time sensory data. In some embodiments, the processor adjusts various operating parameters of actuators, like speed, torque, duty cycle, frequency, slew rate, flow rate, pressure drop, temperature, brush height above the floor, or second or third order time derivatives of the same. For instance, some embodiments adjust the speed of components (e.g., main brush, peripheral brush, wheel, impeller, lawn mower blade, etc.) based on the environmental characteristics inferred (in some cases in real-time according to the preceding sliding windows of time). In some embodiments, the processor activates or deactivates (or modulates intensity of) functions (e.g., vacuuming, mopping, UV sterilization, digging, mowing, salt distribution, etc.) based on the environmental characteristics inferred (a term used broadly and that includes classification and scoring). In other instances, the processor adjusts a movement path, operational schedule (e.g., time when various designated areas are operated on or operations are executed), and the like based on sensory data. Examples of environmental characteristics include driving surface type, obstacle density, room type, level of debris accumulation, level of user activity, time of user activity, etc. 
     In some embodiments, the processor of the robot marks inferred environmental characteristics of different locations of the environment within a map of the environment based on observations from all or a portion of current and/or historical sensory data. In some embodiments, the processor modifies the environmental characteristics of different locations within the map of the environment as new sensory data is collected and aggregated with sensory data previously collected or based on actions of the robot (e.g., operation history). For example, in some embodiments, the processor of a street sweeping robot determines the probability of a location having different levels of debris accumulation (e.g., the probability of a particular location having low, medium and high debris accumulation) based on the sensory data. If the location has a high probability of having a high level of debris accumulation and was just cleaned, the processor reduces the probability of the location having a high level of debris accumulation and increases the probability of having a low level of debris accumulation. Based on sensed data, some embodiments may classify or score different areas of a working environment according to various dimensions, e.g., classifying by driving surface type in a hierarchical driving surface type ontology or according to a dirt-accumulation score by debris density or rate of accumulation. 
     In some embodiments, the map of the environment is a grid map wherein the map is divided into cells (e.g., unit tiles in a regular or irregular tiling), each cell representing a different location within the environment. In some embodiments, the processor divides the map to form a grid map. In some embodiments, the map is a Cartesian coordinate map while in other embodiments the map is of another type, such as a polar, homogenous, or spherical coordinate map. In some embodiments, the environmental sensor collects data as the robot navigates throughout the environment or operates within the environment as the processor maps the environment. In some embodiments, the processor associates each or a portion of the environmental sensor readings with the particular cell of the grid map within which the robot was located when the particular sensor readings were taken. In some embodiments, the processor associates environmental characteristics directly measured or inferred from sensor readings with the particular cell within which the robot was located when the particular sensor readings were taken. In some embodiments, the processor associates environmental sensor data obtained from a fixed sensing device and/or another robot with cells of the grid map. In some embodiments, the robot continues to operate within the environment until data from the environmental sensor is collected for each or a select number of cells of the grid map. In some embodiments, the environmental characteristics (predicted or measured or inferred) associated with cells of the grid map include, but are not limited to (which is not to suggest that any other described characteristic is required in all embodiments), a driving surface type, a room or area type, a type of driving surface transition, a level of debris accumulation, a type of debris, a size of debris, a frequency of encountering debris accumulation, day and time of encountering debris accumulation, a level of user activity, a time of user activity, an obstacle density, an obstacle type, an obstacle size, a frequency of encountering a particular obstacle, a day and time of encountering a particular obstacle, a level of traffic, a driving surface quality, a hazard, etc. In some embodiments, the environmental characteristics associated with cells of the grid map are based on sensor data collected during multiple working sessions wherein characteristics are assigned a probability of being true based on observations of the environment over time. 
     In some embodiments, the processor associates (e.g., in memory of the robot) information such as date, time, and location with each sensor reading or other environmental characteristic based thereon. In some embodiments, the processor associates information to only a portion of the sensor readings. In some embodiments, the processor stores all or a portion of the environmental sensor data and all or a portion of any other data associated with the environmental sensor data in a memory of the robot. In some embodiments, the processor uses the aggregated stored data for optimizing (a term which is used herein to refer to improving relative to previous configurations and does not require a global optimum) operations within the environment by adjusting settings of components such that they are ideal (or otherwise improved) for the particular environmental characteristics of the location being serviced or to be serviced. 
     In some embodiments, the processor generates a new grid map with new characteristics associated with each or a portion of the cells of the grid map at each work session. For instance, each unit tile may have associated therewith a plurality of environmental characteristics, like classifications in an ontology or scores in various dimensions like those discussed above. In some embodiments, the processor compiles the map generated at the end of a work session with an aggregate map based on a combination of maps generated during each or a portion of prior work sessions. In some embodiments, the processor directly integrates data collected during a work session into the aggregate map either after the work session or in real-time as data is collected. In some embodiments, the processor aggregates (e.g., consolidates a plurality of values into a single value based on the plurality of values) current sensor data collected with all or a portion of sensor data previously collected during prior working sessions of the robot. In some embodiments, the processor also aggregates all or a portion of sensor data collected by sensors of other robots or fixed sensing devices monitoring the environment. 
     In some embodiments, the processor (e.g., of a robot or a remote server system, either one of which (or a combination of which) may implement the various logical operations described herein) determines probabilities of environmental characteristics (e.g., an obstacle, a driving surface type, a type of driving surface transition, a room or area type, a level of debris accumulation, a type or size of debris, obstacle density, level of traffic, driving surface quality, etc.) existing in a particular location of the environment based on current sensor data and sensor data collected during prior work sessions. For example, in some embodiments, the processor updates probabilities of different driving surface types existing in a particular location of the environment based on the currently inferred driving surface type of the particular location and the previously inferred driving surface types of the particular location during prior working sessions of the robot and/or of other robots or fixed sensing devices monitoring the environment. In some embodiments, the processor updates the aggregate map after each work session. In some embodiments, the processor adjusts speed of components and/or activates/deactivates functions based on environmental characteristics with highest probability of existing in the particular location of the robot such that they are ideal for the environmental characteristics predicted. For example, based on aggregate sensory data there is an 85% probability that the type of driving surface in a particular location is hardwood, a 5% probability it is carpet, and a 10% probability it is tile. The processor adjusts the speed of components to ideal speed for hardwood flooring given the high probability of the location having hardwood flooring. Some embodiments may classify unit tiles into a flooring ontology, and entries in that ontology may be mapped in memory to various operational characteristics of actuators of the robot that are to be applied. 
     In some embodiments, the processor uses the aggregate map to predict areas with high risk of stalling, colliding with obstacles and/or becoming entangled with an obstruction. In some embodiments, the processor records the location of each such occurrence and marks the corresponding grid cell(s) in which the occurrence took place. For example, the processor uses aggregated obstacle sensor data collected over multiple work sessions to determine areas with high probability of collisions or aggregated electrical current sensor of a peripheral brush motor or motor of another device to determine areas with high probability of increased electrical current due to entanglement with an obstruction. In some embodiments, the processor causes the robot to avoid or reduce visitation to such areas. 
     In some embodiments, the processor uses the aggregate map to determine a navigational path within the environment, which in some cases, may include a coverage path in various areas (e.g., areas including collections of adjacent unit tiles, like rooms in a multi-room work environment). Various navigation paths may be implemented based on the environmental characteristics of different locations within the aggregate map. For example, the processor may generate a movement path that covers areas only requiring low impeller motor speed (e.g., areas with low debris accumulation, areas with hardwood floor, etc.) when individuals are detected as being or predicted to be present within the environment to reduce noise disturbances. In another example, the processor generates (e.g., forms a new instance or selects an extant instance) a movement path that covers areas with high probability of having high levels of debris accumulation, e.g., a movement path may be selected that covers a first area with a first historical rate of debris accumulation and does not cover a second area with a second, lower, historical rate of debris accumulation. 
     In some embodiments, the processor of the robot uses real-time environmental sensor data (or environmental characteristics inferred therefrom) or environmental sensor data aggregated from different working sessions or information from the aggregate map of the environment to dynamically adjust the speed of components and/or activate/deactivate functions of the robot during operation in an environment. For example, an electrical current sensor may be used to measure the amount of current drawn by a motor of a main brush in real-time. The processor may infer the type of driving surface based on the amount current drawn and in response adjusts the speed of components such that they are ideal for the particular driving surface type. For instance, if the current drawn by the motor of the main brush is high, the processor may infer that a robotic vacuum is on carpet, as more power is required to rotate the main brush at a particular speed on carpet as compared to hard flooring (e.g., wood or tile). In response to inferring carpet, the processor may increase the speed of the main brush and impeller (or increase applied torque without changing speed, or increase speed and torque) and reduce the speed of the wheels for a deeper cleaning. Some embodiments may raise or lower a brush in response to a similar inference, e.g., lowering a brush to achieve a deeper clean. In a similar manner, an electrical current sensor that measures the current drawn by a motor of a wheel may be used to predict the type of driving surface, as carpet or grass, for example, requires more current to be drawn by the motor to maintain a particular speed as compared to hard driving surface. In some embodiments, the processor aggregates motor current measured during different working sessions and determines adjustments to speed of components using the aggregated data. In another example, a distance sensor takes distance measurements and the processor infers the type of driving surface using the distance measurements. For instance, the processor infers the type of driving surface from distance measurements of a time-of-flight (“TOF”) sensor positioned on, for example, the bottom surface of the robot as a hard driving surface when, for example, when consistent distance measurements are observed over time (to within a threshold) and soft driving surface when irregularity in readings are observed due to the texture of for example, carpet or grass. In a further example, the processor uses sensor readings of an image sensor with at least one IR illuminator or any other structured light positioned on the bottom side of the robot to infer type of driving surface. The processor observes the signals to infer type of driving surface. For example, driving surfaces such as carpet or grass produce more distorted and scattered signals as compared with hard driving surfaces due to their texture. The processor may use this information to infer the type of driving surface. 
     In some embodiments, the processor infers presence of users from sensory data of a motion sensor (e.g., while the robot is static, or with a sensor configured to reject signals from motion of the robot itself). In response to inferring the presence of users, the processor may reduce motor speed of components (e.g., impeller motor speed) to decrease noise disturbance. In some embodiments, the processor infers a level of debris accumulation from sensory data of an audio sensor. For example, the processor infers a particular level of debris accumulation and/or type of debris based on the level of noise recorded. For example, the processor differentiates between the acoustic signal of large solid particles, small solid particles or air to determine the type of debris and based on the duration of different acoustic signals identifies areas with greater amount of debris accumulation. In response to observing high level of debris accumulation, the processor of a surface cleaning robot, for example, increases the impeller speed for stronger suction and reduces the wheel speeds to provide more time to collect the debris. In some embodiments, the processor infers level of debris accumulation using an IR transmitter and receiver positioned along the debris flow path, with a reduced density of signals indicating increased debris accumulation. In some embodiments, the processor infers level of debris accumulation using data captured by an imaging device positioned along the debris flow path. In other cases, the processor uses data from an IR proximity sensor aimed at the surface as different surfaces (e.g. clean hardwood floor, dirty hardwood floor with thick layer of dust, etc.) have different reflectance thereby producing different signal output. In some instances, the processor uses data from a weight sensor of a dustbin to detect debris and estimate the amount of debris collected. In some instances, a piezoelectric sensor is placed within a debris intake area of the robot such that debris may make contact with the sensor. The processor uses the piezoelectric sensor data to detect the amount of debris collected and type of debris based on the magnitude and duration of force measured by the sensor. In some embodiments, a camera captures images of a debris intake area and the processor analyzes the images to detect debris, approximate the amount of debris collected (e.g. over time or over an area) and determine the type of debris collected. In some embodiments, an IR illuminator projects a pattern of dots or lines onto an object within the field of view of the camera. The camera captures images of the projected pattern, the pattern being distorted in different ways depending the amount and type of debris collected. The processor analyzes the images to detect when debris is collected and to estimate the amount and type of debris collected. In some embodiments, the processor infers a level of obstacle density from sensory data of an obstacle sensor. For example, in response to inferring high level of obstacle density, the processor reduces the wheel speeds to avoid collisions. In some instances, the processor adjusts a frame rate (or speed) of an imaging device and/or a rate (or speed) of data collection of a sensor based on sensory data. 
     In some embodiments, a memory of the robot includes an internal database of types of debris likely to be encountered within the environment. In some embodiments, the processor identifies the type of debris collected in the environment by using the data of various sensors capturing the features of the debris (e.g., camera, pressure sensor, acoustic sensor, etc.) and comparing those features with features of different types of debris stored in the internal database. In some embodiments, the processor determines the likelihood of collecting a particular type of debris in different areas of the environment based on, for example, current and historical data. For example, a robot encounters accumulated dog hair on the surface. Image sensors of the robot capture images of the debris and the processor analyzes the images to determine features of the debris. The processor compares the features to those of different types of debris within the internal database and matches them to dog hair. The processor marks the region in which the dog hair was encountered within a map of the environment as a region with increased likelihood of encountering dog hair. The processor increases the likelihood of encountering dog hair in that particular region with increasing number of occurrences. In some embodiments, the processor further determines if the type of debris encountered may be cleaned by a cleaning function of the robot. For example, a processor of a robotic vacuum determines that the debris encountered is a liquid and that the robot does not have the capabilities of cleaning the debris. In some embodiments, the processor of the robot incapable of cleaning the particular type of debris identified communicates with, for example, a processor of another robot capable of cleaning the debris from the environment. In some embodiments, the processor of the robot avoids navigation in areas with particular type of debris detected. 
     In some embodiments, the processor may adjust speed of components, select actions of the robot, and adjusts settings of the robot, each in response to real-time or aggregated (i.e., historical) sensor data (or data inferred therefrom). For example, the processor may adjust the speed or torque of a main brush motor, an impeller motor, a peripheral brush motor or a wheel motor, activate or deactivate (or change luminosity or frequency of) UV treatment from a UV light configured to emit below a robot, steam mopping, liquid mopping (e.g., modulating flow rate of soap or water), sweeping, or vacuuming (e.g., modulating pressure drop or flow rate), set a schedule, adjust a path, etc. in response to real-time or aggregated sensor data (or environmental characteristics inferred therefrom). In one instance, the processor of the robot may determine a path based on aggregated debris accumulation such that the path first covers areas with high likelihood of high levels of debris accumulation (relative to other areas of the environment), then covers areas with high likelihood of low levels of debris accumulation. Or the processor may determine a path based on cleaning all areas having a first type of flooring before cleaning all areas having a second type of flooring. In another instance, the processor of the robot may determine the speed of an impeller motor based on most likely debris size or floor type in an area historically such that higher speeds are used in areas with high likelihood of large sized debris or carpet and lower speeds are used in areas with high likelihood of small sized debris or hard flooring. In another example, the processor of the robot may determine when to use UV treatment based on historical data indicating debris type in a particular area such that areas with high likelihood of having debris that can cause sanitary issues, such as food, receive UV or other type of specialized treatment. In a further example, the processor reduces the speed of noisy components when operating within a particular area or avoids the particular area if a user is likely to be present based on historical data to reduce noise disturbances to the user. In some embodiments, the processor controls operation of one or more components of the robot based on environmental characteristics inferred from sensory data. For example, the processor deactivates one or more peripheral brushes of a surface cleaning device when passing over locations with high obstacle density to avoid entanglement with obstacles. In another example, the processor activates one or more peripheral brushes when passing over locations with high level of debris accumulation. In some instances, the processor adjusts the speed of the one or more peripheral brushes according to the level of debris accumulation. 
     In some embodiments, the processor of the robot may determine speed of components and actions of the robot at a location based on different environmental characteristics of the location. In some embodiments, the processor may assign certain environmental characteristics a higher weight (e.g., importance or confidence) when determining speed of components and actions of the robot. In some embodiments, input into an application of the communication device (e.g., by a user) specifies or modifies environmental characteristics of different locations within the map of the environment. For example, driving surface type of locations, locations likely to have high and low levels of debris accumulation, locations likely to have a specific type or size of debris, locations with large obstacles, etc. may be specified or modified using the application of the communication device. 
     In some embodiments, the processor may use machine learning techniques to predict environmental characteristics using sensor data such that adjustments to speed of components of the robot may be made autonomously and in real-time to accommodate the current environment. In some embodiments, Bayesian methods may be used in predicting environmental characteristics. For example, to increase confidence in predictions (or measurements or inferences) of environmental characteristics in different locations of the environment, the processor may use a first set of sensor data collected by a first sensor to predict (or measure or infer) an environmental characteristic of a particular location a priori to using a second set of sensor data collected by a second sensor to predict an environmental characteristic of the particular location. Examples of adjustments may include, but are not limited to, adjustments to the speed of components (e.g., a cleaning tool such a main brush or side brush, wheels, impeller, cutting blade, digger, salt or fertilizer distributor, or other component depending on the type of robot), activating/deactivating functions (e.g., UV treatment, sweeping, steam or liquid mopping, vacuuming, mowing, ploughing, salt distribution, fertilizer distribution, digging, and other functions depending on the type of robot), adjustments to movement path, adjustments to the division of the environment into subareas, and operation schedule, etc. In some embodiments, the processor may use a classifier such as a convolutional neural network to classify real-time sensor data of a location within the environment into different environmental characteristic classes such as driving surface types, room or area types, levels of debris accumulation, debris types, debris sizes, traffic level, obstacle density, human activity level, driving surface quality, and the like. In some embodiments, the processor may dynamically and in real-time adjust the speed of components of the robot based on the current environmental characteristics. Initially, the classifier may be trained such that it may properly classify sensor data to different environmental characteristic classes. In some embodiments, training may be executed remotely and trained model parameters may be downloaded to the robot, which is not to suggest that any other operation herein must be performed on the robot. The classifier may be trained by, for example, providing the classifier with training and target data that contains the correct environmental characteristic classifications of the sensor readings within the training data. For example, the classifier may be trained to classify electric current sensor data of a wheel motor into different driving surface types. For instance, if the magnitude of the current drawn by the wheel motor is greater than a particular threshold for a predetermined amount of time, the classifier may classify the current sensor data to a carpet driving surface type class (or other soft driving surface depending on the environment of the robot) with some certainty. In other embodiments, the processor may classify sensor data based on the change in value of the sensor data over a predetermined amount of time or using entropy. For example, the processor may classify current sensor data of a wheel motor into a driving surface type class based on the change in electrical current over a predetermined amount of time or entropy value. In response to predicting an environmental characteristic, such as a driving type, the processor may adjust the speed of components such that they are optimal for operating in an environment with the particular characteristics predicted, such as a predicted driving surface type. In some embodiments, adjusting the speed of components may include adjusting the speed of the motors driving the components. In some embodiments, the processor may also choose actions and/or settings of the robot in response to predicted (or measured or inferred) environmental characteristics of a location. In other examples, the classifier may classify distance sensor data, audio sensor data, or optical sensor data into different environmental characteristic classes (e.g., different driving surface types, room or area types, levels of debris accumulation, debris types, debris sizes, traffic level, obstacle density, human activity level, driving surface quality, etc.). 
     In some embodiments, the processor may use environmental sensor data from more than one type of sensor to improve predictions of environmental characteristics. Different types of sensors may include, but are not limited to, obstacle sensors, audio sensors, image sensors, TOF sensors, and/or current sensors. In some embodiments, the classifier may be provided with different types of sensor data and over time the weight of each type of sensor data in determining the predicted output may be optimized by the classifier. For example, a classifier may use both electrical current sensor data of a wheel motor and distance sensor data to predict driving type, thereby increasing the confidence in the predicted type of driving surface. In some embodiments, the processor may use thresholds, change in sensor data over time, distortion of sensor data, and/or entropy to predict environmental characteristics. In other instances, the processor may use other approaches for predicting (or measuring or inferring) environmental characteristics of locations within the environment. 
     In some instances, different settings may be set by a user using an application of a communication device (as described above) or an interface of the robot for different areas within the environment. For example, a user may prefer reduced impeller speed in bedrooms to reduce noise or high impeller speed in areas with soft floor types (e.g., carpet) or with high levels of dust and debris. As the robot navigates throughout the environment and sensors collect data, the processor may use the classifier to predict real-time environmental characteristics of the current location of the robot such as driving surface type, room or area type, debris accumulation, debris type, debris size, traffic level, human activity level, obstacle density, etc. In some embodiments, the processor assigns the environmental characteristics to a corresponding location of the map of the environment. In some embodiments, the processor may adjust the default speed of components to best suit the environmental characteristics of the location predicted. 
     In some embodiments, the processor may adjust the speed of components by providing more or less power to the motor driving the components. For example, for grass, the processor decreases the power supplied to the wheel motors to decrease the speed of the wheels and the robot and increases the power supplied to the cutting blade motor to rotate the cutting blade at an increased speed for thorough grass trimming. 
     In some embodiments, the processor may record all or a portion of the real-time decisions corresponding to a particular location within the environment in a memory of the robot. In some embodiments, the processor may mark all or a portion of the real-time decisions corresponding to a particular location within the map of the environment. For example, a processor marks the particular location within the map corresponding with the location of the robot when increasing the speed of wheel motors because it predicts a particular driving surface type. In some embodiments, data may be saved in ASCII or other formats to occupy minimal memory space. 
     In some embodiments, the processor may represent and distinguish environmental characteristics using ordinal, cardinal, or nominal values, like numerical scores in various dimensions or descriptive categories that serve as nominal values. For example, the processor may denote different driving surface types, such as carpet, grass, rubber, hardwood, cement, and tile by numerical categories, such as 1, 2, 3, 4, 5 and 6, respectively. In some embodiments, numerical or descriptive categories may be a range of values. For example, the processor may denote different levels of debris accumulation by categorical ranges such as 1-2, 2-3, and 3-4, wherein 1-2 denotes no debris accumulation to a low level of debris accumulation, 2-3 denotes a low to medium level of debris accumulation, and 3-4 denotes a medium to high level of debris accumulation. In some embodiments, the processor may combine the numerical values with a map of the environment forming a multidimensional map describing environmental characteristics of different locations within the environment, e.g., in a multi-channel bitmap. In some embodiments, the processor may update the map with new sensor data collected and/or information inferred from the new sensor data in real-time or after a work session. In some embodiments, the processor may generates an aggregate map of all or a portion of the maps generated during each work session wherein the processor uses the environmental characteristics of the same location predicted in each map to determine probabilities of each environmental characteristic existing at the particular location. 
     In some embodiments, the processor may use environmental characteristics of the environment to infer additional information such as boundaries between rooms or areas, transitions between different types of driving surfaces, and types of areas. For example, the processor may infer that a transition between different types of driving surfaces exists in a location of the environment where two adjacent cells have different predicted type of driving surface. In another example, the processor may infer with some degree of certainty that a collection of adjacent locations within the map with combined surface area below some threshold and all having hard driving surface are associated with a particular environment, such as a bathroom as bathrooms are generally smaller than all other rooms in an environment and generally have hard flooring. In some embodiments, the processor labels areas or rooms of the environment based on such inferred information. 
     In some embodiments, the processor may command the robot to complete operation on one type of driving surface before moving on to another type of driving surface. In some embodiments, the processor may command the robot to prioritize operating on locations with a particular environmental characteristic first (e.g., locations with high level of debris accumulation, locations with carpet, locations with minimal obstacles, etc.). In some embodiments, the processor may generate a path that connects locations with a particular environmental characteristic and the processor may command the robot to operate along the path. In some embodiments, the processor may command the robot to drive over locations with a particular environmental characteristic more slowly or quickly for a predetermined amount of time and/or at a predetermined frequency over a period of time. For example, a processor may command a robot to operate on locations with a particular driving surface type, such as hardwood flooring, five times per week. In some embodiments, a user may provide the above-mentioned commands and/or other commands to the robot using an application of a communication device paired with the robot or an interface of the robot. 
     In some embodiments, the processor of the robot determines an amount of coverage that it may perform in one work session based on previous experiences prior to beginning a task. In some embodiments, this determination may be hard coded. In some embodiments, a user may be presented (e.g., via an application of a communication device) with an option to divide a task between more than one work session if the required task cannot be completed in one work session. In some embodiments, the robot may divide the task between more than one work session if it cannot complete it within a single work session. In some embodiments, the decision of the processor may be random or may be based on previous user selections, previous selections of other users stored in the cloud, a location of the robot, historical cleanliness of areas within which the task is to be performed, historical human activity level of areas within which the task is to be performed, etc. For example, the processor of the robot may decide to perform the portion of the task that falls within its current vicinity in a first work session and then the remaining portion of the task in one or more other work sessions. 
     In some embodiments, the processor of the robot may determine to empty a bin of the robot into a larger bin after completing a certain square footage of coverage. In some embodiments, a user may select a square footage of coverage after which the robot is to empty its bin into the larger bin. In some cases, the square footage of coverage, after which the robot is to empty its bin, may be determined during manufacturing and built into the robot. In some embodiments, the processor may determine when to empty the bin in real-time based on at least one of: the amount of coverage completed by the robot or a volume of debris within the bin of the robot. In some embodiments, the processor may use Bayesian methods in determining when to empty the bin of the robot, wherein the amount of coverage may be used as a priori information and the volume of debris within the bin as posterior information or vice versa. In other cases, other information may be used. In some embodiments, the processor may predict the square footage that may be covered by the robot before the robot needs to empty the bin based on historical data. In some embodiments, a user may be asked to choose the rooms to be cleaned in a first work session and the rooms to be cleaned in a second work session after the bin is emptied. 
     A goal of some embodiments may be to reduce power consumption of the robot (or any other device). Reducing power consumption may lead to an increase in possible applications of the robot. For example, certain types of robots, such as robotic steam mops, were previously inapplicable for residential use as the robots were too small to carry the number of battery cells required to satisfy the power consumption needs of the robots. Spending less battery power on processes such as localization, path planning, mapping, control, and communication with other computing devices may allow more energy to be allocated to other processes or actions, such as increased suction power or heating or ultrasound to vaporize water or other fluids. In some embodiments, reducing power consumption of the robot increases the run time of the robot. In some embodiments, a goal may be to minimize the ratio of a time required to recharge the robot to a run time of the robot as it allows tasks to be performed more efficiently. For example, the number of robots required to clean an airport 24 hours a day may decrease as the run time of each robot increases and the time required to recharge each robot decreases as robots may spend more time cleaning and less time on standby while recharging. In some embodiments, the robot may be equipped with a power saving mode to reduce power consumption when a user is not using the robot. In some embodiments, the power saving mode may be implemented using a timer that counts down a set amount of time from when the user last provided an input to the robot. For example, a robot may be configured to enter a sleep mode or another mode that consumes less power than fully operational mode, when a user has not provided an input for five minutes. In some embodiments, a subset of circuitry may enter power saving mode. For example, a wireless module of a device may enter power saving mode when the wireless network is not being used while other modules may still be operational. In some embodiments, the robot may enter power saving mode while the user is using the robot. For example, a robot may enter power saving mode because while reading content on the robot, viewing a movie, or listening to music the user failed to provide an input within a particular time period. In some cases, recovery from the power saving mode may take time and may require the user to enter credentials. 
     Reducing power consumption may also increase the viability of solar powered robots. Since robots have a limited surface area on which solar panels may be fixed (proportional to the size of the robot), the limited number of solar panels installed may only collect a small amount of energy. In some embodiments, the energy may be saved in a battery cell of the robot and used for performing tasks. While solar panels have improved to provide much larger gain per surface area, economical use of the power gained may lead to better performance. For example, a robot may be efficient enough to run in real time as solar energy is absorbed thereby preventing the robot from having to be remain standby while batteries charge. Solar energy may also be stored for use during times when solar energy is unavailable or during times when solar energy is insufficient. In some cases, the energy may be stored on a smaller battery for later use. To accommodate scenarios wherein minimal solar energy is absorbed or available, it may be important that the robot carry less load and be more efficient. For example, the robot may operate efficiently by positioning itself in an area with increased light when minimal energy is available to the robot. In some embodiments, energy may be transferred wirelessly using a variety of radiative or far-field and non-radiative or near-field techniques. In some embodiments, the robot may use radiofrequencies available in ambiance in addition to solar panels. In some embodiments, the robot may position itself intelligently such that its receiver is optimally positioned in the direction of and to overlap with radiated power. In some embodiments, the robot may be wirelessly charged when parked or while performing a task if processes such as localization, mapping, and path planning require less energy. 
     In some embodiments, the robot may share its energy wirelessly (or by wire in some cases). For example, the robot may provide wireless charging for smart phones. In another example, there robot may provide wireless charging on the fly for devices of users attending an exhibition with limited number of outlets. In some embodiments, the robot may position itself based on the location of outlets within an environment (e.g., location with lowest density of outlets) or location of devices of users (e.g., location with highest density of electronic devices). In some embodiments, coupled electromagnetic resonators combined with long-lived oscillatory resonant modes may be used to transfer power from a power supply to a power drain. 
     In embodiments, there may be a trade-off between performance and power consumption. In some embodiments, a large CPU may need a cooling fan for cooling the CPU. In some embodiments, the cooling fan may be used for short durations when really needed. In some embodiments, the processor may autonomously actuate the fan to turn on and turn off (e.g., by executing computer code that effectuates such operations). In some instances, the cooling fan may be undesirable as it requires power to run and extra space and may create an unwanted humming noise. In some embodiments, computer code may be efficient enough to be executed on compact processors of controllers such that there is no need for a cooling fan, thus reducing power consumption. 
     In some embodiments, the processor may predict energy usage of the robot. In some embodiments, the predicted energy usage of the robot may include estimates of functions that may be performed by the robot over a distance traveled or an area covered by the robot. For example, if a robot is set to perform a steam mop for only a portion of an area, the predicted energy usage may allow for more coverage than the portion covered by the robot. In some embodiments, a predicted need for refueling may be derived from previous work sessions of the robot or from previous work sessions of other robots gathered over time in the cloud. In a point to point application, a user may be presented with a predicted battery charge for distances traveled prior to the robot traveling to a destination. In some embodiments, the user may be presented with possible fueling stations along the path of the robot and may alter the path of the robot by choosing a station for refueling (e.g., using an application or a graphical user interface on the robot). In a coverage application, a user may be presented with a predicted battery charge for different amounts of surface coverage prior to the robot beginning a coverage task. In some embodiments, the user may choose to divide the coverage task into smaller tasks with smaller surface coverage. The user input may be received at the beginning of the session, during the session, or not at all. In some embodiments, inputs provided by a user may change the behavior of the robot for the remaining of a work session or subsequent work sessions. In some embodiments, the user may identify whether a setting is to be applied one-time or permanently. In some embodiments, the processor may choose to allow a modification to take affect during a current work session, for a period of time, a number of work sessions, or permanently. In some embodiments, the processor may divide the coverage task into smaller tasks based on a set of cost functions. 
     In embodiments, the path plan in a point to point application may include a starting point and an ending point. In embodiments, the path plan in a coverage application may include a starting surface and an ending surface, such as rooms, or parts of rooms, or parts of areas defined by a user or by the processor of the robot. In some embodiments, the path plan may include addition information. For example, for a garden watering robot, the path plan may additionally consider the amount of water in a tank of the robot. The user may be prompted to divide the path plan into two or more path plans with a water refilling session planned in between. The user may also need to divide the path plan based on battery consumption and may need to designate a recharging session. In another example, the path plan of a robot that charges other robots (e.g., robots depleted of charge in the middle of an operation) may consider the amount of battery charge the robot may provide to other robots after deducting the power needed to travel to the destination and the closest charging points for itself. The robot may provide battery charge to other robots through a connection or wirelessly. In another example, the path plan of a fruit picking robot may consider the number of trees the robot may service before a fruit container is full and battery charge. In one example, the path plan of a fertilizer dispensing robot may consider the amount of surface area a particular amount of fertilizer may cover and fuel levels. A fertilizing task may be divided into multiple work sessions with one or more fertilizer refilling sessions and one or more refueling sessions in between. 
     In some embodiments, the processor of the robot may transmit information that may be used to identify problems the robot has faced or is currently facing. In some embodiments, the information may be used by customer service to troubleshoot problems and to improve the robot. In some embodiments, the information may be sent to the cloud and processed further. In some embodiments, the information may be categorized as a type of issue and processed after being sent the cloud. In some embodiments, fixes may be prioritized based on a rate of occurrence of the particular issue. In some embodiments, transmission of the information may allow for over the air updates and solutions. In some embodiments, an automatic customer support ticket may be opened when the robot faces an issue. In some embodiments, a proactive action may be taken to resolve the issue. For example, if a consumable part of the robot is facing an issue before the anticipated life time of the part, detection of the issue may trigger an automatic shipment request of the part to the customer. In some embodiments, a notification to the customer may be triggered and the part may be shipped at a later time. 
     In some embodiments, a subsystem of the robot may manage issues the robot faces. In some embodiments, the subsystem may be a trouble manager. For example, a trouble manager may report issues such as a disconnected RF communication channel or cloud. This information may be used for further troubleshooting, while in some embodiments, continuous attempts may be made to reconnect with the expected service. In some embodiments, the trouble manager may report when the connection is restored. In some embodiments, such actions may be logged by the trouble manager. In some embodiments, the trouble manager may report when a hardware component is broken. For example, a trouble manager may report when a charger integrated circuit is broken. 
     In some embodiments, a battery monitoring subsystem may continuously monitor a voltage of a battery of the robot. In some embodiments, a voltage drops triggers an event that instructs the robot to go back to a charging station to recharge. In some embodiments, a last location of the robot and areas covered by the robot are saved such that the robot may continue to work from where it left off. In some embodiments, back to back cleaning many be implemented. In some embodiments, back to back cleaning may occur during a special time. In some embodiments, the robot may charge its batteries up to a particular battery charge level that is required to finish an incomplete task instead of waiting for a full charge. In some embodiments, the second derivative of sequential battery voltage measurements may be monitored to discover if the battery is losing power faster than ordinary. In some embodiments, further processing may occur on the cloud to determine if there are certain production batches of batteries or other hardware that show fault. In such cases, fixes may be proactively announced or implemented. 
     In some embodiments, the processor of the robot may determine a location and direction of the robot with respect to a charging station of the robot by emitting two or more different IR codes using different presence LEDs. In some embodiments, a processor of the charging station may be able to recognize the different codes and may report the receiving codes to the processor of the robot using RF communication. In some embodiments, the codes may be emitted by Time Division Multiple Access (i.e., different IR emits codes one by one). In some embodiments, the codes may be emitted based on the concept of pulse distance modulation. In some embodiments, various protocols, such as NEC IR protocol, used in transmitting IR codes in remote controls, may be used. Standard protocols such as NEC IR protocol may not be optimal for all applications. For example, each code may contain an 8 bits command and an 8 bits address giving a total of 16 bits, which may provide 65536 different combinations. This may require 108 ms and if all codes are transmitted at once 324 ms may be required. In some embodiments, each code length may be 18 pulses of 0 or 1. In some embodiments, two extra pulses may be used for the charging station MCU to handle the code and transfer the code to the robot using RF communication. In some embodiments, each code may have 4 header high pulses and each code length may be 18 pulses (e.g., each with a value of 0 or 1) and two stop pulses (e.g., with a value of 0). In some embodiments, a proprietary protocol may be used, including a frequency of 56 KHz, a duty cycle of ⅓, 2 code bits, and the following code format: Header High: 4 high pulses, i.e., {1, 1, 1, 1}; Header Low: 2 low pulses, i.e., {0, 0}; Data: logic‘0’is 1 high pulse followed by 1 low pulse; logic‘1’is 1 high pulse followed by 3 low pulses; After data, follow by Logic inverse(2&#39;s complementary); End: 2 low pulses, i.e., {0, 0}, to let the charging station have enough time to handle the code. An example using a code 00 includes: {/Header High/1, 1, 1, 1; /Header Low/0, 0; /Logic‘0’/1, 0; /Logic‘0’/1, 0; /Logic‘1’,‘1’,2&#39;s complementary/1, 0, 0, 0, 1, 0, 0, 0; /End/0, 0}. In some embodiments, the pulse time may be a fixed value. For example, in a NEC protocol, each pulse duration may be 560 us. In some embodiments, the pulse time may be dynamic. For example, a function may provide the pulse time (e.g., cBitPulseLengthUs). 
     In some embodiments, permutations of possible code words may be organized in an ‘enum’ data structure. In one implementation, there may be eight code words in the enum data structure arranged in the following order: No Code, Code Left, Code Right, Code Front, Code Side, Code Side Left, Code Side Right, Code All. Other number of code words may be defined as needed in other implementations. Code Left may be associated with observations by a front left presence LED, Code Right may be associated with observations by a front right presence LED, Code Front may be associated with observations by front left and front right presence LEDs, Code Side may be associated with observations by any, some, or all side LEDs, and Code Side Left may be associated with observations by front left and side presence LEDs. In some embodiments, there may be four receiver LEDs on the dock that may be referred to as Middle Left, Middle Right, Side Left, and Side Right. In other embodiments, one or more receivers may be used. 
     In some embodiments, the processor of the robot may define a default constructor, a constructor given initial values, and a copy constructor for proper initialization and a de-constructor. In some embodiments, the processor may execute a series of Boolean checks using a series of functions. For example, the processor may execute a function ‘isFront’ with a Boolean return value to check if the robot is in front of and facing the charging station, regardless of distance. In another example, the processor may execute a function ‘isNearFront’ to check if the robot is near to the front of and facing the charging station. In another example, the processor may execute a function ‘isFarFront’ to check if the robot is far from the front of and facing the charging station. In another example, the processor may execute a function ‘isInSight’ to check if any signal may be observed. In other embodiments, other protocols may be used. A person of the art will know how to advantageously implement other possibilities. In some embodiments, inline functions may be used to increase performance. 
     In some embodiments, the robot may collaborate with the other intelligent devices within the environment. In some embodiments, data acquired by other intelligent devices may be shared with the robot and vice versa. For example, a user may verbally command a robot positioned in a different room than the user to bring the user a phone charger. A home assistant device located within the same room as the user may identify a location of the user using artificial intelligence methods and may share this information with the robot. The robot may obtain the information and devise a path to perform the requested task. In some embodiments, the robot may collaborate with one or more other robot to complete a task. For example, two robots, such as a robotic vacuum and a robotic mop collaborate to clean an area simultaneously or one after the other. In some embodiments, the processors of collaborating robots may share information and devise a plan for completing the task. In some embodiments, the processors of robots collaborate by exchanging intelligence with one other, the information relating to, for example, current and upcoming tasks, completion or progress of tasks (particularly in cases where a task is shared), delegation of duties, preferences of a user, environmental conditions (e.g., road conditions, traffic conditions, weather conditions, obstacle density, debris accumulation, etc.), battery power, maps of the environment, and the like. For example, a processor of a robot may transmit obstacle density information to processors of nearby robots with whom a connection has been established such that the nearby robots can avoid the high obstacle density area. In another example, a processor of a robot unable to complete garbage pickup of an area due to low battery level communicates with a processor of another nearby robot capable of performing garbage pickup, providing the robot with current progress of the task and a map of the area such that it may complete the task. In some embodiments, processors of robots may exchange intelligence relating to the environment (e.g., environmental sensor data) or results of historical actions such that individual processors can optimize actions at a faster rate. In some embodiments, processors of robots collaborate to complete a task. In some embodiments, robots collaborate using methods such as those described in U.S. patent application Ser. Nos. 15/981,643, 14/948,620, 15/986,670, 16/418,988, and 15/048,827, the entire contents of which are hereby incorporated by reference. In some embodiments, a control system may manage the robot or a group of collaborating robots. For example,  FIG.  114 A  illustrates a collaborating trash bin robots  11400 ,  11401 , and  11402 . Trash bin robot  11400  transmits a signal to a control system indicating that its bin is full and requesting another bin to replace its position. The control system may deploy an empty trash bin robot to replace the position of full trash bin robot  11400 . In other instances, processors of robots may collaborate to determine replacement of trash bin robots.  FIG.  114 B  illustrates empty trash bin robot  11403  approaching full trash bin robot  11400 . Processors of trash bin robot  11403  and  11400  may communicate to coordinate the swapping of their positions, as illustrated in  FIG.  114 C , wherein trash bin robot  11400  drives forward while trash bin robot  11403  takes its place.  FIG.  114 D  illustrates full trash bin robot  11400  driving into a storage area for full trash bin robots  11404  ready for emptying and cleaning and empty trash bin robots  11405  ready for deployment to a particular position. Full trash bin robot  11400  parks itself with other full trash bin robots  11404 . Details of a control system that may be used for managing robots is disclosed in U.S. patent application Ser. No. 16/130,880, the entire contents of which is hereby incorporated by reference. 
     In some embodiments, processors of robots may transmit maps, trajectories, and commands to one another. In some embodiments, a processor of a first robot may transmit a planned trajectory to be executed within a map previously sent to a processor of a second robot. In some embodiments, processors of robot may transmit a command, before or after executing a trajectory, to one another. For example, a first robot vehicle may inform an approaching second robot vehicle that it is planning to back out and leave a parallel parking space. It may be up to the second robot vehicle to decide what action to take. The second robot vehicle may decide to wait, drive around the first robot vehicle, accelerate, or instruct the first robot vehicle to stop. In some embodiments, a processor of a first robot may inform a processor of a second robot that it has completed a task and may command the second robot to begin a task. In some embodiments, a processor of a first robot may instruct a processor of a second robot to perform a task while following a trajectory of the first robot or may inform the processor of the first robot of a trajectory which may trigger the second robot to follow the trajectory of the first robot while performing a task. For example, a processor of a first robot may inform a processor of a second robot of a trajectory for execution while pouring asphalt and in response the second robot may follow the trajectory. In some embodiments, processors of robots may transmit current, upcoming, or completed tasks to one another, which, in some cases, may trigger an action upon receipt of a task update of another robot. For example, a processor of a first robot may inform a processor of a second robot of an upcoming task of cleaning an area of a first type of airline counter and the processor of the second robot may decide to clean an area of another type of airline counter, such that the cleaning job of all airline counters may be divided. In some embodiments, processors of robot may inform one another after completing a trajectory or task, which, in some cases, may trigger another robot to begin a task. For example, a first robot may inform a home assistant that it has completed a cleaning task. The home assistant may transmit the information to another robot, which may begin a task upon receiving the information, or to an application of a user which may then use the application to instruct another robot to begin a task. 
     In some instances, the robot and other intelligent devices may interact with each other such that events detected by a first intelligent device influences actions of a second intelligent device. In some embodiments, processor of intelligent devices may use Bayesian probabilistic methods to infer conclusions. For example, a first intelligent device may detect a user entering into a garage by identifying a face of the user with a camera, detecting a motion, detecting a change of lighting, detecting a pattern of lighting, or detecting opening of the garage door. The processor of the first intelligent device may communicate the detection of the user entering the house to processors of other intelligent devices connected through a network. The detection of the user entering the house may lead a processor of a second intelligent device to trigger an actuation or deduct more observation. An actuation may include adjusting a light setting, a music setting, a microwave setting, a security-alarm setting, a temperature setting, a window shading setting, or playing the continuum of the music the user is currently listening to in his/her car. In another example, an intelligent carbon monoxide and fire detector may detect carbon monoxide or a fire and may share this information with a processor of a robot. In response, the processor of the robot may actuate the robot to approach the source of the fire to use or bring a fire extinguisher to the source of the fire. The processor of the robot may also respond by alarming a user or an agency of the incident. In some cases, further information may be required by the processor of the robot prior to making a decision. The robot may navigate to particular areas to capture further data of the environment prior to making a decision. 
     In some embodiments, all or a portion of artificial intelligence devices within an environment, such as a smart home, may interact and share intelligence such that collective intelligence may be used in making decisions. For example,  FIG.  115    illustrates the collection of collaborative artificial intelligence that may be used in making decisions related to the lighting within a smart home. The devices that may contribute to sensing and actuation within the smart home may include a Wi-Fi router connecting to gateway (e.g., WAN), Wi-Fi repeater devices, control points (e.g., applications, user interfaces, wall switches or control points such as turn on or off and dim, set heat temporarily or permanently, and fan settings), sensors for sensing inside light, outside light, and sunlight. In some cases, a sensor of the robot may be used to sense inside and outside light and sunlight and the location of the light sensed by the robot may be determined based on localization of the robot. In some cases, the exact location of the house may be determined using location services on the Wi-Fi router or the IP address or a GPS of the robot. Actuations of the smart house may include variable controllable air valves of the HVAC system, HVAC system fan speed, controllable air conditioning or heaters, and controllable window tinting. In some embodiments, a smart home (or other smart environment) may include a video surveillance camera for streaming data and power over Ethernet LED fixtures. In embodiments, collective artificial intelligence technology (CAIT) may be applied to various types of robots, such as robot vacuums, personal passenger pods with or without a chassis, and an autonomous car. For example, an autonomous battery-operated car may save power based on optimal charging times, learning patterns in historical travel times and distances, expected travels, battery level, and cost of charging. In one case, the autonomous car may arrive at home 7 PM with an empty battery and given that the user is not likely to leave home after 7 PM, may determine how much charge to provide the car with using expensive electricity in the evening (evening) and cheaper electricity (daytime) during the following day and how much charge to attempt to obtain from sunlight the following morning. The autonomous vehicle may consider factors such as what time the user is likely to need the autonomous car (e.g., 8, 10, or 12 PM or after 2 PM since it is the weekend and the user is not likely to use the car until late afternoon). CAIT may be employed in making decisions and may save power consumption by deciding to obtain a small amount of charge using expensive electricity given that there is a small chance of an emergency occurring at 10 PM. In some cases, the autonomous car may always have enough battery charge to reach an emergency room. Or the autonomous car may know that the user needs to run out around 8:30 PM to buy something from a nearby convenience store and may consider that in determining how and when to charge the autonomous car. In another example, CAIT may be used in hybrid or fuel-powered cars. CAIT may be used in determining and suggesting that a user of the car fill up gas at the gas station approaching at it has cheaper gas than the gas station the user usually fuels up at. For instance, CAIT may determine that the user normally buys gas somewhere close to work, that the user is now passing a gas station that is cheaper than the gas the user usually buys, that the car currently has a quarter tank of fuel, that the user is two minutes from home, that the user currently has 15 minutes of free time in their calendar, and that the lineup at the cheaper gas station is 5 minutes which is not more than the average wait time the user is used to. Based on these determinations CAIT may be used in determining if the user should be notified or provided with the suggestion to stop at the cheaper gas station for fueling. 
     In some embodiments, transportation sharing services, food delivery services, online shopping delivery services, and other types of services may employ CAIT. For example, delivery services may employ CAIT in making decisions related to temperature within the delivery box such that the temperature is suitable based on the known or detected item within the box (e.g., cold for groceries, warm for pizza, turn off temperature control for a book), opening the box (e.g., by the delivery person or robot), and authentication (e.g., using previously set public key infrastructure system, the face of the person standing at the door, standard identification including name and/or picture). In some embodiment, CAIT may be used by storage devices, such as fridge. For example, the fridge (or control system of a home for example) may determine if there is milk or not, and if there is no milk and the house is detected to have children (e.g., based on sensor data from the fridge or another collaborating device), the fridge may conclude that travel to a nearby market is likely. In one case, the fridge may determine whether it is fill or empty and may conclude that a grocery shop may occur soon. The fridge may interface with a calendar of the owner stored on a communication device to determine possible times the owner may grocery shop within the next few days. If both Saturday and Sunday have availability, the fridge may determine on which day the user has historically gone grocery shopping and at what time? In some cases, the user may be reminded to go grocery shopping. In some cases, CAIT may be used in determining whether the owner would prefer to postpone bulk purchases and buy from a local super market during the current week based on determining how much would the user may lose by postponing the trip to a bulk grocery store, what and how much food supplies the owner has and needs and how much it costs to purchase the required food supplies from the bulk grocery store, an online grocery store, a local grocery store, or a convenience store. In some cases, CAIT may be used in determining if the owner should be notified that their groceries would cost $45 if purchased at the bulk grocery store today, and that they have a two hour window of time within which they may go to the bulk grocery store today. In one case, CAIT may be used in determining if it should display the notification on a screen of a device of the owner or if it should only provide a notification if the owner can save above a predetermined threshold or if the confidence of the savings is above a predetermined threshold. 
     In another example, CAIT may be used in determining the chances of a user arriving at home at 8 PM and if the user would prefer the rice cooker to cook the rice by 8:10 PM or if the user is likely to take a shower and would prefer to have the rice cooked 8:30 PM which may be based on further determining how much energy would be spent to keep the rice warm, how much preference the user has for freshly cooked food (e.g., 10 or 20 minutes), and how mad the user may be if they were expecting to eat immediately and the food was not prepared until 8:20 PM as a result of assuming that the user was going to take a shower. In one example, CAIT may be used in monitoring activity of devices. For example, CAIT may be used in determining that a user did not respond to a few missed calls from their parents throughout the week. If the user and their parents each have 15 minute time window in their schedule, and the user is not working or typing (e.g., determines based on observing key strokes on a device), and the user is in a good mood (as attention and emotions may be determined by CAIT) a suggestion may be provided to the user to call their parents. If the user continuously postpones calling their parents and their parents have health issues, continues suggestions to call their parents may be provided. In another example, CAIT may be employed to autonomously make decisions for users based on (e.g., inferred from) logged information of the users. In embodiments, users may control which information may be logged and which decisions the CAIT system may make on their behalf. For example, a database may store, for a user, voice data usage, total data usage, data usage on a cell phone, data usage on a home LAN, wireless repeating usage, cleaning preferences for a cleaning robot, cleaning frequency of a cleaning robot, cleaning schedules of a cleaning robot, frequency of robot taking the garbage out, total kilometers of usage of a passenger pod during a particular time period, weekly frequency of using a passenger pod and chassis, data usage while using the pod, monthly frequency of grocery shopping, monthly frequency of filling gas at a particular gas station, etc. In this example, all devices are connected in an integrated system and all intelligence of devices in the integrated system is collaboratively used to make decisions. For example, CAIT may be used to decide when to operate a cleaning robot of a user or to provide the user with a notification to grocery shop based on inferences made using the information stored in the database for the user. In some embodiments, devices of user and devices available to the public (e.g., smart gas pump, robotic lawn mower, or service robot) may be connected in an integrated system. In some embodiments, the user may request usage or service of an unowned device and, in some cases, the user may pay for the usage or service. In some cases, payment is pay as you go. For example, a user may request a robotic lawn mower to mow their lawn every Saturday. The CAIT system may manage the request, deployment of a robotic lawn mower to the home of the user, and payment for the service. 
     CAIT may be employed in making smart decisions based on collective artificial intelligence of its environment. CAIT may use a complex network of AI systems and devices to derive conclusions. In some cases, there may be manual settings and the manual settings may influence decisions made (e.g., the level of likelihood of saving at least a predetermined amount of money that should trigger providing a suggestion to the user). 
     In embodiments, robots may communicate using various types of networks. In embodiments, wireless networks may have various categorizations such as wireless local area network (WLAN) and personal-area network (WPAN). In embodiments, a WLAN may operate in the 2.4 or 5 GHz spectrum and may have a range up to 100 m. In a WLAN, a dual-band wireless router may be used to connect laptops, desktops, smart home assistants, robots, thermostats, security systems, and other devices. In some embodiments, a WLAN may provide mobile clients access to network resources, such as wireless print servers, presentation servers, and storage devices. In embodiments, a WPAN may operate in the 2.4 GHz spectrum. An example of a WPAN may include Bluetooth. In some embodiments, Bluetooth devices, such as headsets and mice, may use Frequency Hopping Spread Spectrum (FHSS). In some embodiments, Bluetooth piconets may consist of up to eight active devices but may have several inactive devices. In some embodiments, Bluetooth devices may be standardized by the 802.15 IEEE standard. A wireless metropolitan area network (WMAN) and a wireless wide-area network (WWAN) are other types of network. In embodiments, a WMAN may covers a large geographic area and may be used as backbone services, point-to-point, or point-to-multipoint links. In embodiments, a WWAN may cover a large geography such as a cellular service and may be provided by a wireless service provider. 
     In some embodiments, the wireless networks used by collaborating robots for wireless communication may rely on the use of a wireless router. In some embodiments, the wireless router (or the robot or any other network device) may be half duplex or full duplex, wherein full duplex allows both parties to communicate with each other simultaneously and half duplex allows both parties to communicate with each other, but not simultaneously. In some embodiments, the wireless router may have the capacity to act as a network switch and create multiple subnets or virtual LANs (VLAN), perform network address translation (NAT), or learn MAC addresses and create MAC tables. In some embodiments, a robot may act as a wireless router and may include similar abilities as described above. In some embodiments, a Basic Service Area (BSA) of the wireless router may be a coverage area of the wireless router. In some embodiments, the wireless router may include an Ethernet connection. For example, the Ethernet connection may bridge the wireless traffic from the wireless clients of a network standardized by the 802.11 IEEE standard to the wired network on the Ethernet side, standardized by the 802.3 IEEE standard, or to the WAN through a telecommunication device. In some embodiments, the wireless router may be the telecommunication device. 
     In some embodiments, the wireless router may have a Service Set Identifier (SSID), or otherwise a network name. In some embodiments, the SSID of a wireless router may be associated with a MAC address of the wireless router. In some cases, the SSID may be a combination of the MAC address and a network name. When the wireless router offers service for only one network, the SSID may be referred to as a basic SSID (BSSID) and when the wireless router allows multiple networks through the same hardware, the SSID may be referred to as a Multiple BSSID (MBSSID). 
     In some embodiments, the environment of the robots and other network devices may include more than one wireless router. In some embodiments, robots may be able to roam and move from one wireless router to another. This may useful in larger areas, such as an airport, or in a home when cost is not an issue. In some embodiments, the processor of a robot may use roaming information, such as the wireless router with which it may be connected, in combination with other information to localize the robot. In some embodiments, robots may be able to roam from a wireless router with a weak signal to a wireless router with a strong signal. In some embodiments, there may be threshold that must be met prior to roaming from one wireless router to another or a constant monitoring may be used. In some embodiments, the processor of a robot may know the availability of wireless routers based on the location of the robot determined using SLAM. In some embodiments, the robots may intelligently arrange themselves to provide coverage when one or more of the wireless routers are down. In embodiments, the BSA of each wireless router must overlap and the wireless routers must have the same SSID for roaming to function. For example, as a robot moves it may observe the same SSID while the MAC address changes. In some embodiments, the wireless routers may operate on different channels or frequency ranges that do not overlap with one another to prevent co-channel interference. In some cases, this may be challenging as the 2.4 GHz spectrum on which the network devices may operate includes only three non-overlapping channels. In some embodiments, an Extended Service Set (ESS) may be used, wherein multiple wireless networks may be used to connect clients. 
     In some embodiments, robots (and other network devices) may communicate through two or more linked LANs. In some embodiments, a wireless bridge may be used to link two or more LANs located within some distance from one other. In embodiments, bridging operates at layer 2 as the LANs do not route traffic and do not have a routing table. In embodiments, bridges be useful in connecting remote sites, however, for a point-to-multipoint topology, the central wireless device may experience congestion as each device on an end must communicate with other devices through the central wireless device. In some embodiments, a mesh may alternatively be used, particularly when connectivity is important, as multiple paths may be used for communication. Some embodiments may employ the 802.11s IEEE mesh standard. In some embodiments, a mesh network may include some nodes (such as network devices) connected to a wired network, some nodes acting as repeaters, some nodes operating in layer 2 and layer 3, some stationary nodes, some mobile nodes, some roaming and mobile nodes, some nodes with long distance antennas, and some nodes with short distance antennas and cellular capability. In some embodiments, a mesh node may transmit data to nearby nodes or may prune data intelligently. In some embodiments, a mesh may include more than one path for data transmission. In some embodiments, a special algorithm may be used to determine the best path for transmitting data from one point to another. In some embodiments, alternative paths may be used when there is congestion or when a mesh node goes down. In some embodiments, graph theory may be used to manage the paths. In some embodiments, special protocols may be used to control loops when they occur. For example, at layer 2 a spanning tree protocol may be used and at layer 3 IP header TTL may be used. 
     In some embodiments, robots (and other network devices) may communicate by broadcasting packets. For example, a robot in a fleet of robot may broadcast packets and everyone in the fleet of robots may receive the packets. In some embodiments, robots (and other network devices) may communicate using multicast transmission. A unicast transmission may include sending packets to a single recipient on a network, whereas multicast transmission may include sending packets to a group of devices on a network. For example, a unicast may be started for a source to stream data to a single destination and if the stream needs to reach multiple destinations concurrently, the stream may be sent to a valid multicast IP address ranging between 224.0.0.0 and 239.255.255.255. In embodiments, the first octet (224.xxx.xxx.xxx) of the multicast IP address range may be reserved for administration. In some embodiments, multicast IP addresses may be identified by the prefix bit pattern of 1110 in the first four bits of the first octet, and belong to a group of addresses designated as Class D. The multicast IP addresses ranging between 224.0.0.0 and 239.255.255.255 are divided into blocks, each assigned a specific purpose or behavior. For example, the range of 224.0.0.0 through 224.0.0.255, known to be the Local Network Control Block is used by network protocols on a local subnet segment. Packets with an address in this range are local in scope and are transmitted with a Time To Live (TTL) of 1 so that they go no farther than the local subnet. Or the range of 224.0.1.0 through 224.0.1.255 is the Inter-Network Control Block. These addresses are similar to the Local Network Control Block except that they are used by network protocols when control messages need to be multicast beyond the local network segment. Other blocks may be found on IANA. Some embodiments may employ 802.2 IEEE standards on transmission of broadcast and multicast packets. For example, bit 0 of octet 0 of a MAC address may indicate whether the destination address is a broadcast/multicast address or a unicast address. Based on the value of bit 0 of octet 0 of the MAC address, the MAC frame may be destined for either a group of hosts or all hosts on the network. In embodiments, the MAC destination address may be the broadcast address 0xFFFF.FFFF.FFFF. 
     In some embodiments, layer 2 multicasting may be used to transmit IP multicast packets to a group of hosts on a LAN. In some embodiments, 23 bits of MAC address space may be available for mapping a layer 3 multicast IP address into a layer 2 MAC address. Since the first four bits of a total of 32 bits of all layer 3 multicast IP addresses are set to 0x1110, 28 bits of meaningful multicast IP address information is left. Since all 28 bits of the layer 3 IP multicast address information may not be mapped into the available 23 bits of the layer 2 MAC address, five bits of address information are lost in the process of mapping, resulting in a 32:1 address ambiguity. In embodiments, a 32:1 address ambiguity indicates that each multicast MAC address can represent 32 multicast IP addresses, which may cause potential problems. For example, devices subscribing to the multicast group 224.1.1.1 may program their hardware to interrupt the CPU when a frame with a destination multicast MAC address of 0x0100.5E00.0101 is received. However, this multicast MAC address may be concurrently used for 31 other multicast IP groups. If any of these 31 other IP groups are also active on the same LAN, the CPU of the device may receive interrupts when a frame is received for any of these other IP groups. In such cases, the CPU must examine the IP portion up to layer 3 of each received frame to determine if the frame is from the subscribed group 224.1.1.1. This may affect the CPU power available to the device if the number of false positives from unsubscribed group traffic is high enough. 
     In some embodiments, rendezvous points may be used to manage multicast, wherein unicast packets may be sent up to the point of subscribers. In some embodiments, controlling IP multicast traffic on WAN links may be important in avoiding saturation of low speed links by high rate groups. In some embodiments, control may be implemented by deciding who can send and receive IP multicast. In some embodiments, any multicast source may send to any group address and any multicast client may receive from any group despite geography. In some embodiments, administrative or private address space may be used within an enterprise unless multicast traffic is sourced to the Internet. 
     In some embodiments, the robot may be coupled with other smart devices (such as robots, home assistants, cell phones, tablets, etc.) via one or more networks (e.g., wireless or wired). For example, the robot and other smart devices may be in communication with each other over a local area network or other types of private networks, such as a Bluetooth connected workgroup or a public network (e.g., the internet or cloud). In some embodiments, the robot may be in communication with other devices, such as servers, via the internet. In some embodiments, the robot may capture information about its surrounding environment, such as data relating to spatial information, people, objects, obstacles, etc. In some embodiments, the robot may receive a set of data or commands from another robot, a computing device, a content server, a control server, or any combination thereof located locally or remotely with respect to the robot. In some embodiments, storage within the robot may be provisioned for storing the set of data or commands. In some embodiments, the processor of the robot may determine if the set of data relates to other robots, people, network objects, or some combination thereof and may select at least one data or command from the set of data or commands. In some embodiments, the robot may receive the set of data or commands from a device external to a private network. In some embodiments, the robot may receive the set of data or commands from a device external to the private network although the device is physically adjacent to the robot. For example, a smart phone may be connected to a Wi-Fi local network or a cellular network. Information may be sent from the smart phone to the robot through an external network although the smart phone is in the same Wi-Fi local network as the robot. In some embodiments, the processor of the robot may offload some of the more process or power intensive tasks to other devices in a network (e.g., local network) or on the cloud or to its own additional processors (if any). 
     In some embodiments, each network device may be assigned an IP or device ID from a local gateway. In some embodiments, the local gateway may have a pool of IP addresses configured. In some cases, the local gateway may exclude a few IP addresses from that range as they may be assigned to other pools, some devices may need a permanent IP, or some IP addresses in the continuous address space may have been previously statically assigned. When an IP is assigned (or otherwise leased), additional information may also be assigned. For example, default gateway, domain name, a TFTP server, an FTP server, an NTP server, DNS sever, or a server from which the device may download most updates for its firmware, etc. For example, a robot may download its clock from an NTP server or have the clock manually adjusted by the user. The robot may detect its own time zone, detect daylight time savings based on the geography, and other information. Any of this information may be manually set as well. In some cases, there may be one or more of each server and the robot may try each one. For example, assigned information of an IP lease may include network 192.168.101.0/24, default router 192.168.101.1, domain name aiincorporated.com, DNS server 192.168.110.50, TFTP server 192.168.110.19, and lease time 6 hours. In some embodiments, language support may be included in the IP lease or may be downloaded from a server (e.g., TFTP server). Examples of languages supported may include English, French, German, Russian, Spanish, Italian, Dutch, Norwegian, Portuguese, Danish, Swedish, and Japanese. In some embodiments, a language may be detected and in response the associated language support may be downloaded and stored locally. If the language support is not used from a predetermined amount of time it may be automatically removed. In some embodiments, a TFTP server may store a configuration file for each robot that each robot may download to obtain the information they need. In some cases, there may be files with common settings and files with individual settings. In some embodiments, the individual settings may be defined based on location, MAC address, etc. In some embodiments, a dynamic host configuration protocol (DHCP), such as DHCP option  150 , may be used to assign IP addresses and other network parameters to each device on the network. In some cases, a hacker may spoof the DHCP server to set up a rogue DHCP server and respond to DHCP requests from the robot. This may be simultaneously performed with a DHCP starvation attack wherein the victim server does not have any new IP addresses to give out, thereby raising the chance of the robot using the rouge DHCP server. Such cases may lead to the robot downloading bad firmware and may be compromised. In order to alleviate these problems, a digital signature may be used. In some embodiments, the robot refrains from installing firmware that is not confirmed to have come from a safe source. 
       FIG.  116    illustrates an example of a network of electronic devices including robots, cell phones, home assistant device, computer, tablet, smart appliance (i.e., fridge), and robot control units (e.g., charging station) within an environment, at least some which may be connected to a cellular or Wi-Fi network. Other examples of devices that may be part of a wireless network (or a wired LAN or other network) may include Internet, file servers, printers, and other devices. In some embodiments, the communication device prefers to connect to a Wi-Fi network when available and uses a cellular network when a Wi-Fi network is unavailable. In one case, the communication device may not be connected to a home Wi-Fi network and a cellular network may be used. In another case, the communication device may be connected to a home Wi-Fi, however, some communication devices may have a cellular network preference. In some embodiments, preference may be by design. In some embodiments, a user may set a preference in an application of the communication device or within the settings of the communication device. In  FIG.  116   , the robots are not directly connected to the LAN while the charging stations are. In one case, the processor of the robot does not receive an IP address and uses an RF communication protocol. In a second case, the processor of the robot receives an IP address but from a different pool than the wireless router distributes. The IP address may not be in a same subnet as the rest of the LAN. In some cases, the charging station may act as a wireless router and provide an IP address to the processor of the robot.  FIGS.  117 A and  117 B  illustrate examples of a connection path  11700  for devices via the cloud. In  FIG.  117 A  the robot control unit 1 is connected to cell phone 1 via the cloud. In this case, cell phone 1 is connected to the cloud via the cellular network while the robot control unit 1 is connected to the cloud via the Wi-Fi network. In  FIG.  117 B  the robot control unit 1 is connected to cell phone 2 via the cloud. In this case, cell phone 2 and robot control unit 1 are connected to the cloud via the Wi-Fi network.  FIG.  118    illustrates an example of a LAN connection path  11800  between cell phone 2 and robot control unit 1 via the wireless router. For a LAN connection path, costs may be reduced as payment to an internet service provider is not required. However, some services, such as services of a home assistant (e.g., Alexa) or cloud enhancements that may be used with mapping, may not be available.  FIG.  119    illustrates a direct connection path  11900  between cell phone 2 and robot control unit 1. In some instances, a direct connection path between devices may be undesirable as the devices may be unable to communicate with other devices in the LAN during the direct connection. For example, a smart phone may not be able to browse the internet during a direct connection with another device. In some instances, a direct connection between devices may be temporarily used. For example, a direct connection between devices may be used during set up of the robot to create an initial communication between a communication device or a charging station and the robot such that the processor of the robot may be provided an SSID that may be used to initially join the LAN. In some embodiments, each device may have its own IP address and communication between devices may be via a wireless router positioned between the devices.  FIG.  120    illustrates a connection path  12000  between robot 3 and cell phone 2 via the router. In such cases, there may be no method of communication if the wireless router becomes unavailable. Furthermore, there may be too many IP addresses used. In some embodiments, a variation of this example may be employed, wherein the robot may connect to the LAN while the charging station may connect to the internet through an RF communication method. 
     In some embodiments, the processor of a robot may transmit an initial radio broadcast message to discover other robots (or electronic devices) capable of communication within the area. In some embodiments, the processor of the robot may discover the existence of another robot capable of communication based on a configuration the processor of the robot performs on the other robot or a command input provided to a graphical user interface. In some embodiments, robots may use TCP/IP for communication. In some embodiments, communication between robots may occur over a layer two protocol. In some embodiments, the robot possesses a MAC address and in some embodiments the processor of the robot transmits the MAC address to other robots or a wireless router. In some embodiments, the processor of a charging station of the robot may broadcast a message to discover other Wi-Fi enabled devices, such as other robots or charging stations capable of communication within the area. In some embodiments, a robot endpoint device may operate within a local area network. In some embodiments, the robot may include a network interface card or other network interface device. In some embodiments, the robot may be configured to dynamically receive a network address or a static network address may be assigned. In some embodiments, the option may be provided to the user through an application of a communication device. In some embodiments, in dynamic mode, the robot may request a network address through a broadcast. In some embodiments, a nearby device may assign a network address from a pre-configured pool of addresses. In some embodiments, a nearby device may translate the network address to a global network address or may translate the network address to another local network address. In some embodiments, network address translation methods may be used to manage the way a local network communicates with other networks. In some embodiments, a DNS name may be used to assign a host name to the robot. 
     In some embodiments, each wireless client within a range of a wireless router may advertise one or more SSID (e.g., each smart device and robot of a smart home). In some embodiments, two or more networks may be configured to be on different subnets and devices may associate with different SSIDs, however, a wireless router that advertises multiple SSIDs uses the same wireless radio. In some embodiments, different SSIDs may be used for different purposes. For example, one SSID may be used for a network with a different subnet than other networks and that may be offered to guest devices. Another SSID may be used for a network with additional security for authenticated devices of a home or office and that places the devices in a subnet. In some embodiments, the robot may include an interface which may be used to select a desired SSID. In some embodiments, an SSID may be provided to the robot by entering the SSID into an application of a communication device (e.g., smart phone during a pairing process with the communication device). In some embodiments, the robot may have a preferred network configured or a preferred network may be chosen through an application of a communication device after a pairing process. In some embodiments, configuration of a wireless network connection may be provided to the robot using a paired device such as a smart phone or through an interface of the robot. In some embodiments, the pairing process between the robot and an application of a communication device may require the communication device, the robot, and a wireless router to be within a same vicinity. In some embodiments, a button of the robot may be pressed to initiate the pairing process. In some embodiments, holding the button of the robot for a few seconds may be required to avoid accidental changes in robot settings. In some embodiments, an indicator (e.g., a light, a noise, vibration, etc.) may be used to indicate the robot is in pairing mode. For example, LEDs positioned on the robot may blink to indicate the robot is in pairing mode. In some embodiments, the application of the communication device may display a button that may be pressed to initiate the pairing process. In some embodiments, the application may display a list of available SSIDs. In some embodiments, a user may use the application to manually enter an SSID. In some embodiments, the pairing process may require that the communication device activate location services such that available SSIDs within the vicinity may be displayed. In some embodiments, the application may display an instruction to activate location services when a global setting on the OS of the communication device has location services deactivated. In cases wherein location services is deactivated, the SSID may be manually entered using the application. In some embodiments, the robot may include a Bluetooth wireless device that may help the communication device in finding available SSIDs regardless of activation or deactivation of location services. This may be used as a user-friendly solution in cases wherein the user may not want to activate location services. In some embodiments, the pairing process may require the communication device and the robot to be connected to the same network or SSID. Such a restriction may create confusion in cases wherein the communication device is connected to a cellular network when at home and close to the robot or the communication device is connected to a 5 Ghz network and the robot is connected to a 2.4 Ghz network, which at times may have the same SSID name and password. In some embodiments, it may be preferable for the robot to use a 2.4 Ghz network as it may roam around the house and may end up on places where a signal strength of a 5 Ghz network is weak. In some embodiments, a 5 Ghz network may be preferred within an environment having multiple wireless repeaters and a signal with good strength. In some embodiments, the robot may automatically switch between networks as the data rate increases or decreases. In some embodiments, pairing methods such as those described in U.S. patent application Ser. No. 16/109,617 may be used, the entire contents of which is hereby incorporated by reference. 
     In some embodiments, a robot device, communication device or another smart device may wirelessly join a local network by passively scanning for networks and listening on each frequency for beacons being sent by a wireless router. Alternatively, the device may use an active scan process wherein a probe request may be transmitted in search of a specific wireless router. In some embodiments, the client may associate with the SSID received in a probe response or in a heard beacon. In some embodiments, the device may send a probe request with a blank SSID field during active scanning. In some embodiments, wireless routers that receive the probe request may respond with a list of available SSIDs. In some embodiments, the device may connect with one of the SSIDs received from the wireless router if one of the SSIDs exists on a preferred networks list of the device. If connection fails, the device may try an SSID existing on the preferred networks list that was shown to available during a scan. 
     In some embodiments, a device may send an authentication request after choosing an SSID. In some embodiments, the wireless router may reply with an authentication response. In some embodiments, the device may send an association request, including the data rates and capabilities of the device after receiving a successful authentication response from the wireless router. In some embodiments, the wireless router may send an association response, including the data rates that the wireless router is capable of and other capabilities, and an identification number for the association. In some embodiments, a speed of transfer may be determined by a Received Signal Strength Indicator (RSSI) and signal-to-noise ratio (SNR). In some embodiments, the device may choose the best speed for transmitting information based on various factors. For example, management frames may be sent at a slower rate to prevent them from becoming lost, data headers may be sent at a faster rate than management frames, and actual data frames may be sent at the fastest possible rate. In some embodiments, the device may send data to other devices on the network after becoming associated with the SSID. In embodiments, the device may communicate with devices within the same subnet or other subnets. Based on normal IP rules, the device may first determine if the other device is on the same subnet and then may decide to use a default gateway to relay the information. In some embodiments, a data frame may be received by a layer 3 device, such as the default gateway. In some embodiments, the frame may then be encapsulated in IPV4 or IPV6 and routed through the wide area network to reach a desired destination. Data traveling in layer 3 allows the device to be controllable via a local network, the cloud, an application connected to wireless LAN, or cellular data. In some embodiments, upon receiving the data at a cellular tower, devices such as Node B, a telecommunications node in mobile communication networks applying the UMTS standard, may provide a connection between the device from which data is sent and the wider telephone network. Node B devices may be connected to the mobile phone network and may communicate directly with mobile devices. In such types of cellular networks, mobile devices do not communicate directly with one another but rather through the Node B device using RF transmitters and receivers to communicate with mobile devices. 
     In some embodiments, a client that has never communicated with a default gateway may use Address Resolution Protocol (ARP) to resolve its MAC address. In some embodiments, the client may examine an ARP table for mapping to the gateway, however if the gateway is not there the device may create an ARP request and transmit the ARP request to the wireless router. For example, an 802.11 frame including four addresses: the source address (SA), destination address (DA), transmitter address (TA), and receiving address (RA) may be used. In this example, the SA is the MAC of the device sending the ARP request, the DA is the broadcast (for the ARP), and the RA is the wireless router. In some embodiments, the wireless router may receive the ARP request and may obtain the MAC address of the device. In some embodiments, the wireless router may verify the frame check sequence (FCS) in the frame and may wait the short interframe space (SIFS) time. When the SIFS time expires, the wireless router may send an acknowledgement (ACK) back to the device that sent the ARP request. The ACK is not an ARP response but rather an ACK for the wireless frame transmission. In embodiments wherein the number of wireless routers are more than one, a Lightweight Access Point Protocol (LWAPP) may be used wherein each wireless router adds its own headers on the frames. In some embodiments, a switch may be present on the path of the device and wireless router. In some embodiments, upon receiving the ARP request, the switch may read the destination MAC address and flood the frame out to all ports, except the one it came in on. In some embodiments, the ARP response may be sent back as a unicast message such that the switch in the path forwards the ARP response directly to the port leading to the device. At such a point, the ARP process of the client may have a mapping to the gateway MAC address and may dispatch the awaiting frame using the process described above, a back off timer, a contention window, and eventually transmitting the frame following the ARP response. 
     Some embodiments may employ virtual local area networks (VLANs). In such embodiments, upon receiving the ARP request, the frame may be flooded to all ports that are members of the same VLAN. A VLAN may be used with network switches for segmentation of hosts at a logical level. By using VLANs on the wired side of the wireless router, the subnet may be logically segmented, just as it is on the wireless space. For example, the result may be SSID=Logical Subnet=Logical VLAN or Logical Broadcast Domain. After the wireless frames move from the wireless connection to the wired network, they must share a single physical wire. In some embodiments, the 802.1Q protocol may be used to place a 4-byte tag in each 802.3 frame to indicate the VLAN. 
     In some embodiments, a hacker may attempt to transmit an ARP response from a host with a MAC address that does not match the MAC address of the host from which the ARP request was broadcasted. In some embodiments, device to device bonds may be implemented using a block chain to prevent any attacks to a network of devices. In some embodiments, the devices in the network may be connected together in a chain and for a new device to join the network it must first establish a bond. In some embodiments, the new device must register in a ledger and an amount of time must pass, over which trust between the new device and the devices of the network is built, before the new device may perform certain actions or receive certain data. 
     Examples of data that a frame or packet may carry includes control data, payload data, digitized voice, digitized video, voice control data, video control data, and the like. 
     In some embodiments, the device may search for an ad hoc network in the list of available networks when none of the SSIDs that were learned from the active scan or from the preferred networks list result in a successful connection. An ad hoc connection may be used for communication between two devices without the need for a wireless router in between the two devices. In some cases, ad hoc connections may not scale well for multiple device but may be possible. In some embodiments, a combination of ad hoc and wired router connections may be possible. In some embodiments, a device may connect to an existing ad hoc network. In some embodiments, a device may be configured to advertise an ad hoc connection. However, in some cases, this may be a potential security risk, such as in the case of robots. In some embodiments, a device may be configured to refrain from connecting to ad hoc networks. In some embodiments, a first device may set up a radio work group, including a name and radio parameters, and a second device may use the radio work group to connect to the first device. This may be known as a Basic Service Set or Independent Basic Service Set, which may define an area within which a device may be reachable. In some embodiments, each device may have one radio and may communicate in a half-duplex at a lower data rate as information may not be sent simultaneously. In some embodiments, each device may have two radios and may communicate in a full duplex. 
     In embodiments, authentication and security of the robot are important and may be configured based on the type of service the robot provides. In some embodiments, the robot may establish an unbreakable bond or a bond that may only be broken over time with users or operators to prevent intruders from taking control of the robot. For example, WPA-802.1X protocol may be used to authenticate a device before joining a network. Other examples of protocols for authentication may include Lightweight Extensible Authentication Protocol (LEAP), Extensible Authentication Protocol Transport Layer Security (EAP-TLS), Protected Extensible Authentication Protocol (PEAP), Extensible Authentication Protocol Generic Token Card (EAP-GTC), PEAP with EAP Microsoft Challenge Handshake Authentication Protocol Version 2 (EAP MS-CHAP V2), EAP Flexible Authentication via Secure Tunneling (EAP-FAST), and Host-Based EAP. In some embodiments, a pre-shared key or static Wired Equivalent Privacy (WEP) may be used for encryption. In other embodiments, more advanced methods, such as WPA/WPA2/CCKM, may be used. In some embodiments, WPA/WPA2 may allow encryption with a rotated encryption key and a common authentication key (i.e., a passphrase). Encryption keys may have various sizes in different protocols, however, for more secure results, a larger key size may be used. Examples of key size include a 40 bit key, 56 bit key, 64 bit key, 104 bit key, 128 bit key, 256 bit key, 512 bit key, 1024 bit key, and 2048 bit key. In embodiments, encryption may be applied to any wireless communication using a variation of encryption standards. 
     In some embodiments, EAP-TLS, a commonly used EAP method for wireless networks, may be used. EAP-TLS encryption is similar to SSL encryption with respect to communication method, however EAP-TLS is one generation than SSL. EAP-TLS establishes an encrypted tunnel and the user certificate is sent inside the tunnel. In EAP-TLS, a certificate is needed and is installed on an authentication server and the supplicant and both client and server key pairs are first generated then signed by the CA server. In some embodiments, the process may begin with an EAP start message and the wireless router requesting an identity of the device. In some embodiments, the device may respond via EAP over RADIUS to the authentication server, the authentication server may send its certificate, and the client may send its certificate, thereby revealing their identity in a trusted way. In some embodiments, a master session key or symmetric session keys may then be created. In some embodiments, the authentication server may send the master session key to the wireless router to be used for either WEP or WPA/WPA2 encryption between the wireless router and the device. 
     WPA was introduced as a replacement for WEP and is based on the IEEE 802.11i standard. More specifically, WPA includes support for Advanced Encryption Standard (AES) and Cipher Block Chaining Message Authentication Code Protocol (CMMP) and the Temporal Key Integrity Protocol (TKIP), which may use RC4 stream cipher to dynamically generate a new key for each packet. (AES/CCMP) still uses the IV and MIC, but the IV increases after each block of cipher. In embodiments, different variations of WPA (e.g., WPA2 or WPA3) may be used. In some embodiments, WPA may mandate using TKIP, with AES being optional. In some embodiments, WPA2 may be used wherein AES is mandated and TKIP is not used. In some embodiments, WPA may allow AES in its general form. In some embodiments, WPA2 may only allow an AES/CCMP variant. 
     WPA may use one of two authentication modes. One mode includes an enterprise mode (or otherwise 802.1X mode) wherein authentication against a server such as a RADIUS server is required for authentication and key distribution and TKIP is used with the option of AES. The second mode includes a personal mode (e.g., popular in homes) wherein an authentication server is not used and each network device encrypts data by deriving its encryption key from a pre-shared key. In some embodiments, a network device and wireless router may agree on security capabilities at the beginning of negotiations, after which the WPA-802.1X process may begin. In some embodiments, the network device and wireless router may use a Pairwise Master Key (PMK) during a session. After this, a four-way handshake may occur. In some embodiments, the network device and an authenticator may communicate and a Pairwise Transient Key (PTK) may be derived which may confirm the PMK between the network device and the wireless router, establish a temporal key (TK) that may be used for message encryption, authenticate the negotiated parameters, and create keying material for the next phase (known as the two-way group key handshake). When the two-way group key handshake occurs, a network device and authenticator may negotiate the Group Transient Key (GTK), which may be used to decrypt broadcast and multicast transmissions. A first network device may generate a random or pseudo-random number using a random generator algorithm and may sends it to a second network device. The second network device may then use a common passphrase along with the random number to derive a key that may be used to encrypt data being sent back to the first network device. The second network device may then send its own random number to the first network device, along with a Message Integrity Code (MIC), which may be used to prevent the data from being tampered with. The first network device may then generate a key that may be used to encrypt unicast traffic to the client. To validate, the first network device may send the random number again, but encrypted using the derived key. A final message may be sent, indicating that the TK is in place on both sides. The two-way handshake that exchanges the group key may include generating a Group Master Key (GMK), usually by way of a random number. After a first network device generates the GMK, it may generate a group random number. This may be used to generate a Group Temporal Key (GTK). The GTK may provide a group key and a MIC. The GTK may change when it times out or when one of the network devices on one side leaves the network. In some embodiments, WPA2 may include key management which may allow keys to be cached, resulting in faster connections. In some embodiments, WPA may include Public Key Infrastructure to achieve higher security. 
     In some embodiments, vendor protocols such as EAP-FAST or LEAP may be used when the wireless router supports the protocols. In some protocols, only a server side certificate may be used to create a tunnel within which the actual authentication takes place. An example of this method includes the PEAP protocol that uses EAP MS-CHAP V2 or EAP GTC to authenticate the user inside an encrypted tunnel. In some embodiments, authentication may allow the robot to be centrally authenticated and may be used to determine if the robot belongs to a fleet or if it safe for the robot to join a fleet or interact with other robots. In some embodiments, a decentralized network may be used. In some embodiments, block chain may be used to add new robots to a fleet of robots wherein new robots may be recorded in a leger as they join. Block chain may be used to prevent new robots from enacting any unexpected or unwanted actions. 
     In some embodiments, a wireless router may be compromised. In some embodiments, as a result of the wireless router being compromised, the flash file system and NVRAM may be deleted. In such instances, there may be significant downtime as the files are put back in place prior to restoring normal wireless router functionality. In some embodiments, a Cisco Resilient Configuration feature may be used to improve recovery time by generating a secure working copy of the IOS image and startup configuration files (i.e., the primary boot set) that cannot be deleted by a remote user. 
     In some embodiments, a Simple Network Management Protocol (SNMP) may be used to manage each device (e.g., network servers, wireless routers, switches, etc.), including robots, within a network. SNMP may be utilized to manage robot devices. In some embodiments, SNMP messages may be encrypted with a hash to provide integrity of the packset. In some embodiments, hashing may also be used to validate the source of an SNMP message. In some embodiments, encryptions such as CBC-DES (DES-56) may be used to make the messages unreadable by an unauthorized party. 
     In some embodiments, the robot may be used as a site survey device. In some embodiments, the robot may cover an environment (e.g., a commercial space such as an airport) and a sensor may be used to monitor the signal strength in different areas of the environment. In some embodiments, the signal strength in different areas may be shared with a facility designer or IT manager of the environment. In some embodiments, the processor of the robot may passively listen to signals in each area of the environment multiple times and may aggregate the results for each area. In some embodiments, the aggregated results may be shared with facility designer or IT manager of the environment. In some embodiments, the processor of the robot may actively transmit probes to understand the layout of the environment prior to designing a wireless architecture. In some embodiments, the processor of the robot may predict coverage of the environment and may suggest where access points may be installed. Examples of access points may include wireless routers, wireless switches, and wireless repeaters that may be used in an environment. Alternatively, machine learned methods may be used to validate and produce a wireless coverage prediction map for a particular designed wireless architecture. In some embodiments, previous data from existing facilities and probes by the robot may be used to reduce blind spots. 
     In some embodiments, the robot may be unable to connect to a network. In such cases, the robot may act as or may be a wireless router. In some embodiments, the robot includes similar abilities as described above for a wireless router. In some embodiments, the robot may act as or may be a wireless repeater to extend coverage. In some embodiments, the robot enacts other actions while acting as a wireless router or repeater. In some embodiments, the robot may follow a user to provide a good signal in areas where there may be weak signals when acting as a wireless repeater. In some embodiments, each robot in a group of robots operating in a large area may become or be a wireless repeater. A robot acting as a wireless router or wireless repeater may be particularly useful in areas where a cable for installation of a wireless router or repeater may not be easily accessible or where wireless router or repeater is only needed on special occasion. In some embodiments, the charging station of the robot or another base station may be a wireless router, that in some cases, may connect to Ethernet. 
     In some embodiments, the robot may take on responsibilities of a wireless router or switches and routers that may be beyond the accessible network (such as inside a service provider) when acting as a wireless router. In some embodiments, one of those responsibilities may include traffic queuing based on the classifications and markings of packets, or otherwise the ordering of different types of traffic to be sent to LAN or WAN. Examples of queuing may include Low Latency Queuing (LLQ) which may be effective in eliminating variable delay, jitter, and packet loss on a network by creating a strict-priority queue for preferred traffic. Other techniques that may be used include first in first out (FIFO), first in last out (FILO), etc. Some embodiments may employ link fragmentation interleaving (LFI) wherein larger data packets may be segmented into smaller fragments and some highly critical and urgent packets may be sent in between newly fragmented data packets. This may prevent large packets from occupying a link for a long time, thereby causing urgent data to expire. In some cases, classification, marking, and enforcing queuing strategies may be executed at several points along the network. In embodiments, wherein the robot may enforce markings or the network respects the markings, it may be useful for the robot to set the markings. However, in situations wherein the service provider may not honor the markings, it may be better for the service provider to set the markings. 
     In some embodiments, the robot may have workgroup bridge (WGB) capabilities. In some embodiments, a WGB is an isolated network that requires access to the rest of the network for access to a server farm or internet, such as in the case where a cell phone is used as a wireless router. In some embodiments, the robot may have cellular access which may be harnessed such that the robot may act as a wireless router. In some embodiments, the robot may become a first node in an ad hoc work group that listens for other robots joining. In some embodiments, connection of other robots or devices may be prevented or settings and preferences may be configured to avoid an unwanted robot or device from taking control of the robot. 
     In some embodiments, the robot may include voice and video capability. For example, the robot may be a pod or an autonomous car with voice and video capability. A user may be able to instruct (verbally or using an application paired with the autonomous car) the autonomous car to turn on, drive faster or at a particular speed, take a next or particular exit, go shopping or to a particular store, turn left, go to the nearest gas station, follow the red car in the front of it, read the plate number of the yellow car in the front it out loud, or store the plate number of the car in the front in database. In another example, a user may verbally instruct a pod to be ready for shopping in ten minutes. In some embodiments, a user may provide an instruction directly to the robot or to a home assistant or an application paired with the pod, which may then relay the instruction to the robot. In another example, a policeman sitting within a police car may verbally instruct the car to send the plate number of a particular model of car positioned in front of the police car for a history check. In one example, a policeman may remotely verbally command a fleet of autonomous police cars to find and follow a particular model of car with a particular plate number or portion of a plate number (e.g., a plate number including the numbers  3  and  5 ). The fleet of police cars may run searches on surrounding cars to narrow down a list of cars to follow. In some cases, the search for the particular car may be executed by other police cars outside of the fleet or a remote device. In some cases, the search for the particular car may executed by closed circuit cameras throughout a city that may flag suspect cars including the particular plate number of portion of the plate number. Some embodiments may determine the police car that may reach a suspect car the fastest based on the nearest police car in the fleet relative to the location of the camera that flagged the suspect car and the location of the suspect car. In some cases, the suspect car may be followed by a police car or by another device within the fleet. For example, a suspect car may pass a first mechanically rotatable camera. The first camera may predict the path of the suspect car and may command a next camera to adjust its FOV to capture an expected position of the suspect car and such there is no a blind spot in between the two cameras. In some embodiments, the cameras may be attached to a wall, a wheeled autonomous car, a drone, a helicopter, a fighter jet, a passenger jet, etc. 
     In some embodiments, instructions to the robot may be provided verbally, through user inputs using a user interface of the robot or an application paired with the robot, a gesture captured by a sensor of the robot, a physical interaction with the robot or communication device paired with the robot (e.g., double tapping the robot), etc. In some embodiments, the user may set up gestures via an application paired with the robot or a user interface of the robot. In some embodiments, the robot may include a home assistant, an application, or smart phone capabilities in combination or individually. 
     In some embodiments, the robot may include mobility, screen, voice, and video capabilities. In some embodiments, the robot may be able to call or communicate with emergency services (e.g., 911) upon receiving an instruction from the user (using methods described above) or upon detecting an emergency using sensors, such as image, acoustic, or temperature sensors. In some embodiments, the robot may include a list of contacts, similar to a list of contacts stored in a cell phone or video conferencing application. In some embodiments, each contact may have a status (e.g., available, busy, away, idle, active, online, offline, last activity some number of minutes ago, a user defined status, etc.). In some embodiments, the robot may include cellular connectivity that it may use for contacting a contact, accessing the internet, etc. In some embodiments, the robot may pair with a smart device or a virtual assistant for contacting a contact and accessing the internet and other features of the smart device or virtual assistant. In some embodiments, each contact and their respective status may be displayed by a graphical user interface of the robot or an application paired with the robot. In some embodiments, contacts may be contacted with a phone call, video call, chat, group chat, or another means. A video call or group chat may include communication between a group of participants. In some embodiments, a history of communication may be configured to be accessible after participants have left a communication session or erased. In some embodiments, chat, voice, or video messages may be sent to contacts currently offline. In some embodiments, voice call protocols, such as G.711 a-law, mu-law, G.722 Wideband, G.729A, G.729B, iLBC (Internet Low Bandwidth Codec), and iSAC (Internet Speech Audio Codec), may be used. 
     In some embodiments, the robot (or an AI system) may initiate selections upon encountering an Interactive Voice Response (IVR) system during a call. For example, a robot may initiate a selection of English upon encountering an IVR system prompting a selection of a particular number for each different language prior to putting the user on the line, given that the robot knows the user prefers English. In other cases, the robot may perform other actions such as entering a credit card number, authentication for the user, and asking a question saved by the user and recording the answer. In one example, the user may verbally instruct the robot to call their bank and ask them to update their address. The robot may execute the instruction using the IVR system of the bank without any intervention from the user. In another example, the user may instruct the robot to call their bank and connect them to a representative. The robot may call the bank, complete authentication of the user, and IVR selection phase, and then put the user through to the representative such that the user has minimal effort. 
     In some embodiments, the robot may be a mobile virtual assistant or may integrate with other virtual voice assistants (e.g., Siri, Google home, or Amazon Alexa). Alternatively, the robot may carry an external virtual voice assistant. In some embodiments, the robot may be a visual assistant and may respond to gestures. In some embodiments, the robot may respond to a set of predefined gestures. In some embodiments, gestures may be processed locally or may be sent to the cloud for processing. 
     In some embodiments, the robot may include a voice command center. In some embodiments, a voice command received by a microphone of the robot may be locally translated to a text command or may be sent to the cloud for analysis and translation into text. In some embodiments, a command from a set of previously known commands (or previously used commands) may processed locally. In some embodiments, the voice command may be sent to the cloud if not understood locally. In some embodiments, the robot may receive voice commands intended for the robot or for other devices within an environment. In some embodiments, speech-to-text functionality may be performed and/or validated by the backend on the cloud or locally on the robot. In some embodiments, the backend component may be responsible for interpreting intent from a speech input and/or operationalizing the intent into a task. In some embodiments, a limited number of well known commands may be stored and interpreted locally. In some embodiments, a limited number of previously used commands may be stored and interpreted locally based on the previous interpretations that were executed on the cloud. In digitized audio, digital signals use numbers to represent levels of voice instead of a combination of electrical signals. For example, the process of digitizing a voice includes changing analog voice signals into a series of numbers that may be used to reassemble the voice at the receiving end. In some embodiments, the robot and other devices (mobile or static) may use a numbering plan, such as the North American Numbering Plan (NANP) which uses the E.164 standard to break numbers down into country code, area code, central office or exchange code, and station code. Other methods may be used. For example, the NANP may be combined with the International Numbering Plan, which all countries abide by for worldwide communication. 
     In some embodiments, the robot may carry voice and/or video data. In embodiments, the average human ear may hear frequencies from 20-20,000 Hz while human speech may use frequencies from 200-9,000 Hz. Some embodiments may employ the G.711 standard, an International Telecommunications Union (ITU) standard using pulse code modulation (PCM) to sample voice signals at a frequency of 8,000 samples per second. Two common types of binary conversion techniques employed in the G.711 standard include u-law (used in the United States, Canada, and Japan) and a-law (used in other locations). Some embodiments may employ the G.729 standard, an ITU standard that samples voice signals at 8,000 samples per second with bit rate fixed at 8 bits per sample and is based on Nyquist rate theorem. In embodiments, the G.729 standard uses compression to achieve more throughput, wherein the compressed voice signal only needs 8 Kbps per call as opposed to 64 Kbps per call in the G.711 standard. The G.729 codec standard allows eight voice calls in same bandwidth required for just one voice call in the G.711 codec standard. In embodiments, the G.729 standard uses a conjugative-structure algebraic-code-excided liner prediction (CS-ACELP) and alternates sampling methods and algebraic expressions as a codebook to predict the actual numeric representation. Therefore, smaller algebraic expressions sent are decoded on the remote site and the audio is synthesized to resemble the original audio tones. In some cases, there may be degradation of quality associated with audio waveform prediction and synthetization. Some embodiments may employ the G.729a standard, another ITU standard that is a less complicated variation of G.729 standard as it uses a different type of algorithm to encode the voice. The G.729 and G.729a codecs are particularly optimized for human speech. In embodiments, data may be compressed down to 8 Kbps stream and the compressed codecs may be used for transmission of voice over low speed WAN links. Since codecs are optimized for speech, they often do not provide adequate quality for music streams. A better quality codec may be used for playing music or sending music or video information. In some cases, multiple codecs may be used for sending different types of data. Some embodiments may use H.323 protocol suite created by ITU for multimedia communication over network based environments. Some embodiments may employ H.450.2 standard for transferring calls and H.450.3 standard for forwarding calls. Some embodiments may employ Internet Low Bitrate Codec (ILBC), which uses either 20 ms or 30 ms voice samples that consume 15.2 Kbps or 13.3 Kbps, respectively. The ILBC may moderate packet loss such that a communication may carry on with little notice of the loss by the user. Some embodiments may employ internet speech audio codec which uses a sampling frequency of 16 kHz or 32 kHz, an adaptive and variable bit rate of 10-32 Kbps or 10-52 Kbps, an adaptive packet size 30-60 ms, and an algorithmic delay of frame size plus 3 ms. Several other codecs (including voice, music, and video codecs) may be used, such as Linear Pulse Code Modulation, Pulse-density Modulation, Pulse-amplitude Modulation, Free Lossless Audio Codec, Apple Lossless Audio Codec, monkey&#39;s audio, OptimFROG, WavPak, True Audio, Windows Media Audio Lossless, Adaptive differential pulse-code modulation, Adaptive Transform Acoustic Coding, MPEG-4 Audio, Linear predictive coding, Xvid, FFmpeg MPEG-4, and DivX Pro Codec. In some embodiments, a Mean Opinion Score (MOS) may be used to measure the quality of voice streams for each particular codec and rank the voice quality on a scale of 1 (worst quality) to 5 (excellent quality). 
     In some embodiments, a packet traveling from the default gateway through layer 3 may be treated differently depending on the underlying frame. For example, voice data may need to be treated with more urgency than a file transfer. Similarly, voice control data such as frames to establish and keep a voice call open may need to be treated urgently. In some embodiments, a voice may be digitized and encapsulated into Internet Protocol (IP) packets to be able to travel in a data network. In some embodiments, to digitize a voice, analog voice frequencies may be sampled, turned into binary, compressed, and sent across an IP network. In the process, bandwidth may be saved in comparison to sending the analog waveform over the wire. In some embodiments, distances of voice travel may be scaled as repeaters on the way may reconstruct the attenuated signals, as opposed to analog signals that are purely electrical on the wire and may become degraded. In analog transmission of voice, the noise may build up quickly and may be retransmitted by the repeater along with the actual voice signals. After the signal is repeated several times, a considerable amount of electrical noise may accumulate and mix with the original voice signal carried. In some embodiments, after digitization, multiple voice streams may be sent in more compact form. 
     In some embodiment, three steps may be used to transform an analog signal (e.g., a voice command) into a compressed digital signal. In some embodiments, a first step may include sampling the analog signal. In some embodiments, the sample size and the sample frequency may depend the desired quality, wherein a larger sample size and greater sampling frequency may be used for increased quality. For example, a higher sound quality may be required for music. In some embodiments, a sample may fit into 8 bits, 16 bits, 32 bits, 64 bits, and so forth. In some cases, standard analogue telephones may distinguish sound waves from 0-4000 Hz. To mimic this this frequency range, the human voice may be sampled 8000 times per second using Harry Nyquist concept, wherein the max data rate (in bits/sec) may be determined using 2×B×log 2 V, wherein B is bandwidth and V is the number of voltage levels. Given that 4000 Hz may approximately be the highest theoretical frequency of the human voice, and that the average human voice may approximately be within the range of 200-2800 Hz, sampling a human voice 8000 times per second may reconstruct an analogue voice equivalent fairly well while using sound waves within the range of 0-299 Hz and 3301-4000 Hz for out-of-band signaling. In some embodiments, Pulse Amplitude Modulation (PAM) may be performed on a waveform to obtain a slice of the wavelength at a constant number of 8000 intervals per second. In some embodiments, a second step of converting an analog signal into a compressed digital signal may include digitization. In some embodiments, Pulse Code Modulation (PCM) may be used to digitize a voice by using quantization to encode the analog waveform into digital data for transport and decode the digital data to play it back by applying voltage pulses to a speaker mimicking the original analog voice. In some embodiments, after completing quantization, the digital data may be converted into a binary format that may be sent across a wire as a series of zeroes and ones (i.e., bits), wherein different series represent different numeric values. For example, 8000 samples per second sampling rate may be converted into an 8-bit binary number and sent via a 64 Kbps of bandwidth (i.e., 8000 samples×8 bits per sample=64000 bits). In some embodiments, a codec algorithm may be used for encoding an analog signal into digital data and decoding digital data to reproduce the analog signal. In embodiments, the quality of the encoded waveforms and the size of the encoded data stream may be different depending on the codec being used. For example, a smaller size of an encoded data stream may be preferable for a voice. Examples of codecs that may be used include u-law (used in the United States, Canada, and Japan) and a-law. In some embodiments, transcoding may be used to translate one codec into another codec. In some cases, codecs may not be compatible. In some embodiments, some resolution of the voice may be naturally lost when an analogue signal is digitized. For example, fewer bits may be used to save on the data size, however this may result in less quality. In some embodiments, a third step of converting an analog signal into a compressed digital signal may include compression. In some embodiments, compression may be used to eliminate some redundancy in the digital data and save bandwidth and computational cost. While most compression algorithms are lossy, some compression algorithms may be lossless. For example, with smaller data streams more individual data streams may be sent across the same bandwidth. In some embodiments, the compressed digital signal may be encapsulated into Internet Protocol (IP) packets that may be sent in an IP network. 
     In some embodiments, several factors may affect transmission of voice packets. Examples of such factors may include packet count, packet delay, packet loss, and jitter (delay variations). In some embodiments, echo may be created in instances wherein digital voice streams and packets travelling from various network paths arrive out of order. In some embodiments, echo may be the repetition of sound that arrives to the listener a period of time after the original sound is heard. 
     In some embodiments, Session Initiation Protocol (SIP), an IETF RFC 3261 standard signaling protocol designed for management of multimedia sessions over the internet, may be used. The SIP architecture is a peer-to-peer model in theory. In some embodiments, Real-time Transport Protocol (RTP), an IETF RFC 1889 and 3050 standard for the delivery of unicast and multicast voice/video streams over an IP network using UDP for transport, may be used. UDP, unlike TCP, may be an unreliable service and may be best for voice packets as it does not have a retransmit or reorder mechanism and there is no reason to resend a missing voice signal out of order. Also, UDP does not provide any flow control or error correction. With RTP, the header information alone may include 40 bytes as the RTP header may be 12 bytes, the IP header may be 20 bytes, and the UDP header may be 8 bytes. In some embodiments, Compressed RTP (cRTP) may be used, which uses between 2-5 bytes. In some embodiments, Real-time Transport Control Protocol (RTCP) may be used with RTP to provide out-of-band monitoring for streams that are encapsulated by RTP. For example, if RTP runs on UDP port 22864, then the corresponding RTCP packets run on the next UDP port 22865. In some embodiments, RTCP may provide information about the quality of the RTP transmissions. For example, upon detecting a congestion on the remote end of the data stream, the receiver may inform the sender to use a lower-quality codec. 
     In some embodiments, a Voice Activity Detection (VAD) may be used to save bandwidth when voice commands are given. In some embodiments, VAD may monitor a voice conversation and may stop transmitting RTP packets across the wire upon detecting silence on the RTP stream (e.g., 35-40% of the length of the voice conversation). In some embodiments, VAD may communicate with the other end of the connection and may play a prerecorded silence packet instead of carrying silence data. 
     Similar to voice data, an image may be sent over the network. In some instances, images may not be as sensitive as voice data as the loss of a few images on their way through network may not cause a drastic issue. However, images used to transfer maps of the environment or special images forming the map of the environment may be more sensitive. In some embodiments, images may not be the only form of data carrying a map. For example, an occupancy grid map may be represented as an image or may use a different form of data to represent the occupancy grid map, wherein the grid map may be a Cartesian division of the floor plane of the robot. In some embodiments, each pixel of an image may correspond to a cell of the grid map. In some embodiments, each pixel of the image may represent a particular square size on the floor plane, the particular square size depending on the resolution. In some embodiments, the color depth value of each pixel may correspond to a height of the floor plane relative to a ground zero plane. In some embodiments, derivative of pixel values of two neighboring pixels of the image (e.g., the change in pixel value between two neighboring pixels) may correspond to traversability from one cell to the neighboring cell. For example, a hard floor of a basement of a building may have a value of zero for height, a carpet of the basement may have a value of one for height, a ceiling of the basement may have a value of 18 for height, and a ground floor of the building may have a value of 20 for height. The transition from the hard floor with a height of zero and the carpet with a height of one may be deemed a traversable path. Given the height of the ceiling is 18 and the height of the ground floor is 20, the thickness of the ceiling of the basement may be known. Further, these heights may allow multiple floors of a same building to be represented, wherein multiple floor planes may be distinguished from one another based on their height (e.g., floor planes of a high rise). In embodiments describing a map using an image, more than gray scale may be used in representing heights of the floor plane in different areas. Similarly, any of RGB may be used to represent other dimensions of each point of the floor plane. For example, another dimension may be a clean or dirty status, thus providing probability of an area needing cleaning. In other examples, another dimension may be previous entanglements or previous encounters with a liquid or previous dog accidents. 
     Given the many tools available for processing an image, many algorithms and choices may exist for processing the map. In some embodiments, maps may be processed in coarse to fine resolution to obtain a rough hypothesis. In some embodiments, the rough hypothesis may be refined and/or tested for the correctness of the rough hypothesis by increasing the resolution. In some embodiments, fine to coarse resolution may maintain a high resolution perception and localization that may be used as ground truth. In some embodiments, image data may be sampled at different resolutions to represent the real image. 
     Similar concerns as those previously discussed for carrying voice packets exist for carrying images. Map control packets may have drastically less developed protocols. In some embodiments, protocols may be used to help control packet count, packet delay, packet loss, and jitter (delay variations). In some embodiments, there may be a delay in the time it takes a packet to arrive to final destination from a source. This may be caused by lack of bandwidth or length of physical distance between locations. In some cases, multiple streams of voice and data traffic competing for a limited amount of bandwidth may cause various kinds of delays. In some embodiments, there may be a fixed delay in the time it takes the packet to arrive to the final destination. For example, it may take a certain amount of time for a packet to travel a specific geographical distance. In some embodiments, QoS may be used to request preferred treatment from the service provider for traffic that is sensitive. In some embodiments, this may reduce other kinds of delay. One of these delays may include a variable delay which is a delay that may be influenced by various factors. In some embodiments, the request may be related to how data is queued in various devices throughout a journey as it impacts the wait time in interface queues of various devices. In some embodiments, changing queuing strategies may help lower variable delays, such as jitter or other variations of delay, such as packets that have different amounts of delay traveling the cloud or network. For example, a first packet of a conversation might take 120 ms to reach a destination while the second packet may take 110 ms to reach the destination. 
     In some embodiments, packets may be lost because of a congested or unreliable network connection. In some embodiments, particular network requirements for voice and video data may be employed. In addition to bandwidth requirements, voice and video traffic may need an end-to-end one way delay of 150 ms or less, a jitter of 30 ms or less, and a packet loss of 1% or less. In some embodiments, the bandwidth requirements depend on the type of traffic, the codec on the voice and video, etc. For example, video traffic consumes a lot more bandwidth than voice traffic. Or in another example, the bandwidth required for SLAM or mapping data, especially when the robot is moving, is more than a video needs, as continuous updates need to go through the network. In another example, in a video call without much movement, lost packets may be filled using intelligent algorithms whereas in a stream of SLAM packets this cannot be the case. In some embodiments, maps may be compressed by employing similar techniques as those used for image compression. 
     In some embodiments, classification and marking of a packet may be used such network devices may easily identify the packet as it crosses the network. In some embodiments, a first network device that receives the packet may classify or mark the packet. In some embodiments, tools such as access controls, the source of the traffic, or inspection of data up to the application layer in the OSI model may be used to classify or mark the packet. In some cases, inspections in upper layers of the OSI model may be more computationally intensive and may add more delay to the packet. In some embodiments, packets may be labeled or marked after classification. In some embodiments, marking may occur in layer 2 of the OSI model (data link) header (thus allowing switches to read it) and/or layer 3 of the OSI model (network) header (thus allowing routers to read it). In some embodiments, after the packet is marked and as it travels through the network, network devices may read the mark of the packet to classify the packet instead of examining deep into the higher layers of the OSI model. In some embodiments, advanced machine learning algorithms may be used for traffic classification or identifying time-sensitive packets instead of manual classification or identification. In some embodiments, marking of a packet may flag the packet as a critical packet such that the rest of the network may identify the packet and provide priority to the packet over all other traffic. In some embodiments, a packet may be marked by setting a Class of Service (CoS) value in the layer 2 Ethernet frame header, the value ranging from zero to seven. The higher the CoS value, the higher priority of the packet. In some embodiments, a packet may receive a default mark when different applications are running on the robot. For example, when the robot is navigating and collaborating with another robot, or if a video or voice call is in progress, data may be marked with a higher value than when other traffic is being sent. In some embodiments, a mark of a value of zero may indicate no marking. In some embodiments, marking patterns may emerge over time as the robot is used over time. 
     In some embodiments, additional hardware may be implemented to avoid congestion. In some embodiments, preemptive measures, such as dropping packets that may be non-essential (or not as essential) traffic to the network, may be implemented to avoid heavy congestion. In some embodiments, a packet that may be dropped may be determined when there is congestion and bandwidth available. In some embodiments, the dropping excess traffic may be known as policing. In some embodiments, shaping queues excess traffic may be employed wherein packets may be sent at a later time or slowly. 
     In some embodiments, metadata (e.g., keywords, tags, descriptions) associated with a digital image may be used to search for an image within a large database. In some embodiments, content-based image retrieval (CBIR) may be used wherein computer vision techniques may be used to search for a digital image in a large database. In some embodiments, CBIR may analyze the contents of the image, such as colors, shapes, textures, or any other information that may be derived from the image. In some embodiments, CBIR may be desirable as searches that rely on metadata may be dependent on annotation quality and completeness. Further, manually annotating images may be time consuming, keywords may not properly describe the image, and keywords may limit the scope of queries to a set of predetermined criteria. 
     In some embodiments, a vector space model used for representing and searching text documents may be applied to images. In some embodiments, text documents may be represented with vectors that are histograms of word frequencies within the text. In some embodiments, a histogram vector of a text document may include the number of occurrences of every word within the document. In some embodiments, common words (e.g., the, is, a, etc.) may be ignored. In some embodiments, histogram vectors may be normalized to unit length by dividing the histogram vector by the total histogram sum since documents may be of different lengths. In some embodiments, the individual components of the histogram vector may be weighted based on the importance of each word. In some embodiments, the importance of the word may be proportional to the number of times it appears in the document, or otherwise the term frequency of the word. In some embodiments, the term frequency (tƒ w,d ) of a word (w) in a document (d) may be determined using 
                 tf     w   ,   d       =       n   w         ∑   j           n   j           ,         
wherein n w  is the raw count of a word and Σ j n j  is the number of words in the document. In some embodiments, the inverse document frequency (idf w,d ) may be determined using
 
                 i   ⁢   d   ⁢     f     w   ,   d         =     log   ⁢         ❘   &#34;\[LeftBracketingBar]&#34;     D     ❘   &#34;\[RightBracketingBar]&#34;                 ❘   &#34;\[LeftBracketingBar]&#34;       {       d   :   w     ∈   d     }       ❘   &#34;\[RightBracketingBar]&#34;               ,         
wherein |D| is the number of documents in the corpus D and |{d:w∈d}| is the number of documents in the corpus that include the particular word. In some embodiments, the term frequency and the inverse document frequency may be multiplied to obtain one of the elements of the histogram vector. In some embodiments, the vector space model may be applied to image by generating words that may be equivalent to a visual representation. For example, local descriptors such as a SIFT descriptor may be used. In some embodiments, a set of words may be used as a visual vocabulary. In some embodiments, a database may be set up and images may be indexed by extracting descriptors, converting them to visual words using the visual vocabulary, and storing the visual words and word histograms with the corresponding information to which they belong. In some embodiments, a query of an image sent to a database of images may return an image result after searching the database. In some embodiments, SQL query language may be used to execute a query. In some embodiments, larger databases may provide better results. In some embodiments, the database may be stored on the cloud.
 
     In one example, the robot may send an image to a database on which a search is required. The search within the database may be performed on the cloud and an image result may be sent to the robot. In some embodiments, different robots may have different databases. In some embodiments, a query of an image may be sent to different robots and a search in each of their databases may be performed. In some embodiments, processing may be executed on the cloud or on the robot. In some embodiments, there may not be a database, and instead an image may be obtained by a robot and the robot may search its surroundings for something similar to contents of the image. In some embodiments, the search may be executed in real time within the FOV of the robot, a fleet of robots, cameras, cameras of drones, or cameras of self-driving cars. For example, an image of a wanted person may be uploaded to the cloud by the police and each security robot in a fleet may obtain the image and search their surroundings to for something similar to the contents of the image. In some embodiments, data stored and labeled in a trained database may be used to enhance the results. 
     In some embodiments, a similar system may be used for searching indoor maps. For example, police may upload an image of a scene from which a partial map was derived and may send a query to a database of maps to determine which house the image may be associated with. In some cases, the database may be a database of previously uploaded maps. In some embodiments, robots in a fleet may create a map in real time (or a partial map within their FOV) to determine which house the image may be associated with. In one example, a feature in video captured within a house may be searched within a database of previously uploaded maps to determine the house within which the video was captured. 
     In some embodiments, similar searching techniques as described above may be used for voice data, wherein, for example, voice data may be converted into text data and searching techniques such as the vector space model may be used. In some embodiments, pre-existing applications that may convert voice data into text data may be used. In some embodiments, such applications may use neural networks in transcribing voice data to text data and may transcribe voice data in real-time or voice data saved in a file. In some embodiments, similar searching techniques as described above may be used for music audio data. 
     In some embodiments, a video or specially developed codec may be used to send SLAM packets within a network. In some embodiments, the codec may be used to encode a spatial map into a series of image like. In some embodiments, 8 bits may be used to describe each pixel and 256 statuses may be available for each cell representing the environment. In some cases, pixel color may not necessarily be important. In some embodiments, depending on the resolution, a spatial map may include a large amount of information, and in such cases, representing the spatial map as video stream may not be the best approach. Some examples of video codecs may include AOM Video 1, Libtheora, Dirac-Research, FFmpeg, Blackbird, DivX, VP3, VP5, Cinepak, and RealVideo. 
     In some embodiments, a first image may be sent and as the robot is moving the image may be changed as a result of the movement instead of the scene changing to save on bandwidth for sending data. In such a scenario, images predicted as a result of the movement of the robot do not need to be sent in full. In some embodiments, the speed of the robot may be sent along with some differential points of interest within the image in between of sending full images. In some embodiments, depending on the speed of transmission, the size of information sent, and the speed of robot, some compression may be safely employed in this way. For example, a Direct Linear Transformation Algorithm may be used to find a correspondence or similarity between two images or planes. In some embodiments, a full perspective transformation may have eight degrees of freedom. In embodiments, each correspondence point may provide two equations, one for x coordinates and one for y coordinates. In embodiments, four correspondence points may be required to compute a homography (H) or a 2D projective transformation that maps one plane x to another plane x′, i.e. x′=Hx. Once an initial image and H are sent, the second image may be reconstructed at the receiving end if required. In embodiments, not all transmitted images may be needed on the receiving end. In other instances, other transformations may be used, such as an affine transformation with 6 degrees of freedom. 
     In some embodiments, motion and the relationship between two consecutive images may be considered when transferring maps. In some embodiments, two consecutive images may be captured by a camera of a moving robot. In some embodiments, the surroundings may be mostly stationary or movement within the surroundings may be considerably slower than the speed at which images may be captured, wherein the brightness of objects may be mostly consistent. In some embodiments, an object pixel may be represented by I(x,y,t), wherein I is an image, t is time, and x, y is a position of a pixel within the image at time t 2 =t 1 +Δt. In some embodiments, there may be a small difference in x and y after a small movement (or between to images captured consecutively), wherein x 2 =x 1 +Δx, y 2 =y 1 +Δy, and I(x,y,t)→I(x+Δx,y+Δy, t+Δt). In some embodiments, the movement vector V=[u,ν] may be used in determining the time derivative of an image ∇I T V=−I t , wherein I t  is the time derivative of the image. The expanded form may be given by the Lucas-Kanade method, wherein [∇I T (x 1 )∇I T (x 2 )∇I T (x n )]V=[I x (x 1 )I x (x 2 ): I x (x n )I y (x 1 )I y (x 2 ): I y (x n )][u,ν]=−[I t (x 1 )I t (x 2 ):I t (x n )]. The Lucas-Kanade method assumes that the displacement of the image contents between two consecutive images is small and approximately constant within a neighborhood of the pixel under consideration. In some embodiments, the series of equations may be solved using least squares optimization. In some embodiments, this may be possible by identifying corners when points meet the quality threshold, as provided by the Shi-Tomsi good-to-track criteria. In some embodiments, transmitting an active illuminator light may help with this. 
     In some embodiments, readings taken using local sensing methods may be implemented into a local submap or a local occupancy grid submap. In some embodiments, similarities between local submaps or between a local submap and a global map may be determined. In some embodiments, matching the local submap with another local submap or with the global map may be a problem of solving probabilistic constraints that may exist between relative poses of the two maps. In some embodiments, adjacent local submaps may be stitched based on motion constraints or observation constraints. In some embodiments, the global map may serve as a reference when stitching two adjacent local submaps. For example, a single scan including two similar edge patterns confirms that two similar edge patterns exist and disqualifies the possibility that the same edge pattern was observed twice.  FIG.  121 A  illustrates a first edge pattern  12100  and a second edge pattern  12101  that appear to be the same. If the first edge pattern  12100  and the second edge pattern  12101  are detected in a single scan, it may be concluded that both the first edge pattern Y00 and the second edge pattern  12101  exist.  FIG.  121 B  illustrates a sensor of a robot  12102  observing the first edge pattern  12100  at time t 1  while at location x 1  and the second edge pattern  12101  at time t 2  while at location x 2 . After observing the second edge pattern, the processor of the robot  12102  may determine whether the robot is back at location x 1  and the second edge pattern  12101  is just the first edge pattern  12100  observed or if the second edge pattern  12101  exists. If a single scan including both the first edge pattern  12100  and the second edge pattern  12101  exists, such as illustrated in  FIG.  121 C , the processor may conclude that the second edge pattern  12101  exists. In some embodiments, distinguishing similar patterns within the environment may be problematic as the range of sensors in local sensing may not be able to detect both patterns in a single scan, as illustrated in  FIG.  121 B . However, the global map may be used to observe the existence of similar patterns, such as in  FIG.  121 C , and disqualify a forming theory. This may be particularly important when the robot is suddenly pushed one or more map resolution cells away during operation. For example,  FIG.  122    illustrates a movement path  12200  of robot  12201 . If robot  12201  is suddenly pushed towards the left direction indicated by arrow  12202 , the portion  12203  of movement path  12200  may shift towards the left. To prevent this from occurring, the processor of robot  12201  may readjust based on the association between features observed and features of data included the global or local map. In some embodiments, association of features may be determined using least square minimization. Examples may include gradient descent, Levenberg-Marquardt, and conjugate gradient. 
     In some embodiments, processors of robots may share their maps with one another. In some embodiments, the processor of a robot or a charging station (or other device) may upload the map to the cloud. In some embodiments, the processor of a robot or the charging station (or other device) may download a map (or other data file) from the cloud.  FIG.  123 A  illustrates an example of a process of saving a map and  FIG.  123 B  illustrates two examples of a process of obtaining the map upon a cold start of the robot. In some embodiments, maps may be stored on the cloud by creating a bucket on the cloud for storing maps from all robots. In some embodiments, http, https, or curl may be used to download and upload maps or other data files. In some embodiments, http put method or http post method may be used. In some embodiments, http post method may be preferable as it determines if a robot is a valid client by checking id, password, or role. In some embodiments, http and mqtt may use the same TCP/IP layers. In some embodiments, TCP may run different sockets for mqtt and http. In some embodiments, a filename may be used to distinguish which map file belongs to each client. 
     In some embodiments, processors of robots may transmit maps to one another. In some embodiments, maps generated by different robots may be combined using similar methods to those described above for combining local submaps (as described in paragraph  306 ), such that the perceptions of two robots may be combined into a monolithic interpretation of the environment, given that the localized position of each robot is known. For example, a combined interpretation of the environment may be useful for autonomous race cars performing dangerous maneuvers, as maneuvers performed with information limited to the immediate surroundings of an autonomous race car may be unsafe. In some embodiments, similarities between maps of different robots may be determined. In some embodiments, matching the maps of different robots may be a problem of solving probabilistic constraints that may exist between relative poses of the two maps. In some embodiments, maps may be stitched based on motion constraints or observation constraints. In some embodiments, a global map may serve as a reference when stitching two maps. In some embodiments, maps may be re-matched after each movement (e.g., linear or angular) of the robot. In some embodiments, processors of robots transmit their coordinates and movements to one another such that processors of other robots may compare their own perception of the movement against the movement of the robot received. In some embodiments, two maps may have a linear distance and a relative angular distance. In some embodiments, two maps may be spun to determine if there is a match between the data of the two maps. In some embodiments, maps may be matched in coarse to fine resolution. Coarse resolution may be used to rule out possibilities quickly and fine resolution may be used to test a hypothesis determine with coarse resolution. 
     In some embodiments, the map of a robot may be in a local coordinate system and may not perfectly align with maps of other robots in their own respective local coordinate system and/or the global coordinate system (or ground truth). In some embodiments, the ground truth may be influenced and changed as maps are matched and re-matched. In some embodiments, the degree of the overlap between maps of different robots may be variable as each robot may see a different perspective. In some embodiments, each robot may have a different resolution of their map, use a different technique to create their map, or have different update intervals of their map. For example, one robot may rely more on odometry than another robot or may perceive the environment using a different method than another robot or may use different algorithms to process observations of the environment and create a map. In another example, a robot with sparse sensing and an effective mapping algorithm may create a better map after a small amount of movement as compared to a robot with a 360 degrees LIDAR. However, if the maps are compared before any movement, the robot with sparse sensing may have a much more limited map. 
     In some embodiments, data may travel through a wired network or a wireless network. For example, data may travel through a wireless network for a collaborative fleet of artificial intelligence robots. In some embodiments, the transmission of data may begin by an AC signal generated by a transmitter. In some embodiments, the AC signal may be transmitted to an antenna of a device, wherein the AC signal may be radiated as a sine wave. During this process, current may change the electromagnetic field around the antenna such that it may transmit electromagnetic waves or signals. In embodiments, the electric field may be generated by stationary charges or current and magnetic field is perpendicular to the electric field. In embodiments, the magnetic field may be generated at the same time as the electric field, however, the magnetic field is generated by moving charges. In embodiments, electromagnetic waves may be created as a result of oscillation between an electric field and a magnetic field, forming when the electric field comes into contact with the magnetic field. In embodiments, the electric field and magnetic field are perpendicular to the direction of the electromagnetic wave. In embodiments, the highest point of a wave is a crest while the lowest point is a trough. 
     In some embodiments, the polarization of an electromagnetic wave describes the way the electromagnetic wave moves. In embodiments, there are three types of polarization, vertical, horizontal, and circular. With vertical polarization waves move up and down in a linear way. With horizontal polarization waves move left and right in a linear way. With circular polarization waves circle as they move forward. For example, some antennas may be vertically polarized in a wireless network and therefore their electric field is vertical. In embodiments, determining the direction of the propagation of signals from an antenna is important as malalignment may result in degraded signals. In some embodiments, an antenna may adjust its orientation mechanically by a motor or set of motors or a user may adjust the orientation of the antenna. 
     In some embodiments, two or more antennas on a wireless device may be used to avoid or reduce multipath issues. In some embodiments, two antennas may be placed one wavelength apart. In some embodiments, when the wireless device hears the preamble of a frame, it may compare the signal of the two antennas and use an algorithm to determine which antenna has the better signal. In some embodiments, both signal streams may be used and combined into one signal using advanced signal processing systems. In some embodiments, the antenna chosen may be used to receive the actual data. Since there is no real data during the preamble, switching the antennas does not impact the data if the system does not have the ability to interpret two streams of incoming data. 
     In embodiments, there are two main types of antennas, directional and omnidirectional, the two antennas differing based on how the beam is focused. In embodiments, the angles of coverage are fixed with each antenna. For example, signals of an omnidirectional antenna from the perspective of the top plane (H-plane) may be observed to propagate evenly in a 360-degree pattern, whereas the signals do not propagate evenly from the perspective of the elevation plane (E-plane). In some embodiments, signals may be related to each plane. In some embodiments, a high-gain antenna may be used to focus a beam. 
     In embodiments, different waveforms may have different wavelengths, wherein the wavelength is the distance between successive crests of a wave or from one point in a cycle to a next point in the cycle. For example, the wavelength of AM radio waveforms may be 400-500 m, wireless LAN waveforms may be a few centimeters, and satellite waveforms may be approximately 1 mm. In embodiments, different waveforms may have different amplitudes, wherein the amplitude is the vertical distance between two crests in the wave (i.e., the peak and trough) and represents the strength of energy put into the signal. In some cases, different amplitudes may exist for the same wavelength and frequency. In some embodiments, some of the energy sent to an antenna for radiation may be lost in a cable existing between the location in which modulation of the energy occurs and the antenna. In some embodiments, the antenna may add a gain by increasing the level of energy to compensate for the loss. In some embodiments, the amount of gain depends on the type of antenna and regulations set by FCC and ETSI for power radiation by antennas. In some embodiments, a radiated signal may naturally weaken as it travels away from the source. In some embodiments, positioning a receiving device closer to a transmitting device may result in a better and more powerful received signal. For example, receivers placed outside of a range of an access point may not receive wireless signals from the access point, thereby preventing the network from functioning. In some embodiments, increasing the amplitude of the signal may increase the distance a wave may travel. In some embodiments, an antenna of the robot may be designed to have more horizontal coverage than vertical coverage. For example, it may be more useful for the robot to be able transmit signals to other robots 15 m away from a side of the robot as compared 15 m above or below the robot. 
     In some embodiments, as data travels over the air, some influences may stop the wireless signal from propagating or may shorten the distance the data may travel before becoming unusable. In some cases, absorption may affect a wireless signal transmission. For instance, obstacles, walls, humans, ceiling, carpet, etc. may all absorb signals. Absorption of a wave may create heat and reduce the distance the wave may travel, however is unlikely to have significant effect on the wavelength or frequency of the wave. To avoid or reduce the effect of absorption, wireless repeaters may be placed within an empty area, however, because of absorbers such as carpet and people, there may be a need for more amplitude or a reduction in distance between repeaters. In some cases, reflection may affect a wireless signal transmission. Reflection may occur when a signal bounces off of an object and travels in a different direction. In some embodiments, reflection may be correlated with frequency, wherein some frequencies may be more tolerant to reflection. In some embodiments, a challenge may occur when portions of signals are reflected, resulting in the signals arriving out of order at the receiver or the receiver receiving the same portion of a signal several times. In some cases, reflections may cause signals to become out of phase and the signals may cancel each other out. In some embodiments, diffraction may affect a wireless signal transmission. Diffraction may occur when the signal bends and spreads around an obstacle. It may be most pronounced when a wave strikes an object with a size comparable to its own wavelength. In some embodiments, refraction may affect a wireless signal transmission. Refraction may occur when the signal changes direction (i.e., bends) as the signal passes through matter with different density. In some cases, this may occur when wireless signals encounter dust particles in the air or water. 
     In some embodiments, obstructions may affect a wireless signal transmission. As a signal travels to a receiver it may encounter various obstructions, as wireless signals travelling further distances widen near the midpoint and slim down closer to the receiver. Even in a visual line of sight (LOS), earth curvature, mountains, trees, grass, and pollution, may interfere with the signal when the distance is long. This may also occur for multiple wireless communicating robots positioned within a home or in a city. The robot may use the wireless network or may create an ad hoc connection when in the visual LOS. Some embodiments may use Fresnel zone, a confocal prolate ellipsoidal shaped region of space between and around a transmitter and receiver. In some embodiments, the size of the Fresnel zone at any particular distance from the transmitter and receiver may help in predicting whether obstructions or discontinuities along the path of the transmission may cause significant interference. In some embodiments, a lack of bandwidth may affect a wireless signal transmission. In some cases, there may be difficulty in transmitting an amount of data required in a timely fashion when there is a lack of bandwidth. In some embodiments, header compression may be used to save on bandwidth. Some traffic (such as voice over IP) may have a small amount of application data in each packet but may send many packets overall. In this case, the amount of header information may consume more bandwidth than the data itself. Header compression may be used to eliminate redundant fields in the header of packets and hence save on bandwidth. In some embodiments, link speeds may affect a wireless signal transmission. For example, slower link speeds may have a significant impact on end-to-end delay due to the serialization process (the amount of time it takes the router to put the packet from its memory buffers onto the wire), wherein the larger the packet, the longer the serialization delay. In some embodiments, payload compression may be used to compress application data transmitted over the network such the router transmits less data across a slow WAN link. 
     In some embodiments, received signal strength indicator (RSSI) may be used to determine the power in a received radio signal or received channel power indicator (RCPI) may be used to determine the received RF power in a channel covering the entire received frame, with defined absolute levels of accuracy and resolution. For example, the 802.11 IEEE standard employs RSSI or RCPI. In some embodiments, signal-to-noise ratio (SNR) may be used to determine the strength of the signal compared to the surrounding noise corrupting the signal. In some embodiments, link budget may be used to determine the power required to transmit a signal that when reached at the receiving end may still be understood. In embodiments, link budget may account for all the gains and losses between a sender and a receiver, including attenuation, antenna gain, and other miscellaneous losses that may occur. For example, link budget may be determined using Received Power (dBm)=Transmitted Power (dBm)+Gains (dB)−Losses (dB). 
     In some embodiments, data may undergo a process prior to leaving an antenna of a robot. In some embodiments, a modulation technique, such as Frequency Modulation (FM) or Amplitude Modulation (AM), used in encoding data, may be used to place data on RF carrier signals. In some cases, frequency bands may be reserved for particular purposes. For example, ISM (Industry, Scientific, and Medical) frequency bands are radio bands from the RF spectrum that are reserved for purposes other than telecommunications. 
     In embodiments, different applications may use different bandwidths, wherein a bandwidth in a wireless network may be a number of cycles per second (e.g., in Hertz or Hz). For example, a low quality radio station may use a 3 kHz frequency range, a high quality FM radio station may use 175 kHz frequency range, and a television signal, which sends both voice and video data over the air, may use 4500 kHz frequency range. In some embodiments, Extremely Low Frequency (ELF) may be a frequency range between 3-30 Hz, Extremely High Frequency (EHF) may be a frequency range between 30-300 GHz, and WLANs operating in an Ultra High Frequency (UHF) or Super High Frequency (SHF) may have a frequency range of 900 MHz, 2.4 GHz, or 5 GHz. In embodiments, different standards may use different bandwidths. For example, the 802.11, 802.11b, 802.11g, and 802.11n IEEE standards use 2.4 GHz frequency range. In some embodiments, wireless LANs may use and divide the 2.4 GHz frequency range into channels ranging from 2.4000-2.4835 GHz. In the United States, the United States standard allows 11 channels, with each channel being 22 MHz wide. In some embodiments, a channel may overlap with another channel and cause interference. For this reason, channels 1, 6, and 11 are most commonly used as they do not overlap. In some embodiments, the processor of the robot may be configured to choose one of channel 1, 6, or 11. In some embodiments, the 5 GHz frequency range may be divided into channels, with each channel being 20 MHz wide. Based on the 802.11a and 802.11n IEEE standards, a total of 23 non-overlapping channels exist in the 5 GHz frequency. 
     In embodiments, different frequency ranges may use different modulation techniques that may provide different data rates. A modulated waveform may consist of amplitude, phase, and frequency which may correspond to volume of the signal, the timing of the signal between peaks, and the pitch of the signal. Examples of modulation techniques may include direct sequence spread spectrum (DSSS), Orthogonal Frequency Division Multiplexing (OFDM), and Multiple-Input Multiple-Output (MIMO). For example, 2.4 GHz frequency range may use DSSS modulation which may provide data rates of 1, 2, 5.5, and 11 Mbps and 5 GHz frequency range may use OFDM which may provide data rates of 6, 9, 12, 18, 24, 36, 48, and 54 Mbps. Devices operating within the 2.5 GHz range may use DSSS modulation technique to transmit data. In some embodiments, the transmitted data may be spread across the entire frequency spectrum being used. For example, an access point transmitting on channel 1 may spread the carrier signal across the 22 MHz-wide channel ranging from 2.401-2.423 GHz. In some embodiments, DSSS modulation technique may encode data (i.e., transform data from one format to another) using a chip sequence because of the possible noise interference with wireless transmission. In some embodiments, DSSS modulation technique may transmit a single data bit as a string of chips or a chip stream spread across the frequency range. With redundant data being transmitted, it is likely that the transmitted data is understood despite some of the signal being lost to noise. In some embodiments, transmitted signals may be modulated over the airwaves and the receiving end may decode this chip sequence back to the originally transmitted data. Because of interference, it is possible that some of the bits in the chip sequence may be lost or inverted (e.g., 1 may become 0 or 0 may become 1). However, with DSSS modulation technique, more than five bits need to be inverted to change the value of a bit from 1 to 0. Because of this, using a chipping sequence may provide networks with added resilience against interference. 
     In some embodiments, DSSS modulation technique may use Barker code. For example, the 802.11 IEEE standard uses an 11 chip Barker code 10110111000 to achieve rates of 1 and 2 Mbps. In embodiments, a Barker code may be a finite sequence of N values a of +1 and −1. In some embodiments, values a j  for j=1, 2, . . . , N may have off-peak autocorrelation coefficients 
               c   v     =       ∑     j   =   1       N   -   v               a   j     ⁢       a     j   +   v       .               
In some embodiments, the autocorrelation coefficients are as small as possible, wherein |c ν |≤1 for all 1≤ν&lt;N. In embodiments, sequences may be chosen for their spectral properties and low cross correlation with other sequences that may interfere. The value of the autocorrelation coefficient for the Barker sequence may be 0 or −1 at all offsets except zero, where it is +11. The Barker code may be used for lower data rates, such as 1, 2, 5.5, and 11 Mbps. In some embodiments, the DSSS modulation technique may use a different coding method to achieve higher data rates, such as 5.5 and 11 Mbps. In some embodiments, DSSS modulation technique may use Complementary Code Keying (CCK). In embodiments, CCK uses a series of codes, or otherwise complementary sequences. In some embodiments, CCK may use 64 unique code words, wherein up to 6 bits may be represented by a code word. In some embodiments, CCK may transmit data in symbols of eight chips, wherein each chip is a complex quadrature phase-shift keying bit-pair at a chip rate of 11 Mchips/s. In 5.5 Mbit/s and 11 Mbit/s, 4 and 8 bits, respectively, may be modulated onto the eight chips c 0 , . . . , c 7 , wherein c=(c 0 , . . . , c 7 )=(e j(ϕ     1     +ϕ     2     +ϕ     3     +ϕ     4     ) , e j(ϕ     1     +ϕ     3     +ϕ     4     ) , e j(ϕ     1     +ϕ     2     +ϕ     4     ) , −e j(ϕ     1     +ϕ     4     ) , e j(ϕ     1     +ϕ     2     +ϕ     3     ) , e j(ϕ     1     +ϕ     3     ) , −e j(ϕ     1     +ϕ     2     ) , e j(ϕ     1    and phase change ϕ 1 , . . . , ϕ 4  may be determined by the bits being modulated. Since ϕ 1  is applied to every chip, ϕ 2  is applied to even chips, ϕ 3  is applied the first two of every four chips, and ϕ 4  is applied to the first four of eight chips, CCK may be generalized Hadamard transform encoding. In some embodiments, DSSS modulation technique may use Mary Orthogonal Keying which uses polyphase complementary codes or other encoding methods.
 
     In some embodiments, after encoding the data (e.g., transforming an RF signal to a sequence of ones and zeroes), the data may be transmitted or modulated out of a radio antenna of a device. In embodiments, modulation may include manipulation of the RF signal, such as amplitude modulation, frequency modulation, and phase-shift keying (PSK). In some embodiments, the data transmitted may be based on the amplitude of the signal. For example, in amplitude modulation, +3V may be represented by a value of 1 and −3V may be represented by a value of 0. In some embodiments, the amplitude of a signal may be altered during transmission due to noise or other factors which may influence the data transmitted. For this reason, AM may not be a reliable solution for transmitting data. Factors such as frequency and phase are less likely to be altered due to external factors. In some embodiments, PSK may be used to convey data by changing the phase of the signal. In embodiments, a phase shift is the difference between two waveforms at the same frequency. For example, two waveforms that peak at the same time are in phase and peak at different times are out of phase. In some embodiments, binary phase-shift keying (BPSK) and quadrature phase-shift keying (QPSK) modulation may be used, as in 802.11b IEEE standard. In BPSK, two phases separated by 180 degrees may be used, wherein a phase shift of 180 degrees may be represented by a value of 1 and a phase shift of 0 degrees may be represented by a value of 0. In some embodiments, BPSK may encode one bit per symbol, which is a slower rate compared to QPSK. QPSK may encode 2 bits per symbol which doubles the rate while staying within the same bandwidth. In some embodiments, QPSK may be used with Barker encoding at a 2 Mbps data rate. In some embodiments, QPSK may be used with CCK-16 encoding at a 5.5 Mbps rate. In some embodiments, QPSK may be used with CCK-128 encoding at a 11 Mbps rate. 
     As an alternative to DSSS, OFDM modulation technique may be used in wireless networks. In embodiments, OFDM modulation technique may be used to achieve very high data rates with reliable resistance to interference. In some embodiments, a number of channels within a frequency range may be defined, each channel being 20 MHz wide. In some embodiments, each channel may be further divided into a larger number of small-bandwidth subcarriers, each being 300 kHz wide, resulting in 52 subcarriers per channel. While the subcarriers may have a low data rate in embodiments, the data may be sent simultaneously over the subcarriers in parallel. In some embodiments, coded OFDM (COFDM) may be used, wherein forward error correction (i.e., convolutional coding) and time and frequency interleaving may be applied to the signal being transmitted. In some embodiments, this may overcome errors in mobile communication channels affected by multipath propagation and Doppler effects. In some embodiments, numerous closely spaced orthogonal subcarrier signals with overlapping spectra may be transmitted to carry data. In some embodiments, demodulation (i.e., the process of extracting the original signal prior to modulation) may be based on fast Fourier transform (FFT) algorithms. For complex numbers x 0 , . . . , x N-1 , the discrete Fourier transform (DFM) may be 
                 X   k     =         ∑     n   =   0       N   -   1               x   n     ⁢     e     -       i   ⁢   2   ⁢   π   ⁢   k   ⁢   n     N         ⁢         for   ⁢         k       =   0       ,   …         ,     N   -   1     ,         
wherein
 
             e     -       i   ⁢   2   ⁢   π     N             
is a primitive nth root of 1. In some embodiments, the DFM may be determined using O(N 2 ) operations, wherein there are N outputs X k , and each output has a sum of N terms. In embodiments, a FFT may be any method that may determine the DFM using 0(N log N) operations, thereby providing a more efficient method. For example, for complex multiplications and additions for N=4096 data points, evaluating the DFT sum directly involves N 2  complex multiplications and N(N−1) complex additions (after eliminating trivial operations (e.g., multiplications by 1)). In contrast, the Cooley-Tukey FFT algorithm may reach the same result with only (N/2)N complex multiplications and NN complex additions. Other examples of FFT algorithms that may be used include Prime-factor FFT algorithm, Bruun&#39;s FFT algorithm, Rader&#39;s FFT algorithm, Bluestein&#39;s FFT algorithm, and Hexagonal FFT.
 
     In some embodiments, MIMO modulation technique may be used. In some embodiments, the advanced signal processing allows data to be recovered after being transmitted on two or more spatial streams with more than 100 Mbps by multiplexing data streams simultaneously in one channel. For example, MIMO modulation technique may use two, three, or more antennas for receiving signals for advanced signal processing. 
     Some embodiments may employ dynamic rate shifting (DRS) (e.g., 802.11b, 802.11g, and 802.11a IEEE standards). In some embodiments, devices operating in the 2.4 GHz range may rate-shift from 11 Mbps to 5.5 Mbps and, in some circumstances, to 2 and 1 Mbps. In some embodiments, rate shifting occurs without dropping the connection and on a transmission-by-transmission basis. For example, a shift from 11 Mbps to 5.5 Mbps may shift back up to 11 Mbps for the next transmission. In all deployments, DRS may support multiple clients operating at multiple data rates. 
     In some embodiments, data collisions may occur, such as in the case of a work group of wireless robots. In some embodiments, two antennas may be used to listen for a jammed signal when a collision occurs, wherein one antenna may be used for transmitted data while the other antenna may be used for listening for a jammed signal. 
     In some embodiments, carrier sense multiple access collision avoidance (CSMA/CA) may be used to avoid data collisions. In such embodiments, a device may use an antenna to first listen prior to transmitting data to avoid data collision. If the channel is idle, the device may transmit a signal informing other devices to refrain from transmitting data as the device is going to transmit data. The device may use the antenna to listen again for a period of time prior to transmitting the data. Alternatively, request to send (RTS) and clear to send (CTS) packets may be used to avoid data collisions. The device transmitting data may transmit an RTS packet prior to transmitting the data and the intended receiver may transmit a CTS packet to the device. This may alert other devices to refrain from transmitting data for a period of time. In some embodiments, a RTS frame may include five fields: frame control, duration, receiver address (RA), transmitter address (TA), and Frame Check Sequence (FCS). In some embodiments, a CTS frame may include four fields: frame control, duration, RA, and FCS. In some embodiments, the RA may indicate the MAC address of the device receiving the frame and TA may indicate the MAC address of the device that transmitted the frame. In some embodiments, FCS may use the cyclic redundancy check (CRC) algorithm. 
     In some embodiments, Effective Isotropic Radiated Power (EIRP) may be used to measure the amount of energy radiated from, or output power of, an antenna in a specific direction. In some embodiments, the EIRP may be dependent on the total power output (quantified by the antenna gain) and the radiation pattern of the antenna. In some embodiments, the antenna gain may be the ratio of the signal strength radiated by an antenna to that radiated by a standard antenna. In some embodiments, the antenna may be compared to different standard antennas, such as an isotropic antenna and a half-wave dipole antenna, and hence different gains may be determined based on the standard antenna. For example, isotropic gain, 
               G   i     =           s   max       s     max   ,   isotropic         ⁢         or   ⁢           G   i       =     10   ⁢   log   ⁢       s   max       s     max   ,   isotropic                   
in decibels, may be determined as the ratio of the power density S max  received at a point far from the antenna in the direction of its maximum radiation to the power density S max,isotropic  received at the same point from a theoretically lossless isotropic antenna which radiates equal power in all direction. The dipole gain,
 
               G   d     =           s   max       s     max   ,   dipole         ⁢         or   ⁢           G   d       =     10   ⁢   log   ⁢       s   max       s     max   ,   dipole                   
in decibels, may be determined as the ratio of the power density S max  received in the direction of its maximum radiation to the power density S max,isotropic  received from a theoretically lossless half-wave dipole antenna in the direction of its maximum radiation. In some embodiments, EIRP may account for the losses in a transmission line and connectors. In some embodiments, the EIRP may be determined as EIRP=transmitter output power−cable loss+antenna gain. In some embodiments, a maximum 36 dBm EIRP, a maximum 30 dBm transmitter power with a 6 dBm gain of the antenna and cable combined, and a 1:1 ratio of power to gain may be used in a point-to-point connection. In some embodiments, a 3:1 ratio of power to gain may be used in multipoint scenarios.
 
     In some embodiments, a CPU, MPU, or MCU may be used for processing. In some embodiments, floats may be processed in hardware. In some embodiments, the MPU may be implemented in hardware. In some embodiments, a GPU may be used in a built-in architecture or in a separate unit in the main electronic board. In some embodiments, an intermediary object code may be created and linked and combined into a final code on a target robot. 
     In some embodiments, a robot boot loader may load a first block of code that may be executed within a memory. In some embodiments, a hash and a checksum of a file chosen for loading may be checked. In some embodiments, the hash and checksum may be printed in a real-time log. In some embodiments, the log may be stored in a memory. In some embodiments, the log may be transmitted over a Wi-Fi network on a computer acting as a terminal. In some embodiments, the transfer protocol may be SSH or telnet. In some embodiments, a security bit may be set in a release build to prohibit tampering of the code. In some embodiments, over the air updates may be possible. 
     In some embodiments, a customized non-volatile configuration may be read from an NVRAM or flash after the robot boot loader loads the code on the memory. For example, the RF channel may be stored and read as a NVRAM parameter and stored in the flash memory. In some embodiments, two copies of computer code may be stored in an NVRAM of the robot. In embodiments, wherein the robot may not boot (e.g., after an upgrade), a second executive computer code may be used for booting up the robot. In some embodiments, the content of memory of the robot may be dumped into a specific memory that may be later viewed or cleared when a hard fault crash occurs. In some embodiments, the amount of memory may be set to a maximum and the new information may rewrite old information. 
     In some embodiments, a boot up process of the robot may be interrupted by the user for troubleshooting purposes. In some embodiments, a sequence of characters may be pressed within a particular time frame during the boot up process to interrupt the boot up process. In some embodiments, further controls may be implemented by pressing other sequences of characters which may prompt the robot to perform a certain task. Some examples include ctrl+c to clear entered characters; ctrl+d to start docking; ctrl+g to start cleaning; ctrl+j to display scheduled jobs; ctrl+n to print the map; ctrl+q to show help/list commands; ctrl+r to software reset; ctrl+s to display statistics; ctrl+t to display current trouble; ctrl+v to toggle vacuum; and ctrl+z to stop cleaning/docking. 
     In some embodiments, the robot may be in various states and each state may have a substrate. For example, the robot may enter a Leave Dock Mode or a Cleaning Mode after boot up. In some embodiments, one or more routine handlers may be used. For example, a routine handler may include an instruction to perform undock, single sweep, and return to origin. 
     In some embodiments, hardware components of the robot may be initialized one by one. In some embodiments, hardware components may be categorized based on the functions they provide. For example, a motor for a suction fan of a robot with motors for moving and a motor for a suction fan may belong to a cleaning hardware subgroup. 
     In some embodiments, the latest version of a map may be saved on a non-volatile memory space of the robot or the base station or on the cloud after a first mapping session is complete. In some embodiments, the non-volatile memory space may be an NV RAM available on the MCU. Other locations may include a flash memory, another NVRAM on the main PCB of the robot or the charging station, or on the cloud. Depending on design preference, the map may be stored locally until the next cold reset of the robot. This may be an advantageous embodiment as a cold-reset may indicate the robot is experiencing a change. In some embodiments, this may be the default setting, however other settings may be possible. For example, a user may choose to permanently store the map in the NVRAM or flash. In some embodiments, a map may be stored on the robot as long as the robot is not cold-started or hard-reset. On cold-start or hard-reset, the processor of the robot may pull the map from the cloud. In some embodiments, the processor reuses the map. In some embodiments, wherein the processor may not be able to reuse the map, the processor of the robot may restart mapping from the beginning. Some embodiments statically allocate a fixed area in an SD-RAM of the robot or charging station as SD-RAMs are large and may thus store a large map if needed. In some embodiments, the fixed area in the SD-RAM may be marked as persistent (i.e., the fixed area is not zeroed upon MCU reset). Alternatively, the map may be stored in SRAM, however, inputs provided by a user (e.g., virtual boundaries, scheduling, floor types, zones, perimeter lines, robot settings, etc.) may be lost in the event that the map is lost during a cold-start or hard-reset. In another embodiment, the map may be even more persistent (i.e., stored in a flash memory) by storing a user request in NVRAM (e.g., as a Boolean). If the map is lost and internet access is down, the user request may be checked in the NVRAM. In some embodiments, the processor may conditionally report an error and may not perform work (e.g., sweep) when the user request cannot be honored. In embodiments, various options for storing the map are possible. 
     In some embodiments, boot up time of the robot may be reduced or performance may be improved by using a higher frequency CPU. In some instances, an increase in frequency of the processor may decrease runtime for all programs. In some instances, power consumption, P=C×V 2 ×F, by a chip may be determined, wherein C is the capacitance switched per clock cycle (in proportion to the number of transistors with changing inputs), V is the voltage, and F is the processor frequency (e.g., cycles per second). In some instances, higher frequency processing hardware consumes more power. In some cases, increase of frequency may be limited by technological constraints. Moore&#39;s law predicts faster and more powerful computers are built over time. However, to execute a number of sophisticated algorithms using current hardware, there may be a need for a combination of software enhancements, algorithm creativity, and parallel and concurrent processing. 
     In some cases, processing in parallel may not provide its full advantages or may be less advantageous for situations where some calculations may depend on prior calculations or data. For example, displacement of a robot may only be identified when the robot moves and sensors of the robot record the movement and other sensors of the robot confirm the movement. At which point, the processor may use the data to update the location of the robot. Theoretically, an increase in speed from parallelization is linear as doubling the number of processing elements reduces the runtime to half. However, in some cases, parallel algorithms may not double the runtime. While some processes may be processed faster linearly, in general, the gain in performance reduces with complexity. In some embodiments, the potential speedup of an algorithm on a parallel computing platform may be determined used Amdahl&#39;s law, 
                 S   ⁡   (   s   )     =     1     1   -   p   +     p   s           ,         
wherein S is the potential speedup in latency of the execution of the whole task, s is the speedup in latency of the execution of the parallelizable part of the task, and p is the percentage of the execution time of the whole task concerning the parallelizable part of the task before parallelization. In some embodiments, parallelization techniques may be advantageously used in situations where they may produce the most results, such as rectified linear unit functions (ReLU) and image processing. In some probabilistic methods, computational cost may increase in quadruples or more. This may be known as a dimensionality curse. In some instances, linear speed up may not be enough in execution of complex tasks if the algorithms and the low level code are written carelessly. As complexity of components increase, the increase in computational cost may become out of control.
 
     In some embodiments, concurrent computations may be executed during overlapping time periods. In some embodiments, the output of a computation may be required to be used as input of another computation. For example, a processor may receive and convolve various sensor data and the output may be used by the processor to generate a map. In some embodiments, the processor of the robot may share contents of a memory space dedicated to a process to another process to save on messaging time. In some embodiments, processes and threads may be executed in parallel on multiple cores. In some embodiments, each process may be assigned to a separate processor or processor core, or a computation may be distributed across multiple devices in a connected network of robotic devices. For example, a host processor executing a ‘for loop’ required to run 1000 iterations on the host processing unit one after another may delegate the task to a secondary processing device by launching a kernel on the secondary processing device. A block of 1000 individual threads may be launched on the secondary processing device in parallel to achieve a higher throughput. Or the host processor may delegate two blocks of 500 threads each. 
     In some embodiments, a high power processor and a low power processor may be used in conjunction with or separate from one other to enable one or more of a variety of different functionalities. In one embodiment, the high power processor and the low power processor may each be dedicated to different tasks or may both include general purpose processing. For example, the high power processor may execute computationally intensive operations and the low power processor may manage less complex operations. In one embodiment, the low power processor may wake or initialize the high power processor for computationally intensive processes. In some embodiments, data and control tasks may be processed on separate processors. In some embodiments, a data path may be separated from a control path. In some embodiments, the control path are bits and instructions that control the data. In some embodiments, data packets maybe separated from control packets. In some embodiments, the data packets may include some control information. In some embodiments, in-band communication may be employed. In some embodiments, out of band communication may be employed. 
     In some embodiments, virtual machines may be executed. In some embodiments, instructions may be divided and may be partly executed at the same time using pipelining techniques wherein individual instructions may be dispatched to be executed independently in different parts of the processor. Some instructions that may be pipelined within a clock cycle may include fetch, decode, execute, memory access, and write back. In some embodiments, an out-of-order execution may be allowed, justifying the computational and energy cost of this technique. In some embodiments, in-order execution including very long instruction word techniques may be used. In some embodiments, interdependencies of instructions may be carefully examined and managed. Minimizing dependencies techniques such as branch prediction (i.e., predicting which branch might be taken), predication (i.e., use of conditional moves), or register renaming (i.e., avoiding WAW and WAR dependencies) may be employed. 
     In some embodiments, latency may be reduced by optimizing the amount of time required for completion of a task. In some embodiments, latency may be sacrificed to instruct a secondary processing device to run multiple threads in an attempt to optimize throughput. In some cases, sophisticated handling of memory space is essential to refrain from memory spaces being shared or leaked between different processes when components that operate concurrently interact by accessing data in real-time as opposed to sending data in a form of messages to one another. 
     In some embodiments, multiple devices may communicate on a data bus. In some embodiments, RAM, ROM, or other memory types may be designed to connect to the data bus. In some embodiments, memory devices may have chip select and output enable pins. In some embodiments, either option may be selected and optimized to save electricity consumption or reduce latency. In some embodiments, a tri-state logic circuit may exist, wherein one state may be high impedance to remove the impact of a device from other parts of a system. In other embodiments, open collector input/output method may be used as an alternative to tri-state logic. In such implementations, devices may release communication lines when they are inactive. In other embodiments, a multiplexer may be used. 
     In some embodiments, processes may be further divided to threads and fibers. For example, thread A may update a memory spot with a variable and thread B may read that variable at the next clock interval. This may be helpful in saving resources when multiple threads need access to the same data and may provide better performance compared to that resulting from thread A being passed into thread B. 
     In some cases, memory management may be implemented from the lowest level of design to improve performance of the robot system. In some instances, intelligent use of registers may save on overhead. In some cases, use of cache memory may enhance performance. In some instances, to achieve a well designed system, quantities such as hit ratio may be properly monitored and optimized. In some embodiments, various memory mapping techniques may be used, such as direct mapping, associative mapping, and set-associative mapping. In some embodiments, a Memory Management Unit (MMU) or Memory Protection Unit (MPU) may be implemented in hardware or software. In some embodiments, cache memory may be used to enhance performance.  FIG.  124    illustrates an example of flow of information between CPU, cache memory, primary memory, and secondary memory. 
     In some embodiments, a Light Weight SLAM algorithm may process spatial data in real-time, generally without buffering or any delay caused by a multi-purpose operating system (OS) such as, Linux, Windows, or Mac OS, acting as an interface between the SLAM algorithm, sensors, and hardware. In some embodiments, a real-time OS may be used. In some embodiments, a Kernel may be used. In some cases, a scheduler may define a time bound system with well defined fixed time constraints. In some embodiments, the scheduler temporarily interrupts low priority tasks and schedules them for resumption at a later time when a high priority or privileged tasks require attention. In some embodiments, a real-time OS handles scheduling, control of the processor, allocation of memory, and input/output devices. In some embodiments, a scheduler block of code may be included in the architecture of the robot system which may also be responsible for controlling the memory, registers, input/output and cleanup of the memory after completion of each task. In some embodiments, the architecture may consist of a kernel which has direct access to privileged underlying hardware. In some embodiments, a Kernel may abstract the hardware and control mechanisms such as create, schedule, open, write, and allocate. In some embodiments, a Kernel may also control, process, thread, socket, and page memory. In some embodiments, a Kernel may enforce policies such as random access, least recently used, or earliest deadline first. In some embodiments, system calls may be implemented to provide access to underlying hardware for high-up processes. In some embodiments, a bit may be set and unset (or vise versa) when a process moves from a kernel mode to a higher level and back. In some embodiments, arguments and parameters may be passed directly between a higher level code and a kernel, or through a register. In some embodiments, a Kernel may trap an illegitimate instruction of memory access request. In some embodiments, a Kernel may send a signal to a process. In some embodiments, a Kernel may assign an ID to a task or process or a group of tasks or processes. In some embodiments, additional software modules or blocks may be installed in the robot system for future needs. In some embodiments, sensor readings may be passed (e.g., as an output) to a Kernel. In some embodiments, a sensor reading may be kept in a memory space and a Kernel may read that memory space in turns. In some embodiments, a Kernel may read a sensor reading from another location. In some embodiments, a Kernel obtains sensor readings without any passing or transferring or reading. All approaches of obtaining sensor readings may be used in an implementation. 
     In some embodiments, a scheduler may allot a certain amount of time to execution of each thread, task, tasklet, etc. For example, a first thread may run for 10 consecutive milliseconds then may be unscheduled by the scheduler to allow a second thread to run for the next 10 consecutive seconds. Similarly, a third thread may follow the second thread. This may continue until the last thread passes the control to the first thread again. In some embodiments, these slices of time may be allocated to threads with a same level of priority on a round robin basis. In some embodiments, each thread may be seen as an object which performs a specific function. In some embodiments, each thread may be assigned a thread ID. In some embodiments, a state of a running thread variable may be stored in a thread stack each time threads are switched. In some embodiments, each thread that is not in a running state (i.e., is in control of a processor or microcontroller) may be in a ready state or a wait state. In a ready state the thread may be ready to run after the current running thread is unscheduled. All other threads may be in a wait state. In some embodiments, priorities may be assigned to threads. A thread with higher priority may preempt threads with lower priorities. In some embodiments, the number of concurrently running threads may be decided in conjunction with thread stack size and other parameters, such as running in default stack or having additional memory space to run in. 
     In some embodiments, locking methods may be used. In other embodiments, multi-versioning may be used. In some embodiments, multi-versioning may converge to uni-versioning in later time slots. In some embodiments, multi-versioning may be used by design. For example, if transaction T i  wants to write to object P, and there is another transaction T k  occurring to the same object, the read timestamp RTS(T i ) must precede the read timestamp RTS(T k ) for the object write operation to succeed. In other words, a write cannot complete if there are other outstanding transactions with an earlier read timestamp RTS to the same object. Every object P has a timestamp TS, however if transaction T i  wants to write to an object, and the transaction has a timestamp TS that is earlier than the object&#39;s current read timestamp, then the transaction is aborted and restarted, as a later transaction already depends on the old value. Otherwise, T i  creates a new version of object P and sets the read/write timestamp TS of the new version to the timestamp of the transaction TS=TS(T i ). 
     In some embodiments, a behavior tree may be used to abstract the complexities of lower level implementations. In some embodiments, a behavior tree may be a mathematical model of plan execution wherein very complex tasks may be composed of simple tasks. In some embodiments, a behavior tree may be graphically represented as a directed tree. In implementation, nodes may be classified as root, control flow nodes, or execution nodes (i.e., tasks). For a pair of connected nodes, the outgoing node may be referred to as a parent and the incoming node as a child. A root node may have no parents and only one child, a control flow node may have one parent and at least one child and an execution node may have one parent and no children. The behavior tree may begin from the root which transmits ticks (i.e., enabling signal) at some frequency to its child to allow execution of the child. In some embodiments, when the execution of a node is allowed, the node may return a status of running, success, or failure to the parent. A control flow node may be used to control the subtasks from which it is composed. The control flow node may either be a fallback or sequence node, which run each of their subtasks in turns. When a subtask is completed and returns a status, the control flow node may decide if the next subtask is to be executed. Fallback nodes may find and execute the first child that does not fail, wherein children may be ticked in order of importance. Sequence nodes may find and execute the first child that has not yet succeeded. In some embodiments, the processor of the robot may define a behavior tree as a three-tuple, T i ={ƒ i ,r i ,Δt), wherein i∈N is the index of the tree, ƒ i :R n →R n  is a vector field representing the right has side of an ordinary difference equation, Δt is a time step, and r i :R n →{R i ,S i ,F i } is the return status, that can be equal to either running R i , success S i , or failure F i . In some embodiments, the processor may implement ordinary difference equations x k+t (t k+1 )=ƒ i (x k (t k )) with t k+1 =t k +Δt, wherein k∈N represents the discrete time and x∈R n  is the state space of the system modelled, to execute the behavior tree. In some embodiments, the processor uses a fallback operator to compose a more complex behavior tree T 0  from two behavior trees T i  and T j , wherein T 0 =fallback(T i ,T j ). The return status r 0  and the vector field ƒ 0  associated with T 0  may be defined by r 0  (x k )={r j (x k ) if x k ∈F 1 r i (x k ) otherwise and ƒ 0 (x k )={ƒ j (x k ) if x k ∈F 1 ƒ i (x k ) otherwise. In some embodiments, the processor uses a sequence operator to compose a more complex behavior tree T 0  from two behavior trees T i  and T j , wherein T 0 =sequence(T i ,T j ). The return status r 0  and the vector field ƒ 0  associated with T 0  may be defined by r 0 (x k )={r j (x k ) if x k ∈S 1 r i (x k ) otherwise and ƒ 0 (x k )={ƒ j (x k ) if x k ∈S 1 ƒ i (x k ) otherwise. 
     In some embodiments, a thread, task, or interrupt may be configured to control a GPIO pin, PIO pin, PWM pin, and timer pin connected to an IR LED transmitter that may provide illumination for a receiver expecting a single IR multi-path reflection of the IR LED off of a surface (e.g., floor). In some embodiments, a TSOP or TSSP sensor may be used. In some embodiments, the output of the sensor may be digital. In some embodiments, the detection range of the sensor may be controlled by changing the frequency within the sensitive bandwidth region or the duty cycle. In some embodiments, a TSOP sensor may be beneficial in terms of power efficiency. For example,  FIG.  125    includes three tables with the voltage measured for a TSOP sensor and a generic IR sensor under three different test conditions. In some embodiments, a while loop or other types of loops may be configured to iterate with each clock as a continuous thread. In some embodiments, a lack of presence of a reflection may set a counter to increase a last value by unity. In some embodiments, the counter may be reset upon receipt of a next reflection. In some embodiments, a new thread with a higher priority may preempt the running thread when a value of the counter reaches a certain threshold. In some embodiments, a thread may control other pins and may provide PWM capabilities to operate the IR transmitter at a 50% duty cycle (or at 10%, 70%, 100% or other percentage duty cycle) to control the average intensity or the IR emission. In some embodiments, the receiver may be responsive to only a certain frequency (e.g., TSOP sensors most commonly respond to 38 Khz frequency). In some embodiments, the receiver may be able to count the number of pulses (or lack thereof) in addition to a presence or lack of presence of light. In some embodiments, other methods of modulating code words or signals over different mediums may be used. In some instances, code words need to be transmitted directionally and quickly, which, with current technologies, may be cost prohibitive. Examples of mediums that may be used other than IR include other spectrums of light, RF using directional and non-directional antennas, acoustic using directional, highly directional, and non-directional antennas, microphones, ultra-sonic, etc. In some embodiments, in addition or in combination or in place of PWM, other modulation methods such as Amplitude Modulation (AM) or Frequency Modulation (FM) may be used. 
     In some embodiments, specular reflection, surface material, angle of the surface normal, ambience light decomposition and intensity, the saturation point of the silicon chip on the receiver, etc. may play a role in how and if a receiver receives a light reflection. In some embodiments, cross talk between sensors may also have an influence. In some embodiments, dedicated allocation of a time slot to each receiver may serve as a solution. In some embodiments, the intensity of the transmitter may be increased with the speed of the robot to observe further at higher speeds. In various environments, a different sensor or sensor settings may be used. In some behavioral robots, a decision may be made based on a mere lack of reflection or presence of a reflection. In some embodiments, counting a counter to a certain value may change the state of a state machine or a behavior tree or may break an iteration loop. In some embodiments, this may be described as a deterministic function wherein state transition=ƒ(˜receipt of reflection). In other embodiments, state transition=ƒ(counter+1&gt;x). In some embodiments, a probabilistic method may be used wherein state transition=P(observation X|observation Y), wherein X and Y may be observations independent of noise impact by one or more sensors observed at the same or different time stamps. 
     In some embodiments, IR sensors may use different wavelengths to avoid cross talk. In some embodiments, the processor may determine an object based on the reflection of light off of a particular surface texture or material as light reflects differently off of different textures or materials for different wavelengths. In some embodiments, the processor may use this to detect pets, humans, pet refuse, liquid, plants, gases (e.g., carbon monoxide), etc. 
     In some embodiments, information from the memory of the robot may be sent to the cloud. In some embodiments, user permission may be requested prior to sending information to the cloud. In some embodiments, information may be compressed prior to being sent. In some embodiments, information may be encrypted prior to being sent. 
     In some embodiments, memory protection for hardware may be used. For example, secure mechanisms are essential when sending and obtaining spatial data to and from the cloud as privacy and confidentiality are of highest importance. In embodiments, information is not disclosed to unauthorized individuals, groups, processes, or devices. In embodiments, highly confidential data is encrypted such third parties may not easily decrypt the data. In embodiments, impersonation is impossible. For example, a third party is unable to insert an unauthentic map or data in replacement of the real map or data. In embodiments, security begins at the data collection level. In embodiments, information processed is inaccessible by a third party. In embodiments, executable code (e.g., SLAM code, coverage code, etc.) and the map (and any related information) are not retrievable from a stored location (e.g., flash or NVRAM or other storage) and are sealed and secured. In some embodiments, encryption mechanisms may be used. In embodiments, permission from the user is required when all or part of map is sent to the cloud. In embodiments, permission from the user is recorded and stored for future references. In embodiments, the method of obtaining permission from the user is such a third party, including the manufacturer, cannot fabricate a permission on behalf of the user. In some embodiments, a transmission channel may be encrypted to prohibit a third party from eavesdropping and translating the plain text communication into a spatial representation of a home of the user. For example, software such as Wireshark may be able to read clear text when connected to a home router and other software may be used to present the data payload into spatial formats. In embodiments, data must remain secure in the cloud. In some embodiments, only an authorized party may decrypt the encrypted information. In some embodiments, data may be encrypted with either symmetric or asymmetric methods, or hashing. Some embodiments may use a secret key or public-private key. In some embodiments, the robot may use data link protocols to connect within a LAN or user IP layer protocols with IPV4 or IPV6 addresses for communication purposes. In some embodiments, communication may be connection based (e.g., TCP) or connectionless (e.g., UDP). For time-sensitive information, UDP may be used. For communication that requires receipt at the other side, TCP may be used. In some embodiments, other encryption frameworks such as IPsec and L2TP may be used. 
     In some embodiments, information may be marked as acceptable and set as protected by the user. In some embodiments, the user may change a protection setting of the information to unprotected. In some embodiments, the processor of the robot does not have the capacity to change the protection setting of the information. In order to avoid situations wherein the map becomes corrupt or localization is compromised, the Atomicity, Consistency, Isolation, and Durability (ACID) rules may be observed. In some cases, atomicity may occur when a data point is inconsistent with a previous data point and corrupts the map. In some cases, a set of constraints or rules may be used to provide consistency of the map. For example, after executing an action or control from a consistent initial state a next state must be guaranteed to reach a consistent state. However, this does not negate the kidnapped robot issue. In such a case, a control defined as picking the robot up may be considered to produce a consistent action. Similarly, an accelerometer may detect a sudden push. This itself may be an action to define a rule that may keep information consistent. These observations may be included at all levels of implementation and may be used in data sensing subsystems, data aggregation subsystems, schedulers, or algorithm level subsystems. In some embodiments, mutual exclusion techniques may be used to provide consistency of data. In some embodiments, inlining small functions may be used to optimize performance. 
       FIG.  126    illustrates an example of the subsystems of the robot described herein, wherein global and local mapping may be used in localization of the robot and vice versa, global and local mapping may be used in map filling, map filling may be used in determining cell properties of the map, cell properties may be used in establishing zones, creating subzones, and evaluating traversability, and subzones and traversability may be used for polymorphic path planning. 
     The methods and techniques described herein may be used with various types of robots such as a surface cleaning robot (e.g., mop, vacuum, pressure cleaner, steam cleaner, etc.), a robotic router, a robot for item or food delivery, a restaurant server robot, a first aid robot, a robot for transporting passengers, a robotic charger, an image and video recording robot, an outdoor robotic sweeper, a robotic mower, a robotic snow plough, a salt or sand spreading robot, a multimedia robot, a robotic cooking device, a car washing robot, a robotic hospital bed, and the like. 
       FIG.  127    illustrates an example of a robot  12700  with processor  12701 , memory  12702 , a first set of sensors  12703 , second set of sensors  12704 , network communication  12705 , movement driver  12706 , signal receiver  12707 , and one or more tools  12708 . In some embodiments, the robot may include the features of a robot described herein. In some embodiments, program code stored in the memory  12702  and executed by the processor  12701  may effectuate the operations described herein. Some embodiments additionally include user communication device  12709  having a touchscreen  12710  with a software application coupled to the robot  12700 , such as that described in U.S. patent application Ser. Nos. 15/272,752, 15/949,708, and 16/277,991, the entire contents of which is hereby incorporated by reference. For example, the application may be used to provide instructions to the robot, such as days and times to execute particular functions and which areas to execute particular functions within. Examples of scheduling methods are described in U.S. patent application Ser. Nos. 16/051,328 and 15/449,660, the entire contents of which are hereby incorporated by reference. In other cases, the application may be used by a user to modify the map of the environment by, for example, adjusting perimeters and obstacles and creating subareas within the map. Some embodiments include a charging or docking station  112711 . 
     In some embodiments, data may be sent between the processor of the robot and an application of the communication device using one or more wireless communication channels such as Wi-Fi or Bluetooth wireless connections. In some cases, communications may be relayed via a remote cloud-hosted application that mediates between the robot and the communication device, e.g., by exposing an application program interface by which the communication device accesses previous maps from the robot. In some embodiments, the processor of the robot and the application of the communication device may be paired prior to sending data back and forth between one another. In some cases, pairing may include exchanging a private key in a symmetric encryption protocol, and exchanges may be encrypted with the key. 
     In some embodiments, the processor of the robot may transmit the map of the environment to the application of a communication device (e.g., for a user to access and view). In some embodiments, the map of the environment may be accessed through the application of a communication device and displayed on a screen of the communication device, e.g., on a touchscreen. In some embodiments, the processor of the robot may send the map of the environment to the application at various stages of completion of the map or after completion. In some embodiments, the application may receive a variety of inputs indicating commands using a user interface of the application (e.g., a native application) displayed on the screen of the communication device. Examples of graphical user interfaces are described in U.S. patent application Ser. Nos. 15/272,752 and 15/949,708, the entire contents of each of which are hereby incorporated by reference. Some embodiments may present the map to the user in special-purpose software, a web application, or the like. In some embodiments, the user interface may include inputs by which the user adjusts or corrects the map perimeters displayed on the screen or applies one or more of the various options to the perimeter line using their finger or by providing verbal instructions, or in some embodiments, an input device, such as a cursor, pointer, stylus, mouse, button or buttons, or other input methods may serve as a user-interface element by which input is received. In some embodiments, after selecting all or a portion of a perimeter line, the user may be provided by embodiments with various options, such as deleting, trimming, rotating, elongating, shortening, redrawing, moving (in four or more directions), flipping, or curving, the selected perimeter line. In some embodiments, the user interface presents drawing tools available through the application of the communication device. In some embodiments, a user interface may receive commands to make adjustments to settings of the robot and any of its structures or components. In some embodiments, the application of the communication device sends the updated map and settings to the processor of the robot using a wireless communication channel, such as Wi-Fi or Bluetooth. 
     In some embodiments, the map generated by the processor of the robot (or one or remote processors) may contain errors, may be incomplete, or may not reflect the areas of the environment that the user wishes the robot to service. By providing an interface by which the user may adjust the map, some embodiments obtain additional or more accurate information about the environment, thereby improving the ability of the robot to navigate through the environment or otherwise operate in a way that better accords with the user&#39;s intent. For example, via such an interface, the user may extend the boundaries of the map in areas where the actual boundaries are further than those identified by sensors of the robot, trim boundaries where sensors identified boundaries further than the actual boundaries, or adjusts the location of doorways. Or the user may create virtual boundaries that segment a room for different treatment or across which the robot will not traverse. In some cases where the processor creates an accurate map of the environment, the user may adjust the map boundaries to keep the robot from entering some areas. 
       FIG.  128 A  illustrates an overhead view of an environment  22300 . This view shows the actual obstacles of the environment with outer line  22301  representing the walls of the environment  22300  and the rectangle  22302  representing a piece of furniture.  FIG.  128 B  illustrates an overhead view of a two-dimensional map  22303  of the environment  22300  created by a processor of the robot using environmental data collected by sensors. Because the methods for generating the map are not 100% accurate, the two-dimensional map  22303  is approximate and thus performance of the robot may suffer as its navigation and operations within the environment are in reference to the map  22303 . To improve the accuracy of the map  22303 , a user may correct the perimeter lines of the map to match the actual obstacles via a user interface of, for example, an application of a communication device.  FIG.  128 C  illustrates an overhead view of a user-adjusted two-dimensional map  22304 . By changing the perimeter lines of the map  22303  (shown in  FIG.  128 B ) created by the processor of the robot, a user is enabled to create a two-dimensional map  22304  of the environment  22300  (shown in  FIG.  128 A ) that accurately identifies obstacles and boundaries in the environment. In this example, the user also creates areas  22305 ,  22306 , and  22307  within the two-dimensional map  22304  and applies particular settings to them using the user interface. By delineating a portion  22305  of the map  22304 , the user can select settings for area  22305  independent from all other areas. For example, for a surface cleaning robot the user chooses area  22305  and selects weekly cleaning, as opposed to daily or standard cleaning, for that area. In a like manner, the user selects area  22306  and turns on a mopping function for that area. The remaining area  22307  is treated in a default manner. Additional to adjusting the perimeter lines of the two-dimensional map  22304 , the user can create boundaries anywhere, regardless of whether an actual perimeter exists in the environment. In the example shown, the perimeter line in the corner  308  has been redrawn to exclude the area near the corner. The robot will thus avoid entering this area. This may be useful for keeping the robot out of certain areas, such as areas with fragile objects, pets, cables or wires, etc. 
       FIGS.  129 A and  129 B  illustrate an example of changing perimeter lines of a map based on user inputs via a graphical user interface, like on a touchscreen.  FIG.  129 A  depicts an overhead view of an environment  22400 . This view shows the actual obstacles of environment  22400 . The outer line  22401  represents the walls of the environment  22400  and the rectangle  22402  represents a piece of furniture. Commercial use cases are expected to be substantially more complex, e.g., with more than 2, 5, or 10 obstacles, in some cases that vary in position over time.  FIG.  129 B  illustrates an overhead view of a two-dimensional map  22410  of the environment  22400  created by a processor of a robot using environmental sensor data. Because the methods for generating the map are often not 100% accurate, the two-dimensional map  22410  may be approximate. In some instances, performance of the robot may suffer as a result of imperfections in the generated map  22410 . In some embodiments, a user corrects the perimeter lines of map  22410  to match the actual obstacles and boundaries of environment  22400 . In some embodiments, the user is presented with a user interface displaying the map  22410  of the environment  22400  on which the user may add, delete, and/or otherwise adjust perimeter lines of the map  22410 . For example, the processor of the robot may send the map  22410  to an application of a communication device wherein user input indicating adjustments to the map are received through a user interface of the application. The input triggers an event handler that launches a routine by which a perimeter line of the map is added, deleted, and/or otherwise adjusted in response to the user input, and an updated version of the map may be stored in memory before being transmitted back to the processor of the robot. For instance, in map  22410 , the user manually corrects perimeter line  22416  by drawing line  22418  and deleting perimeter line  22416  in the user interface. In some cases, user input to add a line may specify endpoints of the added line or a single point and a slope. Some embodiments may modify the line specified by inputs to “snap” to likely intended locations. For instance, inputs of line endpoints may be adjusted by the processor to equal a closest existing line of the map. Or a line specified by a slope and point may have endpoints added by determining a closest intersection relative to the point of the line with the existing map. In some cases, the user may also manually indicate with portion of the map to remove in place of the added line, e.g., separately specifying line  22418  and designating curvilinear segment  22416  for removal. Or some embodiments may programmatically select segment  22416  for removal in response to the user inputs designating line  22418 , e.g., in response to determining that areas  22416  and  22418  bound areas of less than a threshold size, or by determining that line  22416  is bounded on both sides by areas of the map designated as part of the environment. 
     In some embodiments, the application suggests a correcting perimeter. For example, embodiments may determine a best-fit polygon of a perimeter of the (as measured) map through a brute force search or some embodiments may suggest a correcting perimeter with a Hough Transform, the Ramer-Douglas-Peucker algorithm, the Visvalingam algorithm, or other line-simplification algorithm. Some embodiments may determine candidate suggestions that do not replace an extant line but rather connect extant segments that are currently unconnected, e.g., some embodiments may execute a pairwise comparison of distances between endpoints of extant line segments and suggest connecting those having distances less than a threshold distance apart. Some embodiments may select, from a set of candidate line simplifications, those with a length above a threshold or those with above a threshold ranking according to line length for presentation. In some embodiments, presented candidates may be associated with event handlers in the user interface that cause the selected candidates to be applied to the map. In some cases, such candidates may be associated in memory with the line segments they simplify, and the associated line segments that are simplified may be automatically removed responsive to the event handler receive a touch input event corresponding to the candidate. For instance, in map  22410 , in some embodiments, the application suggests correcting perimeter line  22412  by displaying suggested correction  22414 . The user accepts the corrected perimeter line  22414  that will replace and delete perimeter line  22412  by supplying inputs to the user interface. In some cases, where perimeter lines are incomplete or contain gaps, the application suggests their completion. For example, the application suggests closing the gap  22420  in perimeter line  22422 . Suggestions may be determined by the robot, the application executing on the communication device, or other services, like a cloud-based service or computing device in a base station. 
     In embodiments, perimeter lines may be edited in a variety of ways such as, for example, adding, deleting, trimming, rotating, elongating, redrawing, moving (e.g., upward, downward, leftward, or rightward), suggesting a correction, and suggesting a completion to all or part of the perimeter line. In some embodiments, the application may suggest an addition, deletion or modification of a perimeter line and in other embodiments the user may manually adjust perimeter lines by, for example, elongating, shortening, curving, trimming, rotating, translating, flipping, etc. the perimeter line selected with their finger or buttons or a cursor of the communication device or by other input methods. In some embodiments, the user may delete all or a portion of the perimeter line and redraw all or a portion of the perimeter line using drawing tools, e.g., a straight-line drawing tool, a Bezier tool, a freehand drawing tool, and the like. In some embodiments, the user may add perimeter lines by drawing new perimeter lines. In some embodiments, the application may identify unlikely boundaries created (newly added or by modification of a previous perimeter) by the user using the user interface. In some embodiments, the application may identify one or more unlikely perimeter segments by detecting one or more perimeter segments oriented at an unusual angle (e.g., less than 25 degrees relative to a neighboring segment or some other threshold) or one or more perimeter segments comprising an unlikely contour of a perimeter (e.g., short perimeter segments connected in a zig-zag form). In some embodiments, the application may identify an unlikely perimeter segment by determining the surface area enclosed by three or more connected perimeter segments, one being the newly created perimeter segment and may identify the perimeter segment as an unlikely perimeter segment if the surface area is less than a predetermined (or dynamically determined) threshold. In some embodiments, other methods may be used in identifying unlikely perimeter segments within the map. In some embodiments, the user interface may present a warning message using the user interface, indicating that a perimeter segment is likely incorrect. In some embodiments, the user may ignore the warning message or responds by correcting the perimeter segment using the user interface. 
     In some embodiments, the application may autonomously suggest a correction to perimeter lines by, for example, identifying a deviation in a straight perimeter line and suggesting a line that best fits with regions of the perimeter line on either side of the deviation (e.g. by fitting a line to the regions of perimeter line on either side of the deviation). In other embodiments, the application may suggest a correction to perimeter lines by, for example, identifying a gap in a perimeter line and suggesting a line that best fits with regions of the perimeter line on either side of the gap. In some embodiments, the application may identify an end point of a line and the next nearest end point of a line and suggests connecting them to complete a perimeter line. In some embodiments, the application may only suggest connecting two end points of two different lines when the distance between the two is below a particular threshold distance. In some embodiments, the application may suggest correcting a perimeter line by rotating or translating a portion of the perimeter line that has been identified as deviating such that the adjusted portion of the perimeter line is adjacent and in line with portions of the perimeter line on either side. For example, a portion of a perimeter line is moved upwards or downward or rotated such that it is in line with the portions of the perimeter line on either side. In some embodiments, the user may manually accept suggestions provided by the application using the user interface by, for example, touching the screen, pressing a button or clicking a cursor. In some embodiments, the application may automatically make some or all of the suggested changes. 
     In some embodiments, maps may be represented in vector graphic form or with unit tiles, like in a bitmap. In some cases, changes may take the form of designating unit tiles via a user interface to add to the map or remove from the map. In some embodiments, bitmap representations may be modified (or candidate changes may be determined) with, for example, a two-dimensional convolution configured to smooth edges of mapped environment areas (e.g., by applying a Gaussian convolution to a bitmap with tiles having values of 1 where the environment is present and 0 where the environment is absent and suggesting adding unit tiles with a resulting score above a threshold). In some cases, the bitmap may be rotated to align the coordinate system with walls of a generally rectangular room, e.g., to an angle at which a diagonal edge segments are at an aggregate minimum. Some embodiments may then apply a similar one-dimensional convolution and thresholding along the directions of axes of the tiling, but applying a longer stride than the two-dimensional convolution to suggest completing likely remaining wall segments. 
     In some embodiments, the user may create different areas within the environment via the user interface (which may be a single screen, or a sequence of displays that unfold over time). In some embodiments, the user may select areas within the map of the environment displayed on the screen using their finger or providing verbal instructions, or in some embodiments, an input device, such as a cursor, pointer, stylus, mouse, button or buttons, or other input methods. Some embodiments may receive audio input, convert the audio to text with a speech-to-text model, and then map the text to recognized commands. In some embodiments, the user may label different areas of the environment using the user interface of the application. In some embodiments, the user may use the user interface to select any size area (e.g., the selected area may be comprised of a small portion of the environment or could encompass the entire environment) or zone within a map displayed on a screen of the communication device and the desired settings for the selected area. For example, in some embodiments, a user selects any of: cleaning modes, frequency of cleaning, intensity of cleaning, power level, navigation methods, driving speed, etc. The selections made by the user are sent to a processor of the robot and the processor of the robot processes the received data and applies the user changes. 
     In some embodiments, the user may select different settings, such as tool, cleaning and scheduling settings, for different areas of the environment using the user interface. In some embodiments, the processor autonomously divides the environment into different areas and in some instances, the user may adjust the areas of the environment created by the processor using the user interface. Examples of methods for dividing an environment into different areas and choosing settings for different areas are described in U.S. patent application Ser. Nos. 14/817,952, 16/198,393, and 15/619,449, the entire contents of each of which are hereby incorporated by reference. In some embodiments, the user may adjust or choose tool settings of the robot using the user interface of the application and may designate areas in which the tool is to be applied with the adjustment. Examples of tools of a surface cleaning robot include a suction tool (e.g., a vacuum), a mopping tool (e.g., a mop), a sweeping tool (e.g., a rotating brush), a main brush tool, a side brush tool, and an ultraviolet (UV) light capable of killing bacteria. Tool settings that the user may adjust using the user interface may include activating or deactivating various tools, impeller motor speed or power for suction control, fluid release speed for mopping control, brush motor speed for vacuuming control, and sweeper motor speed for sweeping control. In some embodiments, the user may choose different tool settings for different areas within the environment or may schedule particular tool settings at specific times using the user interface. For example, the user selects activating the suction tool in only the kitchen and bathroom on Wednesdays at noon. In some embodiments, the user may adjust or choose robot cleaning settings using the user interface. Robot cleaning settings may include, but are not limited to, robot speed settings, movement pattern settings, cleaning frequency settings, cleaning schedule settings, etc. In some embodiments, the user may choose different robot cleaning settings for different areas within the environment or may schedule particular robot cleaning settings at specific times using the user interface. For example, the user chooses areas A and B of the environment to be cleaned with the robot at high speed, in a boustrophedon pattern, on Wednesday at noon every week, and areas C and D of the environment to be cleaned with the robot at low speed, in a spiral pattern, on Monday and Friday at nine in the morning, every other week. In addition to the robot settings of areas A, B, C, and D of the environment the user selects tool settings using the user interface as well. In some embodiments, the user may choose the order of covering or operating in the areas of the environment using the user interface. In some embodiments, the user may choose areas to be excluded using the user interface. In some embodiments, the user may adjust or create a coverage path of the robot using the user interface. For example, the user adds, deletes, trims, rotates, elongates, redraws, moves (in all four directions), flips, or curves a selected portion of the coverage path. In some embodiments, the user may adjust the path created by the processor using the user interface. In some embodiments, the user may choose an area of the map using the user interface and may apply particular tool and/or operational settings to the area. In other embodiments, the user may choose an area of the environment from a drop-down list or some other method of displaying different areas of the environment. 
     Reference to operations performed on “a map” may include operations performed on various representations of the map. For instance, the robot may store in memory a relatively high-resolution representation of a map, and a lower-resolution representation of the map may be sent to a communication device for editing. In this scenario, the edits are still to “the map,” notwithstanding changes in format, resolution, or encoding. Similarly, a map stored in memory of the robot, while only a portion of the map may be sent to the communication device, and edits to that portion of the map are still properly understood as being edits to “the map” and obtaining that portion is properly understood as obtaining “the map.” Maps may be said to be obtained from a robot regardless of whether the maps are obtained via direct wireless connection between the robot and a communication device or obtained indirectly via a cloud service. Similarly, a modified map may be said to have been sent to the robot even if only a portion of the modified map, like a delta from a previous version currently stored on the robot, is sent. 
     In some embodiments, the user interface may present a map, e.g., on a touchscreen, and areas of the map (e.g., corresponding to rooms or other sub-divisions of the environment, e.g., collections of contiguous unit tiles in a bitmap representation) in pixel-space of the display may be mapped to event handlers that launch various routines responsive to events like an on-touch event, a touch release event, or the like. In some cases, before or after receiving such a touch event, the user interface may present the user with a set of user-interface elements by which the user may instruct embodiments to apply various commands to the area. Or in some cases, the areas of a working environment may be depicted in the user interface without also depicting their spatial properties, e.g., as a grid of options without conveying their relative size or position. Examples of commands specified via the user interface may include assigning an operating mode to an area, e.g., a cleaning mode or a mowing mode. Modes may take various forms. Examples may include modes that specify how a robot performs a function, like modes that select which tools to apply and settings of those tools. Other examples may include modes that specify target results, e.g., a “heavy clean” mode versus a “light clean” mode, a quite vs loud mode, or a slow versus fast mode. In some cases, such modes may be further associated with scheduled times in which operation subject to the mode is to be performed in the associated area. In some embodiments, a given area may be designated with multiple modes, e.g., a vacuuming mode and a quite mode. In some cases, modes may be nominal properties, ordinal properties, or cardinal properties, e.g., a vacuuming mode, a heaviest-clean mode, a 10/seconds/linear-foot vacuuming mode, respectively. Other examples of commands specified via the user interface may include commands that schedule when modes of operations are to be applied to areas. Such scheduling may include scheduling when cleaning is to occur or when cleaning using a designed mode is to occur. Scheduling may include designating a frequency, phase, and duty cycle of cleaning, e.g., weekly, on Monday at 4, for 45 minutes. Scheduling, in some cases, may include specifying conditional scheduling, e.g., specifying criteria upon which modes of operation are to be applied. Examples may include events in which no motion is detected by a motion sensor of the robot or a base station for more than a threshold duration of time, or events in which a third-party API (that is polled or that pushes out events) indicates certain weather events have occurred, like rain. In some cases, the user interface may expose inputs by which such criteria may be composed by the user, e.g., with Boolean connectors, for instance “If no-motion-for-45-minutes, and raining, then apply vacuum mode in area labeled “kitchen.” 
     In some embodiments, the user interface may display information about a current state of the robot or previous states of the robot or its environment. Examples may include a heat map of dirt or debris sensed over an area, visual indications of classifications of floor surfaces in different areas of the map, visual indications of a path that the robot has taken during a current cleaning session or other type of work session, visual indications of a path that the robot is currently following and has computed to plan further movement in the future, and visual indications of a path that the robot has taken between two points in the environment, like between a point A and a point B on different sides of a room or a house in a point-to-point traversal mode. In some embodiments, while or after a robot attains these various states, the robot may report information about the states to the application via a wireless network, and the application may update the user interface on the communication device to display the updated information. For example, in some cases, a processor of a robot may report which areas of the working environment have been covered during a current working session, for instance, in a stream of data to the application executing on the communication device formed via a WebRTC Data connection, or with periodic polling by the application, and the application executing on the computing device may update the user interface to depict which areas of the working environment have been covered. In some cases, this may include depicting a line of a path traced by the robot or adjusting a visual attribute of areas or portions of areas that have been covered, like color or shade or areas or boundaries. In some embodiments, the visual attributes may be varied based upon attributes of the environment sensed by the robot, like an amount of dirt or a classification of a flooring type since by the robot. In some embodiments, a visual odometer implemented with a downward facing camera may capture images of the floor, and those images of the floor, or a segment thereof, may be transmitted to the application to apply as a texture in the visual representation of the working environment in the map, for instance, with a map depicting the appropriate color of carpet, wood floor texture, tile, or the like to scale in the different areas of the working environment. 
     In some embodiments, the user interface may indicate in the map a path the robot is about to take (e.g., according to a routing algorithm) between two points, to cover an area, or to perform some other task. For example, a route may be depicted as a set of line segments or curves overlaid on the map, and some embodiments may indicate a current location of the robot with an icon overlaid on one of the line segments with an animated sequence that depicts the robot moving along the line segments. In some embodiments, the future movements of the robot or other activities of the robot may be depicted in the user interface. For example, the user interface may indicate which room or other area the robot is currently covering and which room or other area the robot is going to cover next in a current work sequence. The state of such areas may be indicated with a distinct visual attribute of the area, its text label, or its perimeters, like color, shade, blinking outlines, and the like. In some embodiments, a sequence with which the robot is currently programmed to cover various areas may be visually indicated with a continuum of such visual attributes, for instance, ranging across the spectrum from red to blue (or dark grey to light) indicating sequence with which subsequent areas are to be covered. 
     In some embodiments, via the user interface or automatically without user input, a starting and an ending point for a path to be traversed by the robot may be indicated on the user interface of the application executing on the communication device. Some embodiments may depict these points and propose various routes therebetween, for example, with various routing algorithms like those described in the applications incorporated by reference herein. Examples include A*, Dijkstra&#39;s algorithm, and the like. In some embodiments, a plurality of alternate candidate routes may be displayed (and various metrics thereof, like travel time or distance), and the user interface may include inputs (like event handlers mapped to regions of pixels) by which a user may select among these candidate routes by touching or otherwise selecting a segment of one of the candidate routes, which may cause the application to send instructions to the robot that cause the robot to traverse the selected candidate route. 
     In some embodiments, the map formed by the processor of the robot during traversal of the working environment may have various artifacts like those described herein. Using techniques like the line simplification algorithms and convolution will smoothing and filtering, some embodiments may remove clutter from the map, like artifacts from reflections or small objects like chair legs to simplify the map, or a version thereof in lower resolution to be depicted on a user interface of the application executed by the communication device. In some cases, this may include removing duplicate borders, for instance, by detecting border segments surrounded on two sides by areas of the working environment and removing those segments. 
     Some embodiments may rotate and scale the map for display in the user interface. In some embodiments, the map may be scaled based on a window size such that a largest dimension of the map in a given horizontal or vertical direction is less than a largest dimension in pixel space of the window size of the communication device or a window thereof in which the user interfaces displayed. Or in some embodiments, the map may be scaled to a minimum or maximum size, e.g., in terms of a ratio of meters of physical space to pixels in display space. Some embodiments may include zoom and panning inputs in the user interface by which a user may zoom the map in and out, adjusting scaling, and pan to shifts which portion of the map is displayed in the user interface. 
     In some embodiments, rotation of the map or portions thereof (like perimeter lines) may be determined with techniques like those described above by which an orientation that minimizes an amount of aliasing, or diagonal lines of pixels on borders, is minimized. Or borders may be stretched or rotated to connect endpoints determined to be within a threshold distance. In some embodiments, an optimal orientation may be determined over a range of candidate rotations that is constrained to place a longest dimension of the map aligned with a longest dimension of the window of the application in the communication device. Or in some embodiments, the application may query a compass of the communication device to determine an orientation of the communication device relative to magnetic north and orient the map in the user interface such that magnetic north on the map as displayed is aligned with magnetic north as sensed by the communication device. In some embodiments, the robot may include a compass and annotate locations on the map according to which direction is magnetic north. 
     In some embodiments, the map may include information such as debris accumulation in different areas, stalls encountered in different areas, obstacles, driving surface type, driving surface transitions, coverage area, robot path, etc. In some embodiments, the user may use user interface of the application to adjust the map by adding, deleting, or modifying information (e.g., obstacles) within the map. For example, the user may add information to the map using the user interface such as debris accumulation in different areas, stalls encountered in different areas, obstacles, driving surface type, driving surface transitions, etc. 
     In some embodiments, the user may choose areas within which the robot is to operate and actions of the robot using the user interface of the application. In some embodiments, the user may use the user interface to choose a schedule for performing an action within a chosen area. In some embodiments, the user may choose settings of the robot and components thereof using the application. Some embodiments may include using the user interface to set a cleaning mode of the robot. In some embodiments, setting a cleaning mode may include, for example, setting a service condition, a service type, a service parameter, a service schedule, or a service frequency for all or different areas of the environment. A service condition may indicate whether an area is to be serviced or not, and embodiments may determine whether to service an area based on a specified service condition in memory. Thus, a regular service condition indicates that the area is to be serviced in accordance with service parameters like those described below. In contrast, a no service condition may indicate that the area is to be excluded from service (e.g., cleaning). A service type may indicate what kind of cleaning is to occur. For example, a hard (e.g. non-absorbent) surface may receive a mopping service (or vacuuming service followed by a mopping service in a service sequence), while a carpeted service may receive a vacuuming service. Other services may include a UV light application service and a sweeping service. A service parameter may indicate various settings for the robot. In some embodiments, service parameters may include, but are not limited to, an impeller speed or power parameter, a wheel speed parameter, a brush speed parameter, a sweeper speed parameter, a liquid dispensing speed parameter, a driving speed parameter, a driving direction parameter, a movement pattern parameter, a cleaning intensity parameter, and a timer parameter. Any number of other parameters may be used without departing from embodiments disclosed herein, which is not to suggest that other descriptions are limiting. A service schedule may indicate the day and, in some cases, the time to service an area. For example, the robot may be set to service a particular area on Wednesday at noon. In some instances, the schedule may be set to repeat. A service frequency may indicate how often an area is to be serviced. In embodiments, service frequency parameters may include hourly frequency, daily frequency, weekly frequency, and default frequency. A service frequency parameter may be useful when an area is frequently used or, conversely, when an area is lightly used. By setting the frequency, more efficient overage of environments may be achieved. In some embodiments, the robot may clean areas of the environment according to the cleaning mode settings. 
     In some embodiments, the processor of the robot may determine or change the cleaning mode settings based on collected sensor data. For example, the processor may change a service type of an area from mopping to vacuuming upon detecting carpeted flooring from sensor data (e.g., in response to detecting an increase in current drawn by a motor driving wheels of the robot, or in response to a visual odometry sensor indicating a different flooring type). In a further example, the processor may change service condition of an area from no service to service after detecting accumulation of debris in the area above a threshold. Examples of methods for a processor to autonomously adjust settings (e.g., speed) of components of a robot (e.g., impeller motor, wheel motor, etc.) based on environmental characteristics (e.g., floor type, room type, debris accumulation, etc.) are described in U.S. patent application Ser. Nos. 16/163,530 and 16/239,410, the entire contents of which are hereby incorporated by reference. In some embodiments, the user may adjust the settings chosen by the processor using the user interface. In some embodiments, the processor may change the cleaning mode settings and/or cleaning path such that resources required for cleaning are not depleted during the cleaning session. In some instances, the processor may use a bin packing algorithm or an equivalent algorithm to maximize the area cleaned given the limited amount of resources remaining. In some embodiments, the processor may analyze sensor data of the environment before executing a service type to confirm environmental conditions are acceptable for the service type to be executed. For example, the processor analyzes floor sensor data to confirm floor type prior to providing a particular service type. In some instances, wherein the processor detects an issue in the settings chosen by the user, the processor may send a message that the user retrieves using the user interface. The message in other instances may be related to cleaning or the map. For example, the message may indicate that an area with no service condition has high (e.g., measured as being above a predetermined or dynamically determined threshold) debris accumulation and should therefore have service or that an area with a mopping service type was found to be carpeted and therefore mopping was not performed. In some embodiments, the user may override a warning message prior to the robot executing an action. In some embodiments, conditional cleaning mode settings may be set using a user interface and are provided to the processor of the robot using a wireless communication channel. Upon detecting a condition being met, the processor may implement particular cleaning mode settings (e.g., increasing impeller motor speed upon detecting dust accumulation beyond a specified threshold or activating mopping upon detecting a lack of motion). In some embodiments, conditional cleaning mode settings may be preset or chosen autonomously by the processor of the robot. 
     In some embodiments, the processor of the robot may acquire information from external sources, such as other smart devices within the home. For example, the processor may acquire data from an external source that is indicative of the times of the day that a user is unlikely to be home and may clean the home during these times. Information may be obtained from, for example, other sensors within the home, smart home devices, location services on a smart phone of the user, or sensed activity within the home. 
     In some embodiments, the user may answer a questionnaire using the application to determine general preferences of the user. In some embodiments, the user may answer the questionnaire before providing other information. 
     In some embodiments, a user interface component (e.g., virtual user interface component such as slider displayed by an application on a touch screen of a smart phone or mechanical user interface component such as a physical button) may receive an input (e.g., a setting, an adjustment to the map, a schedule, etc.) from the user. In some embodiments, the user interface component may display information to the user. In some embodiments, the user interface component may include a mechanical or virtual user interface component that responds to a motion (e.g., along a touchpad to adjust a setting which may be determined based on an absolute position of the user interface component or displacement of the user interface component) or gesture of the user. For example, the user interface component may respond to a sliding motion of a finger, a physical nudge to a vertical, horizontal, or arch of the user interface component, drawing a smile (e.g., to unlock the user interface of the robot), rotating a rotatable ring, and spiral motion of fingers. 
     In some embodiments, the user may use the user interface component (e.g., physically, virtually, or by gesture) to set a setting along a continuum or to choose between discrete settings (e.g., low or high). For example, the user may choose the speed of the robot from a continuum of possible speeds or may select a fast, slow, or medium speed using a virtual user interface component. In another example, the user may choose a slow speed for the robot during UV sterilization treatment such that the UV light may have more time for sterilization per surface area. In some embodiments, the user may zoom in or out or may use a different mechanism to adjust the response of a user interface component. For example, the user may zoom in on a screen displayed by an application of a communication device to fine tune a setting of the robot with a large movement on the screen. Or the user may zoom out of the screen to make a large adjustment to a setting with a small movement on the screen or a small gesture. 
     In some embodiments, the user interface component may include a button, a keypad, a number pad, a switch, a microphone, a camera, a touch sensor, or other sensors that may detect gestures. In some embodiments, the user interface component may include a rotatable circle, a rotatable ring, a click-and-rotate ring, or another component that may be used to adjust a setting. For example, a ring may be rotated clockwise or anti-clockwise, or pushed in or pulled out, or clicked and turned to adjust a setting. In some embodiments, the user interface component may include a light that is used to indicate the user interface is responsive to user inputs (e.g., a light surrounding a user interface ring component). In some embodiments, the light may dim, increase in intensity, or change in color to indicate a speed of the robot, a power of an impeller fan of the robot, a power of the robot, voice output, and such. For example, a virtual user interface ring component may be used to adjust settings using an application of a communication device and a light intensity or light color or other means may be used to indicate the responsiveness of the user interface component to the user input. 
     In some embodiments, a historical report of prior work sessions may be accessed by a user using the application of the communication device. In some embodiments, the historical report may include a total number of operation hours per work session or historically, total number of charging hours per charging session or historically, total coverage per work session or historically, a surface coverage map per work session, issues encountered (e.g., stuck, entanglement, etc.) per work session or historically, location of issues encountered (e.g., displayed in a map) per work session or historically, collisions encountered per work session or historically, software or structural issues recorded historically, and components replaced historically. 
     In some embodiments, the robot may perform work in or navigate to or transport an item to a location specified by the user. In some embodiments, the user may instruct the robot to perform work in a specific location using the user interface of the application of a communication device communicatively paired with the processor of the robot. For example, a user may instruct a robotic mop to clean an area in front of a fridge where coffee has been spilled or a robotic vacuum to vacuum an area in front of a TV where debris often accumulates or an area under a dining table where cheerios have been spilled. In another example, a robot may be instructed to transport a drink to a location in front of a couch on which a user is positioned while watching TV in the living room. In some embodiments, the robot may use direction of sound to navigate to a location of the user. For example, a user may verbally instruct a robot to bring the user medicine and the robot may navigate to the user by following a direction of the voice of the user. In some embodiments, the robot includes multiple microphones and the processor determines the direction of a voice by comparing the signal strength in each of the microphones. In some embodiments, the processor may use artificial intelligence methods and Bayesian methods to identify the source of a voice. 
     In some embodiments, the user may use the user interface of the application to instruct the robot to begin performing work (e.g., vacuuming or mopping) immediately. In some embodiments, the application displays a battery level or charging status of the robot. In some embodiments, the amount of time left until full charge or a charge required to complete the remaining of a work session may be displayed to the user using the application. In some embodiments, the amount of work by the robot a remaining battery level can provide may be displayed. In some embodiments, the amount of time remaining to finish a task may be displayed. In some embodiments, the user interface of the application may be used to drive the robot. In some embodiments, the user may use the user interface of the application to instruct the robot to clean all areas of the map. In some embodiments, the user may use the user interface of the application to instruct the robot to clean particular areas within the map, either immediately or at a particular day and time. In some embodiments, the user may choose a schedule of the robot, including a time, a day, a frequency (e.g., daily, weekly, bi-weekly, monthly, or other customization), and areas within which to perform a task. In some embodiments, the user may choose the type of task. In some embodiments, the user may use the user interface of the application to choose cleaning preferences, such as detailed or quiet clean, a suction power, light or deep cleaning, and the number of passes. The cleaning preferences may be set for different areas or may be chosen for a particular work session during scheduling. In some embodiments, the user may use the user interface of the application to instruct the robot to return to a charging station for recharging if the battery level is low during a work session, then to continue the task. In some embodiments, the user may view history reports using the application, including total time of cleaning and total area covered (per work session or historically), total charging time per session or historically, number of bin empties, and total number of work sessions. In some embodiments, the user may use the application to view areas covered in the map during a work session. In some embodiments, the user may use the user interface of the application to add information such as floor type, debris accumulation, room name, etc. to the map. In some embodiments, the user may use the application to view a current, previous, or planned path of the robot. In some embodiments, the user may use the user interface of the application to create zones by adding dividers to the map that divide the map into two or more zones. In some embodiments, the application may be used to display a status of the robot (e.g., idle, performing task, charging, etc.). In some embodiments, a central control interface may collect data of all robots in a fleet and may display a status of each robot in the fleet. In some embodiments, the user may use the application to change a status of the robot to do not disturb, wherein the robot is prevented from cleaning or enacting other actions that may disturb the user. 
     In some embodiments, the application may display the map of the environment and allow zooming-in or zooming-out of the map. In some embodiments, a user may add flags to the map using the user interface of the application that may instruct the robot to perform a particular action. For example, a flag may be inserted into the map indicates a valuable rug. When the flag is dropped a list of robot actions may be displayed to the user, from which they may choose. to be chosen from. Actions may include stay away, start from here, start from here only on a particular day (e.g., Tuesday). In some embodiments, the flag may inform the robot of characteristics of an area, such as a size of an area. In some embodiments, flags may be labelled with a name. For example, a first flag may be labelled front of TV and a characteristic, such size of the area, may be added to the flag. This may allow granular control of the robot. For example, the robot may be instructed to clean the area front of TV through verbal instruction to a home assistant or may be scheduled to clean in front of the TV every morning using the application. 
     In some embodiments, the user interface of the application (or interface of the robot or other means) may be used to customize the music played when a call is on hold, ring tones, message tones, and error tones. In some embodiments, the application or the robot may include audio-editing applications that may convert MP3 files a required size and format, given that the user has a license to the music. In some embodiments, the application of a communication device (or web, TV, robot interface, etc.) may be used to play a tutorial video for setting up a new robot. Each new robot may be provided with a mailbox, data storage space, etc. In some embodiments, there may be voice prompts that lead the user through the setup process. In some embodiments, the user may choose a language during setup. In some embodiments, the user may set up a recording of the name of the robot. In some embodiments, the user may choose to connect the robot to the internet for in the moment assistance when required. In some embodiments, the user may use the application to select a particular type of indicator be used to inform the user of new calls, emails, and video chat requests or the indicators may be set by default. For example, a message waiting indicator may be an LED indicator, a tone, a gesture, or a video played on the screen of the robot. In some cases, the indicator may be a visual notification set or selected by the user. For example, the user may be notified of a call from a particular family member by a displayed picture or avatar of that family member on the screen of the robot. In other instances, other visual notifications may be set, such as flashing icons on an LCD screen (e.g., envelope or other pictures or icons set by user). In some cases, pressing or tapping the visual icon or a button on/or next to the indicator may activate an action (e.g., calling a particular person and reading a text message or an email). In some embodiments, a voice assistant (e.g., integrated into the robot or an external assistant paired with the robot) may ask the user if they want to reply to a message and may listen to the user message, then send the message to the intended recipient. In some cases, indicators may be set on multiple devices or applications of the user (e.g., cell phone, phone applications, Face Time, Skype, or anything the user has set up) such that the user may receive notification regardless of their proximity to the robot. In some embodiments, the application may be used to setup message forwarding, such that notifications provided to the user by the robot may be forwarded to a telephone number (e.g., home, cellular, etc.), text pager, e-mail account, chat message, etc. 
     In some embodiments, more than one robot and device (e.g., autonomous car, robot vacuum, service robot with voice and video capability, and other devices such as a passenger pod, smart appliances, TV, home controls such as lighting, temperature, etc., tablet, computer, and home assistants) may be connected to the application and the user may use the application to choose settings for each robot and device. In some embodiments, the user may use the application to display all connected robots and other devices. For example, the application may display all robots and smart devices in a map of a home or in a logical representation such as a list with icons and names for each robot and smart device. The user may select each robot and smart device to provide commands and change settings of the selected device. For instance, a user may select a smart fridge and may change settings such as temperature and notification settings or may instruct the fridge to bring a food item to the user. In some embodiments, the user may choose that one robot perform a task after another robot completes a task. In some embodiments, the user may choose schedules of both robots using the application. In some embodiments, the schedule of both robots may overlap (e.g., same time and day). In some embodiments, a home assistant may be connected to the application. In some embodiments, the user may provide commands to the robot via a home assistant by verbally providing commands to the home assistant which may then be transmitted to the robot. Examples of commands include commanding the robot to clean a particular area or to navigate to a particular area or to turn on and start cleaning. In some embodiments, the application may connect with other smart devices (e.g., smart appliances such as smart fridge or smart TV) within the environment and the user may communicate with the robot via the smart devices. In some embodiments, the application may connect with public robots or devices. For example, the application may connect with a public vending machine in an airport and the user may use the application to purchase a food item and instruct the vending machine or a robot to deliver the food item to a particular location within the airport. 
     In some embodiments, the user may be logged into multiple robots and other devices at the same time. In some embodiments, the user receives notifications, alerts, phone calls, text messages, etc. on at least a portion of all robots and other devices that the user is logged into. For example, a mobile phone, a computer, and a service robot of a user may ring when a phone call is received. In some embodiments, the user may select a status of do not disturb for any number of robots (or devices). For example, the user may use the application on a smart phone to set all robots and devices to a do not disturb status. The application may transmit a synchronization message to all robots and devices indicating a status change to do not disturb, wherein all robots and devices refrain from pushing notifications to the user. 
     In some embodiments, the application may display the map of the environment and the map may include all connected robots and devices such as TV, fridge, washing machine, dishwasher, heater control panel, lighting controls, etc. In some embodiments, the user may use the application to choose a view to display. For example, the user may choose that only a debris map generated based on historic cleaning, an air quality map for each room, or a map indicating status of lights as determined based on CAIT is displayed. Or in another example, a user may select to view the FOV of various different cameras within the house to search for an item, such as keys or a wallet. Or the user may choose to run an item search wherein the application may autonomously search for the item within images captured in the FOV of cameras (e.g., on robots moving within the area, static cameras, etc.) within the environment. Or the user may choose that the search focus on searching for the item in images captured by a particular camera. Or the user may choose that the robot navigates to all areas or a particular area (e.g., the master bedroom) of the environment in search of the item. Or the user may choose that the robot checks places the robot believes the item is likely to be in an order that the robot believes will result in finding the item as soon as possible. 
     In some embodiments, the processor of the robot may communicate its spatial situation to a remote user (e.g., via an application of a communication device) and the remote user may issue commands to a control subsystem of the robot to control a path of the robot. In some cases, the trajectory followed by the robot may not be exactly the same as the command issued by the user and the actions actuated by the control subsystem. This may be due to noise in motion and observations. For example,  FIG.  130    illustrates a path of a robot provided by the user and the actual trajectory of the robot. The new location of the robot may be communicated to the user and the user may provide incremental adjustments. In some embodiments, the adjustments and spatial updates are in real time. In some embodiments, the adjustments are so minute that a user may not distinguish a difference between the path provided by the user and the actual trajectory of the robot. In some embodiments, the robot may include a camera for streaming a video accessible by the user to aid in controlling movement of the robot. In some embodiments, the same camera used for SLAM may be used. In some embodiments, real time SLAM allows for real time adjustments and real time interoperation between multiple devices. The is also true for a robot remotely monitored and driven outdoors wherein a driver of the robot in a remote location is able to see the environment as sensors of the robot do. For example, a food delivery robot may be manually steered remotely by a joystick or other control device to move along a pedestrian side of a street. SLAM, GPS, and a camera capturing visual information may be used in real time and may be synched to provide optimal performance. 
     In some embodiments, a map, traversability, a path plan (e.g., coverage area and boustrophedon path), and a trajectory of the robot may be displayed to the user (e.g., using an application of a communication device). In some instances, there may be no need or desire by a user to view spatial information for a surface cleaning device that cleans on a daily basis. However, this may be different in other cases. For example, in the case of augmented reality or virtual reality experienced by a user (e.g., via a headset or glasses), a layer of a map may be superimposed on a FOV of the user. In some instances, the user may want to view the environment without particular objects. For example, for a virtual home, a user may want to view a room without various furniture and decoration. In another example, a path plan may be superimposed on the windshield of an autonomous car driven by a user. The path plan may be shown to the user in real-time prior to its execution such that the user may adjust the path plan.  FIG.  131    illustrates a user is sitting behind a steering wheel  13100  of an autonomous car (which may not be necessary in an autonomous car but is shown to demonstrate the user with respect to the surroundings) and a path plan  13101  shown to the user, indicating with an arrow a plan for the autonomous car to overtake the car  13102  in front. The user may have a chance to accept or deny or alter the path plan. The user may intervene initially or when the lane change is complete or at another point. The path plan may be superimposed on the windshield using a built-in capability of the windshield that may superimpose images, icons, or writing on the windshield glass (or plastic or other material). In other cases, images, icons, or writing may be projected onto the transparent windshield (or other transparent surfaces, e.g., window) by a device fixed onto the vehicle or a device the user is wearing. In some cases, superimposition of images, icons, writing, etc. may take place on a surface of a wearable device of the user, such as glasses or headsets. In some embodiments, the surface on which superimposition occurs may not be transparent. In some embodiments, cameras may capture real-time images of the surroundings and the images may be shown to the user on a screen or by another means. In some embodiments, the user may have or be presented with options of objects they wish to be superimposed on a screen or a transparent surface or their FOV. In cases of superimposition of reality with augmenting information, icons, or the like, simultaneous localization and mapping in real-time may be necessary, and thus the SLAM techniques used must to be able to make real-time adjustments. 
     In some embodiments, an application of a communication device paired with the robot may be used to execute an over the air firmware update (or software or other type of update). In other embodiments, the firmware may be updated using another means, such as USB, Ethernet, RS232 interface, custom interface, a flasher, etc. In some embodiments, the application may display a notification that a firmware update is available and the user may choose to update the firmware immediately, at a particular time, or not at all. In some embodiments, the firmware update is forced and the user may not postpone the update. In some embodiments, the user may not be informed that an update is currently executing or has been executed. In some embodiments, the firmware update may require the robot to restart. In some embodiments, the robot may or may not be able to perform routine work during a firmware update. In some embodiments, the older firmware may be not replaced or modified until the new firmware is completely downloaded and tested. In some embodiments, the processor of the robot may perform the download in the background and may use the new firmware version at a next boot up. In some embodiments, the firmware update may be silent (e.g., forcefully pushed) but there may be audible prompt in the robot. 
     In some embodiments, the process of using the application to update the firmware includes using the application to call the API and the cloud sending the firmware to the robot directly. In some embodiments, a pop up on the application may indicate a firmware upgrade available (e.g., when entering the control page of the application). In some embodiments, a separate page on the application may display firmware info information, such as current firmware version number. In some embodiments, available firmware version numbers may be displayed on the application. In some embodiments, changes that each of the available firmware versions impose may be displayed on the application. For example, one new version may improve the mapping feature or another new version may enhance security, etc. In some embodiments, the application may display that the current version is up to date already if the version is already up to date. In some embodiments, a progress page (or icon) of the application may display when a firmware upgrade is in progress. In some embodiments, a user may choose to upgrade the firmware using a settings page of the application. In some embodiments, the setting page may have subpages such as general, cleaning preferences, firmware update (e.g., which may lead to firmware information). In some embodiments, the application may display how long the update may take or the time remaining for the update to finish. In some embodiments, an indicator on the robot may indicate that the robot is updating in addition to or instead of the application. In some embodiments, the application may display a description of what is changed after the update. In some embodiments, a set of instructions may be provided to the user via the application prior to updating the firmware. In embodiments wherein a sudden disruption occurs during a firmware update, a pop-up may be displayed on the application to explain why the update failed and what needs to be done next. In some embodiments, there may be multiple versions of updates available for different versions of the firmware or application. For example, some robots may have voice indicators such as “wheel is blocked” or “turning off” in different languages. In some embodiments, some updates may be marked as beta updates. In some embodiments, the cloud application may communicate with the robot during an update and update information, such as in  FIG.  132   , may be available on the control center or on the application. In some embodiments, progress of the update may be displayed in the application using a status bar, circle, etc. In some embodiments, the user may choose to finish or pause a firmware update using the application. In some embodiments, the robot may need to be connected to a charger during a firmware update. In some embodiments, a pop up message may appear on the application if the user chooses to update the robot using the application and the robot is not connected to the charger.  FIG.  133 A- 133 C  illustrate examples of different pages of an application paired with the robot.  FIG.  133 A , from left to right, illustrates a control screen of the application which the user may use to instruct the robot to clean or to schedule a cleaning and to access settings, a pop up message indicating a software update is available, and a settings page of the application wherein cleaning preferences and software update information may be accessed.  FIG.  133 B  illustrates a variation of pages that may be displayed to the user using the application update firmware. One page indicates that that the robot firmware is up to date, another page indicates that a new firmware version is available and describes the importance of the update and aspects that will be changed with the update, and one page notifies the user that the robot must be connected to a charger to update the firmware.  FIG.  133 C  illustrates, from top left corner and moving clockwise, a page notifying the user of a new firmware version, from which the user may choose to start the update, a page indicating the progress of the update, a page notifying the user that the update has timed out, and a page notifying the user that the firmware have been successfully updated. 
     In some embodiments, the user may use the application to register the warranty of the robot. If the user attempts to register the warranty more than once, the information may be checked against a database on the cloud and the user be informed they have already done so. In some embodiments, the application may be used to collect possible issues of the robot and may send the information to the cloud. In some embodiments, the robot may send possible issues to the cloud and the application may retrieve the information from the cloud or the robot may send possible issues directly to the application. In some embodiments, the application or a cloud application may directly open a customer service ticket based on the information collected on issues of the robot. For example, the application may automatically open a ticket if a consumable part is detected to wear off soon and customer service may automatically send a new replacement to the user without the user having to call customer service. In another example, a detected jammed wheel may be sent to the cloud and a possible solution may pop up on the application from an auto diagnose machine learned system. In some embodiments, a human may supervise and enhance the process or merely perform the diagnosis. In some embodiments, the diagnosed issue may be saved and used as a data for future diagnoses. 
     In some embodiments, previous maps and work sessions may be displayed to the user using the application. In some embodiments, data of previous work sessions may be used to perform better work sessions in the future. In some embodiments, previous maps and work sessions displayed may be converted into thumbnail images to save space on the local device. In some embodiments, there may be a setting (or default) that saves the images in original form for a predetermined amount of time (e.g., a week) and then converts the images to thumbnails or pushes the original images to the cloud. All of these options may be configurable or a default be chosen by the manufacturer. 
     In some embodiments, a user may have any of a registered email, a username, or a password which may be used to log into the application. If a user cannot remember their email, username, or password, an option to reset any of the three may be available. In some embodiments, a form of verification may be required to reset an email, password, or username. In some embodiments, a user may be notified that they have already signed up when attempting to sign up with a username and name that already exists and may be asked if they forgot their password and/or would like to reset their password. 
     In some embodiments, there may be a control system that manages or keeps track of all robots (and other device) in a fleet. In some embodiments, the control system may be a database. For example, an autonomous car manufacturer may keep track of all cars in a fleet. Some examples of information that may be stored for an autonomous vehicle may include car failed to logon, car failed to connect, car failed to start, car ran out of battery, car lost contact with network, car activity, car mailbox (or message) storage size and how full the mailbox is, number of unread messages, date and time of last read message, last location (e.g., home, coffee shop, work), date and time of last dialed number, date and time of last sent voice message or text, user message activity, battery and charge information, last full charge, last incremental charge, date and time of last charge, amount of incremental charge, location of charges, billing invoice if applicable (e.g., data, mechanical services, etc.), previously opened customer service tickets, history of services, system configuration. In some embodiments, a user may opt out of sending information to the control system or database. In some embodiments, the user may request a private facility store all sent information and may release information to any party by approval. 
     The private facility may create databases and privately store the information. In some embodiments, the private facility may share information for functionality purposes upon request from the user to share particular information with a specific party. For example, if history of a repair of an autonomous case is needed by a manufacturer, the manufacturer may not be able to access the information without sending a request to the private facility storing the information. The private facility may request permission from the user. The user may receive the request via an application, email, or the web and may approve the request, at which point the private facility may release the information to the manufacturer. Multiple options for levels of approval may be used in different embodiments. For example, the user may choose to allow the information to be available to the manufacturer for a day, a week, a year, or indefinitely. Many different settings may be applied to various types of information. The user may set and change setting in their profile at any time (e.g., via an application or the web). For example, a user may retract permission previously approved by the user. 
     In some embodiments, there may be a default setting specifying where information is stored (e.g., a manufacturer, a database owned and controlled by the user, a third party, etc.). The default settings may be change by the user at any time. In some embodiments, the log of information stored may have various parameters set by default or by the user. Examples of parameters may include maximum events allowed in the log which limits the number of entries in the log and when the defined number is exceeded, the oldest entries are overwritten; maximum life of a log which limits the number of days and hours of entries life in the log and when the defined number is exceeded, the oldest entries are overwritten; various levels of logging which may include functionality matters, verbose for troubleshooting, security investigation (i.e., the user has gone missing), security and privacy of the user, etc.; minutes between data collection cycles which controls how frequently report data is gathered from logs (e.g., 30 minutes); days to keep data in reports database which determines when to archive the data or keep thumbnails of data; reports database size (e.g., as a percentage of capacity) which sets the maximum percentage of disk space the reports database may take up; maximum records in report output which limits the number of records presented in the report output; and maximum number of places that the reports can be logged to. The user may change default settings of parameters for the log of information at any time. 
     Owning and having control of where information is logged and stored may be important for users. In some cases, an application of a smart phone may keep track of places a user has visited and may combine this information with location information collected by other applications of the smartphone, which may be unwanted by a user. Or in some cases, websites used for online purchases may store a detailed history of purchases which may later be used for analyzing a user. For example, a 2018 online purchase of a vape may affect results of a health insurance claim submitted in 2050 by the same person, given that the online purchase information of the vape was stored and shared with the health insurer. Situations such as these highlight the increasing importance of providing the user with a choice for recording and/or storing their activity. Whether the logging activity is handled by the manufacturer, the user, or a third party, many interfaces may exist and many types of reports may be executed. For example, a report may be executed for a device, a logically set group of devices, a chosen list of devices, the owners of the devices, a phone number associated with the user, a NANP associated with the device, the type of service the device provides, the type of service the user purchases, the licenses the user paid for to obtain certain features, a last name, a first name, an alias, a location, a home mail address, a work mail address, a device location, a billing ID, an account lockout status, a latest activity, etc. 
     In some embodiments, a robot may be diagnosed using the control interface of the robot. In some embodiments, the robot may be pinged or connected via telnet or SSH and diagnostic commands may be executed. In some embodiments, a verbose log may be activated. In some embodiments, a particular event may be defined and the robot may operate and report the particular event when it occurs. This may help with troubleshooting. In some embodiments, memory dumps and logs may be automatically sent to the cloud and/or kept locally on the robot. The user may choose to save on the cloud, locally or both. In some cases, a combination of sending information to the cloud and saving locally may be preset as a default. In some embodiments, an error log may be generated upon occurrence of an error. An example of a computer code for generating an error log is shown in  FIG.  134   . In some embodiments, the error may initiate a diagnostic procedure. For example,  FIG.  135    provides an example of a diagnostic procedure that may be followed for testing the brushes of a robot if an error with the brushes is detected. Other diagnostic procedures may be used depending on the error detected. For example, detection of a low tire pressure of an autonomous car may initiate a message to be sent to the user via an application and may trigger illumination of light indicator on a panel of the car. In some cases, detection of a low tire pressure may also trigger the car to set an appointment at a service facility based on the calendar of the user, car usage, and time required for the service. Alternatively, the autonomous car may transmit a message to a control center of a type of service required and the control center may dispatch a service car or robot to a location of the car (e.g., a grocery store parking lot while the user shops) to inflate the tire. A service robot may have an air pump, approach the tire, align its arm with the aperture on the tire within which air may be pumped using computer vision, measure the air pressure of the tire, and then inflate the tire to the required air pressure. The air pressure of the tire may be measured several times to provide accuracy. Other car services such as repairs and oil change may be executed by a service car or robot as well. In other cases, a service robot may provide remote resets and remote upgrades. In some embodiments, the service robot (or any other robot) may log information on the local memory temporarily. In some embodiments, syslog servers may be used to offload and store computer and network hardware log information for long periods of time. In many cases, syslog servers are easy to set up and maintain. Once set up, the robot may be pointed to the syslog server. Different embodiments may use different types of syslog servers. In some cases, the syslog server may use a file format of .au or .wav and G.711 codec format with 8 bit rate at 8 kHz. 
     In some embodiments, the robot or a control system managing robots may access system status, troubleshooting tools, and a system dashboard for quick review of system configurations of the robot. In some embodiments, the backend control system of the robot may be used by the robot or a control system managing robots to obtain hardware resource utilization (CPU, storage space), obtain and update software versions, verify and change IP address information, manage Network Time Protocol (NTP) server IP addresses, manage server security including IPSec and digital certificates, ping other IP devices from the device in question (e.g., initiate the robot to ping its default gateway, a file server, a control center, etc.), configure device pool to categorize devices based on some logical criteria (i.e. model number, year number, geography, OS version, activity, functionality, or customized), obtain and update region, location, and date/time group, obtain NTP reference, obtain and update device defaults, obtain and update templates used, obtain and update settings, obtain and update language, obtain and update security profile or configuration. For example, details of the softkey template may be obtained or updated. In embodiments, the softkey Template may control which key button functions are assigned to a desired function. Short cuts may be defined and used, such as tapping twice on the robot screen to call emergency services. 
     In some embodiments, a quick deployment tool may be used to deploy many robots concurrently at deployment time. In some embodiments, a spreadsheet (e.g., Excel template, Google spread sheet, comma delimited text files, or any kind of spread sheets) may be used to deploy and manage many robots concurrently. In some embodiments, there may be fields within the spreadsheet that are the same for all robot and fields that are unique. In some embodiments, a web page may be used by to access the spreadsheet and modify parameters. In some embodiments, database inserts, modifications, or deletions may be executed by bundling robots together and managing them automatically and unattended or on set schedules. In some embodiments, selected records from the database may be pulled, exported, modified, and re-imported into the database. 
     In some embodiments, an end user may license a robot for use. In some embodiments, an end user may be billed for various types of robot licensing, a product (e.g., the robot or another product), services (e.g., provided by the robot), a particular usage or an amount of usage of the robot, or a combination thereof. In some embodiments, such information may be entered manually, semi-autonomously, or autonomously for an account when a sale takes place. In some embodiments, lightweight directory access protocol (LDAP) may be used to store all or a part of the user data. In some cases, other types of databases may be used to store different kinds of information. In some embodiments, the database may include fields for comprehensive user information, such as user ID, last name, location, device ID, and group. In some cases, some fields may be populated by default. In some embodiments, a naming convention may be used to accommodate many users with similar names, wherein the user name may have some descriptive meaning. In some embodiments, at least one parameter must be unique such that it may be used a primary key in the database. In different embodiments, different amounts of data may be replicated and different data may be synchronized. In embodiments, data may be stored for different amounts of time and different types of data may be automatically destroyed. For example, data pulled from database A by database B may include a flag as one of the columns to set the life time of the information. Database B may then destroy the data and, in some cases, the existence of such transfer, after the elapsed time specified. Database B may sweep through the entries of the database at certain time intervals and may purge entries having a time to live that is about to expire. In some cases, database A may send a query to database B at the time of expiry of entries instructing database B to destroy the entries. In some cases, database A may send another query to determine if anything returns in order to confirm that the entries have been destroyed. Such methods may be employed in social media, wherein a user may post an event and may be provided with an option of how long that post is to be displayed for and how long the post is to be kept by the social media company. The information may be automatically deleted from the user profile based on the times chosen by the user, without the user having to do it manually. In some embodiments, the database may perform a full synchronization of all entries each time new information is added to the database. In cases where there is a large amount of data being synchronized, network congestion and server performance issues may occur. In some embodiments, synchronization intervals and scheduling may be chosen to minimize the effect on performance. In some embodiments, synchronization may be incremental (e.g., only the new or changed information is replicated) to reduce the amount of data being replicated, thereby reducing the impact on the network and servers. In some embodiments, database attribute mapping may be used when the names of attribute fields that one database uses are different from the names of equivalent attribute fields. For example, some attributes from an LDAP database may be mapped to the corresponding attributes in a different database using database attribute mapping. In some embodiments, an LDAP synchronization agreement may be created by identifying the attribute of another database to which an attribute from the LDAP database maps to. In some cases, user ID attribute may be mapped first. In some cases, LDAP database attribute fields may be manually mapped to other database attribute fields. 
     The methods and techniques described herein may be used with various different types of robots and devices. For example,  FIG.  136 A  illustrates a smart fridge  13600  that may implement the methods and techniques described herein. Smart fridge  13600  includes an item dispenser  13601  and a detachable mobile robot  13602  for delivering items selected from the item dispenser  13601 .  FIG.  136 B  illustrates an application of a mobile device  13603  that may be paired with smart fridge  13600  and used by a user to request an item from the item dispenser  13601 . The application may display available items in various ways (e.g., images, icons, text, etc.) and may receive an input from the user designating a selection. For example, in  FIG.  136 B  the user selects item C, which the application may highlight, as in area  13604 , after the selection. The user may confirm their selection by pressing  13605  after the item is highlighted. The application may determine a location of the user based on location services or the user may specify a location to which the item is to be delivered using the application. The application may then communicate with smart fridge  13601  to request the selected item be delivered to the location of the user. A processor of smart fridge  13600  may actuate item dispenser  13601  to dispense the selected item.  FIG.  136 C  illustrates item dispenser  13601  dispensing the selected item C which may drop into the detachable mobile robot  13602 , as illustrated in  FIG.  136 D . The processor of smart fridge  13600  may communicate the target delivery location to the processor of mobile robot  13602  or it may receive the information directly from the application. In some cases, the processor of smart fridge  13600  may also provide the processor of mobile robot  13602  with a path plan or the processor of mobile robot  13602  may determine the path plan itself.  FIG.  136 E  illustrates mobile robot  13602  delivering the selected item.  FIG.  137 A  illustrates another example, wherein the robot is a food delivery robot. The food delivery robot includes robot  13700 , a tray  13701  with cup holders  13702 , and a bucket  13703  for collecting waste off of tables. In some cases, sensors used for mapping and navigation may be positioned behind area  13704 . In some cases, the food delivery robot may include a counter weight mechanism for maintaining balance during operation.  FIG.  137 B  illustrates internal components of the food delivery robot, particularly components of the counter weight mechanism, including dampers  13705  coupled to the bottom of tray  13701  and a heavy counter weight  13706  coupled to the bottom of tray  13701  via link  13707 .  FIG.  137 C  illustrates link  13707  coupled to the bottom of tray  13701  using ball joint  13708  such that the tray may remain levelled when robot  13700  is titled (e.g., when driving up or down a slope).  FIG.  137 D  illustrates robot  13700  driving up slope  13709 . While robot  13700  and bucket  13702  are tilted as a result of slope  13709 , counter weight  13706  allows tray  13701  to remain levelled, and thus prevent any spilling of food being delivered. In some cases, customers may order food using an application of a mobile device places on the tables of a restaurant. The application may communicate the order to the kitchen and the kitchen staff may place the order onto the food delivery robot. The food delivery robot may deliver the food to customers. In some cases, the food delivery robot may display orders in progress on an interface screen and the kitchen staff may select the order corresponding to the food that is placed on the tray of the robot for delivery. Based on the order selected by the kitchen staff, the processor of the food delivery robot may determine which table to deliver the food to. In some cases, food may be placed on the tray and the robot may receive a verbal command to deliver the food to a particular table. In some cases, a user may order food to their home using an application. A control system may receive the order and may deploy a food delivery robot to pick up the food order from a particular restaurant and deliver the food to the home of the user. The control system may determine which food delivery robot to deploy based on current location of the robot, the designated delivery location, the battery charge of the robot, etc. Other embodiments may be possible. 
       FIGS.  138 A- 138 C  illustrate another example, in this case a hospital bed including cameras  13800  facing up, forward, and downwards depending on their position on the hospital bed, sensor windows  13801  surrounding the entire hospital bed behind which sensor arrays are positioned (e.g., TOF sensors), telescopic 360-degree LIDAR  13802  that may be raised ( FIG.  138 A ) or lowered ( FIGS.  138 B and  138 C ), ultrasonic sensors  13803 , hospital bed frame  13804  with mattress  13805 . The mattress  13805  is angled for maximum comfort of a patient. In some cases, the patient or the processor of the hospital bed robot autonomously adjusts the angle of mattress  13805 . In some cases, the processor of the hospital bed robot is alerted when a hospital bed is needed in a particular location. The hospital bed robot may navigate to the particular location if empty. In other instances, the processor of the hospital bed robot is provided instructions to transport a patient in the hospital bed from a current location to another location. In some cases, the processor receives instructions or information from an application of a communication device paired with the processor. In some cases, an operator inputs instructions or information into the application and the application transmits the information to the processor. In some instances, the processor of the hospital bed robot has inventory of unused hospital beds and their locations. The processor may further have inventory of used hospital beds and their locations. The hospital bed robot reduces the need for hospital staff to transport hospital beds and therefore provides hospital staff with more time to attend to patients. Multiple hospital bed robots may be used simultaneously. In some cases, the processors of the multiple hospital bed robots collaborate to determine which tasks each hospital bed robot is to perform. In some cases, a control system manages all hospital bed robots in a hospital. In some embodiments, the processors of one or more hospital bed robots operating in a hospital may implement the methods and techniques described herein to, for example, determine optimal movement paths within the hospital, determine optimal collaboration, generate a map, localize, etc. 
     Another example of a robot that may implement the methods and techniques described herein includes a tire replacing robot.  FIG.  139 A  illustrates tire replacing robot  13900  transporting new tire  13901  to replace flat tire  13902  of car  13903 .  FIG.  139 A  illustrates tire replacing robot  13900  aligning its front end with flat tire  13902  using sensors of robot  13900 . Tire replacing robot  13900  may detect screws of the tire using computer vision techniques and may remove the screws using screw driver  13904  and then flat tire  13902 , as illustrated in  FIG.  139 B .  FIG.  139 C  illustrates tire replacing robot  13900  rotating in direction  13905  to attach new tire  13901  to car  13903  and  FIG.  139 D  illustrates new tire  13901  in position and tire replacing robot  13900  securing new tire  13901  to car  13903  by tightening screws using screw driver  13904 . In some cases, the tire replacing robot may be used to switch summer tires to winter tires. Similarly,  FIG.  140 A  illustrates a battery replacing robot  14000  with arms  14001  for removing battery  14002  from car  14003 . Battery replacing robot  14000  may align itself with battery  14002  using various sensors. Using arms  14001 , battery  14002  may be released from car  14003  by triggering a lever or latch, as illustrated in  FIG.  140 B . Battery replacing robot may transport battery  14002  to a repair or replacement station.  FIG.  140 C  illustrates battery replacing robot  14000  transporting a repaired or new battery  14004  for installation on car  14003 . In some cases, an application may be used to request different types of service robots to a particular location at a particular day and time, such as those illustrated in  FIGS.  139 A- 139 D and  140 A- 140 C . A control system may receive the request and deploy the request service robot to a designated location on a designated day and time. The control system may determine which service robot to deploy based on robot capabilities, current location of the robot, the designated service location, the battery charge of the robot, etc. 
     Other methods and techniques (e.g., mapping, localization, path planning, zone division, etc.) that may be used are described in U.S. patent application Ser. Nos. 16/230,805, 16/389,797, 16/427,317, and 16/509,099, the entire contents of which are hereby incorporated by reference. 
     The foregoing descriptions of specific embodiments of the invention have been presented for purposes of illustration and description. They are not intended to be exhaustive or to limit the invention to the precise forms disclosed. 
     In block diagrams provided herein, illustrated components are depicted as discrete functional blocks, but embodiments are not limited to systems in which the functionality described herein is organized as illustrated. The functionality provided by each of the components may be provided by software or hardware modules that are differently organized than is presently depicted. For example, such software or hardware may be intermingled, conjoined, replicated, broken up, distributed (e.g. within a data center or geographically), or otherwise differently organized. The functionality described herein may be provided by one or more processors of one or more computers executing code stored on a tangible, non-transitory, machine readable medium. In some cases, notwithstanding use of the singular term “medium,” the instructions may be distributed on different storage devices associated with different computing devices, for instance, with each computing device having a different subset of the instructions, an implementation consistent with usage of the singular term “medium” herein. In some cases, third party content delivery networks may host some or all of the information conveyed over networks, in which case, to the extent information (e.g., content) is said to be supplied or otherwise provided, the information may be provided by sending instructions to retrieve that information from a content delivery network. 
     The reader should appreciate that the present application describes several independently useful techniques. Rather than separating those techniques into multiple isolated patent applications, the applicant has grouped these techniques into a single document because their related subject matter lends itself to economies in the application process. But the distinct advantages and aspects of such techniques should not be conflated. In some cases, embodiments address all of the deficiencies noted herein, but it should be understood that the techniques are independently useful, and some embodiments address only a subset of such problems or offer other, unmentioned benefits that will be apparent to those of skill in the art reviewing the present disclosure. Due to costs constraints, some techniques disclosed herein may not be presently claimed and may be claimed in later filings, such as continuation applications or by amending the present claims. Similarly, due to space constraints, neither the Abstract nor the Summary sections of the present document should be taken as containing a comprehensive listing of all such techniques or all aspects of such techniques. 
     It should be understood that the description and the drawings are not intended to limit the present techniques to the particular form disclosed, but to the contrary, the intention is to cover all modifications, equivalents, and alternatives falling within the spirit and scope of the present techniques as defined by the appended claims. Further modifications and alternative embodiments of various aspects of the techniques will be apparent to those skilled in the art in view of this description. Accordingly, this description and the drawings are to be construed as illustrative only and are for the purpose of teaching those skilled in the art the general manner of carrying out the present techniques. It is to be understood that the forms of the present techniques shown and described herein are to be taken as examples of embodiments. Elements and materials may be substituted for those illustrated and described herein, parts and processes may be reversed or omitted, and certain features of the present techniques may be utilized independently, all as would be apparent to one skilled in the art after having the benefit of this description of the present techniques. Changes may be made in the elements described herein without departing from the spirit and scope of the present techniques as described in the following claims. Headings used herein are for organizational purposes only and are not meant to be used to limit the scope of the description. 
     As used throughout this application, the word “may” is used in a permissive sense (i.e., meaning having the potential to), rather than the mandatory sense (i.e., meaning must). The words “include”, “including”, and “includes” and the like mean including, but not limited to. As used throughout this application, the singular forms “a,” “an,” and “the” include plural referents unless the content explicitly indicates otherwise. Thus, for example, reference to “an element” or “a element” includes a combination of two or more elements, notwithstanding use of other terms and phrases for one or more elements, such as “one or more.” The term “or” is, unless indicated otherwise, non-exclusive, i.e., encompassing both “and” and “or.” Terms describing conditional relationships (e.g., “in response to X, Y,” “upon X, Y,”, “if X, Y,” “when X, Y,” and the like) encompass causal relationships in which the antecedent is a necessary causal condition, the antecedent is a sufficient causal condition, or the antecedent is a contributory causal condition of the consequent (e.g., “state X occurs upon condition Y obtaining” is generic to “X occurs solely upon Y” and “X occurs upon Y and Z”). Such conditional relationships are not limited to consequences that instantly follow the antecedent obtaining, as some consequences may be delayed, and in conditional statements, antecedents are connected to their consequents (e.g., the antecedent is relevant to the likelihood of the consequent occurring). Statements in which a plurality of attributes or functions are mapped to a plurality of objects (e.g., one or more processors performing steps A, B, C, and D) encompasses both all such attributes or functions being mapped to all such objects and subsets of the attributes or functions being mapped to subsets of the attributes or functions (e.g., both all processors each performing steps A-D, and a case in which processor 1 performs step A, processor 2 performs step B and part of step C, and processor 3 performs part of step C and step D), unless otherwise indicated. Further, unless otherwise indicated, statements that one value or action is “based on” another condition or value encompass both instances in which the condition or value is the sole factor and instances in which the condition or value is one factor among a plurality of factors. Unless otherwise indicated, statements that “each” instance of some collection have some property should not be read to exclude cases where some otherwise identical or similar members of a larger collection do not have the property (i.e., each does not necessarily mean each and every). Limitations as to sequence of recited steps should not be read into the claims unless explicitly specified, e.g., with explicit language like “after performing X, performing Y,” in contrast to statements that might be improperly argued to imply sequence limitations, like “performing X on items, performing Y on the X&#39;ed items,” used for purposes of making claims more readable rather than specifying sequence. Statements referring to “at least Z of A, B, and C,” and the like (e.g., “at least Z of A, B, or C”), refer to at least Z of the listed categories (A, B, and C) and do not require at least Z units in each category. Unless specifically stated otherwise, as apparent from the discussion, it is appreciated that throughout this specification discussions utilizing terms such as “processing,” “computing,” “calculating,” “determining” or the like refer to actions or processes of a specific apparatus specially designed to carry out the stated functionality, such as a special purpose computer or a similar special purpose electronic processing/computing device. Features described with reference to geometric constructs, like “parallel,” “perpendicular/orthogonal,” “square”, “cylindrical,” and the like, should be construed as encompassing items that substantially embody the properties of the geometric construct (e.g., reference to “parallel” surfaces encompasses substantially parallel surfaces). The permitted range of deviation from Platonic ideals of these geometric constructs is to be determined with reference to ranges in the specification, and where such ranges are not stated, with reference to industry norms in the field of use, and where such ranges are not defined, with reference to industry norms in the field of manufacturing of the designated feature, and where such ranges are not defined, features substantially embodying a geometric construct should be construed to include those features within 15% of the defining attributes of that geometric construct. Negative inferences should not be taken from inconsistent use of “(s)” when qualifying items as possibly plural, and items without this designation may also be plural.