Patent Grant
10352953
This application claims priority to EP 15168780.3, filed May 22, 2015, which is hereby incorporated by reference.
The present disclosure relates to a method of operating a laboratory sample distribution system, a laboratory sample distribution system, and a laboratory automation system.
Laboratory sample distribution systems can be used in order to distribute samples between pluralities of laboratory stations in a laboratory automation system. For example, a two-dimensional laboratory sample distribution system providing high throughput is known. Electro-magnetic actuators are disposed below a transport plane in order to drive sample container carriers carrying sample containers on the transport plane.
There is a need for a method of operating a laboratory sample distribution system, a laboratory sample distribution system and a laboratory automation system enabling an efficient and reliable distribution of samples between different laboratory stations.
According to the present disclosure, a method and a laboratory sample distribution system are presented. The laboratory sample distribution system can comprise a plurality of sample container carriers. The sample container carriers can be adapted to carry one or more sample containers. The sample containers can comprise samples to be analyzed by a plurality of laboratory stations. The system can further comprise a transport plane. The transport plane can be adapted to support the sample container carriers. The transport plane can comprise a plurality of transfer locations. The transfer locations can be assigned to corresponding laboratory stations. The system can also comprise a drive. The drive can be adapted to move the sample container carriers on the transport plane. The system can also comprise a control unit. The control unit can be adapted to pre-calculate routes depending on the transfer locations during an initialization of the laboratory sample distribution system and to control the drive such that the sample container carriers can move along the pre-calculated routes after the initialization of the laboratory sample distribution system.
Accordingly, it is a feature of the embodiments of the present disclosure to provide for a method of operating a laboratory sample distribution system, a laboratory sample distribution system and a laboratory automation system enabling an efficient and reliable distribution of samples between different laboratory stations. Other features of the embodiments of the present disclosure will be apparent in light of the description of the disclosure embodied herein.
The following detailed description of specific embodiments of the present disclosure can be best understood when read in conjunction with the following drawings, where like structure is indicated with like reference numerals and in which:
In the following detailed description of the embodiments, reference is made to the accompanying drawings that form a part hereof, and in which are shown by way of illustration, and not by way of limitation, specific embodiments in which the disclosure may be practiced. It is to be understood that other embodiments may be utilized and that logical, mechanical and electrical changes may be made without departing from the spirit and scope of the present disclosure.
The method can be adapted to operate a laboratory sample distribution system. The laboratory sample distribution system can comprises a number (e.g., 10 to 10000) of sample container carriers. The sample container carriers can be respectively adapted to carry one or more sample containers. The sample containers can respectively comprise samples to be analyzed by a plurality (e.g., 2 to 50) of laboratory stations.
The laboratory sample distribution system can further comprise a, substantially planar, transport plane. The transport plane can be adapted to support the sample container carriers, i.e. the sample container carriers can be placed on top of the transport plane and can be moved on top of and over the transport plane.
The transport plane can comprise a plurality (e.g., 2 to 100) of transfer locations, or nodes. The transfer locations, or nodes, can be assigned to corresponding laboratory stations. For example, each laboratory station may have a single corresponding transfer location, or node. Alternatively, more than one transfer location, or node, may be assigned to a corresponding laboratory station. The transfer locations, or nodes, may be statically, or dynamically, assigned to the laboratory stations. In other words, during operation, the transfer locations may be changed, if necessary.
The laboratory sample distribution system can further comprise a drive. The drive can be adapted to move the sample container carriers on and over the transport plane.
The operating method can comprise, during an initialization (i.e., starting and/or booting) of the laboratory sample distribution system e.g., fixed routes extending over the transport plane can be pre-calculated depending on, e.g., between, the different transfer locations. In other words, the pre-calculated routes can be provided on the transport plane between the transfer locations. The transfer locations may represent initial, or goal, nodes in the sense of Graph theory.
After the initialization of the laboratory sample distribution system during a normal operational mode, the drive can be controlled such that the sample container carriers can move along the pre-calculated routes over the transport plane, if and when the sample container carriers are to be distributed between the different laboratory stations. In other words, after the initialization of the laboratory sample distribution system during a normal operational mode, the drive can be controlled such that the sample container carriers can repeatedly move, for example, only, along the pre-calculated fixed routes over the transport plane, if and when the sample container carriers are to be distributed between the different laboratory stations. The term “fixed” can denote that the routes can be statically calculated (i.e. not recalculated) and that the calculated routes can be used by several sample container carriers and may not be calculated for each sample container carrier individually. Self-evidently, in specific use scenarios, the sample container carriers may move apart from the pre-calculated routes, e.g., in case the sample container carriers have to be removed from the transport plane and/or in error conditions. Further, empty sample container carriers may move along different routes and/or apart from the pre-calculated routes.
The routes can be calculated using an informed search algorithm such as, for example, an A*-algorithm or a D*-algorithm. The A*-algorithm is an algorithm that can be used in path finding and graph traversal to efficiently calculate a traversable path between different nodes, e.g., in the form of the transfer locations. The A*-algorithm uses a best-first search and can find a least-cost path from a given initial node to one goal node (out of one or more possible goals). As the A*-algorithm traverses the graph, it can follow a path of the lowest expected total cost or distance, keeping a sorted priority queue of alternate path segments along the way. The D*-algorithm is a refined A*-algorithm.
The routes can be calculated such that a number of intersections between different routes can be minimized.
During the initialization of the laboratory sample distribution system, respective buffer areas located on the transport plane can be logically allocated to the laboratory stations. Samples waiting to be analyzed by the laboratory stations can be buffered in the buffer areas. For example, each laboratory station may have a single corresponding buffer area on the transport plane. Alternatively, more than one buffer area may be assigned to a corresponding laboratory station on the transport plane. The buffer areas can be allocated such that the pre-calculated routes do not intersect the buffer areas.
The sample container carriers can be entered into the buffer areas or can be removed from the buffer areas exclusively over (passing) the transfer locations, i.e., the transfer locations can serve as a gate (entrance/exit) to the buffer areas.
The transport plane can be segmented into logical fields, e.g., square shaped logical fields of substantially identical size and outline. The logical fields can be arranged in a chess board manner. In a time-prioritized reservation scheme, an adjustable number (e.g., 1 to 100) of logical fields positioned on or lying on a pre-calculated route can respectively be reserved for sample container carriers to be moved. In other words, the logical fields can be reserved in a first come, first serve manner for each sample container carrier to be moved. The logical fields can typically be reserved before starting a movement of a sample container carrier. Nevertheless, the logical fields can be reserved during a movement of a sample container carrier, if the sample container carrier has not yet reached the logical fields to be reserved. A sample container carrier moving on a route comprising logical fields being reserved for another sample container carrier with a higher time priority, i.e., the logical fields have been reserved for the other sample container carrier prior to the reservation for the moving sample container, can be stopped before the reserved field or may not be started. The reserved fields can be released when the sample container carrier has passed the reserved field(s).
After the initialization of the laboratory sample distribution system, operating data of the laboratory sample distribution system can be collected and stored. During a next initialization of the laboratory sample distribution system, the routes can be pre-calculated depending on the transfer locations and depending on the operating data.
The operating data can comprise information regarding a volume of traffic on the routes. The information regarding the volume of traffic can comprise information of the number of sample container carriers being moved on the route per time unit (e.g., per minute/hour/day etc.). A time profile of the volume of traffic over the operating time may be determined.
The step of pre-calculating the routes can comprise that a number of lanes assigned to the routes can be determined depending on the volume of traffic. For example, in case of low volume of traffic, a single lane may be assigned to a route. In case of increasing volume of traffic, two or more lanes may be assigned to the route. The routes can be, in one embodiment, one-way lanes.
Samples, and/or sample containers, and/or the sample container carriers can be transferred to/from the laboratory stations using the transfer locations. For example, a pick-and-place device can pick a sample container comprised in a sample container carrier located at one of the transfer locations and can transfer the sample container to the laboratory station. Accordingly, a sample container can be transferred from one of the laboratory stations to an empty sample container carrier located on the transfer location.
During the initialization of the laboratory sample distribution system, the routes can be pre-calculated between the transfer locations, i.e., the end points, or end nodes, of the routes can be formed by the transfer locations. If, for example, a first, a second, and a third transfer location are given, a route between the first and the second transfer location, a route between the first and the third transfer location, and a route between the second and the third transfer location can be pre-calculated.
The laboratory sample distribution system can be adapted to perform the method as described above.
The laboratory sample distribution system can comprise a plurality of sample container carriers. The sample container carriers can be adapted to carry one or more sample containers. The sample containers can comprise samples to be analyzed by a plurality of laboratory stations. The system can also comprise a transport plane. The transport plane can be adapted to support the sample container carriers. The transport plane can comprise a plurality of transfer locations The transfer locations can be assigned to corresponding laboratory stations. The system can also comprise a drive. The drive can be adapted to move the sample container carriers on the transport plane. The system can also comprise a control unit such as, for example, in the form of a microprocessor and program storage. The control unit can be adapted to control the laboratory sample distribution system such that the method as described above can be performed. The control unit can be adapted to pre-calculate routes depending on the transfer locations during an initialization of the laboratory sample distribution system and to control the drive such that the sample container carriers can move along the pre-calculated routes after the initialization of the laboratory sample distribution system.
The sample container carriers can comprise at least one magnetically active device such as, for example, at least one permanent magnet. The drive can comprise a plurality of electro-magnetic actuators being stationary arranged in rows and columns below the transport plane. The electro-magnetic actuators can be adapted to apply a magnetic force to the sample container carriers. The control unit can be adapted to activate the electromagnetic actuators such that the sample container carriers can move simultaneously and independently from one another along the pre-calculated routes. The electro-magnetic actuators may define corresponding nodes of a graph in the sense of Graph Theory. A node may be defined or located on the transport plane above the corresponding electro-magnetic actuator. The transfer locations may be formed above a corresponding electro-magnetic actuator. The so defined grid-shaped graph may be used by an informed search algorithm such as, for example, an A*-algorithm or a D*-algorithm, to calculate a traversable path from initial node, or an initial transfer, location to a goal node, or a goal transfer location.
The laboratory automation system comprises a plurality (e.g., 2 to 50) of laboratory stations such as, for example, pre-analytical, analytical and/or post-analytical stations, and a laboratory sample distribution system as described above.
Pre-analytical stations may be adapted to perform any kind of pre-processing of samples, sample containers and/or sample container carriers. Analytical stations may be adapted to use a sample or part of the sample and a reagent to generate a measuring signal, the measuring signal indicating if and in which concentration, if any, an analyte exists. Post-analytical stations may be adapted to perform any kind of post-processing of samples, sample containers and/or sample container carriers.
The pre-analytical, analytical and/or post-analytical stations may comprise at least one of a decapping station, a recapping station, a centrifugation station, an archiving station, a pipetting station, a sorting station, a tube type identification station, and a sample quality determining station.
The pre-calculated routes can be visualized on the transport plane, such that an operator can control the pre-calculated routes and, if necessary, manually adjust the pre-calculated routes. In order to visualize the pre-calculated routes visualizing means e.g., in the form of light emitting devices such as LEDs can be arranged below the transport plane. The transport plane can be at least partially translucent. For example, for each electro-magnetic actuator, a corresponding LED may be provided placed adjacent to the electro-magnetic actuator. The visualizing means may further be used to visualize the operating state of the corresponding electro-magnetic actuator and may, for example, indicate if the corresponding electro-magnetic actuator is defective. Additionally, if the transport plane is segmented into a number of separate modules, defective modules may be signalized by the visualizing means located inside the defective module.
Referring initially to
The laboratory sample distribution system 100 can comprises a plurality of sample container carriers 140. For the sake of explanation, only a single sample container carrier 140 is depicted. Self-evidently, the laboratory sample distribution system 100 can comprise a plurality of sample container carriers 140, e.g., 50 to 500 sample container carriers 140. The sample container carriers 140 can respectively comprise a magnetically active device 141 in the form of a permanent magnet.
The sample container carriers 140 can be adapted to carry one or more sample containers 145. The sample containers 145 can comprise samples to be analyzed by the laboratory stations 20, 21, 22.
The laboratory sample distribution system 100 can further comprises a transport plane 110. The transport plane 110 can be adapted to support or carry the sample container carriers 140.
Positions sensors 130, e.g., in form of Hall sensors, can be distributed over the transport plane 110, such that a location of a respective sample container carrier 140 can be detected.
Referring to
Referring to
The laboratory sample distribution system 100 can further comprise a control unit 150. The control unit 150 can, inter alia, control the electro-magnetic actuators 120 such that the sample container carriers 140 may move simultaneously and independently from one another over the transport plane 110.
The method of operation of the laboratory sample distribution system 100 will be described with respect to
After the initialization of the laboratory sample distribution system 100, the control unit 150 can control the electro-magnetic actuators 120 such that the sample container carriers 140 can move along the pre-calculated routes 40, 41, 42, if the sample container carriers 140 have to be distributed between the laboratory stations 20, 21, 22.
The routes 40, 41, 42 can be calculated using an A*-algorithm. The routes 40, 41, 42 can be, inter alia, calculated such that a number of intersections between different routes 40, 41, 42 can be minimized. In the embodiment depicted, no intersections occur.
Referring to
In a time-prioritized reservation scheme, a plurality of, for example 10, logical fields 111 lying on the routes 40′ and 41′ can be reserved for sample container carriers to be moved on the routes 40′ and 41′. In other words, the logical fields 111 can be reserved in a first come, first serve manner for each sample container 140 carrier to be moved.
Given that for a sample container carrier to be moved on route 40′ the logical fields 111 on the route 40′ have been reserved before the logical fields 111 on the route 41′ have been reserved for another sample container carrier to be moved on route 41′, the sample container carrier moving on route 41′ can stop before reaching the field in the intersection of the routes 40′ and 41′, thus avoiding a potential collision. The reserved fields 111 can be released when the sample container carriers have passed the reserved fields 111.
After the initialization of the laboratory sample distribution system 100, operating data of the laboratory sample distribution system 100 can be collected. The operating data can comprise information regarding a volume of traffic on the routes 40, 41, 42. During a next initialization of the laboratory sample distribution system 100, the routes 40, 41, 42 can be pre-calculated additionally depending on the volume of traffic. For example, a number of lanes assigned to the routes 40, 41, 42 can be determined depending on the volume of traffic. As depicted in
It is noted that terms like “preferably,” “commonly,” and “typically” are not utilized herein to limit the scope of the claimed embodiments or to imply that certain features are critical, essential, or even important to the structure or function of the claimed embodiments. Rather, these terms are merely intended to highlight alternative or additional features that may or may not be utilized in a particular embodiment of the present disclosure.
For the purposes of describing and defining the present disclosure, it is noted that the term “substantially” is utilized herein to represent the inherent degree of uncertainty that may be attributed to any quantitative comparison, value, measurement, or other representation. The term “substantially” is also utilized herein to represent the degree by which a quantitative representation may vary from a stated reference without resulting in a change in the basic function of the subject matter at issue.
Having described the present disclosure in detail and by reference to specific embodiments thereof, it will be apparent that modifications and variations are possible without departing from the scope of the disclosure defined in the appended claims. More specifically, although some aspects of the present disclosure are identified herein as preferred or particularly advantageous, it is contemplated that the present disclosure is not necessarily limited to these preferred aspects of the disclosure.
| Number | Date | Country | Kind |
|---|---|---|---|
| 15168780 | May 2015 | EP | regional |
| Number | Name | Date | Kind |
|---|---|---|---|
| 3273727 | Rogers et al. | Sep 1966 | A |
| 3653485 | Donlon | Apr 1972 | A |
| 3901656 | Durkos et al. | Aug 1975 | A |
| 4150666 | Brush | Apr 1979 | A |
| 4395164 | Beltrop | Jul 1983 | A |
| 4544068 | Cohen | Oct 1985 | A |
| 4771237 | Daley | Sep 1988 | A |
| 5120506 | Saito et al. | Jun 1992 | A |
| 5295570 | Grechsch et al. | Mar 1994 | A |
| 5309049 | Kawada et al. | May 1994 | A |
| 5457368 | Jacobsen et al. | Oct 1995 | A |
| 5523131 | Isaacs et al. | Jun 1996 | A |
| 5530345 | Murari et al. | Jun 1996 | A |
| 5636548 | Dunn et al. | Jun 1997 | A |
| 5641054 | Mori et al. | Jun 1997 | A |
| 5651941 | Stark et al. | Jul 1997 | A |
| 5720377 | Lapeus et al. | Feb 1998 | A |
| 5735387 | Polaniec et al. | Apr 1998 | A |
| 5788929 | Nesti | Aug 1998 | A |
| 6045319 | Uchida et al. | Apr 2000 | A |
| 6062398 | Talmayr | May 2000 | A |
| 6141602 | Igarashi et al. | Oct 2000 | A |
| 6151535 | Ehlers | Nov 2000 | A |
| 6184596 | Ohzeki | Feb 2001 | B1 |
| 6191507 | Peltier et al. | Feb 2001 | B1 |
| 6206176 | Blonigan et al. | Mar 2001 | B1 |
| 6255614 | Yamakawa et al. | Jul 2001 | B1 |
| 6260360 | Wheeler | Jul 2001 | B1 |
| 6279728 | Jung et al. | Aug 2001 | B1 |
| 6293750 | Cohen et al. | Sep 2001 | B1 |
| 6429016 | McNeil | Aug 2002 | B1 |
| 6444171 | Sakazume et al. | Sep 2002 | B1 |
| 6571934 | Thompson et al. | Jun 2003 | B1 |
| 7028831 | Veiner | Apr 2006 | B2 |
| 7078082 | Adams | Jul 2006 | B2 |
| 7122158 | Itoh | Oct 2006 | B2 |
| 7278532 | Martin | Oct 2007 | B2 |
| 7326565 | Yokoi et al. | Feb 2008 | B2 |
| 7425305 | Itoh | Sep 2008 | B2 |
| 7428957 | Schaefer | Sep 2008 | B2 |
| 7578383 | Itoh | Aug 2009 | B2 |
| 7597187 | Bausenwein et al. | Oct 2009 | B2 |
| 7850914 | Veiner et al. | Dec 2010 | B2 |
| 7858033 | Itoh | Dec 2010 | B2 |
| 7875254 | Garton | Jan 2011 | B2 |
| 7939484 | Loeffler et al. | May 2011 | B1 |
| 8240460 | Bleau et al. | Aug 2012 | B1 |
| 8281888 | Bergmann | Oct 2012 | B2 |
| 8502422 | Lykkegaard | Aug 2013 | B2 |
| 8796186 | Shirazi | Aug 2014 | B2 |
| 8833544 | Stoeckle et al. | Sep 2014 | B2 |
| 9211543 | Ohga et al. | Dec 2015 | B2 |
| 9239335 | Heise | Jan 2016 | B2 |
| 20020009391 | Marquiss et al. | Jan 2002 | A1 |
| 20030092185 | Qureshi et al. | May 2003 | A1 |
| 20040050836 | Nesbitt et al. | Mar 2004 | A1 |
| 20040084531 | Itoh | May 2004 | A1 |
| 20050061622 | Martin | Mar 2005 | A1 |
| 20050109580 | Thompson | May 2005 | A1 |
| 20050194333 | Veiner et al. | Sep 2005 | A1 |
| 20050196320 | Veiner et al. | Sep 2005 | A1 |
| 20050226770 | Allen et al. | Oct 2005 | A1 |
| 20050242963 | Oldham et al. | Nov 2005 | A1 |
| 20050247790 | Itoh | Nov 2005 | A1 |
| 20050260101 | Nauck et al. | Nov 2005 | A1 |
| 20050271555 | Itoh | Dec 2005 | A1 |
| 20060000296 | Salter | Jan 2006 | A1 |
| 20060047303 | Ortiz et al. | Mar 2006 | A1 |
| 20060219524 | Kelly et al. | Oct 2006 | A1 |
| 20070116611 | DeMarco | May 2007 | A1 |
| 20070210090 | Sixt et al. | Sep 2007 | A1 |
| 20070248496 | Bondioli et al. | Oct 2007 | A1 |
| 20070276558 | Kim | Nov 2007 | A1 |
| 20080012511 | Ono | Jan 2008 | A1 |
| 20080029368 | Komori | Feb 2008 | A1 |
| 20080056328 | Rund et al. | Mar 2008 | A1 |
| 20080131961 | Crees et al. | Jun 2008 | A1 |
| 20080286162 | Onizawa et al. | Nov 2008 | A1 |
| 20090004732 | LaBarre et al. | Jan 2009 | A1 |
| 20090022625 | Lee et al. | Jan 2009 | A1 |
| 20090081771 | Breidford et al. | Mar 2009 | A1 |
| 20090128139 | Drenth | May 2009 | A1 |
| 20090142844 | LeComte | Jun 2009 | A1 |
| 20090180931 | Silbert et al. | Jul 2009 | A1 |
| 20090322486 | Gerstel | Dec 2009 | A1 |
| 20100000250 | Sixt | Jan 2010 | A1 |
| 20100152895 | Dai | Jun 2010 | A1 |
| 20100175943 | Bergmann | Jul 2010 | A1 |
| 20100186618 | King et al. | Jul 2010 | A1 |
| 20100255529 | Cocola et al. | Oct 2010 | A1 |
| 20100300831 | Pedrazzini | Dec 2010 | A1 |
| 20100312379 | Pedrazzini | Dec 2010 | A1 |
| 20110050213 | Furukawa | Mar 2011 | A1 |
| 20110124038 | Bishop et al. | May 2011 | A1 |
| 20110172128 | Davies et al. | Jul 2011 | A1 |
| 20110186406 | Kraus | Aug 2011 | A1 |
| 20110287447 | Norderhaug | Nov 2011 | A1 |
| 20120037696 | Lavi | Feb 2012 | A1 |
| 20120129673 | Fukugaki et al. | May 2012 | A1 |
| 20120178170 | Van Praet | Jul 2012 | A1 |
| 20120211645 | Tullo et al. | Aug 2012 | A1 |
| 20120275885 | Furrer et al. | Nov 2012 | A1 |
| 20120282683 | Mototsu | Nov 2012 | A1 |
| 20120295358 | Ariff et al. | Nov 2012 | A1 |
| 20120310401 | Shah | Dec 2012 | A1 |
| 20130034410 | Heise et al. | Feb 2013 | A1 |
| 20130126302 | Johns et al. | May 2013 | A1 |
| 20130153677 | Leen et al. | Jun 2013 | A1 |
| 20130180824 | Kleinikkink et al. | Jul 2013 | A1 |
| 20130263622 | Mullen et al. | Oct 2013 | A1 |
| 20130322992 | Pedrazzini | Dec 2013 | A1 |
| 20140170023 | Saito et al. | Jun 2014 | A1 |
| 20140202829 | Eberhardt | Jul 2014 | A1 |
| 20140231217 | Denninger et al. | Aug 2014 | A1 |
| 20140234065 | Heise et al. | Aug 2014 | A1 |
| 20140234949 | Wasson et al. | Aug 2014 | A1 |
| 20150014125 | Hecht | Jan 2015 | A1 |
| 20150166265 | Pollack et al. | Jun 2015 | A1 |
| 20150233956 | Buehr | Aug 2015 | A1 |
| 20150233957 | Riether | Aug 2015 | A1 |
| 20150241457 | Miller | Aug 2015 | A1 |
| 20150273468 | Croquette et al. | Oct 2015 | A1 |
| 20150273691 | Pollack | Oct 2015 | A1 |
| 20150276775 | Mellars et al. | Oct 2015 | A1 |
| 20150276776 | Riether | Oct 2015 | A1 |
| 20150276777 | Riether | Oct 2015 | A1 |
| 20150276778 | Riether | Oct 2015 | A1 |
| 20150276781 | Riether | Oct 2015 | A1 |
| 20150276782 | Riether | Oct 2015 | A1 |
| 20150360876 | Sinz | Dec 2015 | A1 |
| 20150360878 | Denninger et al. | Dec 2015 | A1 |
| 20160003859 | Wenczel et al. | Jan 2016 | A1 |
| 20160025756 | Pollack et al. | Jan 2016 | A1 |
| 20160054341 | Edelmann | Feb 2016 | A1 |
| 20160054344 | Heise et al. | Feb 2016 | A1 |
| 20160069715 | Sinz | Mar 2016 | A1 |
| 20160077120 | Riether | Mar 2016 | A1 |
| 20160097786 | Malinkowski et al. | Apr 2016 | A1 |
| 20160229565 | Margner | Aug 2016 | A1 |
| 20160274137 | Baer | Sep 2016 | A1 |
| 20160282378 | Malinowski et al. | Sep 2016 | A1 |
| 20160341750 | Sinz et al. | Nov 2016 | A1 |
| 20170059599 | Riether | Mar 2017 | A1 |
| 20170096307 | Mahmudimanesh et al. | Apr 2017 | A1 |
| 20170097372 | Heise et al. | Apr 2017 | A1 |
| 20170101277 | Malinowski | Apr 2017 | A1 |
| 20170108522 | Baer | Apr 2017 | A1 |
| 20170131307 | Pedain | May 2017 | A1 |
| 20170131309 | Pedain | May 2017 | A1 |
| 20170131310 | Volz et al. | May 2017 | A1 |
| 20170138971 | Heise et al. | May 2017 | A1 |
| 20170160299 | Schneider et al. | Jun 2017 | A1 |
| 20170168079 | Sinz | Jun 2017 | A1 |
| 20170174448 | Sinz | Jun 2017 | A1 |
| 20170184622 | Sinz et al. | Jun 2017 | A1 |
| 20170248623 | Kaeppeli et al. | Aug 2017 | A1 |
| 20170248624 | Kaeppeli et al. | Aug 2017 | A1 |
| 20170363608 | Sinz | Dec 2017 | A1 |
| 20180067141 | Mahmudimanesh et al. | Mar 2018 | A1 |
| 20180074087 | Heise et al. | Mar 2018 | A1 |
| 20180106821 | Vollenweider et al. | Apr 2018 | A1 |
| 20180128848 | Schneider et al. | May 2018 | A1 |
| 20180156835 | Hassan | Jun 2018 | A1 |
| 20180188280 | Malinowski | Jul 2018 | A1 |
| 20180210000 | van Mierlo | Jul 2018 | A1 |
| 20180210001 | Reza | Jul 2018 | A1 |
| 20180217174 | Malinowski | Aug 2018 | A1 |
| 20180217176 | Sinz et al. | Aug 2018 | A1 |
| 20180224476 | Birrer et al. | Aug 2018 | A1 |
| 20180348244 | Ren | Dec 2018 | A1 |
| 20180348245 | Schneider et al. | Dec 2018 | A1 |
| 20190018027 | Hoehnel | Jan 2019 | A1 |
| 20190076845 | Huber et al. | Mar 2019 | A1 |
| 20190076846 | Durco et al. | Mar 2019 | A1 |
| 20190086433 | Hermann et al. | Mar 2019 | A1 |
| 20190094251 | Malinowski | Mar 2019 | A1 |
| 20190094252 | Waser et al. | Mar 2019 | A1 |
| 20190101468 | Haldar | Apr 2019 | A1 |
| Number | Date | Country |
|---|---|---|
| 201045617 | Apr 2008 | CN |
| 102109530 | Jun 2011 | CN |
| 3909786 | Sep 1990 | DE |
| 102012000665 | Aug 2012 | DE |
| 102011090044 | Jul 2013 | DE |
| 0601213 | Oct 1992 | EP |
| 0775650 | May 1997 | EP |
| 0896936 | Feb 1999 | EP |
| 0916406 | May 1999 | EP |
| 1122194 | Aug 2001 | EP |
| 1524525 | Apr 2005 | EP |
| 2119643 | Nov 2009 | EP |
| 2148117 | Jan 2010 | EP |
| 2327646 | Jun 2011 | EP |
| 2447701 | May 2012 | EP |
| 2500871 | Sep 2012 | EP |
| 2502675 | Sep 2012 | EP |
| 2887071 | Jun 2015 | EP |
| 2165515 | Apr 1986 | GB |
| S56-147209 | Nov 1981 | JP |
| 60-223481 | Nov 1985 | JP |
| 61-081323 | Apr 1986 | JP |
| S61-069604 | Apr 1986 | JP |
| S61-094925 | May 1986 | JP |
| S61-174031 | Aug 1986 | JP |
| S61-217434 | Sep 1986 | JP |
| S62-100161 | May 1987 | JP |
| S63-31918 | Feb 1988 | JP |
| S63-48169 | Feb 1988 | JP |
| S63-82433 | May 1988 | JP |
| S63-290101 | Nov 1988 | JP |
| 01-148966 | Jun 1989 | JP |
| H01-266860 | Oct 1989 | JP |
| H02-87903 | Mar 1990 | JP |
| 03-192013 | Aug 1991 | JP |
| H03-38704 | Aug 1991 | JP |
| H04-127063 | Apr 1992 | JP |
| H05-69350 | Mar 1993 | JP |
| H05-142232 | Jun 1993 | JP |
| H05-180847 | Jul 1993 | JP |
| 06-268808 | Apr 1994 | JP |
| H06-148198 | May 1994 | JP |
| 06-156730 | Jun 1994 | JP |
| 06-211306 | Aug 1994 | JP |
| 07-228345 | Aug 1995 | JP |
| 07-236838 | Sep 1995 | JP |
| H07-301637 | Nov 1995 | JP |
| H09-17848 | Jan 1997 | JP |
| H11-083865 | Mar 1999 | JP |
| H11-264828 | Sep 1999 | JP |
| H11-304812 | Nov 1999 | JP |
| H11-326336 | Nov 1999 | JP |
| 2000-105243 | Apr 2000 | JP |
| 2000-105246 | Apr 2000 | JP |
| 3112393 | Sep 2000 | JP |
| 2001-124786 | May 2001 | JP |
| 2001-240245 | Sep 2001 | JP |
| 2005-001055 | Jan 2005 | JP |
| 2005-249740 | Sep 2005 | JP |
| 2006-106008 | Apr 2006 | JP |
| 2007-309675 | Nov 2007 | JP |
| 2007-314262 | Dec 2007 | JP |
| 2007-315835 | Dec 2007 | JP |
| 2007-322289 | Dec 2007 | JP |
| 2009-036643 | Feb 2009 | JP |
| 2009-062188 | Mar 2009 | JP |
| 2009-145188 | Jul 2009 | JP |
| 2009-300402 | Dec 2009 | JP |
| 2010-243310 | Oct 2010 | JP |
| 2013-172009 | Sep 2013 | JP |
| 2013-190400 | Sep 2013 | JP |
| 685591 | Sep 1979 | SU |
| 1996036437 | Nov 1996 | WO |
| 2003042048 | May 2003 | WO |
| 2007024540 | Mar 2007 | WO |
| 2008133708 | Nov 2008 | WO |
| 2009002358 | Dec 2008 | WO |
| 2010042722 | Apr 2010 | WO |
| 2012170636 | Jul 2010 | WO |
| 2010087303 | Aug 2010 | WO |
| 2010129715 | Nov 2010 | WO |
| 2011138448 | Nov 2011 | WO |
| 2012158520 | Nov 2012 | WO |
| 2012158541 | Nov 2012 | WO |
| 2013064656 | May 2013 | WO |
| 2013099647 | Jul 2013 | WO |
| 2013152089 | Oct 2013 | WO |
| 2013169778 | Nov 2013 | WO |
| 2013177163 | Nov 2013 | WO |
| 2014050821 | Apr 2014 | WO |
| 2014059134 | Apr 2014 | WO |
| 2014071214 | May 2014 | WO |
| Entry |
|---|
| Hart, Peter E., Nils J. Nilsson and Bertram Raphael, “A Formal Basis for the Heuristic Determination of Minimum Cost Paths,” IEEE Transactions of Systems Science and Cybernetics, vol. SSC-4, No. 2. Jul. 1968: pp. 100-107. |
| Russell Stuart and Peter Norvig, Artificial Intelligence: A Modern Approach. Pearson Education, 2011, 3rd Edition. |
| Stentz, Anthony, “Optimal and Efficient Path Planning for Partially-Known Environments,” IEEE International Conference on Robotics and Automation, May 1994. |
| Number | Date | Country | |
|---|---|---|---|
| 20160341751 A1 | Nov 2016 | US |
