KR102514765B1 - Method and server for providing course information of vessel - Google Patents

Abstract

The route determination server for determining the ship's route includes a database for storing information on a plurality of waypoints, and a plurality of different points for each waypoint based on latitude data and longitude data included in the information on the plurality of waypoints. A network graph generation unit that creates a plurality of network graphs by connecting waypoints, a port information receiver that receives information on a departure point and a destination from a user terminal, and selects one of a plurality of network graphs based on the information on the departure point and destination. and a route information transmitter for transmitting information on a route corresponding to the selected network graph to the user terminal.

Description

Server and method for determining vessel route {METHOD AND SERVER FOR PROVIDING COURSE INFORMATION OF VESSEL}

The present invention relates to a server and method for determining a ship's route.

The ship routing problem is basically a path optimization problem, and various algorithms have been proposed to solve it. For example, there is TREAD (Traffic Route Extraction and Anomaly Detection) algorithm for marine route search.

In addition, there is a method of unsupervised learning of recorded vessel position data using AIS (Automatic Identification System) technology, predicting an effective vessel movement path through this, and classifying a high-risk position. Although this method is useful for searching for and recommending a safe route by analyzing a route commonly traveled by ships, it has a disadvantage in that it does not provide an optimal route and does not reflect changing weather and tide information.

On the other hand, there is a way to approach the ship route optimization problem using the SPEA2 (Strength Pareto Evolutionary Algorithm) optimization algorithm. It is an algorithm that searches for a route optimized for multiple goals by considering the degree of risk. This SPEA2 optimization algorithm is an algorithm that searches for optimal routes under various conditions considering sea wind and current by reflecting weather information, but it takes a considerable amount of time to calculate the first set of routes, so there is a limit to actual use on board.

In addition, there is an attempt to solve the shortest path problem of a ship by utilizing the Dijkstra algorithm. However, Dijkstra's algorithm can only calculate short-distance ship routes, and when considering weather or tide information, the calculation becomes too complex, making it difficult to actually use it.

Furthermore, recently, an optimized route search method considering ocean current, sea traffic, anchorage, etc. has been proposed by improving the A* algorithm, which is an advanced version of Dijkstra's algorithm. Although the efficiency of optimal route calculation was achieved by using the A* algorithm, the optimization route search method using the A* algorithm is more about minimizing risks such as collision risk, traffic, and anchoring in a short-distance route than route optimization considering complex maritime conditions. The point of view was considered, and the simulation was also made only in a very short section, so the possibility of expansion to long-distance operation is low.

Korean Registered Patent Publication No. 10-1556723 (published on September 23, 2015)

The present invention derives an improved A* algorithm by substituting weather, sea wind information, and tidal information into route calculation using the existing A* algorithm to provide an artificial intelligence-based ship route optimization service using marine meteorological data, It is intended to provide an optimal ship route using the improved A* algorithm.

Specifically, the present invention may generate a plurality of network graphs by connecting a plurality of different waypoints for each of a plurality of waypoints, and recommend an optimal ship route to the user terminal using the generated plurality of network graphs.

However, the technical problem to be achieved by the present embodiment is not limited to the technical problems described above, and other technical problems may exist.

As a technical means for achieving the above-described technical problem, a route determination server for determining a route of a ship according to a first aspect of the present invention includes a database for storing information on a plurality of waypoints; a network graph generator for generating a plurality of network graphs by connecting a plurality of other waypoints for each waypoint based on latitude data and longitude data included in the information on the plurality of waypoints; a port information receiving unit for receiving information on a departure point and a destination from a user terminal; a network graph selector selecting one of the plurality of network graphs based on the information on the source and destination; and a route information transmitter for transmitting information on a route corresponding to the selected network graph to the user terminal.

According to a second aspect of the present invention, a method for determining a ship's route, performed by a route determination server, includes storing information about a plurality of waypoints; generating a plurality of network graphs by connecting a plurality of other waypoints for each waypoint based on latitude data and longitude data included in the information on the plurality of waypoints; Receiving information about a departure point and a destination from a user terminal; selecting one of the plurality of network graphs based on the information on the source and destination; and transmitting information on a route corresponding to the selected network graph to the user terminal.

