Route forming device, ship, route forming method, and program
The route creation device addresses the challenge of creating effective navigation routes by detecting obstacles and performing optimization calculations to ensure safe and efficient ship navigation, considering distance and constraints.
Patent Information
- Application Number
- JP2023082418
- Authority / Receiving Office
- JP · JP
- Patent Type
- Applications
- Current Assignee / Owner
- Filing Date
- 2023-05-18
- Publication Date
- 2024-11-28
- Estimated Expiration
- Not applicable · inactive patent
AI Technical Summary
Existing navigation route creation systems for ships fail to appropriately create routes that account for obstacles, leading to potential navigation issues.
A route creation device that detects the position of representative points of obstacles, constructs a polygonal line map to differentiate navigable and non-navigable areas, and performs optimization calculations using evaluation functions to create a navigable route, considering distance and constraints such as rudder angle and engine speed.
Enables the creation of optimized navigation routes that allow ships to navigate safely and efficiently while minimizing energy consumption and maintaining stable navigation states.
Smart Images

Figure 2024165862000001_ABST
Abstract
Description
[Technical field]
[0001] The present disclosure relates to a route creation device, a ship, a route creation method, and a program. [Background technology]
[0002] Conventionally, there have been known techniques for automatically creating a ship's navigation route. For example, Patent Document 1 describes a method for automatically creating a ship's navigation route, in which a quay where the ship will dock is detected as point cloud data by a sensor, a target point that is the ship's docking position is set based on the data, and then a route from the ship to the target point is created by dividing it into control points called via points. [Prior art documents] [Patent documents]
[0003] [Patent Document 1] International Publication No. 2020 / 111044 Summary of the Invention [Problem to be solved by the invention]
[0004] When automatically creating a ship's navigation route in this way, it is necessary to create an appropriate route that the ship can navigate.
[0005] The present disclosure has been made in consideration of the above, and aims to provide a route creation device, a ship, a route creation method, and a program capable of appropriately creating a route that a ship can navigate. [Means for solving the problem]
[0006] The ship route creation device of the present disclosure comprises a line map construction unit that detects the position of a representative point of an obstacle and constructs a line map indicating areas where the ship can navigate and areas where the ship cannot navigate based on the position of the representative point, a condition setting unit that uses the line map to set, for each position on the line map, an evaluation value that becomes higher the farther away from the position of the obstacle, and an optimization calculation execution unit that performs an optimization calculation using an evaluation function based on the evaluation value and creates a ship route when the result of the optimization calculation is optimal.
[0007] The ship according to the present disclosure is equipped with the above-mentioned route planning device.
[0008] The ship route creation method disclosed herein includes the steps of detecting the position of a representative point of an obstacle, and constructing a broken line map indicating areas where the ship can navigate and areas where the ship cannot navigate based on the position of the representative point; using the broken line map, setting an evaluation value for each position on the broken line map, the evaluation value increasing the farther away from the position of the obstacle, and performing an optimization calculation using an evaluation function based on the evaluation value, and creating a ship route when the result of the optimization calculation is optimal.
[0009] The program disclosed herein causes a computer to execute the steps of detecting the position of a representative point of an obstacle, constructing a broken line map showing areas where the ship can navigate and areas where the ship cannot navigate based on the position of the representative point, using the broken line map to set an evaluation value for each position on the broken line map, the evaluation value increasing the farther away from the position of the obstacle, and performing an optimization calculation using an evaluation function based on the evaluation value, and creating a route for the ship when the result of the optimization calculation is optimal. Effect of the Invention
[0010] According to the present disclosure, a route that a ship can navigate can be appropriately created. [Brief description of the drawings]
[0011] [Figure 1]FIG. 1 is a schematic diagram of a ship according to this embodiment. [Diagram 2] FIG. 2 is a schematic block diagram of the route generation device according to the present embodiment. [Diagram 3] FIG. 3 is a schematic diagram of a potential map according to the first embodiment. [Figure 4] FIG. 4 is a flowchart illustrating a processing flow of the route generation device according to the first embodiment. [Diagram 5] FIG. 5 is a schematic diagram of a cost map according to the second embodiment. [Figure 6] FIG. 6 is an explanatory diagram of an output result of the route generation device according to the second embodiment. [Figure 7] FIG. 7 is a flowchart illustrating a process flow of the route generation device according to the second embodiment. DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENTS
[0012] Preferred embodiments of the present disclosure will be described in detail below with reference to the accompanying drawings. Note that the present disclosure is not limited to these embodiments, and when there are multiple embodiments, the present disclosure also includes combinations of the embodiments.
[0013] (First embodiment) The configuration of the ship will be described with reference to Fig. 1. Fig. 1 is a schematic diagram of the ship according to this embodiment.
[0014] (ship) The marine vessel SH according to this embodiment shown in Fig. 1 is a moving body capable of automatic navigation. However, the marine vessel SH is not limited to this, and may be a moving body operated by a driver. In this embodiment, the marine vessel SH is a moving body that moves on water W (water surface), but is not limited to this, and may be an underwater vehicle that moves underwater.
[0015] As shown in FIG. 1, the ship SH has a route creation device 1. The route creation device 1 is a device that automatically creates a route R from a departure position S to an arrival position G of the ship SH. The route creation device 1 will be specifically described below. In this embodiment, a route R is created in a two-dimensional plane. In the two-dimensional plane, one direction along the horizontal direction is defined as the X direction, and a direction along the horizontal direction and perpendicular to the X direction is defined as the Y direction. In this embodiment, the route creation device 1 is mounted on the ship SH, but is not limited to this, and may be provided at a position different from the ship SH. In this case, a control device provided on the ship SH may acquire information on the route R created by the route creation device 1 and automatically navigate the ship SH according to the route R.
[0016] (Route creation device) Fig. 2 is a schematic block diagram of a route creation device according to this embodiment. The route creation device 1 according to this embodiment is, for example, a computer, and has an input unit 10, an output unit 20, a memory 30, and a control unit 40 as shown in Fig. 2. The input unit 10 is a device that accepts user operations, and may be, for example, a mouse, a keyboard, a touch panel, or the like. The output unit 20 is a device that outputs information, and may be, for example, a display that displays images, or the like.
[0017] The memory 30 is a memory that stores the calculation contents of the control unit 40, programs, and various information input by the user of the route creation device 1 from the input unit 10, and includes at least one of a main storage device such as a RAM (Random Access Memory), a ROM (Read Only Memory), and an external storage device such as an HDD (Hard Disk Drive). The programs for the control unit 40 saved in the memory 30 may be stored in a recording medium that the route creation device 1 can read.
[0018] The control unit 40 is a calculation device and includes a calculation circuit such as a CPU (Central Processing Unit). The control unit 40 includes a broken line map construction unit 411, a condition setting unit 412, an optimization calculation execution unit 413, an output control unit 414, and a movement control unit 415. The control unit 40 realizes the broken line map construction unit 411, the condition setting unit 412, the optimization calculation execution unit 413, the output control unit 414, and the movement control unit 415 by reading and executing a program (software) from the memory 30, and executes the program. The control unit 40 may execute these processes by one CPU, or may include multiple CPUs and execute the processes by the multiple CPUs. At least a part of the broken line map construction unit 411, the condition setting unit 412, the optimization calculation execution unit 413, the output control unit 414, and the movement control unit 415 may be realized by hardware.
[0019] (route) As shown in Fig. 1, the route creation device 1 creates a route R from the departure position S of the ship SH to the arrival position G. In the example of Fig. 1, the departure position S is a position on the open sea side of the port facility, and the arrival position G is a docking position provided within the port facility. The departure position S and the arrival position G may be any positions. The departure position S and the arrival position G may be set by the driver, for example.
[0020] (Processing of route creation device) The process performed by the route generation device 1 will now be described.
[0021] (Obstacle information acquisition) The broken line map construction unit 411 acquires obstacle information, which is information indicating the positions of obstacles OB such as quays around the current position of the ship SH and the docking position (arrival position G). Any method may be used to obtain the obstacle information. For example, map information around the current position of the ship SH and the docking position (arrival position G) may include obstacle information, and the broken line map construction unit 411 may acquire the map information from an external server or the like via a communication unit (not shown). The broken line map construction unit 411 may also detect the obstacle information using a sensor attached to the ship SH (not shown). The sensor that acquires the obstacle information may be, for example, a LIDAR (Light Detection and Ranging). The obstacle information may be stored in advance in the memory 30, or may be input by the user via the input unit 10.
[0022] (Constructing a line map) The broken line map construction unit 411 detects the position of the representative point SP of the obstacle OB based on the acquired obstacle information. The representative point SP of the obstacle OB is a position within the area where the obstacle OB exists. The representative point SP of the obstacle OB may be any position within the area where the obstacle OB exists, and may be, for example, an end point or a bending point (a point that is an extreme value) of the obstacle OB on a two-dimensional plane. The broken line map construction unit 411 constructs a broken line map LM indicating an area where the ship SH is navigable and an area where the ship SH is not navigable based on the position of the representative point SP of the obstacle OB. Specifically, the broken line map construction unit 411 detects position information of the representative point SP of the obstacle OB as point cloud data from the acquired map information. Then, the broken line map construction unit 411 constructs the broken line map LM by connecting the point data indicating the positions of the detected representative points SP of the obstacle OB with line segments. In other words, the polygonal line map LM is a map that indicates the boundary between an area where the ship SH can navigate (an area of water W) and an area where the ship SH cannot navigate (an area where an obstacle OB exists).
[0023] In this embodiment, the condition setting unit 412 uses the broken line map LM constructed by the broken line map construction unit 411 to set an evaluation value that becomes higher as the distance from the position of the obstacle OB increases, and the optimization calculation execution unit 413 executes optimization calculation using an evaluation function based on the evaluation value to create a route R for the ship SH. First, the evaluation value will be described below.
[0024] (Get rating value) The condition setting unit 412 uses the broken line map LM to set an evaluation value for each position on the broken line map LM, which is higher in evaluation as it becomes farther from the position of the obstacle OB. That is, the evaluation value is a value determined for each position on the broken line map LM. For example, in the case of a first position on the broken line map LM and a second position closer to the obstacle OB than the first position, the condition setting unit 412 sets evaluation values for the first position and the second position such that the evaluation value at the first position is higher than the evaluation value at the second position. Note that in the example of this embodiment, the evaluation value is set so that the smaller the evaluation value, the higher the evaluation, so that the evaluation value at the first position is set smaller than the evaluation value at the second position. However, the present invention is not limited to this, and the evaluation may be higher as the evaluation value is larger.
[0025] In this embodiment, the condition setting unit 412 sets an evaluation value for each position of the polygonal line map LM so that the evaluation gradually increases (in this example, the value decreases) as the distance from the position of the obstacle OB increases, and sets a map in which the set evaluation value is assigned to each position of the polygonal line map LM as the potential map PM. More specifically, it is preferable that the condition setting unit 412 sets a potential function that determines the evaluation value, and creates the potential map PM based on the potential function. The potential function will be described below.
[0026] In this embodiment, the condition setting unit 412 sets the value of the potential function whose evaluation increases (worse) as the distance from the obstacle OB increases as the evaluation value p (xi,yi) In other words, the evaluation value p (xi,yi)is a value of a potential function at a coordinate point (xi, yi) of a certain position in a two-dimensional coordinate system of XY. i is an identifier of the coordinate point. That is, "i=1,...N", and N indicates the total number of coordinate points (positions) on the X-axis and Y-axis on the broken line map LM. The route creation device 1 according to this embodiment creates a trajectory connecting the coordinate points as the route R. Increasing the number of N increases the number of coordinate points, so that the route R can be created in detail, but the amount of calculation for the optimization calculation also increases. The value of the number of coordinate points N may be set arbitrarily. For example, the value of N may be set by the user. In that case, the condition setting unit 412 may acquire the value input by the user via the input unit 10 as the number of coordinate points N on the X-axis and Y-axis.
[0027] Here, the evaluation value p (xi,yi) The potential function that determines is a function calculated by superposing a plurality of linear potential functions. In explaining the potential function, first, the linear potential function will be explained below.
[0028] (First-order potential function) The condition setting unit 412 sets, as the linear potential function, a function in which the evaluation gradually increases (the value decreases) as the distance from the obstacle OB increases. In this embodiment, the condition setting unit 412 calculates, based on two representative points SP of adjacent obstacles OB on the broken line map LM, a linear potential function indicating an evaluation value at a position within a predetermined distance range from the two representative points SP. For example, the condition setting unit 412 sets, as the linear potential function, a Gaussian function in which ellipses each having two adjacent representative points SP as foci are contour lines. That is, for example, the condition setting unit 412 sets an evaluation value that is the same value on the outer periphery of an ellipse having two representative points SP as foci. Then, the condition setting unit 412 sets an evaluation value for the outer periphery of each ellipse having two representative points SP as foci such that the smaller the size of the ellipse, the larger the value (the lower the evaluation). The condition setting unit 412 may set an evaluation value for the region between the perimeter of an ellipse and an ellipse one step smaller than the ellipse, which is the same as the perimeter of the ellipse (the perimeter of the larger ellipse) or the perimeter of the ellipse one step smaller than the ellipse, or may set an evaluation value that is a value between the evaluation values of the perimeters of those ellipses. This sets a linear potential function in which the evaluation becomes higher (the value becomes smaller) the farther the region is from the two adjacent representative points SP.
[0029] (potential function) The condition setting unit 412 sets a linear potential function for every combination of two representative points SP of adjacent obstacles OB on the broken line map LM. Then, the condition setting unit 412 superimposes all the calculated linear potential functions to set the potential function according to this embodiment.
[0030] The potential function calculated by the condition setting unit 412 is a superposition of all the linear potential functions, and thus, like the linear potential function, the value decreases and the evaluation becomes higher as the distance from the obstacle OB increases, and the value for each position (coordinate point) in the potential function becomes the evaluation value.
[0031] (Creating a potential map) 3 is a schematic diagram of a potential map according to the first embodiment. The condition setting unit 412 sets an evaluation value p (xi,yi) Specifically, the condition setting unit 412 creates a potential map PM to which the value of the potential function calculated by superposing the primary potential functions (the evaluation value p (xi,yi) ) for all positions (coordinate points) on the polygonal line map LM. That is, the evaluation value p (xi,yi) ) can be said to be a distribution map of the potential map PM. In other words, the condition setting unit 412 sets the evaluation value p (xi,yi) , all positions (N 2 The number of coordinate points in the polygonal line map LM and the potential map PM are calculated and the potential map PM is created. 2 It becomes an individual.
[0032] (Get constraints) The condition setting unit 412 may acquire constraint conditions to be used in the optimization calculation. The constraint conditions are constraint conditions that must be observed when creating the route R. The constraint conditions may be of any content, but in this embodiment, the condition setting unit 412 acquires, as the constraint conditions, a first constraint condition that constrains the rudder angle of the ship SH to be within a range equal to or less than an upper limit rudder angle, and a second constraint condition that constrains the engine speed of the ship SH to be within an upper limit rudder speed. The condition setting unit 412 may acquire the constraint conditions by any method, and may, for example, acquire preset constraint conditions from an external server or read them from the memory 30.
[0033] (constraints) The constraint conditions in this embodiment are, for example, as shown in the following formulas (1) and (2): However, the constraint conditions shown below are merely examples, and the constraint conditions are not limited to these.
[0034]
number
[0035] The formula (1) is a constraint condition corresponding to the first constraint condition that restricts the rudder angle of the ship SH to be within a range equal to or less than the upper limit rudder angle A1. The formula (1) is expressed by the rudder angle r (xi,yi) does not exceed the upper limit rudder angle A1 at any position (coordinate point). The upper limit rudder angle A1 according to this embodiment is set to 30°, but the value of the upper limit rudder angle A1 may be set arbitrarily. For example, the value of the upper limit rudder angle A1 may be set by a user. In this case, the condition setting unit 412 may acquire the value input by the user via the input unit 10 as the upper limit rudder angle A1. The upper limit rudder angle A1 may also be automatically set by the condition setting unit 412. In this case, for example, the condition setting unit 412 may set the upper limit rudder angle A1 based on the obstacle information and the dimensional information and power performance information of the ship SH.
[0036]
number
[0037] (Getting the evaluation function) The condition setting unit 412 acquires an evaluation function to be used in the optimization calculation, whose value is determined based on the set evaluation value (potential map PM). Specifically, the condition setting unit 412 acquires an evaluation value p (xi,yi) The function showing the sum of these is obtained as the evaluation function.
[0038] (Optimization calculation) The optimization calculation execution unit 413 performs optimization calculation using the acquired evaluation function, and creates a route R for the ship SH when the result of the optimization calculation is optimal. That is, the optimization calculation execution unit 413 creates, as the route R for the ship SH, a route optimized based on the evaluation function among each route that the ship SH can take from the departure position S to the arrival position G. Specifically, the optimization calculation execution unit 413 calculates the sum of evaluation values at each position on the route (each position that the ship passes through on the potential map PM) based on the potential map PM (evaluation value of each position), and performs optimization calculation so that the evaluation of the sum of the evaluation values is as high as possible (in this example, so that the sum of the evaluation values is as small as possible). That is, for example, the optimization calculation execution unit 413 calculates the sum of evaluation values at each position on the route for each route that the ship SH can take, and sets the route for which the sum of the evaluation values is equal to or less than a predetermined value (preferably the route for which the sum is the smallest) as the optimized route R.
[0039] Furthermore, it is preferable that the optimization calculation execution unit 413 performs the optimization calculation using the first evaluation function as an evaluation function while satisfying the constraint conditions (the first constraint condition and the second constraint condition in this example) set by the condition setting unit 412. However, it is not essential to use the constraint conditions.
[0040] (Example of using multiple evaluation functions) In this embodiment, the optimization calculation execution unit 413 may execute the optimization calculation using an evaluation function other than the sum of the evaluation values (first evaluation function). The optimization calculation using an evaluation function other than the sum of the evaluation values will be described below.
[0041] In this case, the condition setting unit 412 may acquire a second evaluation function, a third evaluation function, a fourth evaluation function, and a fifth evaluation function in addition to the first evaluation function indicating the sum of the evaluation values. The second evaluation function is an evaluation function related to the sailing time from the departure position S until the ship SH reaches the arrival position G. The third evaluation function is an evaluation function related to the energy consumed by the ship SH from the departure position S until the ship SH reaches the arrival position G, and may be a function with a control input (rudder angle and engine speed) to the ship SH as a variable. The fourth evaluation function is a function indicating the sailing state of the ship SH. The sailing state of the ship SH is an index indicating how the ship SH is sailing, and is determined based on at least one (preferably all) of the position, attitude, speed, and angular velocity of the ship SH. That is, the fourth evaluation function is a function with at least one (preferably all) of the position, attitude, speed, and angular velocity of the ship SH as a variable. The fifth evaluation function is a function indicating the rate of change of the input to the ship. The rate of change of the input to the ship SH refers to the amount of change per unit time of the control input to the ship SH (rudder angle and engine speed). In other words, the fifth evaluation function is a function that uses the rate of change of the input to the ship SH as a variable.
[0042] The optimization calculation executing unit 413 may execute the optimization calculation using at least one of the second evaluation function, the third evaluation function, the fourth evaluation function, and the fifth evaluation function as an evaluation function in addition to the first evaluation function. More specifically, it is preferable that the optimization calculation executing unit 413 executes the optimization calculation to set an optimized route R so that the evaluation of the sum of the evaluation values at each position on the route is as high as possible (in this example, the sum of the evaluation values is as small as possible), the navigation time from the departure position S of the ship SH to the arrival position G of the ship SH is as short as possible, the energy consumption of the ship SH from the departure position S of the ship SH to the arrival position G of the ship SH is as small as possible, the navigation state of the ship SH is as stable as possible, and the rate of change of the input to the ship SH is as small as possible. Specifically, the optimization calculation executing unit 413 calculates the route R with the minimum sum of the five evaluation functions from the first evaluation function to the fifth evaluation function as a result of the optimization calculation. Note that even in this case, it is preferable to execute the optimization calculation so as to satisfy the constraint conditions. As an example of a formula for performing the optimization calculation, the optimization calculation may be performed so that the following formula (3) is minimized.
[0043]
number
[0044] The output control unit 414 outputs the result of the optimization calculation calculated by the optimization calculation execution unit 413. The result of the optimization calculation is information indicating the route R of the ship SH, and may further include information on the sailing time. The method of outputting the result of the optimization calculation by the output control unit 414 may also be arbitrary, and may be, for example, transmitted to an external device or displayed on the output unit 20.
[0045] (Ship Control) The movement control unit 415 controls the drive mechanism of the ship SH, in other words, performs control input to the drive mechanism to navigate the ship SH. The movement control unit 415 moves the ship SH according to the route R calculated by the optimization calculation execution unit 413.
[0046] In this embodiment, the movement control unit 415 automatically controls the movement of the ship SH so that it moves according to the route R, but this is not limited thereto, and the movement of the ship SH may be manually controlled, for example, by the operation of the driver. Even in this case, the driver may manually control the ship SH to follow the automatically set route R while, for example, visually checking the route R displayed on the output unit 20. Furthermore, for example, the output control unit 414 may set a control input for realizing the route R and cause the output unit 20 to display information on the set control input. In this case, the driver may visually check the control input displayed on the output unit 20 and manually control the ship SH while referring to the control input.
[0047] (Processing flow) Next, the process flow of this embodiment will be described. FIG. 4 is a flow chart of route creation according to this embodiment. When creating a route R, the broken line map construction unit 411 acquires obstacle information, which is information on obstacles OB such as quays. The broken line map construction unit 411 detects position information of representative points SP (end points and bend points) of the obstacles OB from the acquired obstacle information, and constructs a broken line map LM that connects all the detected representative points SP of the obstacles OB with line segments (step S1). The condition setting unit 412 creates a potential map PM based on the broken line map LM created by the broken line map construction unit 411 (step S2). The condition setting unit 412 acquires an evaluation function (step S3). The optimization calculation execution unit 413 executes optimization calculation based on the potential map PM and the evaluation function, and sets a route R for the ship SH (step S4).
[0048] (effect) As described above, the route creation device 1 according to this embodiment detects the positions of representative points SP of obstacles OB, such as quays, from the acquired obstacle information, and constructs a broken line map LM. After that, a potential map PM is created based on the constructed broken line map LM. Then, the route creation device 1 performs an optimization calculation using the potential map PM and an evaluation function, and creates a route R for the ship SH when the result of the optimization calculation is optimal. According to the present disclosure, a route R that the ship SH can navigate can be appropriately created.
[0049] Second embodiment Next, a second embodiment will be described. In the first embodiment, a potential map PM is created based on a broken line map LM, and a route R is created using the potential map PM. However, in the second embodiment, a cost map CM is created based on a broken line map LM, and a route R is created using the cost map CM, which is different from the first embodiment. Here, the cost map CM is a distribution diagram of new evaluation values according to this embodiment. In the second embodiment, the description of the parts that are common to the first embodiment will be omitted.
[0050] (Get rating value) The condition setting unit 412 according to the second embodiment sets, for each position on the broken line map LM, an evaluation value that increases with distance from the position of the obstacle OB. Specifically, the condition setting unit 412 sets the evaluation value at each position so that the evaluation value takes a first value at a position where the obstacle OB is present, and a second value that is higher in evaluation than the first value at a position where the obstacle OB is not present. In the example of this embodiment, the evaluation value is set so that the smaller the evaluation value, the higher the evaluation, so that the evaluation value at the first position is set smaller than the evaluation value at the second position. For example, the condition setting unit 412 may set the first value to 1 and the second value to 0. However, the present invention is not limited to this, and the evaluation may be higher as the evaluation value increases. Hereinafter, the evaluation value at a certain coordinate point (al, bl) in the two-dimensional coordinate system of XY is appropriately referred to as the evaluation value c (al,bl) Here, l is an identifier of a lattice point, which will be described later. That is, "l=1,...M", and M indicates the total number of lattice points on the X-axis and Y-axis on the broken line map LM. The route creation device 1 according to this embodiment creates a trajectory connecting the lattice points as the route R. If M, which is the total number of lattice points on the X-axis and Y-axis, is increased, the lattice points increase, so that the route R can be created in detail, but the lattice points to be calculated in the optimization calculation also increase. The value of the total number M of lattice points on the X-axis and Y-axis may be set arbitrarily. For example, the value of M may be set by the user. In this case, the condition setting unit 412 may acquire the value input by the user via the input unit 10 as the total number M of lattice points on the X-axis and Y-axis.
[0051] (Creating a cost map) 5 is a schematic diagram of a cost map according to the second embodiment. In this embodiment, the condition setting unit 412 sets an evaluation value c (al,bl) Specifically, the condition setting unit 412 creates a cost map CM with an evaluation value c (al,bl) Calculate the score and assign it to each grid point. The assigned score c (al,bl)The distribution map of the above can be said to be the cost map CM. In other words, the condition setting unit 412 calculates the cost of all the lattice points (M 2 The condition setting unit 412 then classifies the grid points (coordinate points) into grid points with obstacles OB and grid points without obstacles OB. Then, for all grid points, the condition setting unit 412 assigns 1 to grid points with obstacles OB and 0 to grid points without obstacles OB, and assigns an evaluation value c (al,bl) As a result, the evaluation value c (al,bl) The distribution map of these points is the cost map CM. The number of coordinate points (grid points) in the line map LM and the cost map CM is the same as M 2 It becomes one.
[0052] (Getting the evaluation function) The condition setting unit 412 acquires an evaluation function to be used in the optimization calculation, whose value is determined based on the set evaluation value (cost map CM). The condition setting unit 412 obtains an evaluation value c (al,bl) The condition setting unit 412 may obtain the evaluation function by any method. For example, the condition setting unit 412 may obtain a preset evaluation function from an external server or read it from the memory 30.
[0053] (Optimization calculation) The optimization calculation execution unit 413 calculates the evaluation function (evaluation value c (al,bl) , and creates a route R for the ship SH when the result of the optimization calculation is optimal. That is, the optimization calculation execution unit 413 creates, as the route R for the ship SH, a route that is optimized based on the evaluation function from among all the routes that the ship SH can take from the departure position S to the arrival position G. More specifically, the optimization calculation execution unit 413 creates, based on the cost map CM (evaluation value for each position), the evaluation values c (al,bl)and performs optimization calculation so that the evaluation of the sum of the evaluation values is as high as possible (in this example, so that the sum of the evaluation values is as small as possible). That is, for example, the optimization calculation execution unit 413 calculates the sum of the evaluation values at each position on the route for each route that the ship SH can take, and sets the route for which the sum of the evaluation values is equal to or less than a predetermined value (preferably the route for which the sum is the smallest) as the optimized route R.
[0054] The output control unit 414 outputs the result of the optimization calculation calculated by the optimization calculation executing unit 413. The result of the optimization calculation is information indicating the route R of the ship SH.
[0055] FIG. 6 is an explanatory diagram of the output result of the route creation device according to the second embodiment. As shown in FIG. 6, the output control unit 414 assigns a position number indicating a position for each lattice point on the cost map CM. One position number corresponds to one coordinate (al, bl). Then, which numbered lattice point the ship SH passes through may be displayed as a result of optimization calculation on the output unit 20 in a format in which the position numbers of the lattice points that form the route are displayed in order (in the example of FIG. 6, the position numbers of the lattice points are output in the order of 1, 2, 7, 12, 17, 22, 23, 24, and 25). Furthermore, the XY coordinates corresponding to the position numbers may be listed together with the output result of the lattice point position numbers.
[0056] (Processing flow) Next, the process flow of this embodiment will be described. FIG. 7 is a flow chart of route creation according to this embodiment. When creating a route R, the broken line map construction unit 411 acquires obstacle information, which is information on obstacles OB such as quays. The broken line map construction unit 411 detects position information of representative points SP (end points and bending points) of the obstacles OB from the acquired obstacle information, and constructs a broken line map LM that connects the representative points SP of each of the detected obstacles OB with line segments (step S11). The condition setting unit 412 creates a cost map CM based on the broken line map LM created by the broken line map construction unit 411 (step S12). The condition setting unit 412 acquires an evaluation function (step S13). The optimization calculation execution unit 413 executes optimization calculation based on the cost map CM and the evaluation function (step S14).
[0057] (effect) As described above, the route creation device 1 according to this embodiment detects the positions of representative points SP of obstacles OB, such as quays, from the acquired obstacle information, and constructs a broken line map LM. After that, a cost map CM is created based on the constructed broken line map LM. Then, an optimization calculation is performed using the cost map CM and an evaluation function, and a route R for the ship SH is created when the result of the optimization calculation is optimal. According to the present disclosure, a route R on which the ship SH can navigate can be appropriately created. Furthermore, in this embodiment, since there are fewer constraints and evaluation functions compared to the first embodiment, the result of the optimization calculation can be calculated quickly.
[0058] (Modification 1 of the second embodiment) Next, a first modified example of the second embodiment will be described. In the second embodiment, for all positions (lattice points), the condition setting unit 412 sets an evaluation value c of 1 to a position (lattice point) where an obstacle OB is present and 0 to a position (lattice point) where no obstacle OB is present. (al,bl)In the previous example, a cost map CM was created by allocating the cost to each position, and a route R was created based on the cost map CM. That is, the cost map CM in the second embodiment was a binarized map in which the evaluation value of each position was a first value or a second value. In contrast, in this example, a filtering process is performed to correct the cost map CM so that there are three or more types of evaluation values for each position, and a filtering cost map FCM is created.
[0059] (Filtering process) Specifically, the condition setting unit 412 performs a filtering process to assign a third value of cost according to the distance from the obstacle OB to the grid points on the binarized cost map CM where there is no obstacle OB and the distance from the obstacle OB is shorter than a predetermined distance, and creates a filtering cost map FCM. For example, the condition setting unit 412 assigns an evaluation value c of 0 to the grid points (hereinafter referred to as threshold grid points) that are a distance 2d away from the obstacle OB. (al,bl) As the obstacle OB is approached from the threshold grid point, the evaluation value c (al,bl) may be set to approach 1. In this example, the threshold grid point at a distance of 2d from the obstacle OB is assigned an evaluation value c of 0. (al,bl) The grid point at the distance d from the obstacle OB, which is the midpoint between the obstacle OB and the threshold grid point, is assigned an evaluation value c of 0.5. (al,bl) For the other grid points that are closer than 2d to the obstacle OB, an evaluation value c (al,bl) Here, the distance 2d from the obstacle OB to the threshold grid point is the distance between the ship SH and the obstacle OB that is ensured so that the ship SH can avoid the obstacle OB and navigate safely. The distance 2d may be automatically set by the condition setting unit 412. In this case, for example, the condition setting unit 412 may set the distance 2d based on the obstacle information and the dimensional information and power performance information of the ship SH.
[0060] In this example, the filtering cost map FCM created in this manner is treated as the cost map CM in the second embodiment, and subsequent optimization calculation processing and the like are performed in the same manner as in the second embodiment.
[0061] (effect) As described above, the route generation device 1 according to this example performs a filtering process based on a predetermined distance from an obstacle OB on the generated cost map CM to generate a filtering cost map FCM. Then, based on the filtering cost map FCM, an evaluation function is obtained, an optimization calculation is performed, and a route R for the ship SH is generated when the result of the optimization calculation is optimal. According to the present disclosure, a route R that the ship SH can navigate can be appropriately generated while taking into account the distance between the ship SH and an obstacle OB. Furthermore, in this example, since there are fewer constraint conditions and evaluation functions compared to the first embodiment, the result of the optimization calculation can be calculated quickly.
[0062] (Modification 2 of the second embodiment) Next, a second modification of the second embodiment will be described. In the first modification of the second embodiment, a broken line map LM and a cost map CM are created based on map information including obstacle information, and the created cost map CM is subjected to a filtering process to create a filtered cost map FCM. In this example, after the cost map CM is created by the method of the first modification of the second embodiment, and before the filtering process is performed, the obstacle information (including the position information of other ships) is updated using a sensor (such as LIDAR) attached to the ship SH (not shown). Then, based on the updated obstacle information, an evaluation value c of 1 is assigned to the grid point where the added obstacle OB is located. (al,bl) and update the cost map CM. Finally, the updated cost map CM is filtered using the method shown in the first modified example of the second embodiment to create a filtering cost map FCM. The method of performing optimization calculations based on the filtering cost map FCM is the same as in the first modified example, and therefore will not be described here.
[0063] (effect) As described above, the route generation device 1 according to this embodiment updates the generated cost map CM based on obstacle information obtained from a sensor (such as LIDAR), performs filtering processing based on the updated predetermined distance from the obstacle OB, and generates a filtering cost map FCM. Then, based on the filtering cost map FCM, an evaluation function is acquired, an optimization calculation is performed, and a route R for the ship SH when the result of the optimization calculation is optimal is generated. According to the present disclosure, the route R navigable by the ship SH can be appropriately generated by taking into account the distance between the ship SH and the obstacle OB and incorporating obstacle information obtained by a sensor or the like. Furthermore, in this embodiment, since there are fewer constraint conditions and evaluation functions compared to the first embodiment, the result of the optimization calculation can be calculated quickly.
[0064] Third embodiment Next, a third embodiment will be described. In the third embodiment, the method of the second embodiment and the method of the first embodiment are combined to create a route R. In this embodiment, a route for the ship SH is first created using the method shown in the second embodiment, and the created route is set as a base route R0, and a route R is created using the method shown in the first embodiment using the base route R0.
[0065] That is, in the third embodiment, the route generation device 1 sets a route R based on the cost map CM in the same manner as in the second embodiment. The route R set in the same manner as in the second embodiment is appropriately referred to as a base route R0.
[0066] In the third embodiment, the condition setting unit 412 sets a constraint condition (third constraint condition) that restricts the distance between the position of the ship SH and the base route R0 to fall within a range of specified values.
[0067] The condition setting unit 412 sets the potential map PM (evaluation value for each position) in the same manner as in the first embodiment.
[0068] The optimization calculation executing unit 413 performs optimization calculation in the same manner as in the first embodiment, except that the constraint condition (third constraint condition) that the distance between the position of the ship SH and the base route R0 falls within a specified value range is satisfied, and calculates an optimized route R. That is, the optimization calculation executing unit 413 performs optimization calculation using the sum of evaluation values at each position on the route (first evaluation function) as an evaluation function while satisfying the constraint condition that the distance between the position of the ship SH and the base route R0 falls within a specified value range, and creates the route R of the ship SH when the result of the optimization calculation is optimal. Note that in the third embodiment, the constraint conditions (first and second constraint conditions) and the second to fifth evaluation functions specified in the first embodiment may also be used.
[0069] As described above, according to the third embodiment, the route R that the ship SH can navigate can be appropriately created. Furthermore, in this embodiment, compared to the first embodiment, the third constraint condition is added, which limits the range in which the optimization calculation is performed on the potential map PM, and therefore the result of the optimization calculation can be calculated quickly.
[0070] (effect) As described above, the route creation device 1 according to the first aspect of the present disclosure includes a broken line map creation unit 411 that detects the position of the representative point SP of an obstacle OB and creates a broken line map LM that indicates areas where the ship SH can navigate and areas where the ship SH cannot navigate based on the position of the representative point SP, a condition setting unit 412 that uses the broken line map LM to set, for each position on the broken line map LM, an evaluation value that becomes higher the farther away from the position of the obstacle OB, and an optimization calculation execution unit 413 that performs optimization calculations using an evaluation function based on the evaluation values and creates a route R for the ship SH when the result of the optimization calculation is optimal. According to the present disclosure, a route R on which the ship SH can navigate can be appropriately created.
[0071] A route creation device 1 according to a second aspect of the present disclosure is the route creation device 1 according to the first aspect, in which a condition setting unit 412 creates a potential map PM in which an evaluation value that increases with distance from an obstacle OB is assigned to each position on the broken line map LM, and an optimization calculation execution unit 413 performs optimization calculations using the sum of the evaluation values at the positions on the potential map PM through which the ship SH passes as an evaluation function. According to the present disclosure, a route R that the ship SH can navigate can be appropriately created by taking into account the sum of the evaluation values at the positions on the potential map PM through which the ship SH passes.
[0072] A route generation device 1 according to a third aspect of the present disclosure is the route generation device 1 according to the second aspect, in which the condition setting unit 412 sets a linear potential function whose value decreases with increasing distance from the obstacle OB based on two adjacent representative points SP, and creates a potential map PM by superimposing the linear potential functions for each combination of two adjacent representative points SP. According to the present disclosure, the potential map PM is created based on two adjacent representative points SP, and a route R navigable by the ship SH can be appropriately created by taking into account the created potential map PM.
[0073] A route generation device 1 according to a fourth aspect of the present disclosure is the route generation device 1 according to the second or third aspect, and the optimization calculation execution unit 413 performs the optimization calculation using the sailing time, the energy consumed by the ship SH, the sailing state of the ship SH, the rate of change of the input to the ship SH, and the sum of the evaluation values at the positions on the potential map PM that the ship SH passes through as evaluation functions. According to the present disclosure, it is possible to execute an optimization calculation that takes into account the sailing time, the energy consumed by the ship SH, the sailing state of the ship SH, the rate of change of the input to the ship SH, and the sum of the evaluation values at the positions on the potential map PM that the ship SH passes through.
[0074] A route creation device 1 according to a fifth aspect of the present disclosure is the route creation device 1 according to the fourth aspect, and the optimization calculation execution unit 413 performs optimization calculations so that the sailing time is as short as possible, the energy consumption of the ship SH is as small as possible, the sailing state of the ship SH is as stable as possible, the rate of change of the input to the ship SH is as small as possible, and the evaluation of the sum of the evaluation values is as high as possible. According to the present disclosure, optimization calculations can be executed so that the sailing time is as short as possible, the energy consumption of the ship SH is as small as possible, the sailing state of the ship SH is as stable as possible, the rate of change of the input to the ship SH is as small as possible, and the evaluation of the sum of the evaluation values is as high as possible.
[0075] A route generation device 1 according to a sixth aspect of the present disclosure is the route generation device 1 according to the first aspect, The condition setting unit 412 sets an evaluation value for each position on the broken line map LM, the evaluation value taking a first value at a position where an obstacle OB is present and a second value, which is evaluated higher than the first value, at a position where no obstacle OB is present, and creates a cost map CM to which an evaluation value is assigned for each position based on the evaluation value, and the optimization calculation execution unit 413 performs optimization calculation using the sum of the evaluation values at the positions on the cost map CM through which the ship SH passes as an evaluation function. According to the present disclosure, a route R on which the ship SH can navigate can be appropriately created, taking into account the sum of the evaluation values at the positions on the cost map CM through which the ship SH passes.
[0076] A route generation device 1 according to a seventh aspect of the present disclosure is the route generation device 1 according to the sixth aspect, and the optimization calculation execution unit 413 performs optimization calculation so as to maximize the evaluation of the sum of the evaluation values. According to the present disclosure, it is possible to execute optimization calculation so as to maximize the evaluation of the sum of the evaluation values at the positions on the cost map CM of the ship SH that are passed through.
[0077] A route generation device 1 according to an eighth aspect of the present disclosure is the route generation device 1 according to the sixth or seventh aspect, in which a condition setting unit 412 performs a filtering process on the cost map CM to generate a filtering cost map FCM, and an optimization calculation execution unit 413 performs optimization calculation using the sum of evaluation values at positions through which the ship SH passes on the filtering cost map FCM as an evaluation function. According to the present disclosure, it is possible to generate a route R that takes into account the distance between the ship SH and an obstacle OB so that the ship SH can navigate safely while avoiding the obstacle OB.
[0078] A route generation device 1 according to a ninth aspect of the present disclosure is the route generation device 1 according to the sixth or seventh aspect, in which a condition setting unit 412 acquires a route of the ship SH calculated by optimization calculation based on a cost map CM as a base route R0, sets a constraint condition that the distance between the base route R0 and the ship SH is within a specified value, creates a potential map PM using a broken line map LM in which an evaluation value is assigned to each position, with the evaluation value increasing with increasing distance from an obstacle OB, and an optimization calculation execution unit 413 performs optimization calculation using the sum of the evaluation values at the positions through which the ship SH passes on the potential map PM as an evaluation function and satisfies the constraint condition, and creates a route of the ship when the result of the optimization calculation is optimal. According to the present disclosure, the time required for the optimization calculation can be shortened compared to the first aspect.
[0079] A ship according to a tenth aspect of the present disclosure includes the route generation device 1 according to any one of the first to third, sixth and seventh aspects. According to the present disclosure, a navigable route R can be appropriately generated.
[0080] A route creation method according to an eleventh aspect of the present disclosure includes the steps of detecting the position of a representative point SP of an obstacle OB, constructing a broken line map LM indicating areas where the ship SH can navigate and areas where the ship SH cannot navigate based on the position of the representative point SP, setting, for each position on the broken line map LM, an evaluation value that becomes higher the farther away from the position of the obstacle OB is, and performing an optimization calculation using an evaluation function based on the evaluation value, and creating a route R for the ship SH when the result of the optimization calculation is optimal. According to the present disclosure, a route R on which the ship SH can navigate can be appropriately created.
[0081] A program according to a twelfth aspect of the present disclosure causes a computer to execute the steps of detecting the position of a representative point SP of an obstacle OB, constructing a broken line map LM indicating areas where the ship SH can navigate and areas where the ship SH cannot navigate based on the position of the representative point SP, setting, for each position on the broken line map LM, an evaluation value that becomes higher the farther away from the position of the obstacle OB is, and performing an optimization calculation using an evaluation function based on the evaluation value, and creating a route R for the ship SH when the result of the optimization calculation is optimal. According to the present disclosure, a route R where the ship SH can navigate can be appropriately created.
[0082] Although the embodiment of the present disclosure has been described above, the embodiment is not limited by the contents of this embodiment. In addition, the above-mentioned components include those that a person skilled in the art can easily imagine, those that are substantially the same, and those that are within the so-called equivalent range. Furthermore, the above-mentioned components can be appropriately combined. Furthermore, various omissions, substitutions, or modifications of the components can be made without departing from the gist of the above-mentioned embodiment. [Explanation of symbols]
[0083] 1 Route creation device S Starting position G Arrival position R pathway LM Line Map PM potential map CM Cost Map SH Ships OB Obstacles SP representative point W water
Claims
1. a polygonal line map constructing unit that detects positions of representative points of obstacles and constructs a polygonal line map showing areas where the ship is navigable and areas where the ship is not navigable based on the positions of the representative points; a condition setting unit that uses the polygonal line map to set an evaluation value for each position on the polygonal line map such that the evaluation value increases as the distance from the obstacle increases; an optimization calculation execution unit that performs optimization calculation using an evaluation function based on the evaluation value and creates a ship route that results in an optimal result of the optimization calculation; Including, Route creation device.
2. the condition setting unit creates a potential map in which an evaluation value, which becomes higher as the distance from the obstacle increases, is assigned to each position on the broken line map, and the optimization calculation executing unit performs the optimization calculation using a sum of the evaluation values at positions on the potential map through which the ship passes as an evaluation function. The route generation device according to claim 1 .
3. the condition setting unit sets a linear potential function whose value decreases as the distance from the obstacle increases based on two adjacent representative points, and creates the potential map by superimposing the linear potential function for each combination of the two adjacent representative points. The route generation device according to claim 2 .
4. the optimization calculation execution unit performs the optimization calculation using, as evaluation functions, a sailing time, an energy consumption of the ship, a sailing state of the ship, a rate of change of an input to the ship, and a sum of the evaluation values at positions through which the ship passes on the potential map; The route creation device according to claim 2 or 3.
5. the optimization calculation execution unit performs optimization calculations so that the sailing time is as short as possible, the energy consumption of the ship is as small as possible, the sailing state of the ship is as stable as possible, the rate of change of the input to the ship is as small as possible, and the evaluation of the sum of the evaluation values is as high as possible. The route generation device according to claim 4.
6. the condition setting unit sets an evaluation value for each position on the broken line map, the evaluation value taking a first value at a position where the obstacle is present and taking a second value having a higher evaluation value than the first value at a position where the obstacle is not present, and creates a cost map in which the evaluation value is allocated to each position based on the evaluation value, and the optimization calculation executing unit performs the optimization calculation using the sum of the evaluation values at positions through which the ship passes on the cost map as an evaluation function. The route generation device according to claim 1 .
7. The optimization calculation execution unit performs optimization calculation so as to maximize the evaluation of the sum of the evaluation values. The route generation device according to claim 6.
8. the condition setting unit performs a filtering process on the cost map to create a filtering cost map, and the optimization calculation executing unit performs the optimization calculation using a sum of the evaluation values at positions through which the ship passes on the filtering cost map as an evaluation function. The route creation device according to claim 6 or 7.
9. the condition setting unit obtains the ship's route calculated by optimization calculation based on the cost map as a base route, sets the distance between the base route and the ship within a specified value as a constraint condition, and creates a potential map using the broken line map in which an evaluation value, which becomes higher the farther away from the obstacle, is assigned to each position; the optimization calculation execution unit uses the sum of the evaluation values at the positions through which the ship passes on the potential map as an evaluation function, and performs the optimization calculation so as to satisfy the constraint condition, and creates a ship's route when the result of the optimization calculation is optimal. The route creation device according to claim 6 or 7.
10. A ship comprising the route planning device according to any one of claims 1 to 3, 6 and 7.
11. detecting positions of representative points of obstacles and constructing a polygonal line map showing areas where the vessel is navigable and areas where the vessel is not navigable based on the positions of the representative points; a step of setting, for each position on the polygonal line map, an evaluation value that increases as the distance from the obstacle increases using the polygonal line map; performing an optimization calculation using an evaluation function based on the evaluation value, and creating a ship route when the optimization calculation results in an optimal route; Including, How to create a route.
12. detecting positions of representative points of obstacles and constructing a polygonal line map showing areas where the vessel can navigate and areas where the vessel cannot navigate based on the positions of the representative points; a step of setting, for each position on the polygonal line map, an evaluation value that increases as the distance from the obstacle increases using the polygonal line map; performing an optimization calculation using an evaluation function based on the evaluation value, and creating a ship route when the optimization calculation results in an optimal route; to cause a computer to execute program.
Citation Information
Patent Citations
Control target generation device and ship-steering control device
WO2020111044A1
