JP2005140664A - Route search device - Google Patents

Abstract

<P>PROBLEM TO BE SOLVED: To efficiently make a route search, when a plurality of moving objects exist. <P>SOLUTION: A route searching device 100 forms a label affixed with required time corresponding to a route for each moving object from the place of departure up to a destination N4 successively, and finishes a search at the point of time, when all the moving objects reach the destination N4, and a route whose required time is the shortest is determined. A label 307 represents a label formed, when a car (A) has moved to N3 after passing L11, and a label 304 represents a label formed when a person B has moved to N3, after passing L12. In this case, the device 100 forms a new label 310, representing a moving object riding together, representing that the person B has ridden the car (A) together. The device 100 makes a route search, by successively forming labels of all the moving objects including moving objects riding together, and finishes the route search, when all the moving objects reach the destination N4, whether or not each object is a separate moving object or a moving object riding together. <P>COPYRIGHT: (C)2005,JPO&NCIPI

Description

  The present invention relates to a route search device that searches for a route to a destination.

  2. Description of the Related Art Navigation systems that use map data (hereinafter referred to as electronic map data) that is digitized so as to be usable by a computer, input a departure point and a destination, search for a route, and are guided are becoming widespread. In such a route search, there may be a case where it is desired to search for a plurality of moving objects, taking into account waiting time and the like. In recent years, in a navigation system, for example, when there are a plurality of moving objects such as people and cars, the route is in any pattern, such as a pattern in which each moving object goes directly to the destination or a pattern in which the moving objects are waiting together. I was going to explore. A Dijkstra method is an example of the route search method.

Japanese Patent Laid-Open No. 10-281882

  However, in the conventional route search method, each mobile unit determines which pattern can be reached in a short time: a pattern that directly goes to the destination, or a pattern that joins in the middle and then goes to the destination. It was difficult to do. Also, when a plurality of people are picked up by a plurality of cars, it is difficult to determine which car is efficient to pick up which person to meet and move. In addition, when moving while waiting, there is a problem in that it becomes complicated as the number of moving objects increases, and a burden is placed on the user.

  The present invention has been made in view of the above-described problems, and an object of the present invention is to provide a technique for efficiently performing a route search when there are a plurality of moving objects.

In order to solve at least a part of the problems described above, the present invention provides:
In a route search device that searches for routes of a plurality of mobile objects having the same destination,
A reference section that references map data composed of nodes and links;
An input unit for inputting a starting point and a destination in the map data of the plurality of moving bodies;
Based on the map data, the departure place and the destination, a route search unit for individually searching for the route of each mobile unit;
In the route search, at the node through which at least two or more of the plurality of moving bodies pass together, a combined moving body in which the two or more moving bodies move together is generated and added as the moving body The gist is to include a united mobile generation unit.

  Examples of the moving body include a car and a person. The combined moving body includes a moving body in which a person rides in a car and moves together. It is not necessarily limited to the case where a person is in a car. A moving object in which one car is loaded and towed by another car, or one of two cars is parked and all of them are transferred to the other car. And so on. As the moving speed of the combined moving body, it is preferable to use the fastest moving speed among the moving bodies constituting the combined moving body because the moving speed after joining is increased.

  By adopting such a configuration, a user can generate a coalesced mobile body without specifying a meeting place and a mobile body to join, and perform a route search including the coalesced mobile body. This improves convenience.

  In the present invention, the route search unit may perform the search using a Dijkstra method. In this way, it is possible to perform a route search in which each mobile object is evaluated according to a common criterion by setting cost or the like.

  In the route search device of the present invention, the route search unit is configured such that when all of the plurality of mobile bodies arrive at the destination in the form of the combined mobile body or each single mobile body, The search may be terminated. Since the combined moving body is composed of a plurality of moving bodies, even if each moving body does not arrive at the destination individually, it is only necessary to arrive at the destination as a combined moving body. In this way, it is not necessary to perform a route search until all the moving bodies reach the destination, and the search efficiency can be improved.

