Method, system and apparatus for adaptive particle filter localization

Information

  • Patent Grant
  • 11079240
  • Patent Number
    11,079,240
  • Date Filed
    Friday, December 7, 2018
    6 years ago
  • Date Issued
    Tuesday, August 3, 2021
    3 years ago
Abstract
A method for localization of a mobile automation apparatus includes, at a navigational controller: generating a set of candidate poses within an environmental map; updating the candidate poses according to motion data corresponding to movement of the mobile automation apparatus; receiving observational data collected at an actual pose of the mobile automation apparatus; generating (i) respective weights for the candidate poses, each weight indicating a likelihood that the corresponding candidate pose matches the actual pose, and (ii) a localization confidence level based on the weights; responsive to determining whether the localization confidence level exceeds a candidate pose resampling threshold: when the determination is affirmative, (i) increasing the candidate pose resampling threshold and (ii) generating a further set of candidate poses; and when the determination is negative, (i) decreasing the candidate pose resampling threshold without generating the further set; and repeating the updating, the receiving, the generating and the determining.
Description
BACKGROUND

Environments in which objects are managed, such as retail facilities, may be complex and fluid. For example, a retail facility may include objects such as products for purchase, a distribution environment may include objects such as parcels or pallets, a manufacturing environment may include objects such as components or assemblies, a healthcare environment may include objects such as medications or medical devices.


A mobile apparatus may be employed to perform tasks within the environment, such as capturing data for use in identifying products that are out of stock, incorrectly located, and the like. To travel within the environment, the mobile apparatus may be required to perform a localization function (e.g. to track a current location of the mobile apparatus within a map of the environment). Accurate localization may be complicated by various factors, including moving obstacles not represented in the above map, distortions in the map, and the like.





BRIEF DESCRIPTION OF THE SEVERAL VIEWS OF THE DRAWINGS

The accompanying figures, where like reference numerals refer to identical or functionally similar elements throughout the separate views, together with the detailed description below, are incorporated in and form part of the specification, and serve to further illustrate embodiments of concepts that include the claimed invention, and explain various principles and advantages of those embodiments.



FIG. 1 is a schematic of a mobile automation system.



FIG. 2A depicts a mobile automation apparatus in the system of FIG. 1.



FIG. 2B is a block diagram of certain internal hardware components of the mobile automation apparatus in the system of FIG. 1.



FIG. 2C is a block diagram of certain internal components of the apparatus of FIG. 1.



FIG. 3 is a flowchart of a method for localization of the mobile automation apparatus of FIG. 1.



FIG. 4A illustrates a map employed in the performance of the method of FIG. 3



FIG. 4B illustrates an example performance of block 310 of the method of FIG. 3.



FIGS. 5A-5B illustrate an example performance of blocks 315-325 of the method of FIG. 3.



FIGS. 6A-6B illustrate a further example performance of blocks 310-325 of the method of FIG. 3.



FIGS. 7A-7B illustrate additional performances of blocks 315-325 of the method of FIG. 3.



FIGS. 8A-8B illustrates further performances of blocks 310-325 of the method of FIG. 3



FIG. 9A illustrates a further performance of blocks 315-325 of the method of FIG. 3.



FIG. 9B illustrates a further example performance of blocks 310-325 of the method of FIG. 3.



FIGS. 10A-10B illustrate further performances of blocks 315-325 of the method of FIG. 3.





Skilled artisans will appreciate that elements in the figures are illustrated for simplicity and clarity and have not necessarily been drawn to scale. For example, the dimensions of some of the elements in the figures may be exaggerated relative to other elements to help to improve understanding of embodiments of the present invention.


The apparatus and method components have been represented where appropriate by conventional symbols in the drawings, showing only those specific details that are pertinent to understanding the embodiments of the present invention so as not to obscure the disclosure with details that will be readily apparent to those of ordinary skill in the art having the benefit of the description herein.


DETAILED DESCRIPTION

Examples disclosed herein are directed to a method for localization of a mobile automation apparatus, the method comprising, at a navigational controller: generating a set of candidate poses within an environmental map; updating the set of candidate poses according to motion data corresponding to movement of the mobile automation apparatus; receiving observational data collected at an actual pose of the mobile automation apparatus; generating (i) respective weights for the candidate poses, each weight indicating a likelihood that the corresponding candidate pose matches the actual pose, and (ii) a localization confidence level based on the weights; responsive to determining whether the localization confidence level exceeds a candidate pose resampling threshold: when the determination is affirmative, (i) increasing the candidate pose resampling threshold and (ii) generating a further set of candidate poses; and when the determination is negative, (i) decreasing the candidate pose resampling threshold without generating the further set; and repeating the updating, the receiving, the generating and the determining.


Additional examples disclosed herein are directed to a mobile automation apparatus, comprising a motion sensor; an observational sensor; and a navigational controller connected to the motion sensor and the observational sensor; the navigational controller configured to: generate a set of candidate poses within an environmental map; update the set of candidate poses according to motion data collected via the motion sensor; collect observational data corresponding to an actual pose of the mobile automation apparatus via the observational sensor; generate (i) respective weights for the candidate poses, each weight indicating a likelihood that the corresponding candidate pose matches the actual pose, and (ii) a localization confidence level based on the weights; determine whether the localization confidence level exceeds a candidate pose resampling threshold, and responsive to the determination: when the determination is affirmative, (i) increase the candidate pose resampling threshold and (ii) generate a further set of candidate poses; and when the determination is negative, (i) decrease the candidate pose resampling threshold without generating the further set; and repeat the update of the set of candidate poses, the collection of observation data, the generation of the weights and the localization confidence level, and the determination.


Further examples disclosed herein are directed to a non-transitory computer-readable medium storing a plurality of computer-readable instructions executable by a navigational controller, wherein execution of the computer-readable instructions configures the navigational controller to: generate a set of candidate poses within an environmental map; update the set of candidate poses according to motion data collected via a motion sensor; collect observational data corresponding to an actual pose of the mobile automation apparatus via an observational sensor; generate (i) respective weights for the candidate poses, each weight indicating a likelihood that the corresponding candidate pose matches the actual pose, and (ii) a localization confidence level based on the weights; determine whether the localization confidence level exceeds a candidate pose resampling threshold, and responsive to the determination: when the determination is affirmative, (i) increase the candidate pose resampling threshold and (ii) generate a further set of candidate poses; and when the determination is negative, (i) decrease the candidate pose resampling threshold without generating the further set; and repeat the update of the set of candidate poses, the collection of observation data, the generation of the weights and the localization confidence level, and the determination.



FIG. 1 depicts a mobile automation system 100 in accordance with the teachings of this disclosure. The system 100 is illustrated as being deployed in a retail environment, but in other embodiments can be deployed in a variety of other environments, including warehouses, hospitals, and the like. The environment in which the system 100 is deployed may also be referred to herein generically as a facility.


The system 100 includes a server 101 in communication with at least one mobile automation apparatus 103 (also referred to herein simply as the apparatus 103) and at least one client computing device 105 via communication links 107, illustrated in the present example as including wireless links. In the present example, the links 107 are provided by a wireless local area network (WLAN) deployed within the retail environment by one or more access points (not shown). In other examples, the server 101, the client device 105, or both, are located outside the retail environment, and the links 107 therefore include wide-area networks such as the Internet, mobile networks, and the like. The system 100 also includes a dock 108 for the apparatus 103 in the present example. The dock 108 is in communication with the server 101 via a link 109 that in the present example is a wired link. In other examples, however, the link 109 is a wireless link.


The client computing device 105 is illustrated in FIG. 1 as a mobile computing device, such as a tablet, smart phone or the like. In other examples, the client device 105 is implemented as another type of computing device, such as a desktop computer, a laptop computer, another server, a kiosk, a monitor, and the like. The system 100 can include a plurality of client devices 105 in communication with the server 101 via respective links 107.


The system 100 is deployed, in the illustrated example, in a retail environment including a plurality of shelf modules 110-1, 110-2, 110-3 and so on (collectively referred to as shelves 110, and generically referred to as a shelf 110—this nomenclature is also employed for other elements discussed herein). Each shelf module 110 supports a plurality of products 112. Each shelf module 110 includes a shelf back 116-1, 116-2, 116-3 and a support surface (e.g. support surface 117-3 as illustrated in FIG. 1) extending from the shelf back 116 to a shelf edge 118-1, 118-2, 118-3.


The shelf modules 110 are typically arranged in a plurality of aisles, each of which includes a plurality of modules 110 aligned end-to-end. In such arrangements, the shelf edges 118 face into the aisles, through which customers in the retail environment as well as the apparatus 103 may travel. As will be apparent from FIG. 1, the term “shelf edge” 118 as employed herein, which may also be referred to as the edge of a support surface (e.g., the support surfaces 117) refers to a surface bounded by adjacent surfaces having different angles of inclination. In the example illustrated in FIG. 1, the shelf edge 118-3 is at an angle of about ninety degrees relative to each of the support surface 117-3 and the underside (not shown) of the support surface 117-3. In other examples, the angles between the shelf edge 118-3 and the adjacent surfaces, such as the support surface 117-3, is more or less than ninety degrees.


The apparatus 103 is deployed within the retail environment, and communicates with the server 101 (e.g. via the link 107) to navigate, autonomously or partially autonomously, along a length 119 of at least a portion of the shelves 110. The apparatus 103, autonomously or in conjunction with the server 101, is configured to continuously determine its location within the environment, for example with respect to a map of the environment. The map may, for example, define the positions of obstacles such as the shelves 110 according to a frame of reference 102. The apparatus 103 may also be configured to update the map (e.g. via a simultaneous mapping and localization, or SLAM, process). As will be discussed in greater detail below, the apparatus 103 can be configured to employ a particle filter localization mechanism, such as a localization mechanism based on Monte Carlo Localization (MCL) to determine a current pose (i.e. a location and an orientation) of the apparatus 103 within the map (i.e. with respect to the frame of reference 102).


The apparatus 103 is equipped with a plurality of navigation and data capture sensors 104, such as image sensors (e.g. one or more digital cameras) and depth sensors (e.g. one or more Light Detection and Ranging (LIDAR) sensors, one or more depth cameras employing structured light patterns, such as infrared light, or the like). The apparatus 103 can be configured to employ the sensors 104 to both navigate among the shelves 110 (e.g. according to the paths mentioned above) and to capture shelf data during such navigation.