The above-described means for solving the problems is only illustrative and should not be construed as limiting the present invention. In addition to the exemplary embodiments described above, there may be additional embodiments described in the drawings and detailed description.

According to any one of the above-described problem solving means of the present invention, the present invention connects a plurality of different waypoints for each of a plurality of waypoints to generate a plurality of network graphs, and uses the generated plurality of network graphs to optimize the ship. Routes may be recommended to user terminals. In addition, the present invention can provide a shortest path search while minimizing a search in an unnecessary part by setting a direction from a starting point to a destination.

1 is a block diagram of a route determination server according to an embodiment of the present invention.
2A to 2C are diagrams illustrating information on a plurality of waypoints stored in a database according to an embodiment of the present invention.
3 is a diagram for explaining a method of generating a plurality of network graphs according to an embodiment of the present invention.
4A to 4B are views for explaining a method for determining a ship's route according to an embodiment of the present invention.
5 is a flowchart illustrating a method of generating a plurality of network graphs for route determination according to an embodiment of the present invention.
6 is a flowchart illustrating a method of determining a ship route according to an embodiment of the present invention.

Hereinafter, embodiments of the present invention will be described in detail so that those skilled in the art can easily practice the present invention with reference to the accompanying drawings. However, the present invention may be embodied in many different forms and is not limited to the embodiments described herein. And in order to clearly explain the present invention in the drawings, parts irrelevant to the description are omitted, and similar reference numerals are attached to similar parts throughout the specification.

Throughout the specification, when a part is said to be "connected" to another part, this includes not only the case where it is "directly connected" but also the case where it is "electrically connected" with another element interposed therebetween. . In addition, when a certain component is said to "include", this means that it may further include other components without excluding other components unless otherwise stated.

In this specification, a "unit" includes a unit realized by hardware, a unit realized by software, and a unit realized using both. Further, one unit may be realized using two or more hardware, and two or more units may be realized by one hardware.

In this specification, some of the operations or functions described as being performed by a terminal or device may be performed instead by a server connected to the terminal or device. Likewise, some of the operations or functions described as being performed by the server may also be performed in a terminal or device connected to the corresponding server.

Hereinafter, specific details for the implementation of the present invention will be described with reference to the accompanying configuration diagram or process flow chart.

1 is a block diagram of a route determination server 10 according to an embodiment of the present invention.

Referring to FIG. 1, the route determination server 10 includes a database 100, a network graph generator 110, a port information receiver 120, a network graph selector 130, and a route information transmitter 140. can do. However, the route determination server 10 shown in FIG. 1 is only one implementation example of the present invention, and various modifications are possible based on the components shown in FIG.

Hereinafter, FIG. 1 will be described with reference to FIGS. 2A to 4B.

The database 100 may collect and store maritime meteorological information including ocean currents, depths, wave heights, wind speeds, wind powers, and the like for each maritime zone for the world's oceans provided by public and private sources.

The database 100 may store information on a plurality of waypoints. Here, the plurality of waypoints refer to points at which a plurality of ships cross in a plurality of routes through which a plurality of ships can navigate or significant points on a route. These plurality of waypoints are, for example, points through which ships pass when sailing between maritime zones, and may be changed due to the construction of a new port, the opening of a new route, or the installation of artifacts on the sea.

For example, referring to FIG. 2A , the database 100 may store latitude data and route data for each waypoint, and may store a list of adjacent waypoints connected to each waypoint. For example, the database 100 stores latitude data and route data for waypoint 1, and waypoints 2, 3, and 6 adjacent to waypoint 1 are connected to waypoint 1. You can map and save.

The information processing unit (not shown) subdivides the list of adjacent waypoints connected to each waypoint stored in the database 100 into information about each connected waypoint through a melt technique, and can process the data for future use. there is.

Referring to FIG. 2B, the database 100 is a relationship including distance values between other waypoints connected to each waypoint, latitude data and route data for the other connected waypoints, and connection line information (edge information) connected between waypoints. Information can be stored for each waypoint. Here, a distance value between two waypoints may be calculated through a predefined distance calculation function based on latitude data and longitude data of each of the two waypoints. At this time, the predefined distance calculation function may be defined as follows.

<predefined distance calculation function>