In the route search device according to the present invention,
The united moving body generation unit may control generation of the united moving body based on a predetermined condition.

  The predetermined condition may be, for example, a combination of moving objects, the number of persons that can be boarded by the moving objects, node attribute information, and the like. Among these, as a combination of moving bodies, for example, a person rides in a car, one car loads and pulls the other car, one of two cars is parked and moved to the other, etc. This is a matter relating to whether or not the moving bodies can merge with each other. Further, the node attribute information includes, for example, a matter regarding whether the place is appropriate or not suitable for waiting. In this way, it is possible to flexibly and efficiently generate a passenger moving body, and convenience is improved.

  In the route search device of the present invention, the united mobile body generation unit may limit the generation of the united mobile body having the same united mobile body to a predetermined number or less. Here, the same union moving body refers to the same moving body constituting the union moving body. By so doing, it is possible to suppress a decrease in route search efficiency due to an increase in the number of moving bodies, and it is possible to improve convenience.

  The route search apparatus of this invention WHEREIN: The said union moving body production | generation part is good also as deleting either of the moving bodies which comprise the said union moving body. For example, in a node through which both a person and a vehicle pass, a combined moving body composed of these moving bodies may be generated and one of the moving bodies may be deleted.

  By so doing, it is possible to suppress a decrease in route search efficiency due to an increase in the number of moving bodies, and it is possible to improve convenience. From the viewpoint of suppressing an increase in the number of moving objects, any moving object may be deleted, but if a moving object with a low moving speed is deleted, for example, the same route after passing through the same node When passing the route, it is possible to omit the route search for a moving body with a slow moving speed that clearly delays the arrival time, thereby improving convenience. Such a route search method is particularly effective when, for example, a route search with the shortest required time is performed.