The server 101 includes a special purpose controller, such as a processor 120, specifically designed to control and/or assist the mobile automation apparatus 103 to navigate the environment and to capture data. The processor 120 can be further configured to obtain the captured data via a communications interface 124 for storage in a repository 132 and subsequent processing (e.g. to detect objects such as shelved products in the captured data, and detect status information corresponding to the objects). The server 101 may also be configured to transmit status notifications (e.g. notifications indicating that products are out-of-stock, low stock or misplaced) to the client device 105 responsive to the determination of product status data. The client device 105 includes one or more controllers (e.g. central processing units (CPUs) and/or field-programmable gate arrays (FPGAs) and the like) configured to process (e.g. to display) notifications received from the server 101.


The processor 120 is interconnected with a non-transitory computer readable storage medium, such as the above-mentioned memory 122, having stored thereon computer readable instructions for performing various functionality, including control of the apparatus 103 to capture shelf data, post-processing of the shelf data, and generating and providing certain navigational data to the apparatus 103, such as target locations at which to capture shelf data. The memory 122 includes a combination of volatile (e.g. Random Access Memory or RAM) and non-volatile memory (e.g. read only memory or ROM, Electrically Erasable Programmable Read Only Memory or EEPROM, flash memory). The processor 120 and the memory 122 each comprise one or more integrated circuits. In some embodiments, the processor 120 is implemented as one or more central processing units (CPUs) and/or graphics processing units (GPUs).


The server 101 also includes the above-mentioned communications interface 124 interconnected with the processor 120. The communications interface 124 includes suitable hardware (e.g. transmitters, receivers, network interface controllers and the like) allowing the server 101 to communicate with other computing devices—particularly the apparatus 103, the client device 105 and the dock 108—via the links 107 and 109. The links 107 and 109 may be direct links, or links that traverse one or more networks, including both local and wide-area networks. The specific components of the communications interface 124 are selected based on the type of network or other links that the server 101 is required to communicate over. In the present example, as noted earlier, a wireless local-area network is implemented within the retail environment via the deployment of one or more wireless access points. The links 107 therefore include either or both wireless links between the apparatus 103 and the mobile device 105 and the above-mentioned access points, and a wired link (e.g. an Ethernet-based link) between the server 101 and the access point.


The memory 122 stores a plurality of applications, each including a plurality of computer readable instructions executable by the processor 120. The execution of the above-mentioned instructions by the processor 120 configures the server 101 to perform various actions discussed herein. The applications stored in the memory 122 include a control application 128, which may also be implemented as a suite of logically distinct applications. In general, via execution of the application 128 or subcomponents thereof and in conjunction with the other components of the server 101, the processor 120 is configured to implement various functionality related to controlling the apparatus 103 to navigate among the shelves 110 and capture data. The processor 120, as configured via the execution of the control application 128, is also referred to herein as the controller 120. As will now be apparent, some or all of the functionality implemented by the controller 120 described below may also be performed by preconfigured special purpose hardware controllers (e.g. one or more FPGAs and/or Application-Specific Integrated Circuits (ASICs) configured for navigational computations) rather than by execution of the control application 128 by the processor 120.


Turning now to FIGS. 2A and 2B, the mobile automation apparatus 103 is shown in greater detail. The apparatus 103 includes a chassis 201 containing a locomotive mechanism 203 (e.g. one or more electrical motors driving wheels, tracks or the like). The apparatus 103 further includes a sensor mast 205 supported on the chassis 201 and, in the present example, extending upwards (e.g., substantially vertically) from the chassis 201. The mast 205 supports the sensors 104 mentioned earlier. In particular, the sensors 104 include at least one imaging sensor 207, such as a digital camera, as well as at least one depth sensor 209, such as a 3D digital camera. The apparatus 103 also includes additional depth sensors, such as LIDAR sensors 211. In other examples, the apparatus 103 includes additional sensors, such as one or more RFID readers, temperature sensors, and the like.


In the present example, the mast 205 supports seven digital cameras 207-1 through 207-7, and two LIDAR sensors 211-1 and 211-2. The mast 205 also supports a plurality of illumination assemblies 213, configured to illuminate the fields of view of the respective cameras 207. That is, the illumination assembly 213-1 illuminates the field of view of the camera 207-1, and so on. The sensors 207 and 211 are oriented on the mast 205 such that the fields of view of each sensor face a shelf 110 along the length 119 of which the apparatus 103 is travelling. The apparatus 103 also includes a motion sensor 218, shown in FIG. 2B. The motion sensor 218 is configured to collect motion data defining movement of the apparatus 103, and can therefore include an inertial measurement unit (IMU) including a combination of accelerometer(s) and gyroscope(s). The motion sensor 218 can also include, in some embodiments, a wheel speed sensor integrated with the locomotive mechanism 203.


The mobile automation apparatus 103 includes a special-purpose navigational controller, such as a processor 220, as shown in FIG. 2B, interconnected with a non-transitory computer readable storage medium, such as a memory 222. The memory 222 includes a combination of volatile (e.g. Random Access Memory or RAM) and non-volatile memory (e.g. read only memory or ROM, Electrically Erasable Programmable Read Only Memory or EEPROM, flash memory). The processor 220 and the memory 222 each comprise one or more integrated circuits. The memory 222 stores computer readable instructions for execution by the processor 220. In particular, the memory 222 stores a navigation application 228 which, when executed by the processor 220, configures the processor 220 to perform various functions discussed below in greater detail and related to the navigation of the apparatus 103, and in particular to localization of the apparatus 103 employing a particle filter mechanism. The application 228 may also be implemented as a suite of distinct applications in other examples.


The processor 220, when so configured by the execution of the application 228, may also be referred to as a navigational controller 220. Those skilled in the art will appreciate that the functionality implemented by the processor 220 via the execution of the application 228 may also be implemented by one or more specially designed hardware and firmware components, such as FPGAs, ASICs and the like in other embodiments.


The memory 222 may also store a repository 232 containing, for example, the above-mentioned map representing the environment in which the apparatus 103 operates, for use during the execution of the application 228. The apparatus 103 may communicate with the server 101, for example to receive instructions to navigate to specified locations and initiate data capture operations, via a communications interface 224 over the link 107 shown in FIG. 1. The communications interface 224 also enables the apparatus 103 to communicate with the server 101 via the dock 108 and the link 109.


As will be apparent in the discussion below, in other examples, some or all of the processing performed by the apparatus 103 may be performed by the server 101, and some or all of the processing performed by the server 101 may be performed by the apparatus 103. That is, although in the illustrated example the application 228 resides in the mobile automation apparatus 103, in other embodiments the actions performed by some or all of the components of the apparatus 103 may be performed by the processor 120 of the server 101, either in conjunction with or independently from the processor 220 of the mobile automation apparatus 103. As those of skill in the art will realize, distribution of navigational computations between the server 101 and the mobile automation apparatus 103 may depend upon respective processing speeds of the processors 120 and 220, the quality and bandwidth of the link 107, as well as criticality level of the underlying instruction(s).


Turning now to FIG. 2C, before describing the actions taken by the apparatus 103 to perform localization, certain components of the application 228 will be described in greater detail. As will be apparent to those skilled in the art, in other examples the components of the application 228 may be separated into distinct applications, or combined into other sets of components. Some or all of the components illustrated in FIG. 2C may also be implemented as dedicated hardware components, such as one or more ASICs or FPGAs.


The application 228 includes a particle handler 250 configured to generate (also referred to as “resample”) or update a set of candidate poses (which may also be referred to as particles) for the apparatus 103 within the above-mentioned map. The updating of candidate poses can be performed based on motion data, for example received from the motion sensor 218. The generation of candidate poses is performed based on inputs including weights (also referred to as likelihoods, as will be discussed below) assigned to a previous set of candidate poses by a candidate pose evaluator 254. The candidate pose evaluator 254 is configured to generate such weights based on observational data, such as lidar scans received from the lidar sensors 211. The application 228 also includes a resampling threshold handler 258, configured to maintain and update a threshold defining whether, based on the weights generated by the evaluator 254, to cause the particle handler 250 to generate (i.e. resample) a further set of particles, or to cause the particle handler 250 to update a current set of particles (e.g. according to motion data).


The functionality of the application 228 will now be described in greater detail. In particular, the particle filter-based localization mechanism mentioned above will be described as performed by the apparatus 103. Turning to FIG. 3, a method 300 of localization is shown. The method 300 will be described in conjunction with its performance by the apparatus 103, with reference to the components illustrated in FIGS. 2B and 2C.


At block 305, the apparatus 103, and particularly the particle handler 250, is configured to obtain a map of the environment in which the apparatus 103 is deployed. The map can be obtained at block 305 by retrieval from the memory 222 (e.g. from the repository 232), where the map was previously stored. In other examples, the map can be obtained at block 305 by requesting the map from the server 101. Also at block 305, the apparatus 103 (and particularly the threshold handler 258) is configured to initialize a candidate pose resampling threshold. The candidate pose resampling threshold, as will be described in greater detail below, is employed to determine whether to resample a particle set used for localization, or to maintain a current particle set. The threshold is initialized at a preconfigured value (e.g. stored in the memory 222). In the present example the threshold is initialized at a value of ten percent (10%), although as will be apparent in the discussion below, a wide variety of other initial values may also be employed at block 305. The threshold also need not be expressed as a percentage in other implementations.


Turning brief to FIG. 4A, an example map 400 is shown as retrieved at block 305, depicting an overhead view of the environment in which the apparatus 103 is deployed. The map 400 defines, according to the frame of reference 102, the positions of a plurality of obstacles 404 in the environment. Also shown on the map in FIG. 4A is the actual pose 408 of the apparatus 103, although the actual pose 408 is not currently known to the apparatus 103. The pose 408 (and all other poses discussed herein) is characterized by a location within the map 400, e.g. indicated by the center of the triangle indicating the pose 408, as well as an orientation (i.e. a heading direction), indicated by the apex arrow extending from the circular element.


Returning to FIG. 3, at block 310 the apparatus 103 is configured to generate a set of candidate poses, also referred to as particles, within the map 400. The candidate poses are generated with a distribution throughout the map 400 (or a portion thereof, although in the examples discussed herein the entire map 400 will be employed) that is based on weights assigned to a previously generated set of candidate poses. The present performance of block 310 is the first performance of block 310, and therefore no weights for previous candidate poses are available. Such a scenario is equivalent to a previous set of particles having equal weights. Therefore, the set of candidate poses generated in the present performance of block 310 can be randomly distributed throughout the map 400. The particle handler 250 can be configured to generate a predefined number of candidate poses.



