An apparatus and method relocating a robot. The apparatus may include a particle generating unit, a first distance obtaining unit, a second distance obtaining unit, and a position estimating unit. A plurality of particles may be generated on a map, a first distance may be obtained according to respective distances between each particle of the plurality of particles and a wireless communication apparatus, based on a position of the wireless communication apparatus and respective positions of each particle on the map, a second distance may be obtained according to respective determined distances between the wireless communication apparatus and the robot, based on a strength measure of the electromagnetic signal received by the robot from the wireless communication apparatus or based on an arrival time or time of flight of the electromagnetic signal, and a position of the robot may be estimated by comparing the first distance and the second distance.
|
12. A method of relocating a robot, the method comprising:
generating a plurality of particles and arranging the plurality of particles on a map;
obtaining a first distance according to respective distances between each particle of the plurality of particles and a wireless communication apparatus performing wireless communication with the robot, the respective distances being based on a position of the wireless communication apparatus and respective positions of each particle on the map;
obtaining a second distance according to a determined distance between the wireless communication apparatus and the robot, the determined distance being based on a strength measure of an electromagnetic signal received from the wireless communication apparatus or based on an arrival time or time of flight of the electromagnetic signal; and
estimating a position of the robot by use of the first distance and the second distance.
1. An apparatus for relocating a robot, the apparatus comprising:
a particle generating unit configured to generate a plurality of particles and arrange the plurality of particles on a map;
a first distance obtaining unit configured to obtain a first distance according to respective distances between each particle of the plurality of particles and a wireless communication apparatus performing wireless communication with the robot, the respective distances being based on a position of the wireless communication apparatus and respective positions of each particle on the map;
a second distance obtaining unit configured to obtain a second distance according to a determined distance between the wireless communication apparatus and the robot, the determined distance being based on a strength measure of an electromagnetic signal received by the robot from the wireless communication apparatus or based on an arrival time or time of flight of the electromagnetic signal; and
a position estimating unit configured to estimate a position of the robot by use of the first distance and the second distance.
2. The apparatus of
3. The apparatus of
wherein the first distance obtaining unit selectively generates one of the respective straight paths to be a detour path, including at least two straight paths detouring around an obstacle between the wireless communication apparatus and a corresponding particle and which extend along open spaces between the wireless communication apparatus and the corresponding particle.
4. The apparatus of
5. The apparatus of
6. The apparatus of
7. The apparatus of
8. The apparatus of
9. The apparatus of
10. The apparatus of
11. The apparatus of
13. The method of
14. The method of
wherein one of the respective straight paths is selectively made to be a detour path, including at least two straight paths detouring around an obstacle between the wireless communication apparatus and a corresponding particle and which extend along open spaces between the wireless communication apparatus and the corresponding particle.
15. The method of
16. The method of
18. The method of
19. The method of
20. The method of
21. The method of
|
This application claims the benefit under 35 U.S.C. §119(a) of Korean Patent Application No. 10-2010-0107819, filed on Nov. 1, 2010, the disclosure of which is incorporated by reference in its entirety for all purposes.
1. Field
One or more embodiments relate to a mobile device with a relocation technique capability, and method for the same, for estimating a position of the mobile device.
2. Description of the Related Art
The term “robot” has been generally applied to an autonomous figure having a human form which is equipped with a machine to operate body parts including mechanical limbs to perform functions in a humanlike manner. However, nowadays, even though the term of ‘robot’ can refer to a machine that may not resemble human beings in appearance, some robots may still be able to autonomously perform tasks.
For example, a mobile robot may be desirable for performing tasks in harsh environments or dangerous areas, replacing humans. In addition, a domestic mobile robot, such as a cleaning robot, which autonomously moves within a home is becoming increasingly common for helping housework.
In order for a mobile robot to autonomously perform a task while moving, it is desirable for the mobile robot to determine the location of the mobile robot. In a complex indoor environment, the mobile robot may build a map of a surrounding environment while estimating its position by use of various types of sensors. However, even when a map is available, there may be the occasion where the mobile robot slips, is moved to an unknown location, or the mobile robot is moved to a predetermined position where the robot loses information about its original position. Accordingly, there is a need for a relocation capability for mobile robots to reacquire or relocate their current positions.
According to one or more embodiments, there is provided an apparatus for relocating a robot, the apparatus including a particle generating unit configured to generate a plurality of particles and arrange the plurality of particles on a map, a first distance obtaining unit configured to obtain a first distance according to respective distances between each particle of the plurality of particles and a wireless communication apparatus performing wireless communication with the robot, the respective distances being based on a position of the wireless communication apparatus and respective positions of each particle on the map, a second distance obtaining unit configured to obtain a second distance according to a determined distance between the wireless communication apparatus and the robot, the determined distance being based on a strength measure of an electromagnetic signal received by the robot from the wireless communication apparatus or based on an arrival time or time of flight of the electromagnetic signal, and a position estimating unit configured to estimate a position of the robot by use of the first distance and the second distance.
According to one or more embodiments, there is provided a method of relocating a robot, the method including generating a plurality of particles and arranging the plurality of particles on a map, obtaining a first distance according to respective distances between each particle of the plurality of particles and a wireless communication apparatus performing wireless communication with the robot, the respective distances being based on a position of the wireless communication apparatus and respective positions of each particle on the map, obtaining a second distance according to a determined distance between the wireless communication apparatus and the robot, the determined distance being based on a strength measure of an electromagnetic signal received from the wireless communication apparatus or based on an arrival time or time of flight of the electromagnetic signal, and estimating a position of the robot by use of the first distance and the second distance.
Additional aspects and/or advantages of one or more embodiments will be set forth in part in the description which follows and, in part, will be apparent from the description, or may be learned by practice of one or more embodiments of disclosure. One or more embodiments are inclusive of such additional aspects.
These and/or other aspects will become apparent and more readily appreciated from the following description of embodiments, taken in conjunction with the accompanying drawings of which:
Reference will now be made in detail to one or more embodiments, illustrated in the accompanying drawings, wherein like reference numerals refer to like elements throughout. In this regard, embodiments of the present invention may be embodied in many different forms and should not be construed as being limited to embodiments set forth herein. Accordingly, embodiments are merely described below, by referring to the figures, to explain aspects of the present invention.
As shown in
The map storage unit 101 may store map information about a work space, e.g., about the space surrounding the robot or in surroundings where the robot is expected to be present and perform tasks. The map information stored in the map storage unit 101 may be a grid map, for example, and may be obtained or generated by dividing a work space of the robot into a plurality of same sized lattices or cells, as only examples, and representing the presence of an object in each lattice or cell in the grid map.
The map building unit 102 may build map information, which may be stored in the map storage unit 101. In addition, the map building unit 102 may update the map information stored in the map storage unit 101. For example, the map building unit 102 may build a map through a Simultaneous Localization And Mapping (SLAM) technique while calculating the current position of a robot based on the built map.
The movement control unit 103 may control the movement or operation of the robot 100 such that the robot 100 performs a predetermined task in the work space, for example, or control the movement of the robot 100 to move the robot to a predetermined position on a map stored in the map storage unit 101, as only examples. In an embodiment, the movement control unit 103 may control the driving unit to drive the moving unit, for moving the robot to the predetermined position.
The relocation unit 104 may estimate the position of the robot 100 when the robot 100 has been moved to the predetermined position where current location information is lost, slips, or is moved to an unknown location, as only examples. For example, the map building unit 102 of the robot 100 estimates the position of the robot 100, while building a map, when the map building unit 102 loses map information which has been obtained up to a present time. Accordingly, the position of the robot 100 needs to be newly estimated. As described above, when the robot 100 loses the current location information, the relocation unit 104 may rapidly estimate the position of the robot 100.
The transmission/reception unit 105 performs wireless communication with a wireless communication apparatus 106 installed within the work space, separate from the robot 100. As only an example, the transmission/reception unit 105 may perform wireless communication with the wireless communication apparatus 106 using one or more electromagnetic signals, such as optical signals, radio frequency (RF) signals, infrared ray (IR) signals, ultrasonic signals, etc. For example, the wireless communication apparatus 106 may be implemented using an access point (AP) or a bluetooth module that performs wireless communication through optical signals, radio frequency signals, infrared ray signals, or ultrasonic signals, noting that alternative electromagnetic signals are available. One or more of the wireless communication apparatuses 106 may have a fixed location, or a dynamic location.
As shown in
The hatched portions of the grid map 200 represent wall surfaces, e.g., of the work space, or object(s) within the work space, and the inner non-hatched portions of the grid map 200 represent open spaces, e.g., which potentially may be indicative of being traversable by the robot. As illustrated in
The grid map 200 of
As shown in
The particle generating unit 301 may generate a plurality of particles to respectively overlay, or to be respectively added to, differing positions on the map. As noted below,
Accordingly,
In an embodiment, each particle may be a position candidate of the robot 100, generated on the grid map 200 using a coordinate system of the grid map 200, thereby having its own coordinates.
In an embodiment, the particle generating unit 301 generates particles such that the particles are uniformly distributed over the entire area of the map 200, noting that alternatives are available. For example, the particle generating unit 301 may generate particles such that the particles are concentrated on a select region(s) of the map that is expected to represent a location of the robot 100. Further, the particle generating unit 301 may generate particles such that the particles are distributed in only one or more predetermined regions of the map, e.g., less than all inner non-hatched cells of grid map 200.
Referring again to
As an example, the first distance obtaining unit 302 may obtain the first distance by calculating a length of a straight path between the wireless communication apparatus 106 and each particle. The straight path may be modified to include a detour around an obstacle between the wireless communication apparatus 106 and a corresponding particle, and may extend along open spaces between the wireless communication apparatus 106 and the corresponding particle.
As another example, the first distance obtaining unit 302 may obtain the first distance by calculating the length of a shortest signal transmission path of the corresponding electromagnetic signals from the wireless communication apparatus 106 to each particle.
As shown in
The first distance between the wireless device #1 (201-1) and the particle 210 corresponds to the length of a straight line connecting the wireless device #1 (201-1) to the particle 210 on the grid map 200. For example, the first distance between the wireless device #1 (201-1) and the particle 210 is shown as being the length of the straight line L1.
The first distance between the wireless device #1 (201-1) and the particle 220 corresponds to the length of a shortest signal transmission path of an electromagnetic signal when the electromagnetic signal is transmitted from the wireless device #1 (201-1) to the particle 220. For example, the first distance between the wireless device #1 (201-1) and the particle 220 is a summation of the length of the illustrated straight line L3 and the length of the illustrated straight line L4.
In this example, when a path including the straight line L3 and the straight line L4 is referred to as a detour path, the first distance obtaining unit 302 may identify the detour path as follows.
In an embodiment, the first distance obtaining unit 302 searches for a straight line L2 connecting the wireless device #1 (201-1) and the particle 220. The first distance obtaining unit 302 determines whether the straight line L2 passes through an obstacle. If an obstacle, such as a wall, exists along the straight line L2, the first distance obtaining unit 302 searches for open spaces around the obstacle and searches for at least one straight line, for example, the line L3 and the line L4 that connect the wireless device #1 (201-1) to the particle 220 through the open spaces.
In
When a line connects a particle P to a wireless communication apparatus AP, and if the line does not pass through an obstacle, the first distance corresponds to the length of the line. However, if the line connecting the particle P to the wireless communication apparatus AP passes through an obstacle, a detour path making a detour around the obstacle is searched for and the first distance is obtained by use of the length of the detour path.
In order to identify a detour path, a first distance obtaining unit, such as the first distance obtaining unit 302 in
In
In addition, in
If the pixel Pi and the pixel GF are identified, a line diF connecting the pixel Pi to the pixel GF is generated. Unless the line diF passes through an obstacle, the first distance may be obtained as the length of the detour path corresponding to the summation of a line P-Pi between the particle P and the pixel Pi, the line diF, and a line AP-GF between the wireless communication apparatus AP and the pixel GF.
As shown in
Referring again to
As an example, if the electromagnetic signal is implemented using radio frequency (RF) or infrared (IR) electromagnetic signals, the strength of the electromagnetic signal is in inverse proportion to the propagation distance of the electromagnetic signal. Accordingly, in an embodiment, the second distance obtaining unit 303 measures the strength of the electromagnetic signal received in the transmission/reception unit 105 of the robot 100, and thereby obtain the second distance between the wireless communication apparatus 106 and the robot 100.
As another example, the second distance may be obtained by multiplying a determined arrival time or time-of-flight (TOF), of the electromagnetic signal, e.g., detected by the robot 100 and/or the wireless communication apparatus 106, by the speed of light when an ultra-wide band (UWB) or Chirp Spread Spectrum (CSS) scheme is implemented, as only examples. Thus, in one or more embodiments, if the electromagnetic signal is implemented as ultrasonic signals, the second distance may be obtained by multiplying the arrival time or TOF time of an ultrasonic wave by the speed of ultrasonic wave.
The electromagnetic signal may reach the robot 100 through reflection and diffraction of the electromagnetic signal. Accordingly, the second distance may correspond to the length of the shortest signal transmission path of an electromagnetic signal when the electromagnetic signal transmits from the wireless communication apparatus 106 to the robot 100. For example, the second distance may not represent the physical distance between an object A and an object B, but rather may represent the length of the transmission path of an electromagnetic signal when the electromagnetic signal transmits from the object A to the object B.
In addition, in
For example, the position estimating unit 304 may assign weights to each particle, update the weights based on the difference between a respectively determined first distance and a respectively determined second distance, and estimate that the position of the robot 100 is the position of the particle having the largest weight. In detail, the updating of one or more weights for each particle may be achieved by use of a Gaussian likelihood function according to the below Equation 1, for example.
Wt=Wt-1+k*exp(−|r−z|2/2σ2) Equation 1
Here, w is a weight, t is a time step, r is a first distance, z is a second distance, and k and a are parameters affecting the shape of a likelihood function. Parameters k and/or a may be fixed or dynamic. If a plurality of wireless communication apparatuses 106 are provided, a single weight of a particular particle may be updated in consideration of the number of the wireless communication apparatuses 106, e.g., the single weight may be updated based on an identified first distance and second distance for each wireless communication apparatus 106.
As shown in
After the generating of the particles, first distances between one or more particles and one or more wireless communication apparatuses may be obtained, e.g., using the map 200, in operation 702. As only an example, a first distance may be obtained by a first distance obtaining unit, such as the first distance obtaining unit 302 of
After the obtaining of the first distance, as only an example, a second distance between the robot and one or more wireless communication apparatuses may be obtained by use of a strength measure of an electromagnetic signal of the wireless communication apparatus or based on the arrival time or time of flight (TOF) of the electromagnetic signal, in operation 703. As only an example, the second distance obtaining unit 303 of
After the obtaining of the first distance and the second distance, one or more first distances may be compared with one or more second distance to estimate the position of the robot, in operation 704. As only an example, the position estimating unit 304 of
As at least described above, when a robot is moved to a new position, if the new position of the robot is included within an area where an electromagnetic ranging is achievable through a wireless communication apparatus, the robot may be relocated anywhere in the area and the new location of the robot may be estimated. In addition, since the robot is able to distinguish different rooms from each other, e.g., if the robot is a cleaning robot, the work efficiency of cleaning rooms is enhanced. In addition, relocation system, apparatus, and method embodiments, as supported herein, may be applied in a space specified service based on a user position in an indoor environment, again noting that alternatives are also available.
In one or more embodiments, any apparatus, system, and unit descriptions herein include one or more hardware devices and/or hardware processing elements/devices. In one or more embodiments, any described apparatus, system, and unit may further include one or more desirable memories, and any desired hardware input/output transmission devices, as only examples. Further, the term apparatus should be considered synonymous with elements of a physical system, not limited to a device, i.e., a single device at a single location, or enclosure, or limited to all described elements being embodied in single respective element/device or enclosures in all embodiments, but rather, depending on embodiment, is open to being embodied together or separately in differing devices or enclosures and/or differing locations through differing hardware elements.
In addition to the above described embodiments, embodiments can also be implemented through computer readable code/instructions in/on a non-transitory medium, e.g., a computer readable medium, to control at least one processing element/device, such as a processor, computing device, computer, or computer system with peripherals, to implement any above described embodiment. The medium can correspond to any defined, measurable, and tangible structure permitting the storing and/or transmission of the computer readable code. Additionally, one or more embodiments include the at least one processing element or device.
The media may also include, e.g., in combination with the computer readable code, data files, data structures, and the like. One or more embodiments of computer-readable media include magnetic media such as hard disks, floppy disks, and magnetic tape; optical media such as CD ROM disks and DVDs; magneto-optical media such as optical disks; and hardware devices that are specially configured to store and/or perform program instructions, such as read-only memory (ROM), random access memory (RAM), flash memory, and the at least one processing device, respectively. Computer readable code may include both machine code, such as produced by a compiler, and files containing higher level code that may be executed by the computer using an interpreter, for example. The media may also be any defined, measurable, and tangible elements of one or more distributed networks, so that the computer readable code is stored and/or executed in a distributed fashion. In one or more embodiments, such distributed networks do not require the computer readable code to be stored at a same location, e.g., the computer readable code or portions of the same may be stored remotely, either stored remotely at a single location, potentially on a single medium, or stored in a distributed manner, such as in a cloud based manner. Still further, as noted and only as an example, the processing element could include a processor or a computer processor, and processing elements may be distributed and/or included in a single device. There may be more than one processing element and/or processing elements with plural distinct processing elements, e.g., a processor with plural cores, in which case one or more embodiments would include hardware and/or coding to enable single or plural core synchronous or asynchronous operation.
The computer-readable media may also be embodied in at least one application specific integrated circuit (ASIC) or Field Programmable Gate Array (FPGA), as only examples, which execute (processes like a processor) program instructions.
While aspects of the present invention has been particularly shown and described with reference to differing embodiments thereof, it should be understood that these embodiments should be considered in a descriptive sense only and not for purposes of limitation. Descriptions of features or aspects within each embodiment should typically be considered as available for other similar features or aspects in the remaining embodiments. Suitable results may equally be achieved if the described techniques are performed in a different order and/or if components in a described system, architecture, device, or circuit are combined in a different manner and/or replaced or supplemented by other components or their equivalents.
Thus, although a few embodiments have been shown and described, with additional embodiments being equally available, it would be appreciated by those skilled in the art that changes may be made in these embodiments without departing from the principles and spirit of the invention, the scope of which is defined in the claims and their equivalents.
Lee, Hyoung-ki, Jung, Jong-Dae
Patent | Priority | Assignee | Title |
Patent | Priority | Assignee | Title |
6098107, | Sep 02 1997 | WSOU Investments, LLC | Dynamic algorithms for shortest path tree computation |
6529642, | Sep 10 1999 | BEIJING ZHIGU TECH CO , LTD | Method for enlarging/reducing digital images |
6666823, | Apr 04 2001 | Siemens Medical Solutions USA, Inc. | Beam combination method and system |
7496444, | Mar 10 2008 | NNG LLC | Near route interactive map search |
7555705, | Sep 10 2003 | Microsoft Technology Licensing, LLC | Annotation management in a pen-based computing system |
7859546, | Apr 27 2007 | DREAMWORKS ANIMATION LLC | Placing skin-attached features on a computer generated character |
8004519, | Apr 27 2007 | DREAMWORKS ANIMATION LLC | Decorating computer generated character with surface-attached features |
8060389, | Jun 07 2000 | Apple Inc | System and method for anonymous location based services |
8280574, | Jul 18 2007 | Toyota Jidosha Kabushiki Kaisha | Path planning device and method, cost evaluation device, and moving body |
8289159, | Apr 26 2006 | Qualcomm Incorporated | Wireless localization apparatus and method |
8296112, | Aug 22 2008 | Kabushiki Kaisha Toshiba | Flow simulation method, flow simulation system, and computer program product |
20040193365, | |||
20060149465, | |||
20060167601, | |||
20070276541, | |||
20090043489, | |||
20100082194, | |||
JP2008234350, | |||
JP2008250906, | |||
KR1020060043147, | |||
KR1020070026912, | |||
KR1020070072305, | |||
WO2008062543, |
Executed on | Assignor | Assignee | Conveyance | Frame | Reel | Doc |
Aug 01 2011 | LEE, HYOUNG-KI | SAMSUNG ELECTRONICS CO , LTD | ASSIGNMENT OF ASSIGNORS INTEREST SEE DOCUMENT FOR DETAILS | 027148 | /0818 | |
Aug 01 2011 | JUNG, JONG-DAE | SAMSUNG ELECTRONICS CO , LTD | ASSIGNMENT OF ASSIGNORS INTEREST SEE DOCUMENT FOR DETAILS | 027148 | /0818 | |
Oct 31 2011 | Samsung Electronics Co., Ltd. | (assignment on the face of the patent) | / |
Date | Maintenance Fee Events |
Oct 31 2014 | ASPN: Payor Number Assigned. |
May 16 2017 | M1551: Payment of Maintenance Fee, 4th Year, Large Entity. |
Jul 19 2021 | REM: Maintenance Fee Reminder Mailed. |
Jan 03 2022 | EXP: Patent Expired for Failure to Pay Maintenance Fees. |
Date | Maintenance Schedule |
Nov 26 2016 | 4 years fee payment window open |
May 26 2017 | 6 months grace period start (w surcharge) |
Nov 26 2017 | patent expiry (for year 4) |
Nov 26 2019 | 2 years to revive unintentionally abandoned end. (for year 4) |
Nov 26 2020 | 8 years fee payment window open |
May 26 2021 | 6 months grace period start (w surcharge) |
Nov 26 2021 | patent expiry (for year 8) |
Nov 26 2023 | 2 years to revive unintentionally abandoned end. (for year 8) |
Nov 26 2024 | 12 years fee payment window open |
May 26 2025 | 6 months grace period start (w surcharge) |
Nov 26 2025 | patent expiry (for year 12) |
Nov 26 2027 | 2 years to revive unintentionally abandoned end. (for year 12) |