In the route search apparatus of the present invention,
It is good also as providing the path | route determination part which determines the path | route of these several mobile bodies based on the said search result of all the mobile bodies including the said boarding mobile body.

  In this way, for example, it is possible to evaluate and determine which is preferable for a certain mobile body, which is a route to the destination alone or a route to the destination as a combined mobile body, and convenience is improved. Examples of the evaluation criteria include travel distance and required time.

  The present invention does not necessarily have all the various features described above, and may be configured by omitting some of them or combining them appropriately. The present invention can be configured as a route search method in addition to the route search device described above. Further, the present invention can be realized in various modes such as a computer program for the computer to perform the above-described route search, a recording medium on which the program is recorded, and a data signal that includes the program and is embodied in a carrier wave. . In addition, in each aspect, it is possible to apply the various additional elements attached | subjected previously.

  When the present invention is configured as a computer program or the program as a recording medium or the like, it may be configured as an entire program for controlling the operation of the route search apparatus, or only the portion that performs the function of the present invention is configured. It is good. The recording medium includes a flexible disk, a CD-ROM, a DVD-ROM, a magneto-optical disk, an IC card, a ROM cartridge, a punch card, a printed matter on which a code such as a barcode is printed, a computer internal storage device (RAM or Various types of computer-readable media such as a memory such as a ROM and an external storage device can be used.

Hereinafter, embodiments of the present invention will be described in the following items.
A. Example:
A1. System overview:
A2. Function block
A3. Route search process:
A3-1. Route search process:
A3-2. Detailed route search process:
A3-3. Route notification processing:
B. Variation:

A. First embodiment:
A1. System overview:
FIG. 1 is an explanatory diagram illustrating a system overview in an embodiment of the present invention. The route search system 1000 includes a computer 100 and a navigation system 10, and the computer 100 and the navigation system 10 are connected via the Internet INT. The navigation system 10 inputs a starting point, a destination, and a moving body such as a car or a person to the computer 100. The computer 100 is constructed with the route search device of the present invention, performs a route search based on the input, and notifies the navigation system 10 of the route search result. Hereinafter, the computer 100 is referred to as a route search device 100.

  FIG. 1 also shows a schematic diagram 200 in which the route search device 100 performs route search using the electronic map data 210. The electronic map data 210 includes links representing roads and nodes representing road end points. In the figure, N1 to N4 indicate nodes, and L10 (20) to L14 (8) indicate links. (20) in the link L10 (20) indicates an evaluation value such as the distance of the corresponding link, the required time, ease of passage, and the occurrence frequency of a traffic jam. As shown in the figure, in this embodiment, the moving speed of the car is “4” and the moving speed of the person is “1”. A numerical value obtained by dividing the evaluation value by the moving speed corresponds to the required moving time of each moving body, and this is used as a link cost for route search. Further, in this embodiment, a car A and a person B are designated as moving bodies. The car A has N1 and the person B has N2 as a starting place, and the destination of these moving bodies is N4. .

  An outline of a route search method performed by the route search device 100 will be described. Details will be described later. The labels with the required time corresponding to the route from the starting point of each moving body to the destination N4 are sequentially generated. The label 300 includes an identifier 300a, a traveling vehicle identifier 300b, and a required time 300c. In the identifier 300a, an identifier “A” indicating that the label is the label of the car A is set. In the riding vehicle identifier 300b, when a riding vehicle is generated, an identifier of the riding vehicle is set. The required time 300c indicates the required time for movement. Since the car A is in the state of the departure place N1, the travel time is indicated as “0”. In addition, a node number 300d indicating which node the label is generated is set below the label 300. In this embodiment, the node number is displayed as “1” in which “N” of “N1” representing the node is omitted. Although not shown, each label is set with a node number indicating from which node it has moved as attribute information. As shown in the figure, a label 307 represents a label when the car A has passed L11 and moved to N3, and a label 304 represents a label when the person B has passed L12 and moved to N3. Represents. In such a case, the route search device 100 generates a new label 310 that represents the traveling vehicle on which the person B rides the car A. In the label 310, since the person B rides on the car A, the identifier indicates “A” representing the car A, and the passenger moving body identifier indicates “B” representing the person B. The required time is the longer of either the car A or the person B. In this embodiment, the required time is “4”, so the travel time is indicated as “4”.

  The route search apparatus 100 performs route search by sequentially generating labels of all moving objects including the passenger moving object, and regardless of whether all moving objects are individual moving objects or passenger moving objects. The route search is terminated when arriving at N4. That is, when the boarding vehicle arrives at the destination N4, both the car A and the person B riding in the car A have arrived at the destination, and the car A and the person moving individually Even if all of B have not arrived at the destination, in fact, all the moving bodies have arrived at the destination. Therefore, the search efficiency can be improved by terminating the route search when all the mobile objects have arrived at the destination in any manner.

A2. Functional Block FIG. 2 is an explanatory diagram illustrating functional blocks of the route search apparatus 100 in the present embodiment. The route search device 100 is configured as a part of the main control unit 101, the map DB 102, the map data reference unit 103, the communication unit 104, the route determination unit 105, the route search unit 106, and the route search unit 106. Mobile unit management unit 107 and search condition storage unit 108. These functional blocks are configured by software. It may be configured as hardware.

  The main control unit 101 has a function of controlling each functional block. The map DB 102 stores electronic map data. The map data reference unit 103 has a function of referring to the electronic map data in the map DB 102 based on a reference request from the route search unit 106. The communication unit 104 has a function of communicating with other devices such as the navigation system 10, receives input of information such as a departure point and a destination necessary for route search, and passes them to other functional blocks.

  The route search unit 106 performs route search by referring to the electronic map data via the map data reference unit 103 based on the information such as the departure place delivered from the communication unit 104. The mobile object management unit 107 is configured as a part of the route search unit 106. When there are nodes through which a plurality of mobile objects pass in the route search, the mobile object management unit 107 is configured based on the riding mobile object generation condition 109. The mobile body is integrated into a single mobile body to generate a passenger mobile body, and the mobile body is deleted.

  The passenger moving body generation condition 109 is also shown in FIG. The rider moving body generation condition 109 includes a check box CB that indicates a condition to be used, a condition No that is uniquely assigned to the condition, and a rider moving object generation condition. As shown in the figure, the route search is performed so that the check box CB2 is checked and the condition No. “2”, which is the same-chosen moving object generation condition “generates only one same-moving moving object composed of the same moving objects”. Shows you to do. It is good also as a plurality of same-seat moving body generation conditions. In addition, it is possible to set conditions so as to generate a passenger moving body only for a specific moving body combination, or when “highway interchange” or the like is set as node attribute information, Since it is inappropriate for waiting, such a node may not generate a passenger moving body.

  Note that the setting of the node attribute information may be appropriate not only when waiting is inappropriate but also when waiting is appropriate. In this case, the traveling vehicle is generated only when there is an appropriate setting for waiting. Suitable places for meeting include, for example, “convenience store”, “road station”, and the like.

  The route determination unit 105 has a function of determining a route having the shortest required time from the route search result and notifying the navigation system 10 via the communication unit 104.

A3. Route search process:
A3-1. Route search process:
FIG. 3 shows a flowchart for explaining the route search processing in this embodiment. When the route search device 100 receives input of information necessary for the route search such as the moving body, the departure place, and the destination from the navigation system 10 (step S10), the route search device 100 refers to the electronic map data required for the route search (step S11). ), Route search is performed (step S12). Details of the route search processing will be described later.

  Next, the route search device 100 determines a route having the minimum required time from the route search result, and notifies the navigation system 10 (step S13). The result notification process will be described later.