FIG. 4B illustrates the map 400 with a set of candidate poses overlaid thereon. In particular, example candidate poses 412-1, 412-2, 412-3 and 412-4 are illustrated. As will now be apparent, a greater number of candidate poses are typically generated at block 310 (e.g. one hundred poses; numbers of candidate poses both greater and smaller than 100 are also contemplated, with the actual number generated depending on the size of the map 400, the computational resources available to the apparatus 103, and the like), but only a subset are illustrated in FIG. 4B for clarity.


Referring again to FIG. 3, at block 315 the apparatus 103 is configured to obtain motion data corresponding to movement of the apparatus 103, and the particle handler 250 is configured to update the candidate poses 412 of the set generated at block 310 according to the motion data. In the present example, the motion data includes odometry obtained from the motion sensor 218 described above. The motion data indicates that the apparatus 103 has travelled a given distance in a “forward” direction. FIG. 5A illustrates the change in the actual pose of the apparatus 103. In particular, the previous actual pose 408 is shown, along with a current actual pose 508 following the above movement of the apparatus 103.


At block 315, the particle handler 250 is configured to update the poses 412 generated at block 310 to apply translations, rotations or the like based on the motion data. Thus, in the example shown in FIG. 5A, the candidate poses 412 are updated to candidate poses 512-1, 512-2, 512-3 and 512-4. For example, the candidate pose 512-1 corresponds to the candidate pose 412-1 of FIG. 4B (also illustrated for reference in FIG. 5A), translated “forward” by the same distance as shown between the poses 408 and 508. As will be apparent, the direction of travel reflected by the pose 512-1 is incorrect relative to the frame of reference 102 (it is the opposite direction from the actual direction of travel). The translations and/or rotations mentioned above can be applied to the candidate poses with some noise, to model noise in the motion data obtained from sensors of the apparatus 103.


At block 320, the apparatus 103 is configured to collect observational data corresponding to the actual pose 508. In the present example, the observational data includes lidar scan data collected with one or more of the lidar sensors 211. As will be apparent, in other embodiments the observational data can include other forms of data representing the surroundings of the apparatus 103, such as image data, in addition to or instead of lidar scan data. In the present example, the observational data includes a lidar scan having a field of view 516 as shown in FIG. 5B.


