The present disclosure relates to a route generation device that generates a route to a destination of an unmanned carrier or the like, for example.
Conventionally, as a guidance system for causing an unmanned carrier to travel on a target travel route in a hotel, a production line of a factory, a distribution warehouse, or the like, for example, an electromagnetic guidance system in which a guidance magnetic field transmitted from an electric wire embedded in a floor is detected by a coil mounted on the unmanned carrier, an optical system in which reflected light from a reflection tape attached to a floor surface is detected by an optical sensor, or the like is known.
On the other hand, as a method of operating and managing an unmanned carrier without using the above-described guidance method, for example, an automatic guided vehicle (AGV) that automatically travels on a target travel route to load and unload a cargo and the like has been proposed.
In such an operation management method for an unmanned carrier, a user inputs a conveyance route to the unmanned carrier in advance, and conveyance to a destination or the like is performed. Further, a method of generating a route to a destination using a route generation algorithm such as A* (Aster) is also used.
There is known a conveyance device in which a moving device moves between stations along a travel line and conveys an article between the stations. Here, when the moving device, which is an unmanned carrier, moves to the destination, information is received from a relay point (storage medium), and the moving device advances the route based on the information.
There is known a method of operating a robotic cleaning device which is an automatic self-propelled machine on a surface to be cleaned. Here, a technique is disclosed in which, during cleaning, roadmap nodes are registered at intervals on a surface to be cleaned, and when a robotic cleaning device is driven from a previously registered roadmap node to a currently registered roadmap node without colliding with an obstacle or detecting an obstacle, the roadmap nodes are connected to form a roadmap link in a roadmap diagram, whereby navigation of the robotic cleaning device is facilitated.
However, in the related art, when the user inputs a route to the AGV, if the route becomes complicated, the amount of information increases and the burden on the user side also increases.
On the other hand, when A* (Aster) that is a route generation algorithm is used, it may take a very long time to generate a route. For example, there is a problem that the wider the facility, the longer the time required for the AGV to search for the way to the destination.
A first example embodiment of the present disclosure is a route generation device that generates a route of a mobile object. The route generation device includes a map information generator to indicate an accessible area and an inaccessible area of the mobile object from predetermined map information, a processor to apply predetermined processing to a boundary line between the accessible area and the inaccessible area based on the generated map information, to set a relay point of the mobile object on the boundary line, a distance calculator to calculate a distance between the relay points from a length of a line segment linking the relay points, and a route generator to generate a route from a point of departure to a destination of the mobile object based on the relay points and the distance between the relay points.
A second example embodiment of the present disclosure is a route generation method. The method includes generating map information indicating an accessible area and an inaccessible area of a mobile object from predetermined map information, setting point groups at predetermined intervals on a boundary line between the accessible area and the inaccessible area based on the map information generated, calculating angle information obtained by extracting, from among the point groups, a point group in which an angle defined by straight lines linking predetermined point groups includes a certain value or larger, setting a relay point of the mobile object in the inaccessible area based on the angle information, calculating a distance between the relay points from a length of a line segment linking the relay points, and generating a route from a point of departure to a destination of the mobile object on a basis of the relay points and the distance between the relay points.
The above and other elements, features, steps, characteristics and advantages of the present disclosure will become more apparent from the following detailed description of the example embodiments with reference to the attached drawings.
Example embodiments according to the present disclosure will be described in detail below with reference to the accompanying drawings.
As illustrated in
The calculation unit 3 includes an own-position estimation unit 11 and a route generation unit 13. The storage unit (memory) 4 stores map information, route information, a program for creating them, a travel control program of the route generation device 1, and the like.
Next, a method for creating map information and route information in the route generation device according to the first example embodiment will be described.
In step S11 of
The LiDAR is a technique of emitting a laser to a two-dimensional space or a three-dimensional space in a predetermined area called a facility and measuring distances at a plurality of measurement points in the area.
In step S13, the control unit 2 performs a process of setting an area at a certain distance from the detected obstacle as an “inaccessible area” where the automatic guided vehicle AGV cannot enter. Specifically, a portion at a certain distance (for example, the length of the diagonal line of the automatic guided vehicle AGV) from the edge of the black portion in
Here, for example, based on the outer size of the automatic guided vehicle AGV or the like, an accessible area where the AGV can move without colliding with a person or an object and an inaccessible area where the AGV cannot move are determined. When the image illustrated in
In step S15, as illustrated in
In step S17, the control unit 2 extracts a corner (relay point) based on the passage route (contour portion to be described later) extracted in step S15.
That is, in step S31 of
In step S33, the control unit 2 discriminates an acute angle, an obtuse angle, and the like, on the basis of the angle formed by the point group. In general, an acute angle refers to an angle of 90° or less, and an obtuse angle refers to an angle larger than 90° and smaller than 180°. Here, as described later, when one straight line is inclined by a certain value (for example, 45°) or more with respect to the other straight line, the angle is defined as an acute angle or an obtuse angle, and a point group in which an angle defined by straight lines connecting predetermined consecutive point groups has a certain value or more is extracted.
Specifically, by focusing on a point “c” in
Similar processing is repeated for other focusing points. For example, when an angle θ2 defined by straight lines 55 and 57 connecting points “d” and “h” on both sides starting from a point “f” has a certain value or more, the angle at the point “f” can be determined to be an obtuse angle from
That is, when calculating the angle θ formed by two straight lines (for example, a straight line “ac” and a straight line “ce” in
Therefore, since the angle θ3 formed by the straight lines is not equal to or larger than a certain angle, the angle θ3 is determined to be an angle other than an obtuse angle and an acute angle.
In step S35, the control unit 2 determines, as a corner, a point corresponding to an acute angle or an obtuse angle whose angle is equal to or larger than a certain value, on the basis of the discrimination result of the angle in step S33 described above. As a result, it is possible to efficiently set corners and reduce the amount of information at that time.
When the corner extraction process illustrated in
Next, in step S21 of
As a first method, adjacent corners on each lap course described above are connected to each other, and a distance of a line segment formed by the connection is stored. In addition, the corners that are not adjacent to each other are also connected together including other lap courses if the corners are within a certain distance, and the distance of the formed line segment is stored. In this way, for example, it is possible to avoid a state where the automatic guided vehicle AGV basically continues traveling one lap course and does not travel other lap courses as much as possible. An example of a route formed in this manner is shown in
A second method is a method of connecting all corners and storing the distance of a line segment formed by the connection.
Next, processing of determining a route to a destination in the route generation device will be described.
In step S43, the route generation device 1 searches for an optimum route from the combinations of the corners (relay points) from the current location to the destination and the distance between the corners, based on the route information stored in the memory 4. Here, the “optimum route” means a route having the shortest moving distance or the shortest route passing by the wall of the building as much as possible. The route searched in this way is a route in which movement of the automatic guided vehicle AGV does not interfere with the passerby or the like.
In step S45, the control unit 2 moves the automatic guided vehicle AGV while controlling the drive unit 8 such that it moves along the route searched for and determined in step S43. In the case of moving the AGV to the destination, the optimum route is autonomously determined from the coordinates of the corner and the distance information between the corners, and the AGV is moved. The drive unit 8 includes, for example, a known drive mechanism including a plurality of wheels, a motor that drives these wheels, and the like.
During the movement, an own-position estimation unit 11 of the route generation device 1 obtains the movement amount from the rotation angle of the wheel or the like by odometry for example, and estimates the position of the AGV from the accumulation result. In addition, simultaneous localization and mapping (SLAM) may be used to estimate the own-position.
When the destination is not on the relay points, a relay point located closest to the destination is checked. Then, an optimum route is searched for by using between the relay points. At the time of movement, the vehicle first moves to the nearest relay point, follows the route searched above, and moves from the last relay point to the destination.
A movement route 71 in
As described above, according to the route generation device of the first example embodiment, the contour of the accessible area is extracted from the generated map information, and relay points of the mobile object (AGV) can be quickly set on the basis of the angles formed by the point groups provided to the contour. Therefore, it is easy to generate a safe and shortest route from the point of departure to the destination in consideration of obstacles.
That is, it is possible to generate a highly reliable route in which relay points are efficiently set in consideration of presence or absence of an obstacle. In addition, by generating the route information in which the corners without an obstacle are connected in the accessible area, it is possible to generate a shortest route between the point of departure and the destination without interfering with passage of a person or movement of an object.
Next, a second example embodiment of the present disclosure will be described. Since the configuration of a route generation device according to the second example embodiment is the same as that of the route generation device according to the first example embodiment illustrated in
In step S53, the control unit 2 detects a boundary surface of color shading in the map information illustrated in FIG. 10A and generates, for example, a point group map illustrated in
In step S55, the control unit 2 checks the surrounding occupancy state (presence or absence of an obstacle) with reference to the end point of the line segment extracted in step S53 described above.
For example, when the end point is opened by about 90°, the occupancy of the surroundings is set to 0.25, when the end point is opened by 180°, the occupancy of the surroundings is set to 0.5, and when the end point is opened by about 270°, the occupancy of the surroundings is set to 0.75.
The occupancy is a degree of expansion of a line segment to the periphery with an end point as a reference, and here, an acute angle, an obtuse angle, and a plane are determined from the occupancy. For example, the occupancy 0.25 is determined to be an acute angle, the occupancy 0.75 is determined to be an obtuse angle, and the occupancy 0.5 is determined to be a plane.
In step S59, the corners are connected as illustrated in
Note that, in the second example embodiment, the process of designating the destination and determining the route to the destination by the automatic guided vehicle AGV (route generation device) is the same as that in the first example embodiment illustrated in
As described above, according to the route generation device of the second example embodiment, it is possible to extract corners on the basis of map information in which the amount of information is reduced from that of the map information created by the LRF, and to speed up the corner setting processing. In particular, in a facility having a simple structure, a route between the point of departure and the destination can be efficiently generated.
The present disclosure is not limited to the above-described example embodiment, and various modifications are possible.
In the route generation devices according to the first and second example embodiments described above, in the case of creating map information, an obstacle is detected using a single LRF (LiDAR), but the present disclosure is not limited thereto.
For example, LRF1 and LRF2 may be installed at different positions in the height direction of the route generation device, and a map may be created on the basis of information obtained therefrom. In this case, when any of the LRFs detects an obstacle, a two-dimensional map is created assuming that the detection point has an obstacle.
Specifically, when an obstacle illustrated in
In the route generation device according to the first example embodiment, an inaccessible area is provided in consideration of the shape and the like of the AGV, but the present disclosure is not limited thereto.
For example, a camera may be installed in the route generation device in addition to the LRF, and an inaccessible area may be provided using information captured by the camera. Specifically, in the case where “entry prohibited cones” illustrated in
Note that the camera may be a two-dimensional camera that generates two-dimensional image data or a three-dimensional camera that generates three-dimensional distance image data.
In the first and second example embodiments described above, the processing of detecting corners is performed on the already-created map information, but the map may be created by the AGV equipped with a camera, and the coordinates of a specific structure (for example, a door or the like) recognized by the camera during creation of the map may be supplementarily added as a corner.
Features of the above-described preferred example embodiments and the modifications thereof may be combined appropriately as long as no conflict arises.
While example embodiments of the present disclosure have been described above, it is to be understood that variations and modifications will be apparent to those skilled in the art without departing from the scope and spirit of the present disclosure. The scope of the present disclosure, therefore, is to be determined solely by the following claims.
Number | Date | Country | Kind |
---|---|---|---|
2019-180471 | Sep 2019 | JP | national |
This is a U.S. national stage of application No. PCT/JP2020/031590, filed on Aug. 21, 2020, and with priority under 35 U.S.C. § 119(a) and 35 U.S.C. § 365(b) being claimed from Japanese Patent Application No. 2019-180471, filed on Sep. 30, 2019, the entire disclosures of which are hereby incorporated herein by reference.
Filing Document | Filing Date | Country | Kind |
---|---|---|---|
PCT/JP2020/031590 | 8/21/2020 | WO |