A3-2. Detailed route search process:
FIG. 4 is a flowchart for explaining the details of the route search processing in the present embodiment. This corresponds to the processing performed by the route search device 100 in step S12 of FIG. In addition, FIGS. 5 and 6 schematically show processing performed in each step.

  The route search device 100 creates a candidate label (step S20), and determines a label having the minimum required time among the candidate labels as a confirmed label (step S21). When there are a plurality of labels having the minimum required time, the label is arbitrarily determined from the labels. An explanatory diagram of the processing according to FIG. 5 is shown.

  FIG. 5 is an explanatory diagram schematically illustrating label generation processing in the present embodiment. The route search table 250 includes No indicating a processing step, a generated candidate label group, and a confirmed label group.

  In No “1”, labels 300 and 301 at the departure node of the car A and the person B are generated and set as candidate labels. Since labels 300 and 301 have the same required time of “0”, label 301 is arbitrarily set as a definitive label. The point P given to the upper part of the label 301 indicates that the label 301 is a confirmed label.

  No “2” indicates that the label 301 set as the confirmed label in No “1” is added to the confirmed label group from the candidate label group.

  Returning to FIG. Next, the route search device 100 refers to the confirmed label (step S22), and determines whether or not all moving objects have arrived at the destination (step S23). If all the mobile objects have not arrived at the destination (step S23: NO), whether or not there are other confirmed labels with the same generated node and different moving means among the confirmed labels. Is determined (step S24). If it does not exist (step S24: NO), the process returns to step S20, and a candidate label is generated based on the confirmed label determined immediately before.

  As illustrated in FIG. 5, No “3” indicates that a new candidate label is generated based on the label 301 added to the confirmed label group in No “2”. Since the person B who is the moving object represented by the label 301 is located at N2, N1, N3, and N4 are listed as candidate nodes for the movement destination. The route search device 100 adds labels 303, 304, and 305 generated when the person B moves to these nodes to the candidate label group, as indicated by a one-dot chain line 400 in the figure. Next, the route search apparatus 100 sets the label 300 having the minimum required time from the labels 300, 303, 304, and 305 as a confirmed label.

  No. “4” indicates that the label 300 set as the confirmed label in No “3” is added to the confirmed label group from the candidate label group.

  No. “5” indicates that a new candidate label is generated based on the label 300 added to the confirmed label group immediately before, similarly to the process of No “3”. Labels 306 and 307 indicated by alternate long and short dash lines 401 in the figure are labels newly added as candidate labels. The route search device 100 sets a label 304 having a minimum required time as a confirmed label from the labels 303, 304, 305, 306, and 307. In No “6” to No “8”, the same processing as that in No “4” to No “5” is performed, and thus the description thereof is omitted.

  Returning to FIG. 4, the explanatory diagram is continued. When the generated node is the same among the confirmed labels and there is another confirmed label with a different moving means (step S24: YES), the route search device 100 refers to the riding moving object generation condition 109 ( Step S25), based on this, it is determined whether or not to generate a label representing the passenger moving body (Step S26). If it is to be generated (step S26: YES), a label representing the same moving body is generated from these confirmed labels and added as a confirmed label (step S27), and the process returns to step S20 to repeat the process. As a result of this processing, the passenger moving body is newly added to the route search target. When the passenger moving body is not generated (step S26: NO), the process returns to step S20 and is repeated.

  As illustrated in FIGS. 5 and 6, the route search device 100 causes one mobile body to ride on the other mobile body when a label generated at the same node exists in the confirmed label group. A passenger moving object is generated and added as a confirmed label. As indicated by No “8”, since the labels 304 and 307 surrounded by the broken line 500 are generated at the same node N3, in the next step No “9”, the route search device 100 has a slow moving speed. A label 310 representing a passenger moving body where B is on the car A is generated and added as a confirmed label. The required time of the passenger moving body is the longer required time of each moving body constituting the passenger moving body. Since the required time up to that time for the car A and the person B constituting the passenger moving body is “4”, the required time of the label 310 is “4”. The required time will be used.

  No. “10” indicates that a new candidate label is generated based on the label 310 added to the confirmed label group immediately before, similarly to the process of No “3”. In this embodiment, for the sake of simplicity, it is assumed that the link once passed by the moving body cannot be reversed, and the traveling mobile body does not pass L11 through which the car A passes and L12 through which the person B passes. That is, a label 311 indicated by a one-dot chain line 403 in the figure is newly added as a candidate label. Thereafter, the same processing as No. “4” to No. “9” is repeated until No. “13”.

  Returning to FIG. Next, the route search device 100 refers to the confirmed label, and when all the mobile objects have arrived at the destination (step S23: YES), the route search processing is terminated.

  As shown in FIG. 6, with No “13”, there is a label 314 that has arrived at the destination N4 among the labels set as confirmed labels. Such a label 314 is a traveling vehicle in which a person B rides on the car A, and at this time, all the moving bodies have arrived at the destination N4. The route search apparatus 100 ends the search when No. “13” because all the mobile bodies end the search when they arrive at the destination in any manner.

  In the confirmed label group displayed in No. “13”, the node number before movement set in the attribute information of each confirmed label is referred to, and a route search result is obtained. That is, the car A passes the route N1-N3-N4 and carries the person B on N3. The person B passes the route N2-N3-N4 and rides on the car A at N3.