For example, the database 100 includes distance values between waypoints 1 and waypoint 2 connected to waypoint 1, edge information between waypoints 1 and 2, latitude data for waypoint 2, and Route data can be mapped to waypoint #1 and stored. In addition, the database 100 includes distance values between waypoint 1 and waypoint 3 connected to waypoint 1, edge information between waypoint 1 and waypoint 3, latitude data and route data for waypoint 3. can be mapped to waypoint 1 and stored.

On the other hand, when drawing a network graph in software or the like, a relationship matrix (or adjacency matrix) indicating whether each node is connected to another node or not is often used. Therefore, after expressing whether or not each node is connected to a node as a relationship matrix, the relationship matrix can be expressed as a network graph using a Python program, for example.

Referring to FIG. 2C , a relation matrix information generation unit (not shown) generates relation matrix information indicating whether each waypoint is connected to another waypoint by using the relation information stored in the database 100. can do. At this time, a network graph may be created in which each waypoint created through relation matrix information becomes a node and a connection line between each waypoint becomes an edge.

The network graph generator 110 may generate a plurality of network graphs by connecting a plurality of other waypoints connected to each waypoint using relational information and relational matrix information stored in the database 100 .

Referring to FIG. 3 together, the network graph generator 110 connects a plurality of other waypoints for each waypoint based on latitude data and longitude data included in information about a plurality of waypoints for each waypoint. You can create a network graph of

Here, each of a plurality of waypoints constituting the network graph is a node, and a connection line connecting each node is an edge. That is, the network graph generator 110 may create a network graph including nodes and edges.

The network graph generator 110 may calculate a distance between waypoints based on latitude data and longitude data of each waypoint connected to each waypoint, and may generate a network graph based on the calculated distance between waypoints.

For example, when waypoints connected to waypoint 1 are waypoint 2, waypoint 3, and waypoint 6, the network graph generator 110 provides relation information and relation matrix information stored in the database 100. Calculate distance values connecting waypoints #1, waypoint #2, waypoint #3, and waypoint #6 using A first network graph connecting the waypoint and the sixth waypoint may be created.

After changing the route problem to the graph path optimization problem, the network graph generator 110 may generate a plurality of network graphs by connecting a plurality of other waypoints connected to each waypoint using an optimization algorithm.

The network graph generation unit 110 creates a plurality of network graphs by connecting a plurality of other waypoints connected to each waypoint by utilizing weather information on ocean currents, depths, and weather of the world's seas provided by public and private sources. can

The network graph generator 110 may assign weights to edges between waypoints based on the calculated distance between waypoints. For example, the network graph generator 110 may assign a first weight to an edge between the corresponding waypoints because the greater the distance between the calculated waypoints, the greater the amount of fuel consumed and the time required for sailing. The network graph generation unit 110 may assign a second weight greater than the first weight to an edge between the corresponding waypoints because the smaller the distance between the calculated waypoints, the smaller the amount of fuel consumed and the time required for sailing. there is. As another example, the network graph generator 110 may assign different additional weights or adjust weights to edges between waypoints calculated based on marine weather information.

Here, the weight given to the edge between each waypoint (node) can be used as a heuristic distance of the improved A* algorithm (optimized route derivation algorithm). That is, the weight assigned to the edge between each waypoint may mean a heuristic distance calculated using latitude data and longitude data of each waypoint.

The network graph generation unit 110 reflects the maritime meteorological information (e.g., sea wind, current, speed and direction of waves, etc.) on the sea to the existing A* algorithm, thereby improving the A* algorithm (optimized route derivation algorithm). ) can be derived.

Here, the A* algorithm can be defined as follows.

< A* Algorithm>

The A* algorithm first selects the node with the smallest expected distance to the target point on the Openlist (i.e. f(x) combined with cost + heuristic function). Here, Openlist is a list in which all possible nodes on the path are added, and the expected distance function f(x) is the cost function g(x) corresponding to the sum of the distance consumption values of the paths traveled so far, and the current point and the target As the sum of h(x), which is a heruistic function for the expected distance to a point, it means the expected distance and fuel consumption value for the entire route from the departure port to the arrival port. If the node is the destination node, it means that the route search is complete, so the algorithm is terminated. Among the nodes adjacent to the corresponding node, nodes that do not belong to the Closelist are one of the possible paths, so they are added to the Openlist, and the expected distance f(x) to the destination of the corresponding adjacent nodes is calculated. If the adjacent node is already in the Openlist and the calculated f(x) value is smaller, it means that the current path is more optimal, so update the f(x) value and make the adjacent node and the corresponding node a parent-child relationship. connect If the above steps are repeated until path finding is completed, an optimized path according to the A* algorithm is derived.