At block 325, the apparatus 103, and in particular the candidate pose evaluator 254, is configured to generate weights for each of the candidate poses 512. The weights may also be referred to as likelihoods. Each weight indicates a likelihood that the corresponding candidate pose 512 matches the actual pose 508 (i.e. that the candidate pose 512 correctly localizes the apparatus 103 within the map 400. The evaluator 254 is configured, at block 325, to generate expected observational data for each candidate pose 512, based on the pose 512 itself and on the map 400. In other words, the evaluator 254 is configured to determine what observational data would be expected at block 320, if the apparatus 103 were located at the candidate pose 512. For example, FIG. 5B illustrates a virtual field of view 520-1 associated with the candidate pose 512-1, illustrating the expected observational data that would be collected at block 320 if the apparatus 103 was located at the pose 512-1. The evaluator 254 is configured, for each candidate pose 512, to compare the expected observational data with the actual observational data from block 320, and to assign a weight to each candidate pose 512 based on the degree of similarity between expected and actual observational data.


As is evident from FIG. 5B, certain candidate poses 512 (e.g. the candidate pose 512-2) yield expected observational data that matches the actual observational data poorly. The candidate pose 512-2 is therefore assigned a low weight (e.g. 3% in the present example). Repeating the same process for each candidate pose 512 yields the example weights shown in FIG. 5B. That is, the candidate pose 512-3 is assigned a weight of 40%, and the candidate pose 512-4 is assigned a weight of 48%. The candidate pose 512-1, as shown in FIG. 5B, is assigned a weight of 85%. Although the candidate pose 512-1 faces in the opposite direction from the actual pose 508 and faces towards a different obstacle 404 than the actual pose 508, the obstacles are assumed to be similar to each other, and the orientation of the actual pose 508 and the candidate pose 512-1 relative to the corresponding obstacles 404 are similar. Therefore the expected observational data in the field of view 520-1 is similar to the actual observational data.


Returning again to FIG. 3, at block 325 the apparatus 103 is also configured to generate a localization confidence level based on the weights discussed above. For example, the evaluator 254 can be configured to select a predefined number of the candidate poses 512 having the highest weights (e.g. in a set of 100 candidate poses, the 15 highest-weighted candidate poses), and generate an average of the selected weights. In other examples, the evaluator 254 may also apply a selection threshold to the above selection, for example selecting up to a predefined number of candidate poses whose weights are greater than 70%.


In the example illustrated in FIG. 5B, it is assumed that the evaluator simply selects the highest-weighted candidate pose 512 (i.e. the candidate pose 512-1) in the present example. The confidence level generated at block 325 for the present example performance of block 325 is therefore 85%. At block 330, the evaluator 254 can be configured to present a localization, for example to another component of the apparatus 103, the server 101, or the like. The localization presented at block 330 can be an average pose of the subset of selected candidate poses from which the confidence level is generated.


At block 335, the apparatus 103 (and in particular the threshold handler 258) is configured to determine whether the confidence level generated at block 325 exceeds the threshold initialized at block 305. In the present example, as noted earlier, the threshold was initialized at 10%, and the confidence level of 85% therefore exceeds the threshold. The determination at block 335 is therefore affirmative, and performance of the method proceeds to block 340.


At block 340, the threshold handler 258 is configured to increase the threshold from the value initialized at block 305. In the present example, the threshold is increased to match the current localization confidence (e.g. 85%). In other examples, the threshold can be increased in predetermined steps, or by a dynamic step determined based on the difference between the confidence level and the current threshold. The increase of the threshold at block 340 indicates an expectation that further observations of the surroundings of the apparatus 103 are likely to improve the localization confidence of the apparatus 103, based on the affirmative determination at block 335.


Following the performance of block 340, the apparatus 103 is configured to generate a further set of candidate poses, based on the weights previously assigned to the candidate poses 512 at block 325. That is, the further set of candidate poses generated in this iteration of block 310 are distributed in the map 400 according to the weights from block 325. The further set of candidate poses are therefore biased towards the pose 512-1. FIG. 6A illustrates a further set of candidate poses 612-1, 612-2, 612-3 and 612-4 generated at block 310. As shown in FIG. 6A, the candidate poses 612 are biased towards the location of the candidate pose 512-1 within the map 400 (that is, three of the four candidate poses 612 are adjacent to the candidate pose 512-1).


At block 315, further motion data indicates that the apparatus 103 has moved in the forward direction and turned to the “right” by an angle of 90 degrees, as shown in FIG. 6B, which illustrates an updated actual pose 608 relative to the previous actual pose 508. The candidate poses 612 are also updated at block 315, as shown in FIG. 6B, in which the candidate poses 612 are replaced with candidate poses 712-1, 712-2, 712-3 and 712-4 (the candidate pose 612-1 prior to updating is also shown for reference).


At a further performance of block 320, the apparatus 103 is configured to obtain observational data, depicting a field of view 616. As will now be apparent, the expected observational data corresponding to the candidate poses 712 are dissimilar to the actual observational data collected from the field of view 616. The candidate poses 712-1, 712-2, 712-3 and 712-4 are therefore assigned weights at block 325 as shown in FIG. 7B (respectively, of 5%, 2%, 0% and 22%). The confidence level at block 325 is therefore 5%, corresponding to the weight assigned to the candidate pose 712-1.


At block 335, therefore, the determination is negative, as the confidence level from block 325 does not exceed the current resampling threshold of 85%. The apparatus 103 is therefore configured, at block 345, to decrease the threshold. The threshold is decreased according to a predetermined step (e.g. 10% per performance of block 345). In other examples, the threshold can be decreased by a dynamic step determined according to the distance travelled by the apparatus 103 (as defined by the motion data received at block 315) since the previous threshold update, or on an elapsed time period since the previous threshold update (with greater distances or greater time periods leading to greater decreases). The decrease is independent of the difference between localization confidence and the previous threshold. The decrease of the threshold at block 345 indicates that based on the current observational data, the confidence of the apparatus 103 in the effectiveness of the current distribution of candidate poses is reduced (i.e. this distribution of candidate poses is considered less likely to yield accurate localization). In the present example, the threshold is assumed to be decreased form 85% to 60%.


Following the performance of block 345, the apparatus 103 is configured to return to block 315. Of particular note, following block 345 a new set of candidate poses is not generated. Instead, the previous set of candidate poses 712 is retained, and updated according to motion data collected at block 315. FIG. 7A illustrates further performances of block 315, 320 and 325, in which a change in the actual pose 708 is reflected in motion data obtained at block 315, and the candidate poses 712 are updated, appearing as candidate poses 722-1, 722-2, 722-3 and 722-4. As is apparent from FIG. 7A, the weights assigned to the updated candidate poses 722 at a further performance of block 325 remain below the threshold of 60%, and thus the threshold is reduced once again at block 340. For illustrative purposes, the threshold is assumed to be reduced to 20%.



FIG. 7B illustrates a further performance of blocks 315, 320 and 325, resulting in weights assigned to candidate poses 732-1, 732-2, 732-3 and 732-4 (which are updated versions of the candidate poses 722) of 2%, 1%, 3% and 25%, respectively. The confidence level generated at block 325 is therefore 25% (corresponding to the highest-weighted candidate pose 732). The determination at block 335 is therefore affirmative, because the confidence level of 25% exceeds the threshold of 20%. The threshold is therefore increased to 25% at block 340, and block 310 is repeated to generate a new set of candidate poses.


As shown in FIG. 8A, the new set of candidate poses 812-1, 812-2, 812-3 and 812-4 are biased towards the position of the candidate pose 732-4 shown in FIG. 7B (though such bias may be relatively weak, due to the low weight of the candidate pose 732-4). Following a further performance of blocks 320 and 325, the weights illustrated in FIG. 8A are generated. As will now be apparent, the poses 812 were not updated to reflect movement of the apparatus 103 as defined by motion data obtained at block 315. The motion data may, for example, indicate that the apparatus 103 has not moved since the generation of the candidate poses 812.


As seen in FIG. 8A, the weight generated for the candidate pose 812-1 is 75%, which exceeds the threshold of 25%. Employing the weight of 75% as the localization confidence level at block 325, the determination at block 335 is therefore affirmative, and at block 340 the threshold is increased to 75%, following which a further set of candidate poses 822-1, 822-2, 822-3 and 822-4 (shown in FIG. 8B) are generated at block 310, biased towards the position of the candidate pose 812-1.



FIG. 9A illustrates a further performance of blocks 315, 320 and 325. Specifically, motion data obtained at block 315 indicates movement of the apparatus 103 (reflected as an actual pose 908). The candidate poses 822 are therefore updated to the candidate poses 832-1, 832-2, 832-3 and 832-4 as shown in FIG. 9A, and the illustrated weights are generated at block 325. The confidence level determined at block 325 is therefore 90%, and the determination at block 335 is affirmative (as the confidence level, of 90% exceeds the threshold of 75%). The threshold is therefore increased to 90%, and yet another set of candidate poses is therefore generated in a further performance of block 310, illustrated in FIG. 9B as candidate poses 912-1, 912-2, 912-3 and 912-4.



FIG. 10A illustrates a further performance of block 315, updating the candidate poses 912 to candidate poses 922-1, 922-2, 922-3 and 922-4 according to motion data indicating movement of the apparatus 103 (to an actual pose 1008). FIG. 10A also illustrates an obstacle 1000, which is assumed not to be represented in the map 400. The obstacle 1000 may be, for example, a moving obstacle such as a person, vehicle or the like. At block 320, the observational data collected from the actual pose 1008 therefore indicates the presence of the obstacle 1000, whereas the expected observational data generated from the map 400 for each of the candidate poses 922 does not indicate the presence of the obstacle 1000. The weights generated for the candidate poses 922 are therefore low (e.g. an example weight of 10% for the candidate pose 922-1 is shown) despite the close proximity of the poses 922 to the actual pose 1008 (i.e. despite the accuracy of the candidate poses 922). The determination at block 335 is therefore negative, and the threshold is decreased (e.g. from 90% to 75%) at block 345. However, the candidate poses 922 are retained.



FIG. 10B illustrates the results of a further performance of blocks 315, 320 and 325. As shown in FIG. 10B, the obstacle 1000 has moved, and is no longer in a position to be detected in the observational data from an updated actual pose 1018 of the apparatus 103. The weights generated for the updated candidate poses 932-1, 932-2, 932-3 and 932-4 therefore once again indicate high localization confidence, and a new set of candidate poses can be generated at a further performance of block 310 based on the weights shown in FIG. 10B, resulting in a set of candidate poses tightly biased towards the actual pose 1018 (rather than more weakly biased candidate poses that would result from generating a new set of candidate poses according to the weights shown in FIG. 10A).


Through the performance of the method 300, therefore, the apparatus 103 is configured to resample candidate poses (i.e. generate new sets of candidate poses) when such resampling is expected to yield greater localization confidence than currently available, and to avoid resampling otherwise. In other words, the apparatus 103 retains particle distributions (i.e. does not resample) that have historically yielded higher localization confidence than a current localization confidence (in the event that the current localization confidence is lower due to a transient factor such as a moving obstacle, distorted region of the map, or the like). Further, the apparatus 103 replaces particle distributions that have historically yielded lower localization confidence than a current localization confidence, with the expectation that resampling based on the current elevated localization confidence will lead to further improvements in localization.


In the foregoing specification, specific embodiments have been described. However, one of ordinary skill in the art appreciates that various modifications and changes can be made without departing from the scope of the invention as set forth in the claims below. Accordingly, the specification and figures are to be regarded in an illustrative rather than a restrictive sense, and all such modifications are intended to be included within the scope of present teachings.


The benefits, advantages, solutions to problems, and any element(s) that may cause any benefit, advantage, or solution to occur or become more pronounced are not to be construed as a critical, required, or essential features or elements of any or all the claims. The invention is defined solely by the appended claims including any amendments made during the pendency of this application and all equivalents of those claims as issued.


Moreover in this document, relational terms such as first and second, top and bottom, and the like may be used solely to distinguish one entity or action from another entity or action without necessarily requiring or implying any actual such relationship or order between such entities or actions. The terms “comprises,” “comprising,” “has”, “having,” “includes”, “including,” “contains”, “containing” or any other variation thereof, are intended to cover a non-exclusive inclusion, such that a process, method, article, or apparatus that comprises, has, includes, contains a list of elements does not include only those elements but may include other elements not expressly listed or inherent to such process, method, article, or apparatus. An element proceeded by “comprises . . . a”, “has . . . a”, “includes . . . a”, “contains . . . a” does not, without more constraints, preclude the existence of additional identical elements in the process, method, article, or apparatus that comprises, has, includes, contains the element. The terms “a” and “an” are defined as one or more unless explicitly stated otherwise herein. The terms “substantially”, “essentially”, “approximately”, “about” or any other version thereof, are defined as being close to as understood by one of ordinary skill in the art, and in one non-limiting embodiment the term is defined to be within 10%, in another embodiment within 5%, in another embodiment within 1% and in another embodiment within 0.5%. The term “coupled” as used herein is defined as connected, although not necessarily directly and not necessarily mechanically. A device or structure that is “configured” in a certain way is configured in at least that way, but may also be configured in ways that are not listed.


It will be appreciated that some embodiments may be comprised of one or more specialized processors (or “processing devices”) such as microprocessors, digital signal processors, customized processors and field programmable gate arrays (FPGAs) and unique stored program instructions (including both software and firmware) that control the one or more processors to implement, in conjunction with certain non-processor circuits, some, most, or all of the functions of the method and/or apparatus described herein. Alternatively, some or all functions could be implemented by a state machine that has no stored program instructions, or in one or more application specific integrated circuits (ASICs), in which each function or some combinations of certain of the functions are implemented as custom logic. Of course, a combination of the two approaches could be used.


Moreover, an embodiment can be implemented as a computer-readable storage medium having computer readable code stored thereon for programming a computer (e.g., comprising a processor) to perform a method as described and claimed herein. Examples of such computer-readable storage mediums include, but are not limited to, a hard disk, a CD-ROM, an optical storage device, a magnetic storage device, a ROM (Read Only Memory), a PROM (Programmable Read Only Memory), an EPROM (Erasable Programmable Read Only Memory), an EEPROM (Electrically Erasable Programmable Read Only Memory) and a Flash memory. Further, it is expected that one of ordinary skill, notwithstanding possibly significant effort and many design choices motivated by, for example, available time, current technology, and economic considerations, when guided by the concepts and principles disclosed herein will be readily capable of generating such software instructions and programs and ICs with minimal experimentation.


The Abstract of the Disclosure is provided to allow the reader to quickly ascertain the nature of the technical disclosure. It is submitted with the understanding that it will not be used to interpret or limit the scope or meaning of the claims. In addition, in the foregoing Detailed Description, it can be seen that various features are grouped together in various embodiments for the purpose of streamlining the disclosure. This method of disclosure is not to be interpreted as reflecting an intention that the claimed embodiments require more features than are expressly recited in each claim. Rather, as the following claims reflect, inventive subject matter lies in less than all features of a single disclosed embodiment. Thus the following claims are hereby incorporated into the Detailed Description, with each claim standing on its own as a separately claimed subject matter.

Claims
  • 1. A method for localization of a mobile automation apparatus, the method comprising, at a navigational controller: generating a set of candidate poses within an environmental map;updating the set of candidate poses according to motion data corresponding to movement of the mobile automation apparatus;receiving observational data from a field of view collected at an actual pose of the mobile automation apparatus;generating (i) respective weights for the candidate poses, each weight indicating a likelihood that the corresponding candidate pose matches the actual pose, and (ii) a localization confidence level based on the weights; andresponsive to determining whether the localization confidence level exceeds a candidate pose resampling threshold: when the determination is affirmative, (i) increasing the candidate pose resampling threshold and (ii) generating a further set of candidate poses; andwhen the determination is negative, (i) decreasing the candidate pose resampling threshold without generating the further set.
  • 2. The method of claim 1, further comprising: presenting a localization of the mobile automation apparatus based on the localization confidence level.
  • 3. The method of claim 1, further comprising: prior to generating the set of candidate poses, retrieving the map from a memory.
  • 4. The method of claim 1, wherein updating the set of candidate poses according to the motion data comprises: receiving the motion data from a motion sensor of the mobile apparatus; andre-locating each of the candidate poses relative to the map based on the motion data.
  • 5. The method of claim 1, wherein receiving the observational data includes receiving depth scan data captured by a depth sensor of the mobile automation apparatus.
  • 6. The method of claim 1, wherein generating the weights comprises: determining, based on the map, expected observational data; andcomparing the expected observational data to the observational data.
  • 7. The method of claim 1, wherein generating the localization confidence level comprises: selecting a subset of the candidate poses, and generating an average of the weights corresponding to the subset.
  • 8. The method of claim 1, wherein decreasing the candidate pose resampling threshold comprises decreasing the candidate pose resampling threshold by a predetermined step value.
  • 9. The method of claim 1, wherein increasing the candidate pose resampling threshold comprises setting the candidate pose resampling threshold to a value equal to a highest one of the weights.
  • 10. A mobile automation apparatus, comprising a motion sensor;an observational sensor; anda navigational controller connected to the motion sensor and the observational sensor; the navigational controller configured to: generate a set of candidate poses within an environmental map;update the set of candidate poses according to motion data collected via the motion sensor;collect observational data from a field of view corresponding to an actual pose of the mobile automation apparatus via the observational sensor;generate (i) respective weights for the candidate poses, each weight indicating a likelihood that the corresponding candidate pose matches the actual pose, and (ii) a localization confidence level based on the weights; anddetermine whether the localization confidence level exceeds a candidate pose resampling threshold, and responsive to the determination: when the determination is affirmative, (i) increase the candidate pose resampling threshold and (ii) generate a further set of candidate poses; andwhen the determination is negative, (i) decrease the candidate pose resampling threshold without generating the further set.
  • 11. The mobile automation apparatus of claim 10, wherein the navigational controller is further configured to: present a localization of the mobile automation apparatus based on the localization confidence level.
  • 12. The mobile automation apparatus of claim 10, wherein the navigational controller is further configured to: prior to generating the set of candidate poses, retrieve the map from a memory.
  • 13. The mobile automation apparatus of claim 10, wherein the navigational controller is further configured, to update the set of candidate poses according to the motion data, to: receive the motion data from a motion sensor of the mobile apparatus; andre-locate each of the candidate poses relative to the map based on the motion data.
  • 14. The mobile automation apparatus of claim 10, wherein the navigational controller is further configured to receive the observational data as depth scan data.
  • 15. The mobile automation apparatus of claim 10, wherein the navigational controller is further configured, to generate the weights, to: determine, based on the map, expected observational data; andcompare the expected observational data to the observational data.
  • 16. The mobile automation apparatus of claim 10, wherein the navigational controller is further configured, to generate the localization confidence level, to: select a subset of the candidate poses, and generate an average of the weights corresponding to the subset.
  • 17. The mobile automation apparatus of claim 10, wherein the navigational controller is further configured, to decrease the candidate pose resampling threshold, to: decrease the candidate pose resampling threshold by a predetermined step value.
  • 18. The mobile automation apparatus of claim 10, wherein the navigational controller is further configured, to increase the candidate pose resampling threshold, to set the candidate pose resampling threshold to a value equal to a highest one of the weights.
  • 19. The mobile automation apparatus of claim 10, wherein the motion sensor includes an inertial measurement unit; and wherein the observational sensor includes a lidar sensor.
  • 20. A non-transitory computer-readable medium storing a plurality of computer-readable instructions executable by a navigational controller, wherein execution of the computer-readable instructions configures the navigational controller to: generate a set of candidate poses within an environmental map;update the set of candidate poses according to motion data collected via a motion sensor;collect observational data from a field of view corresponding to an actual pose of the mobile automation apparatus via an observational sensor;generate (i) respective weights for the candidate poses, each weight indicating a likelihood that the corresponding candidate pose matches the actual pose, and (ii) a localization confidence level based on the weights; anddetermine whether the localization confidence level exceeds a candidate pose resampling threshold, and responsive to the determination: when the determination is affirmative, (i) increase the candidate pose resampling threshold and (ii) generate a further set of candidate poses; andwhen the determination is negative, (i) decrease the candidate pose resampling threshold without generating the further set.
  • 21. The method of claim 1, wherein when the determination is negative, (i) decreasing the candidate pose resampling threshold without generating the further set and (ii) repeating the updating, the receiving, the generating respective weights and the determining.
US Referenced Citations (439)
Number Name Date Kind
5209712 Ferri May 1993 A
5214615 Bauer May 1993 A
5408322 Hsu et al. Apr 1995 A
5414268 McGee May 1995 A
5534762 Kim Jul 1996 A
5566280 Fukui et al. Oct 1996 A
5953055 Huang et al. Sep 1999 A
5988862 Kacyra et al. Nov 1999 A
6026376 Kenney Feb 2000 A
6034379 Bunte et al. Mar 2000 A
6075905 Herman et al. Jun 2000 A
6115114 Berg et al. Sep 2000 A
6141293 Amorai-Moriya et al. Oct 2000 A
6304855 Burke Oct 2001 B1
6442507 Skidmore et al. Aug 2002 B1
6549825 Kurata Apr 2003 B2
6580441 Schileru-Key Jun 2003 B2
6711293 Lowe Mar 2004 B1
6721723 Gibson et al. Apr 2004 B1
6721769 Rappaport et al. Apr 2004 B1
6836567 Silver et al. Dec 2004 B1
6995762 Pavlidis et al. Feb 2006 B1
7090135 Patel Aug 2006 B2
7137207 Armstrong et al. Nov 2006 B2
7245558 Willins et al. Jul 2007 B2
7248754 Cato Jul 2007 B2
7277187 Smith et al. Oct 2007 B2
7373722 Cooper et al. May 2008 B2
7474389 Greenberg et al. Jan 2009 B2
7487595 Armstrong et al. Feb 2009 B2
7493336 Noonan Feb 2009 B2
7508794 Feather et al. Mar 2009 B2
7527205 Zhu et al. May 2009 B2
7605817 Zhang et al. Oct 2009 B2
7647752 Magnell Jan 2010 B2
7693757 Zimmerman Apr 2010 B2
7726575 Wang et al. Jun 2010 B2
7751928 Antony et al. Jul 2010 B1
7783383 Eliuk et al. Aug 2010 B2
7839531 Sugiyama Nov 2010 B2
7845560 Emanuel et al. Dec 2010 B2
7885865 Benson et al. Feb 2011 B2
7925114 Mai et al. Apr 2011 B2
7957998 Riley et al. Jun 2011 B2
7996179 Lee et al. Aug 2011 B2
8009864 Linaker et al. Aug 2011 B2
8049621 Egan Nov 2011 B1
8091782 Cato et al. Jan 2012 B2
8094902 Crandall et al. Jan 2012 B2
8094937 Teoh et al. Jan 2012 B2
8132728 Dwinell et al. Mar 2012 B2
8134717 Pangrazio et al. Mar 2012 B2
8189855 Opalach et al. May 2012 B2
8199977 Krishnaswamy et al. Jun 2012 B2
8207964 Meadow et al. Jun 2012 B1
8233055 Matsunaga et al. Jul 2012 B2
8260742 Cognigni et al. Sep 2012 B2
8265895 Willins et al. Sep 2012 B2
8277396 Scott et al. Oct 2012 B2
8284988 Sones et al. Oct 2012 B2
8423431 Rouaix et al. Apr 2013 B1
8429004 Hamilton et al. Apr 2013 B2
8463079 Ackley et al. Jun 2013 B2
8479996 Barkan et al. Jul 2013 B2
8520067 Ersue Aug 2013 B2
8542252 Perez et al. Sep 2013 B2
8571314 Tao et al. Oct 2013 B2
8599303 Stettner Dec 2013 B2
8630924 Groenevelt et al. Jan 2014 B2
8660338 Ma et al. Feb 2014 B2
8743176 Stettner et al. Jun 2014 B2
8757479 Clark et al. Jun 2014 B2
8812226 Zeng Aug 2014 B2
8923893 Austin et al. Dec 2014 B2
8939369 Olmstead et al. Jan 2015 B2
8954188 Sullivan et al. Feb 2015 B2
8958911 Wong et al. Feb 2015 B2
8971637 Rivard Mar 2015 B1
8989342 Liesenfelt et al. Mar 2015 B2
9007601 Steffey et al. Apr 2015 B2
9037287 Grauberger et al. May 2015 B1
9064394 Trundle Jun 2015 B1
9070285 Ramu et al. Jun 2015 B1
9072929 Rush et al. Jul 2015 B1
9120622 Elazary et al. Sep 2015 B1
9129277 Macintosh Sep 2015 B2
9135491 Morandi et al. Sep 2015 B2
9159047 Winkel Oct 2015 B2
9171442 Clements Oct 2015 B2
9247211 Zhang et al. Jan 2016 B2
9329269 Zeng May 2016 B2
9349076 Liu et al. May 2016 B1
9367831 Besehanic Jun 2016 B1
9380222 Clayton et al. Jun 2016 B2
9396554 Williams et al. Jul 2016 B2
9400170 Steffey Jul 2016 B2
9424482 Patel et al. Aug 2016 B2
9517767 Kentley et al. Dec 2016 B1
9542746 Wu et al. Jan 2017 B2
9549125 Goyal et al. Jan 2017 B1
9562971 Shenkar et al. Feb 2017 B2
9565400 Curlander et al. Feb 2017 B1
9589353 Mueller-Fischer et al. Mar 2017 B2
9600731 Yasunaga et al. Mar 2017 B2
9600892 Patel et al. Mar 2017 B2
9612123 Levinson et al. Apr 2017 B1
9639935 Douady-Pleven et al. May 2017 B1
9697429 Patel et al. Jul 2017 B2
9766074 Roumeliotis et al. Sep 2017 B2
9778388 Connor Oct 2017 B1
9779205 Namir Oct 2017 B2
9791862 Connor Oct 2017 B1
9805240 Zheng et al. Oct 2017 B1
9811754 Schwartz Nov 2017 B2
9827683 Hance et al. Nov 2017 B1
9880009 Bell Jan 2018 B2
9928708 Lin et al. Mar 2018 B2
9953420 Wolski et al. Apr 2018 B2
9980009 Jiang et al. May 2018 B2
9994339 Colson et al. Jun 2018 B2
9996818 Ren et al. Jun 2018 B1
10019803 Venable et al. Jul 2018 B2
10111646 Nycz et al. Oct 2018 B2
10121072 Kekatpure Nov 2018 B1
10127438 Fisher et al. Nov 2018 B1
10197400 Jesudason et al. Feb 2019 B2
10210603 Venable et al. Feb 2019 B2
10229386 Thomas Mar 2019 B2
10248653 Blassin et al. Apr 2019 B2
10262294 Hahn et al. Apr 2019 B1
10265871 Hance et al. Apr 2019 B2
10289990 Rizzolo et al. May 2019 B2
10336543 Sills et al. Jul 2019 B1
10349031 DeLuca Jul 2019 B2
10352689 Brown et al. Jul 2019 B2
10373116 Medina et al. Aug 2019 B2
10394244 Song et al. Aug 2019 B2
20010031069 Kondo et al. Oct 2001 A1
20010041948 Ross et al. Nov 2001 A1
20020006231 Jayant et al. Jan 2002 A1
20020059202 Hadzikadic et al. May 2002 A1
20020097439 Braica Jul 2002 A1
20020146170 Rom Oct 2002 A1
20020158453 Levine Oct 2002 A1
20020164236 Fukuhara et al. Nov 2002 A1
20030003925 Suzuki Jan 2003 A1
20030094494 Blanford et al. May 2003 A1
20030174891 Wenzel et al. Sep 2003 A1
20040021313 Gardner et al. Feb 2004 A1
20040084527 Bong et al. May 2004 A1
20040131278 imagawa et al. Jul 2004 A1
20040240754 Smith et al. Dec 2004 A1
20050016004 Armstrong et al. Jan 2005 A1
20050114059 Chang et al. May 2005 A1
20050174351 Chang Aug 2005 A1
20050213082 DiBernardo et al. Sep 2005 A1
20050213109 Schell et al. Sep 2005 A1
20060032915 Schwartz Feb 2006 A1
20060045325 Zavadsky et al. Mar 2006 A1
20060106742 Bochicchio et al. May 2006 A1
20060285486 Roberts et al. Dec 2006 A1
20070036398 Chen Feb 2007 A1
20070074410 Armstrong et al. Apr 2007 A1
20070272732 Hindmon Nov 2007 A1
20080002866 Fujiwara Jan 2008 A1
20080025565 Zhang et al. Jan 2008 A1
20080027591 Lenser et al. Jan 2008 A1
20080077511 Zimmerman Mar 2008 A1
20080159634 Sharma et al. Jul 2008 A1
20080164310 Dupuy et al. Jul 2008 A1
20080175513 Lai et al. Jul 2008 A1
20080181529 Michel et al. Jul 2008 A1
20080183730 Enga Jul 2008 A1
20080238919 Pack Oct 2008 A1
20080294487 Nasser Nov 2008 A1
20090009123 Skaff Jan 2009 A1
20090024353 Lee et al. Jan 2009 A1
20090057411 Madej et al. Mar 2009 A1
20090059270 Opalach et al. Mar 2009 A1
20090060349 Linaker et al. Mar 2009 A1
20090063306 Fano et al. Mar 2009 A1
20090063307 Groenovelt et al. Mar 2009 A1
20090074303 Filimonova et al. Mar 2009 A1
20090088975 Sato et al. Apr 2009 A1
20090103773 Wheeler et al. Apr 2009 A1
20090125350 Lessing et al. May 2009 A1
20090125535 Basso et al. May 2009 A1
20090152391 McWhirk Jun 2009 A1
20090160975 Kwan Jun 2009 A1
20090192921 Hicks Jul 2009 A1
20090206161 Olmstead Aug 2009 A1
20090236155 Skaff Sep 2009 A1
20090252437 Li et al. Oct 2009 A1
20090287587 Bloebaum et al. Nov 2009 A1
20090323121 Valkenburg et al. Dec 2009 A1
20100017407 Beniyama et al. Jan 2010 A1
20100026804 Tanizaki et al. Feb 2010 A1
20100070365 Siotia et al. Mar 2010 A1
20100082194 Yabushita et al. Apr 2010 A1
20100091094 Sekowski Apr 2010 A1
20100118116 Tomasz et al. May 2010 A1
20100131234 Stewart et al. May 2010 A1
20100141806 Uemura et al. Jun 2010 A1
20100161569 Schreter Jun 2010 A1
20100171826 Hamilton et al. Jul 2010 A1
20100208039 Setettner Aug 2010 A1
20100214873 Somasundaram et al. Aug 2010 A1
20100235033 Yamamoto et al. Sep 2010 A1
20100241289 Sandberg Sep 2010 A1
20100257149 Cognigni et al. Oct 2010 A1
20100295850 Katz et al. Nov 2010 A1
20100315412 Sinha et al. Dec 2010 A1
20100326939 Clark et al. Dec 2010 A1
20110047636 Stachon et al. Feb 2011 A1
20110052043 Hyung et al. Mar 2011 A1
20110093306 Nielsen et al. Apr 2011 A1
20110137527 Simon et al. Jun 2011 A1
20110168774 Magal Jul 2011 A1
20110172875 Gibbs Jul 2011 A1
20110216063 Hayes Sep 2011 A1
20110242286 Pace et al. Oct 2011 A1
20110246503 Bender et al. Oct 2011 A1
20110254840 Halstead Oct 2011 A1
20110286007 Pangrazio et al. Nov 2011 A1
20110288816 Thierman Nov 2011 A1
20110310088 Adabala et al. Dec 2011 A1
20120017028 Tsirkin Jan 2012 A1
20120019393 Wolinsky et al. Jan 2012 A1
20120022913 VolKmann et al. Jan 2012 A1
20120051730 Cote et al. Mar 2012 A1
20120069051 Hagbi et al. Mar 2012 A1
20120075342 Choubassi et al. Mar 2012 A1
20120133639 Kopf et al. May 2012 A1
20120307108 Forutanpour Jun 2012 A1
20120169530 Padmanabhan et al. Jul 2012 A1
20120179621 Moir et al. Jul 2012 A1
20120185112 Sung et al. Jul 2012 A1
20120194644 Newcombe et al. Aug 2012 A1
20120197464 Wang et al. Aug 2012 A1
20120201466 Funayama et al. Aug 2012 A1
20120209553 Doytchinov et al. Aug 2012 A1
20120236119 Rhee et al. Sep 2012 A1
20120249802 Taylor Oct 2012 A1
20120250978 Taylor Oct 2012 A1
20120269383 Bobbitt et al. Oct 2012 A1
20120287249 Choo et al. Nov 2012 A1
20120323620 Hofman et al. Dec 2012 A1
20130030700 Miller et al. Jan 2013 A1
20130090881 Janardhanan et al. Apr 2013 A1
20130119138 Winkel May 2013 A1
20130132913 Fu et al. May 2013 A1
20130134178 Lu May 2013 A1
20130138246 Gutmann et al. May 2013 A1
20130142421 Silver et al. Jun 2013 A1
20130144565 Miller et al. Jun 2013 A1
20130154802 O'Haire et al. Jun 2013 A1
20130156292 Chang et al. Jun 2013 A1
20130162806 Ding et al. Jun 2013 A1
20130176398 Bonner et al. Jul 2013 A1
20130178227 Vartanian et al. Jul 2013 A1
20130182114 Zhang et al. Jul 2013 A1
20130226344 Wong et al. Aug 2013 A1
20130228620 Ahem et al. Sep 2013 A1
20130232039 Jackson et al. Sep 2013 A1
20130235165 Gharib et al. Sep 2013 A1
20130235206 Smith et al. Sep 2013 A1
20130236089 Litvak et al. Sep 2013 A1
20130278631 Border et al. Oct 2013 A1
20130299306 Jiang et al. Nov 2013 A1
20130299313 Baek, IV et al. Nov 2013 A1
20130300729 Grimaud Nov 2013 A1
20130303193 Dharwada et al. Nov 2013 A1
20130321418 Kirk Dec 2013 A1
20130329013 Metois et al. Dec 2013 A1
20130341400 Lancaster-Larocque Dec 2013 A1
20140002597 Taguchi et al. Jan 2014 A1
20140003655 Gopalkrishnan et al. Jan 2014 A1
20140003727 Lortz et al. Jan 2014 A1
20140006229 Birch et al. Jan 2014 A1
20140016832 Kong et al. Jan 2014 A1
20140019311 Tanaka Jan 2014 A1
20140025201 Ryu et al. Jan 2014 A1
20140028837 Gao et al. Jan 2014 A1
20140047342 Breternitz et al. Feb 2014 A1
20140049616 Stettner Feb 2014 A1
20140052555 MacIntosh Feb 2014 A1
20140086483 Zhang et al. Mar 2014 A1
20140098094 Neumann et al. Apr 2014 A1
20140100813 Shaowering Apr 2014 A1
20140104413 McCloskey et al. Apr 2014 A1
20140129027 Schnittman May 2014 A1
20140156133 Cullinane et al. Jun 2014 A1
20140161359 Magri et al. Jun 2014 A1
20140192050 Qiu et al. Jul 2014 A1
20140195374 Bassemir et al. Jul 2014 A1
20140214547 Signorelli et al. Jul 2014 A1
20140214600 Argue et al. Jul 2014 A1
20140267614 Ding et al. Sep 2014 A1
20140267688 Aich et al. Sep 2014 A1
20140277691 Jacobus et al. Sep 2014 A1
20140277692 Buzan et al. Sep 2014 A1
20140279294 Field-Darragh et al. Sep 2014 A1
20140300637 Fan et al. Oct 2014 A1
20140316875 Tkachenko et al. Oct 2014 A1
20140330835 Boyer Nov 2014 A1
20140344401 Varney et al. Nov 2014 A1
20140351073 Murphy et al. Nov 2014 A1
20140369607 Patel et al. Dec 2014 A1
20150015602 Beaudoin Jan 2015 A1
20150019391 Kumar et al. Jan 2015 A1
20150029339 Kobres et al. Jan 2015 A1
20150032304 Nakamura et al. Jan 2015 A1
20150039458 Reid Feb 2015 A1
20150088618 Basir et al. Mar 2015 A1
20150088701 Desmarais et al. Mar 2015 A1
20150088703 Yan Mar 2015 A1
20150092066 Geiss et al. Apr 2015 A1
20150106403 Haverinen et al. Apr 2015 A1
20150117788 Patel et al. Apr 2015 A1
20150139010 Jeong et al. May 2015 A1
20150154467 Feng et al. Jun 2015 A1
20150161793 Takahashi Jun 2015 A1
20150170256 Pettyjohn et al. Jun 2015 A1
20150181198 Baele et al. Jun 2015 A1
20150212521 Pack et al. Jul 2015 A1
20150235157 Avegliano et al. Aug 2015 A1
20150245358 Schmidt Aug 2015 A1
20150262116 Katircioglu et al. Sep 2015 A1
20150279035 Wolski et al. Oct 2015 A1
20150298317 Wang et al. Oct 2015 A1
20150310601 Rodriguez et al. Oct 2015 A1
20150332368 Vartiainen et al. Nov 2015 A1
20150352721 Wicks et al. Dec 2015 A1
20150363625 Wu et al. Dec 2015 A1
20150363758 Wu et al. Dec 2015 A1
20150365660 Wu et al. Dec 2015 A1
20150379704 Chandrasekar et al. Dec 2015 A1
20160026253 Bradski et al. Jan 2016 A1
20160044862 Kocer Feb 2016 A1
20160061591 Pangrazio et al. Mar 2016 A1
20160070981 Sasaki et al. Mar 2016 A1
20160092943 Vigier et al. Mar 2016 A1
20160012588 Taguchi et al. Apr 2016 A1
20160104041 bowers et al. Apr 2016 A1
20160107690 Oyama et al. Apr 2016 A1
20160112628 Super et al. Apr 2016 A1
20160114488 Mascorro Medina et al. Apr 2016 A1
20160129592 Saboo et al. May 2016 A1
20160132815 Itoko et al. May 2016 A1
20160150217 Popov May 2016 A1
20160156898 Ren et al. Jun 2016 A1
20160163067 Williams et al. Jun 2016 A1
20160171336 Schwartz Jun 2016 A1
20160171429 Schwartz Jun 2016 A1
20160171707 Schwartz Jun 2016 A1
20160185347 Lefevre et al. Jun 2016 A1
20160191759 Somanath et al. Jun 2016 A1
20160224927 Pettersson Aug 2016 A1
20160253735 Scudillo et al. Sep 2016 A1
20160253844 Petrovskaya Sep 2016 A1
20160260054 High et al. Sep 2016 A1
20160271795 Vicenti Sep 2016 A1
20160313133 Zeng et al. Oct 2016 A1
20160328618 Patel et al. Nov 2016 A1
20160328767 Bonner et al. Nov 2016 A1
20160353099 Thomson et al. Dec 2016 A1
20160364634 Davis et al. Dec 2016 A1
20170004649 Collet Romea et al. Jan 2017 A1
20170011281 Dijkman et al. Jan 2017 A1
20170011308 Sun et al. Jan 2017 A1
20170032311 Rizzolo et al. Feb 2017 A1
20170041553 Cao et al. Feb 2017 A1
20170054965 Raab et al. Feb 2017 A1
20170066459 Singh Mar 2017 A1
20170074659 Giurgiu et al. Mar 2017 A1
20170109940 Guo et al. Apr 2017 A1
20170147966 Aversa et al. May 2017 A1
20170150129 Pangrazio May 2017 A1
20170178060 Schwartz Jun 2017 A1
20170193434 Shah et al. Jul 2017 A1
20170219338 Brown et al. Aug 2017 A1
20170219353 Alesiani Aug 2017 A1
20170227645 Swope et al. Aug 2017 A1
20170227647 Baik Aug 2017 A1
20170228885 Baumgartner Aug 2017 A1
20170261993 Venable et al. Sep 2017 A1
20170262724 Wu et al. Sep 2017 A1
20170280125 Brown et al. Sep 2017 A1
20170286773 Skaff et al. Oct 2017 A1
20170286901 Skaff et al. Oct 2017 A1
20170323253 Enssle et al. Nov 2017 A1
20170323376 Glaser et al. Nov 2017 A1
20170337508 Bogolea et al. Nov 2017 A1
20180001481 Shah et al. Jan 2018 A1
20180005035 Bogolea et al. Jan 2018 A1
20180005176 Williams et al. Jan 2018 A1
20180020145 Kotfis et al. Jan 2018 A1
20180051991 Hong Feb 2018 A1
20180053091 Savvides et al. Feb 2018 A1
20180053305 Gu et al. Feb 2018 A1
20180075403 Mascorro Medina et al. Mar 2018 A1
20180089613 Chen et al. Mar 2018 A1
20180101813 Paat et al. Apr 2018 A1
20180108134 Venable et al. Apr 2018 A1
20180114183 Howell Apr 2018 A1
20180130011 Jacobsson May 2018 A1
20180143003 Clayton et al. May 2018 A1
20180174325 Fu et al. Jun 2018 A1
20180201423 Drzewiecki et al. Jul 2018 A1
20180204111 Zadeh et al. Jul 2018 A1
20180251253 Taira et al. Sep 2018 A1
20180276596 Murthy et al. Sep 2018 A1
20180281191 Sinyayskiy et al. Oct 2018 A1
20180293442 Fridental et al. Oct 2018 A1
20180306958 Goss et al. Oct 2018 A1
20180313956 Rzeszutek et al. Nov 2018 A1
20180314260 Jen et al. Nov 2018 A1
20180314908 Lam Nov 2018 A1
20180315007 Kingsford et al. Nov 2018 A1
20180315065 Zhang et al. Nov 2018 A1
20180315173 Phan et al. Nov 2018 A1
20180315865 Haist et al. Nov 2018 A1
20180370727 Hance et al. Dec 2018 A1
20190057588 Savvides et al. Feb 2019 A1
20190065861 Savvides et al. Feb 2019 A1
20190073554 Rzeszutek Mar 2019 A1
20190073559 Rzeszutek et al. Mar 2019 A1
20190073627 Nakdimon et al. Mar 2019 A1
20190077015 Shibasaki et al. Mar 2019 A1
20190087663 Yamazaki et al. Mar 2019 A1
20190094876 Moore et al. Mar 2019 A1
20190108606 Komiyama Apr 2019 A1
20190178436 Mao et al. Jun 2019 A1
20190180150 Taylor et al. Jun 2019 A1
20190197728 Yamao Jun 2019 A1
20190236530 Cantrell et al. Aug 2019 A1
20190304132 Yoda et al. Oct 2019 A1
20190392212 Sawhney Dec 2019 A1
20200314333 Liang et al. Oct 2020 A1
Foreign Referenced Citations (37)
Number Date Country
2835830 Nov 2012 CA
3028156 Jan 2018 CA
104200086 Dec 2014 CN
107067382 Aug 2017 CN
766098 Apr 1997 EP
1311993 May 2007 EP
2309378 Apr 2011 EP
2439487 Apr 2012 EP
2472475 Jul 2012 EP
2562688 Feb 2013 EP
2662831 Nov 2013 EP
2693362 Feb 2014 EP
2323238 Sep 1998 GB
2330265 Apr 1999 GB
2014170431 Sep 2014 JP
101234798 Jan 2009 KR
1020190031431 Mar 2019 KR
WO 9923600 May 1999 WO
WO 2003002935 Jan 2003 WO
WO 2003025805 Mar 2003 WO
WO 2006136958 Dec 2006 WO
WO 2007042251 Apr 2007 WO
WO 2008057504 May 2008 WO
WO 2008154611 Dec 2008 WO
WO 2012103199 Aug 2012 WO
WO 2012103202 Aug 2012 WO
WO 2012154801 Nov 2012 WO
WO 2013165674 Nov 2013 WO
WO 2014066422 May 2014 WO
WO 2014092552 Jun 2014 WO
WO 2014181323 Nov 2014 WO
WO 2015127503 Sep 2015 WO
WO 2016020038 Feb 2016 WO
WO 2018018007 Jan 2018 WO
WO 2018204308 Nov 2018 WO
WO 2018204342 Nov 2018 WO
WO 2019023249 Jan 2019 WO
Non-Patent Literature Citations (93)
Entry
“Fair Billing with Automatic Dimensioning” pp. 1-4, undated, Copyright Mettler-Toledo International Inc.
“Plane Detection in Point Cloud Data” dated Jan. 25, 2010 by Michael Ying Yang and Wolfgang Forstner, Technical Report 1, 2010, University of Bonn.
“Swift Dimension” Trademark Omniplanar, Copyright 2014.
Ajmal S. Mian et al., “Three-Dimensional Model Based Object Recognition and Segmentation in Cluttered Scenes”, IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 28, No. 10, Oct. 2006.
Batalin et al., “Mobile robot navigation using a sensor network,” IEEE, International Conference on robotics and automation, Apr. 26, May 1, 2004, pp. 636-641.
Bazazian et al., “Fast and Robust Edge Extraction in Unorganized Point clouds,” IEEE, 2015 International Conference on Digital Image Computing: Techniques and Applicatoins (DICTA), Nov. 23-25, 2015, pp. 1-8.
Biswas et al. “Depth Camera Based Indoor Mobile Robot Localization and Navigation” Robotics and Automation (ICRA), 2012 IEEE International Conference on IEEE, 2012.
Bohm, Multi-Image Fusion for Occlusion-Free Façade Texturing, International Archives of the Photogrammetry, Remote Sensing and Spatial Information Sciences, pp. 867-872 (Jan. 2004).
Bristow et al., “A Survey of Iterative Learning Control”, IEEE Control Systems, Jun. 2006, pp. 96-114.
Buenaposada et al. “Realtime tracking and estimation of plane pose” Proceedings of the ICPR (Aug. 2002) vol. II, IEEE pp. 697-700.
Carreira et al., “Enhanced PCA-based localization using depth maps with missing data,” IEEE, pp. 1-8, Apr. 24, 2013.
Chen et al. “Improving Octree-Based Occupancy Maps Using Environment Sparsity with Application to Aerial Robot Navigation” Robotics and Automation (ICRA), 2017 IEEE.
Cleveland Jonas et al: “Automated System for Semantic Object Labeling with Soft-Object Recognition and Dynamic Programming Segmentation”, IEEE Transactions on Automation Science and Engineering, IEEE Service Center, New York, NY (Apr. 1, 2017).
Cook et al., “Distributed Ray Tracing” ACM SIGGRAPH Computer Graphics, vol. 18, No. 3, ACM pp. 137-145, 1984.
Datta, A., et al. “Accurate camera calibration using iterative refinement of control points,” in Computer Vision Workshops (ICCV Workshops), 2009.
Deschaud, et al., “A Fast and Accurate Place Detection algoritm for large noisy point clouds using filtered normals and voxel growing,” 3DPVT, May 2010, Paris, France. [hal-01097361].
Douillard, Bertrand, et al. “On the segmentation of 3D LIDAR point clouds.” Robotics and Automation (ICRA), 2011 IEEE International Conference on IEEE, 2011.
Dubois, M., et al., A comparison of geometric and energy-based point cloud semantic segmentation methods, European Conference on Mobile Robots (ECMR), pp. 88-93, 25-27, Sep. 2013.
Duda, et al., “Use of the Hough Transformation to Detect Lines and Curves in Pictures”, Stanford Research Institute, Menlo Park, California, Graphics and Image Processing, Communications of the ACM, vol. 15, No. 1 (Jan. 1972).
F.C.A. Groen et al., “The smallest box around a package,” Pattern Recognition, vol. 14, No. 1-6, Jan. 1, 1981, pp. 173-176, XP055237156, GB, ISSN: 0031-3203, DOI: 10.1016/0031-3203(81(90059-5 p. 176-p. 178.
Federico Tombari et al. “Multimodal cue integration through Hypotheses Verification for RGB-D object recognition and 6DOF pose estimation”, IEEE International Conference on Robotics and Automation, Jan. 2013.
Flores, et al., “Removing Pedestrians from Google Street View Images”, Computer Vision and Pattern Recognition Workshops, 2010 IEEE Computer Society Conference On, IEE, Piscataway, NJ, pp. 53-58 (Jun. 13, 2010).
Glassner, “Space Subdivision for Fast Ray Tracing.” IEEE Computer Graphics and Applications, 4.10, pp. 15-24, 1984.
Golovinskiy, Aleksey, et al. “Min-Cut based segmentation of point clouds.” Computer Vision Workshops (ICCV Workshops), 2009 IEEE 12th International Conference on. IEEE, 2009.
Hackel et al., “Contour Detection in unstructured 3D point clouds,” IEEE, 2016 Conference on Computer vision and Pattern recognition (CVPR), Jun. 27-30, 2016, pgs. 19.
Hao et al., “Structure-based object detection from scene point clouds,” Science Direct, v191, pp. 148-160 (2016).
Hu et al., “An improved method of discrete point cloud filtering based on complex environment,” International Journal of Applied Mathematics and Statistics, v48, i18 (2013).
International Search Report and Written Opinion for corresponding International Patent Application No. PCT/US2016/064110 dated Mar. 20, 2017.
International Search Report and Written Opinion for corresponding International Patent Application No. PCT/US2017/024847 dated Jul. 7, 2017.
International Search Report and Written Opinion for International Application No. PCT/US2019/025859 dated Jul. 3, 2019.
International Search Report and Written Opinion for International Application No. PCT/US2018/030419 dated Aug. 31, 2018.
International Search Report and Written Opinion from International Patent Application No. PCT/US2018/030345 dated Sep. 17, 2018.
International Search Report and Written Opinion from International Patent Application No. PCT/US2018/030360 dated Jul. 9, 2018.
International Search Report and Written Opinion from International Patent Application No. PCT/US2018/030363 dated Jul. 9, 2018.
International Search Report and Written Opinion from International Patent Application No. PCT/US2019/025849 dated Jul. 9, 2019.
International Search Report and Written Opinion from International Patent Application No. PCT/US2019/064020 dated Feb. 19, 2020.
International Search Report and Written Opinion for International Patent Application No. PCT/US2013/053212 dated Dec. 1, 2014.
International Search Report and Written Opinion for International Patent Application No. PCT/US2013/070996 dated Apr. 2, 2014.
International Search Report and Written Opinion for International Patent Application No. PCT/US2020/028133 dated Jul. 24, 2020.
International Search Report and Written Opinion from International Patent Application No. PCT/US2020/029134 dated Jul. 27, 2020.
International Search Report and Written Opinion from International Patent Application No. PCT/US2020/028183 dated Jul. 24, 2020.
International Search Report and Written Opinion from International Patent Application No. PCT/US2020/035285 dated Aug. 27, 2020.
Jadhav et al. “Survey on Spatial Domain dynamic template matching technique for scanning linear barcode,” International Journal of science and research v 5 n 3, Mar. 2016)(Year: 2016).
Jian Fan et al: “Shelf detection via vanishing point and radial projection”, 2014 IEEE International Conference on image processing (ICIP), IEEE, (Oct. 27, 2014), pp. 1575-1578.
Kang et al., “Kinematic Path-Tracking of Mobile Robot Using Iterative learning Control”, Journal of Robotic Systems, 2005, pp. 111-121.
Kay et al. “Ray Tracing Complex Scenes.” ACM SIGGRAPH Computer Graphics, vol. 20, No. 4, ACM, pp. 269-278, 1986.
Kelly et al., “Reactive Nonholonomic Trajectory Generation via Parametric Optimal Control”, International Journal of Robotics Research, vol. 22, No. 7-8, pp. 583-601 (Jul. 30, 2013).
Lari, Z., et al., “An adaptive approach for segmentation of 3D laser point cloud.” International Archives of the Photogrammertry, Remote sensing and spatial information Sciences, vol. XXXVIII-5/W12, 2011, ISPRS Calgary 2011 Workshop, Aug. 29-31, 2011, Calgary, Canada.
Lecking et al: “Localization in a wide range of industrial environments using relative 3D ceiling features”, IEEE, pp. 333-337 (Sep. 15, 2008).
Lee et al. “Statistically Optimized Sampling for Distributed Ray Tracing.” ACM SIGGRAPH Computer Graphics, vol. 19, No. 3, ACM, pp. 61-67, 1985.
Li et al., “An improved RANSAC for 3D Point cloud plane segmentation based on normal distribution transformation cells,” Remote sensing, V9: 433, pp. 1-16 (2017).
Likhachev, Maxim, and Dave Ferguson. “Planning Long dynamically feasible maneuvers for autonomous vehicles.” The international journal of Robotics Reasearch 28.8 (2009): 933-945. (Year:2009).
Marder-Eppstein et al., “The Office Marathon: robust navigation in an indoor office environment,” IEEE, 2010 International conference on robotics and automation, May 3-7, 2010, pp. 300-307.
McNaughton, Matthew, et al. “Motion planning for autonomous driving with a conformal spatiotemporal lattice.” Robotics and Automation (ICRA), 2011 IEEE International Conference on. IEEE, 2011. (Year: 2011).
Mitra et al., “Estimating surface normals in noisy point cloud data,” International Journal of Computational geometry & applications, Jun. 8-10, 2003, pp. 322-328.
N.D.F. Campbell et al. “Automatic 3D Object Segmentation in Multiple Views using Volumetric Graph-Cuts”, Journal of Image and Vision Computing, vol. 28, Issue 1, Jan. 2010, pp. 14-25.
Ni et al., “Edge Detection and Feature Line Tracing in 3D-Point Clouds by Analyzing Geometric Properties of Neighborhoods,” Remote Sensing, V8 I9, pp. 1-20 (2016).
Norriof et al., “Experimental comparison of some classical iterative learning control algorithms”, IEEE Transactions on Robotics and Automation, Jun. 2002, pp. 636-641.
Notice of allowance for U.S. Appl. No. 13/568,175 dated Sep. 23, 2014.
Notice of allowance for U.S. Appl. No. 13/693,503 dated Mar. 11, 2016.
Notice of allowance for U.S. Appl. No. 14/068,495 dated Apr. 25, 2016.
Notice of allowance for U.S. Appl. No. 14/518,091 dated Apr. 12, 2017.
Notice of allowance for U.S. Appl. No. 15/211,103 dated Apr. 5, 2017.
Olson, Clark F., etal. “Wide-Baseline Stereo Vision for terrain Mapping” in Machine Vision and Applications, Aug. 2010.
Oriolo et al., “An iterative learning controller for nonholonomic mobile Robots”, the international Journal of Robotics Research, Aug. 1997, pp. 954-970.
Ostafew et al., “Visual Teach and Repeat, Repeat, Repeat: Iterative learning control to improve mobile robot path tracking in challenging outdoor environment”, IEEE/RSJ International Conference on Intelligent robots and Systems, Nov. 2013, p. 176-.
Park et al., “Autonomous mobile robot navigation using passive rfid in indoor environment,” IEEE, Transactions on industrial electronics, vol. 56, issue 7, pp. 2366-2373 (Jul. 2009).
Perveen et al. (An overview of template matching methodologies and its application, International Journal of Research in Computer and Communication Technology, v2n10, Oct. 2013) (Year: 2013).
Pivtoraiko et al., “Differentially constrained mobile robot motion planning in state lattices”, journal of field robotics, vol. 26, No. 3, 2009, pp. 308-333.
Pratt W K Ed: “Digital Image processing, 10-image enhancement, 17-image segmentation”, Jan. 1, 2001, Digital Image Processing: PIKS Inside, New York: John Wily & Sons, US, pp. 243-258, 551.
Puwein, J., et al.“Robust Multi-view camera calibration for wide-baseline camera networks,”in IEEE Workshop on Applications of computer vision (WACV), Jan. 2011.
Rusu, et al. “How to incrementally register pairs of clouds,” PCL Library, retrieved from internet on Aug. 22, 2016 [http://pointclouds.org/documentation/tutorials/pairwise_incremental_registration.php.
Rusu, et al. “Spatial Change detection on unorganized point cloud data,” PCL Library, retrieved from internet on Aug. 19, 2016 [http://pointclouds.org/documentation/tutorials/octree_change.php].
Schnabel et al. “Efficient RANSAC for Point-Cloud Shape Detection”, vol. 0, No. 0, pp. 1-12 (1981).
Senthilkumaran, et al., “Edge Detection Techniques for Image Segmentation—A Survey of Soft Computing Approaches”, International Journal of Recent Trends in Engineering, vol. 1, No. 2 (May 2009).
Szeliski, “Modified Hough Transform”, Computer Vision. Copyright 2011, pp. 251-254. Retrieved on Aug. 17, 2017 [http://szeliski.org/book/drafts/SzeliskiBook_20100903_draft.pdf].
Tahir, Rabbani, et al., “Segmentation of point clouds using smoothness constraint,” International Archives of Photogrammetry, Remote Sensing and Spatial Information Sciences 36.5 (Sep. 2006): 248-253.
Trevor et al., “Tables, Counters, and Shelves: Semantic Mapping of Surfaces in 3D,” Retrieved from Internet Jul. 3, 2018 @ http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.703.5365&rep=rep1&type=p.
Tseng, et al., “A Cloud Removal Approach for Aerial Image Visualization”, International Journal of Innovative Computing, Information & Control, vol. 9, No. 6, pp. 2421-2440 (Jun. 2013).
Uchiyama, et al., “Removal of Moving Objects from a Street-View Image by Fusing Multiple Image Sequences”, Pattern Recognition, 2010, 20th International Conference On, IEEE, Piscataway, NJ pp. 3456-3459 (Aug. 23, 2010).
United Kingdom Intellectual Property Office, “Combined Search and Examination Report” for GB Patent Application No. 1813580.6 dated Feb. 21, 2019.
United Kingdom Intellectual Property Office, Combined Search and Examination Report dated Jan. 22, 2016 for GB Patent Application No. 1417218.3.
United Kingdom Intellectual Property Office, Combined Search and Examination Report dated Jan. 22, 2016 for GB Patent Application No. 1521272.3.
United Kingdom Intellectual Property Office, Combined Search and Examination Report dated Mar. 11, 2015 for GB Patent Application No. 1417218.3.
United Kingdom Intellectual Property Office, Combined Search and Examination Report dated May 13, 2020 for GB Patent Application No. 1917864.9.
Varol Gul et al: “Product placement detection based on image processing”, 2014 22nd Signal Processing and Communication Applications Conference (SIU), IEEE, Apr. 23, 2014.
Varol Gul et al: “Toward Retail product recognition on Grocery shelves”, Visual Communications and image processing; Jan. 20, 2004; San Jose, (Mar. 4, 2015).
Weber et al., “Methods for Feature Detection in Point clouds,” visualization of large and unstructured data sets—IRTG Workshop, pp. 90-99 (2010).
Zhao Zhou et al.: “An Image contrast Enhancement Algorithm Using PLIP-based histogram Modification”, 2017 3rd IEEE International Conference on Cybernetics (CYBCON), IEEE, (Jun. 21, 2017).
Ziang Xie et al., “Multimodal Blending for High-Accuracy Instance Recognition”, 2013 IEEE RSJ International Conference on Intelligent Robots and Systems, pp. 2214-2221.
Fan Zhang et al., “Parallax-tolerant Image Stitching”, 2014 Computer Vision Foundation, pp. 4321-4328.
Kaimo Lin et al., “Seagull: Seam-guided Local Alignment for Parallax-tolerant Image Stitching”, Retrieved on Nov. 16, 2020 [http://publish.illinois.edu/visual-modeling-and-analytics/files/2016/08/Seagull.pdf].
Julio Zaragoza et al., “As-Projective-As-Possible Image Stitching with Moving DLT”, 2013 Computer Vision Foundation, pp. 2339-2346.
Related Publications (1)
Number Date Country
20200182622 A1 Jun 2020 US