A3-3. Route notification processing:
FIG. 7 is a flowchart for explaining the route search result notification processing in this embodiment. The process of the route search device 100 is a process corresponding to step S13 in FIG.

  The route search device 100 refers to the route search result (step S30) and transmits the result to the navigation system 10 (step S31). In this embodiment, since one route is searched for each moving body, the navigation system 10 is notified without evaluating the searched route. However, when a plurality of routes are searched, each route is searched. For example, the route of the shortest required time may be notified.

  When the navigation system 10 receives the search result (step S40), the navigation system 10 displays the search result on the display of the navigation system 10 (step S41). As shown in the drawing, the route of each moving body and the junction point are displayed, and the arrival time and the required time are also displayed.

  According to the route search device 100 of the first embodiment described above, even if the user does not specify the meeting place and the moving body to be joined, the traveling body is generated in the route search process, and the traveling body is also included. Since the route search of the mobile body is performed, the route search can be performed efficiently, and the convenience is improved.

  In the above-described embodiment, the route search is performed for two vehicles, that is, one car and one person. However, a route search can be performed by specifying a plurality of cars and a plurality of people. In such a case, if the generation of the passenger moving body is appropriately suppressed by the passenger moving body generation condition 109, it is possible to suppress a decrease in processing efficiency due to an increase in the moving bodies.

B. Variation:
In the embodiment described above, the traveling vehicle generation condition 109 is set to a condition for generating a traveling vehicle, but in this modification, it is considered in the route search process together with the generation of the traveling vehicle. The search condition to be set was set.