In addition, the network graph generator 110 may reflect the estimated voyage time and fuel consumption for each of a plurality of routes corresponding to the plurality of network graphs to the improved A* algorithm. Through this, an optimized route can be derived using the improved A* algorithm.

The database 100 stores a plurality of network graphs generated by the network graph generator 110, and for each network graph, relationship information related to each network graph and distances and edges between a plurality of waypoints included in each network graph Information can be mapped and stored.

The port information receiving unit 120 may receive information about a ship's departure point and destination from a user terminal. For example, the ship's departure information includes the port name corresponding to the departure port from which the ship departs or the latitude and longitude information at which the departure port is located, and the ship's destination information includes the port name corresponding to the destination port to which the ship arrives or Latitude and longitude information at which the destination port is located may be included.

The network graph selection unit 130 may select one of a plurality of network graphs based on information on a source and a destination.

For example, the network graph selection unit 130 searches for information on waypoints corresponding to source information and waypoints corresponding to destination information using relationship information related to a plurality of network graphs stored in the database 100. can In addition, the network graph selector 130 may select a plurality of network graphs including a waypoint corresponding to the searched source information and a waypoint corresponding to the destination information among the plurality of network graphs stored in the database 100 .

For example, referring to FIG. 4A , when the waypoint corresponding to the source information is waypoint 11 and the waypoint corresponding to the destination information is waypoint 2374, the network graph selector 130 selects the database 100 ), search for a network graph with waypoint number 11 as the starting point and waypoint number 2374 as the destination among the plurality of network graphs stored in , and include it in the searched network graph along with the distance values between the plurality of waypoints included in the searched network graph. You can search the latitude data and route data of each waypoint.

The network graph selector 130 may select a network graph having the shortest path based on weights of a plurality of edges included in a plurality of network graphs including a waypoint corresponding to a starting point and a waypoint corresponding to a destination. For example, the network graph selector 130 may search a network graph having the shortest path using a shortest path search algorithm (eg, A* algorithm).

The network graph selector 130 may calculate expected voyage time and fuel consumption information for each network graph for a plurality of network graphs including a waypoint corresponding to a departure point and a waypoint corresponding to a destination.

The network graph selector 130 extracts a network graph having a distance value that is less than or equal to a preset threshold value from among a plurality of network graphs including waypoints corresponding to a starting point and waypoints corresponding to a destination, and extracts at least one network graph. An optimal network graph may be selected based on the required voyage time and fuel consumption information for the graph.

The network graph selector 130 extracts a network graph having a distance value that is less than or equal to a predetermined threshold value from among a plurality of network graphs including a waypoint corresponding to a starting point and a waypoint corresponding to a destination, and corresponds to the extracted network graph. An optimal network graph may be selected from network graphs extracted based on maritime weather information on a route to be traveled. Here, the maritime weather information may include, for example, at least one of wave height, wave direction, wind direction, surface pressure, swell height, swell direction, current, tropical typhoon, and ice cover. .

The network graph selector 130 extracts a network graph having a distance value that is less than or equal to a predetermined threshold value from among a plurality of network graphs including a waypoint corresponding to a starting point and a waypoint corresponding to a destination, and corresponds to the extracted network graph. An optimal network graph may be selected from network graphs extracted based on maritime traffic information on a route to be traveled.

The route information transmitter 140 may transmit information about a route corresponding to a network graph having the selected shortest path to a user terminal. For example, referring to FIG. 4B , the route information transmission unit 140 may display a route corresponding to the selected network graph on a map UI and transmit the route to the user terminal.