B1-1. Search conditions:
FIG. 8 is an explanatory diagram illustrating search conditions in this modification. The search condition 110 is assumed to be stored in the search condition storage unit 108 in the same manner as the traveling vehicle generation condition 109. The route search unit 106 refers to the search condition 110 and performs a route search based on the condition.

  For example, as shown in condition No. “1”, traffic restrictions such as one-way due to construction and prohibition of traffic outside the designated direction may be set. In this way, when the vehicle picks up a person, even if there are traffic restrictions or the like in the immediate vicinity of the person, it is possible to perform a route search in consideration of them and to pick up the person more easily. For example, when there is one-way traffic restriction and the vehicle has to make a detour, a person may move to a road that is not one-way.

  Further, as shown in the condition No. “2”, the movement speed of the person may be set so that the route search is performed at a speed slower than the actually set movement speed. In this way, the movement distance of the person can be limited, and the movement load of the person can be reduced, such as when the weather is bad or when carrying a baggage.

  Further, as shown in the condition No “3”, for the human label, the travel time from the departure place is limited. For example, the candidate label may not be generated after 10 minutes or more have elapsed. In this way, the human load can be reduced for the predetermined time, and convenience is improved.

  Further, as indicated by condition No. “4”, the movement speed of the person may be set to “0”. In this way, since the person does not move from the departure place, the person does not have to walk and the load can be reduced. In addition, the generation of the label can be omitted in terms of processing, and the search efficiency can be improved.

  In the above-described embodiment, a vehicle / one vehicle and a person / one person are designated as the moving body. In this modification, when the moving body is a car / two cars, a person / two people, the condition No “3” (only one person can ride in each car) set in the riding-car moving body generation condition 109, and The route search satisfying the condition No. “4” (the person's moving speed is set to “0”) set in the search condition 110 is performed. The configuration of the route search apparatus 100 is the same as that in the embodiment.

B1-2. Route search pattern:
FIG. 9 is an explanatory diagram showing electronic map data in the present modification. The electronic map data 600 includes nodes N1 to N5 and links L20 (44) to L28 (48). The moving speed of the car is 4, and the moving speed of the person is 1. As shown in the figure, the car A starts from N1, the car B starts from N2, the person C starts from N3, and the person D starts from N4.

  The route search device 100 has a condition No. “3” in the passenger moving body generation condition 109 that “only one person can get on each vehicle” and a condition “No. 4” in the search condition 110 that sets the movement speed of the person to 0. Route search is performed so as to satisfy the condition “ If a search is performed under these conditions, the persons C and D will not move from the starting point. In addition, even if the car A takes a route passing through the nodes N3 and N4, a passenger moving body on which the people C and D are carried together is not generated. Therefore, for example, a route search such as a pattern in which people C and D ride together in a car A, a pattern in which people C and D ride together in a car B, and a pattern in which people C and D arrive independently at a destination, etc. Not done.

  The route search apparatus 100 refers to the search condition 110 before “candidate label generation” shown in step S20 of FIG. 4, determines whether or not to generate a candidate label, and performs route search.

  FIG. 10 is an explanatory diagram illustrating the route search result in this embodiment. As shown in the figure, pattern 1 is a pattern that “car A goes to pick up person C, and car B goes to pick up person D”. The route of the car A is N1-N3-N5, and the required time of the route is “12”. The route of the car B is N2-N4-N5, and the required time of the route is “13”.

  Similarly, pattern 2 is a pattern that “car A goes to pick up person D and car B goes to pick up person C”. The route of the car A is N1-N4-N5, and the required time of the route is “16”. The route of the car B is N2-N3-N5, and the required time of the route is “17”.

  When the search condition 110 is taken into consideration, the patterns that can be searched are the above-described two patterns. However, in the present invention, the search is performed when each mobile object arrives at the destination in the form of either an individual or a passenger mobile object. Therefore, the pattern 1 that is the shortest path is searched first, and the process ends. It is also possible to search all routes and let the user select which route to use.

  As in the modification described above, by setting the search conditions in advance, the number of mobile objects to be searched can be suppressed, and search efficiency can be improved. When a route search is performed simultaneously with a plurality of mobile objects, the number of mobile objects increases, the search pattern increases, and the processing efficiency decreases. This is particularly useful when it is expected to increase. In addition, the route search device 100 can perform flexible route search based on various search conditions, so that convenience can be improved.

B2. Modification 2:
Moreover, it is good also as providing an additional function in the above-mentioned Example and modification. For example, a route search may be performed in consideration of luggage. That is, when the person G puts the baggage at another point, the route is searched by using the baggage as the moving body having the movement speed “0”. It is also possible to set a person G who is the owner as attribute information in the package, and perform a route search so that the vehicle on which the person G gets passes the package point. In such a case, as a condition for generating a moving body on which a load is placed, only when a person G is on the moving body that passes the point of the load, that is, when a specific combination of the person G and the load is satisfied. If the traveling vehicle is generated, a candidate label is not generated anew even if a vehicle other than the person G rides a vehicle, so that the search efficiency can be improved.

B3. Modification 3:
Moreover, since the required time to the meeting place of each moving body is obtained from the search result, the departure time of each moving body may be notified. Further, the departure time may be notified in consideration of the ease of waiting at the meeting place, the ease of parking the car, the weather, and the like. The “waiting state” includes, for example, that a car cannot park or park for a long time in the case of a roundabout at a station or along a road. In such a case, it is preferable to calculate the departure time of the person so that the waiting person always arrives first at the meeting place. “Considering the weather” includes calculating the departure time so that the car arrives at the meeting place in the case of bad weather such as rainy weather.

B4. Modification 4:
In addition, the moving body management unit 107 of the route search apparatus 100 may be provided with a function of deleting a moving body having a low moving speed when a traveling moving body is generated in advance. For example, when a passenger moving body is generated from two moving bodies, that is, a person and a vehicle, it is possible to delete a person whose movement speed is slow. In this way, when passing through the same route after passing through the same node, it is possible to omit the route search for a moving body with a slow moving speed that clearly delays the arrival time, thereby improving convenience.

  Although various embodiments of the present invention have been described above, the present invention is not limited to these embodiments, and it goes without saying that various configurations can be made without departing from the spirit of the present invention.

It is explanatory drawing which illustrates the system outline | summary in an Example. It is explanatory drawing which illustrates the functional block of the route search apparatus in an Example. It is a flowchart explaining the route search process in a present Example. It is a flowchart explaining the route search process details in a present Example. It is explanatory drawing which illustrates typically the label production | generation process in a present Example. It is explanatory drawing which illustrates typically the label production | generation process in a present Example. It is a flowchart explaining the route search result notification process in a present Example. It is explanatory drawing which illustrates the search conditions in this modification. It is explanatory drawing which shows the electronic map data in this modification. It is explanatory drawing which illustrates the route search result in this modification.

Explanation of symbols

1000 ... route search system 10 ... navigation system 100 ... route search device 101 ... main control unit 102 ... map DB
DESCRIPTION OF SYMBOLS 103 ... Map data reference part 104 ... Communication part 105 ... Route determination part 106 ... Route search part 107 ... Moving body management part 108 ... Search condition storage part 109 ... Riding together Field generation condition 110 ... Search condition 200 ... Schematic diagram 210 ... Electronic map data 250 ... Route search table 303-314 ... Label 300a ... Identifier 300b ... Riding passenger vehicle identifier 300c ... Time required 400,401,403 ... Dash-dot line 500 ... Dashed line 600 ... Electronic map data

Claims (10)

A route search device for searching for routes of a plurality of mobile bodies having the same destination,
A reference section that references map data composed of nodes and links;
An input unit for inputting a starting point and a destination in the map data of the plurality of moving bodies;
Based on the map data, the departure place and the destination, a route search unit for individually searching for the route of each mobile unit;
In the route search, at the node through which at least two or more of the plurality of moving bodies pass together, a combined moving body in which the two or more moving bodies move together is generated and added as the moving body A route search device comprising a united mobile generation unit. The route search device according to claim 1,
The route search device, wherein the route search unit terminates the search when all of the plurality of moving bodies have arrived at the destination in the form of the combined moving body or each single moving body. A route search device according to claim 1 or claim 2, wherein
The united moving body generation unit controls generation of the united moving body based on a predetermined condition,
The route search device, wherein the predetermined condition is a condition based on a combination of moving bodies constituting the combined moving body. The route search device according to claim 3,
The union moving body generation unit is a route search device that restricts the generation of union moving bodies having the same moving body that constitutes the union moving body to a predetermined number or less. A route search device according to any one of claims 1 to 4,
The united mobile body generation unit is a route search device that generates the united mobile body and deletes at least a part of the mobile body constituting the united mobile body. The route search device according to claim 5,
The union moving body generation unit is a route search device that deletes a moving body having a slow moving speed from among the moving bodies constituting the union moving body. The route search device according to any one of claims 1 to 6,
A route search device comprising: a route determination unit that determines routes of the plurality of mobile bodies based on the search results of all mobile bodies including the combined mobile body. A route search method for searching for routes of a plurality of mobile objects having the same destination,
As a process executed by the computer,
(A) referring to map data composed of nodes and links;
(B) inputting a starting point and a destination in the map data of the plurality of moving objects;
(C) a step of individually searching for a route of each moving body based on the map data, the departure place, and the destination;
(D) In the route search, at a node through which at least two or more moving bodies of the plurality of moving bodies pass together, a combined moving body in which the two or more moving bodies move together is generated and added as the moving body. A route search method comprising the steps. A computer program for causing a computer to search for routes of a plurality of moving objects having the same destination,
A function to refer to map data composed of nodes and links,
A function of inputting a starting point and a destination in the map data of the plurality of moving bodies;
Based on the map data, the starting point, and the destination, a function for individually searching the route of each mobile unit;
In the route search, at a node through which at least two or more moving bodies of the plurality of moving bodies pass together, a combined moving body in which the two or more moving bodies move together is generated and added as the moving body; A computer program to be realized by a computer.   A recording medium recording the computer program according to claim 9 in a computer-readable manner.

Images