Here, the information on the route corresponding to the selected network graph may include, for example, voyage distance information expected according to the route, voyage time information, average sailing speed of the ship, fuel consumption information for the ship's operation, and the like. In addition, the information on the route corresponding to the selected network graph may include expected maritime weather information by operating date, current maritime weather information, maritime traffic information, sea depth information on the route, and the like.

For example, the weather forecast information provider (not shown) may reflect weather forecast information selected by the user terminal among information included in information on a route corresponding to the selected network graph to the sea of the map and provide the user terminal with the weather forecast information. there is.

For example, when the user terminal requests information on sea wave height, the weather forecast information providing unit (not shown) maps a map reflecting current wave height information as a color change of the sea level on a route corresponding to the selected network graph. may be provided to the user terminal. When the user terminal requests information on the direction of waves or wind on the sea, the weather forecast information providing unit (not shown) provides information on the direction of waves or wind on the sea of the map on the route corresponding to the selected network graph. It can be displayed and provided to the user terminal.

The weather forecast information providing unit (not shown) provides summary information of at least one weather forecast information for a route to the user terminal based on the information on the route corresponding to the network graph selected by the user terminal, and provides the user terminal with information about the route corresponding to the network graph selected by the user terminal. Upon receiving a detailed information request of weather forecast information for , detailed information of weather forecast information may be provided to the user terminal. Here, the summary information of the weather forecast information for the route may include, for example, a map indicating the location of a port corresponding to each departure point and destination, and wind and wave strength information for each date on the route. Detailed information of the weather forecast information for the route includes port name corresponding to the departure point and destination, latitude and longitude, port country information, local time information, etc., and wind direction and speed on the route by date. It may include wind weather information, wave weather information including wave direction and wave height by date, and visible weather information including current visible distance information of ports corresponding to departure and destination points.

Meanwhile, for those skilled in the art, each of the database 100, the network graph generator 110, the port information receiver 120, the network graph selector 130, and the route information transmitter 140 may be separately implemented, or one of them It will be fully understood that the above may be incorporated and implemented.

5 is a flowchart illustrating a method of generating a plurality of network graphs for route determination according to an embodiment of the present invention.

Referring to FIG. 5 , in step S501 , the route determination server 10 may store information on a plurality of waypoints in the database 100 . Here, the information on the plurality of waypoints may include latitude data and longitude data of the waypoints.

In step S503, the route determination server 10 may create a plurality of network graphs by connecting a plurality of other waypoints for each waypoint based on the latitude data and longitude data included in the information on the plurality of waypoints. In this case, a plurality of network graphs generated for each waypoint may be stored in the database 100 .

In the above description, steps S501 to S503 may be further divided into additional steps or combined into fewer steps, depending on the implementation of the present invention. Also, some steps may be omitted if necessary, and the order of steps may be changed.

6 is a flowchart illustrating a method of determining a ship route according to an embodiment of the present invention.

Referring to FIG. 6 , in step S601, the route determination server 10 may receive information about a departure point and a destination from a user terminal.

In step S603, the route determination server 10 may select one of a plurality of network graphs stored in the database 100 based on the information on the origin and destination.

In step S605, the route determination server 10 may transmit information on a route corresponding to the selected network graph to the user terminal.

In the foregoing description, steps S601 to S607 may be further divided into additional steps or combined into fewer steps, depending on an embodiment of the present invention. Also, some steps may be omitted if necessary, and the order of steps may be changed.

An embodiment of the present invention may be implemented in the form of a recording medium including instructions executable by a computer, such as program modules executed by a computer. Computer readable media can be any available media that can be accessed by a computer and includes both volatile and nonvolatile media, removable and non-removable media. Also, computer readable media may include all computer storage media. Computer storage media includes both volatile and nonvolatile, removable and non-removable media implemented in any method or technology for storage of information such as computer readable instructions, data structures, program modules or other data.

The above description of the present invention is for illustrative purposes, and those skilled in the art can understand that it can be easily modified into other specific forms without changing the technical spirit or essential features of the present invention. will be. Therefore, the embodiments described above should be understood as illustrative in all respects and not limiting. For example, each component described as a single type may be implemented in a distributed manner, and similarly, components described as distributed may be implemented in a combined form.

The scope of the present invention is indicated by the claims to be described later rather than the detailed description, and all changes or modifications derived from the meaning and scope of the claims and equivalent concepts thereof should be construed as being included in the scope of the present invention. .

10: route determination server
100: database
110: network graph generation unit
120: port information receiver
130: network graph selection unit
140: route information transmission unit

Claims (12)

In the route determination server for determining the route of the ship,
A database for storing information on a plurality of waypoints including points crossing a plurality of routes on which a plurality of ships can navigate or meaningful points on a route;
a network graph generator for generating a plurality of network graphs by connecting a plurality of other waypoints for each waypoint based on latitude data and longitude data included in the information on the plurality of waypoints;
a port information receiving unit for receiving information on a departure point and a destination from a user terminal;
a network graph selector selecting one of the plurality of network graphs based on the information on the source and destination; and
A route information transmitter for transmitting information on a route corresponding to the selected network graph to the user terminal.
Including,
The database further stores relationship information including distance values between the plurality of other waypoints connected to each waypoint, connection line information, and latitude data and route data for the plurality of other connected waypoints,
The network graph generator generates the plurality of network graphs using the relation information stored in the database;
The network graph generating unit derives an improved A* algorithm by reflecting marine weather information of the sea to the A* algorithm,
The network graph generation unit reflects the estimated voyage time and fuel consumption for each of a plurality of routes corresponding to the plurality of network graphs in the improved A* algorithm,
Wherein the network graph selector selects one of the plurality of network graphs using the improved A* algorithm.
According to claim 1,
Each of the plurality of waypoints is a node, and a connection line connecting each node is an edge;
The network graph generating unit generates a network graph including the node and the edge, the route determination server.
According to claim 2,
The network graph generator
calculating a distance between waypoints based on latitude data and longitude data of each of the plurality of waypoints;
And generating the network graph based on the calculated distance between waypoints.
According to claim 3,
The network graph generator
and assigning a weight to the edge based on the distance between the waypoints.
According to claim 3,
Wherein the database maps and stores distances between a plurality of waypoints included in each network graph for each network graph.
According to claim 4,
The network graph selector selects a network graph having the shortest path based on weights of a plurality of edges included in a plurality of network graphs including waypoints corresponding to the starting point and waypoints corresponding to the destination. Route decision server.
A method for determining a ship's route performed by a route determination server,
Storing information on a plurality of waypoints including points intersecting in a plurality of routes on which a plurality of ships can navigate or meaningful points on a route in a database;
generating a plurality of network graphs by connecting a plurality of other waypoints for each waypoint based on latitude data and longitude data included in the information on the plurality of waypoints;
Receiving information about a departure point and a destination from a user terminal;
selecting one of the plurality of network graphs based on the information on the source and destination;
Transmitting information on a route corresponding to the selected network graph to the user terminal
Including,
Storing in the database
further storing relationship information including distance values between the plurality of other waypoints connected to each waypoint, connection line information, and latitude data and route data for the plurality of other connected waypoints;
The step of generating the plurality of network graphs is
generating the plurality of network graphs using the relationship information stored in the database;
Deriving an improved A* algorithm by reflecting marine weather information of the sea to the A* algorithm; and
Further comprising reflecting the expected voyage time and fuel consumption for each of the plurality of routes corresponding to the plurality of network graphs to the improved A* algorithm,
The selection step is
The step of selecting one of the plurality of network graphs using the improved A* algorithm.
According to claim 7,
Each of the plurality of waypoints is a node, and a connection line connecting each node is an edge;
The step of generating the plurality of network graphs is
The route determination method comprising generating a network graph including the nodes and edges.
According to claim 8,
The step of generating the plurality of network graphs is
calculating a distance between waypoints based on latitude data and longitude data of each of the plurality of waypoints; and
And generating the network graph based on the calculated distance between waypoints.
According to claim 9,
The step of generating the plurality of network graphs is
and assigning a weight to the edge based on the distance between the waypoints.
According to claim 9,
The route determination method further comprising mapping and storing distances between a plurality of waypoints included in each network graph for each network graph.
According to claim 10,
The selection step is
Selecting a network graph having the shortest path based on weights of a plurality of edges included in a plurality of network graphs including a waypoint corresponding to the starting point and a waypoint corresponding to the destination, How to decide.

Images