WO2004057273A1 - Appareil de recherche de trajet, systeme de recherche de trajet, programme et procede de recherche de trajet - Google Patents

Appareil de recherche de trajet, systeme de recherche de trajet, programme et procede de recherche de trajet Download PDF

Info

Publication number
WO2004057273A1
WO2004057273A1 PCT/JP2002/013333 JP0213333W WO2004057273A1 WO 2004057273 A1 WO2004057273 A1 WO 2004057273A1 JP 0213333 W JP0213333 W JP 0213333W WO 2004057273 A1 WO2004057273 A1 WO 2004057273A1
Authority
WO
WIPO (PCT)
Prior art keywords
block
route
cost
end point
movement
Prior art date
Application number
PCT/JP2002/013333
Other languages
English (en)
Japanese (ja)
Inventor
Tatsuya Honmaru
Shigeaki Nakata
Original Assignee
Jicoux Datasystems, Inc.
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Jicoux Datasystems, Inc. filed Critical Jicoux Datasystems, Inc.
Priority to AU2002357627A priority Critical patent/AU2002357627A1/en
Priority to PCT/JP2002/013333 priority patent/WO2004057273A1/fr
Priority to JP2004561997A priority patent/JPWO2004057273A1/ja
Publication of WO2004057273A1 publication Critical patent/WO2004057273A1/fr

Links

Classifications

    • G—PHYSICS
    • G01—MEASURING; TESTING
    • G01C—MEASURING DISTANCES, LEVELS OR BEARINGS; SURVEYING; NAVIGATION; GYROSCOPIC INSTRUMENTS; PHOTOGRAMMETRY OR VIDEOGRAMMETRY
    • G01C21/00—Navigation; Navigational instruments not provided for in groups G01C1/00 - G01C19/00
    • G01C21/26—Navigation; Navigational instruments not provided for in groups G01C1/00 - G01C19/00 specially adapted for navigation in a road network
    • G01C21/34—Route searching; Route guidance
    • G01C21/3446—Details of route searching algorithms, e.g. Dijkstra, A*, arc-flags, using precalculated routes

Definitions

  • the present invention relates to a route search device, a route search system, a program, and a route search method.
  • the present invention specifies a movement route to be used for movement from a start point to an end point.
  • the present invention relates to a route search device for searching.
  • a method for performing a route search using a plurality of nodes is known.
  • a route search is performed based on the distance between each node and the like.
  • an object of the present invention is to provide a route search device, a route search system, a program, and a route search method that can solve the above-described problems. This object is achieved by a combination of the features described in the independent claims.
  • the dependent claims define further advantageous embodiments of the present invention.
  • a route search device for searching for a movement route to be used for a movement from a start point to an end point, wherein an entire area including the start point and the end point is determined.
  • a block management unit that manages an internal path cost, which is a moving cost required to pass through the block area using a path in the block included in the block area, corresponding to each of the plurality of divided block areas; Select multiple block areas based on the start and end points of the area
  • a block selecting unit that generates a moving path from a start point to an end point via a path within a block included in each of a plurality of block areas selected by the block selecting unit;
  • a moving cost calculating unit that calculates a path moving cost, which is a moving cost when moving using the moving path, based on the internal path cost corresponding to the included block internal path.
  • At least some of the block areas have at least three entrances connecting the inside and the outside of the block area, and the block management unit corresponds to each of at least some of the block areas. Two of the at least three entrances may be used as one end and the other end, and at least two different routes in the block may be managed.
  • each block area has a plurality of entrances and exits that connect the block area and a block area adjacent to the block area in the entire area
  • the block management unit includes two entrances out of the plurality of entrances. Is managed as a route in the block, the moving cost between the two entrances and exits is managed as the cost of the inner diameter route corresponding to the route in the block, and the block selecting unit determines the number of blocks in the block area. At least as a part, two block areas adjacent to each other are selected, and the movement path generation unit compares the two block areas with the intra-block path in each block area and the two block areas. At least a part of the movement route may be generated by connecting via an entrance connecting the devices.
  • the travel route generation unit generates a plurality of travel routes
  • the travel cost calculation unit calculates each route travel cost for the plurality of travel routes
  • the route search device calculates the route travel cost for each travel route.
  • a route selection unit that selects one of the plurality of travel routes based on the plurality of travel routes.
  • the block management unit assigns the separation movement cost, which is the movement cost between the two separation blocks, to the two separation blocks, which are the block regions separated from each other across the plurality of block regions.
  • the block selection unit may control the start point program, which is a block area including the start point, as at least a part of the plurality of block areas.
  • the end point block which is a block area including the end point, and the movement path generation unit generates a start point path from the start point to one separation block based on the intra-block path included in the start point block. Based on the route in the block included in the end point block, an end point route from another distant block to the end point is generated, thereby generating a movement route passing through the start point route and the end point route.
  • the start cost and the end cost of the start route and the end route are calculated.
  • the route moving cost may be calculated based on the moving cost, the end point moving cost, and the distance moving cost.
  • the block selection unit further selects: a start point near block which is a block area near the start point block, and an end point near block which is a block area near the end point block.
  • a start point near block which is a block area near the start point block
  • an end point near block which is a block area near the end point block.
  • the block management unit includes a plurality of whole division blocks that are a plurality of block areas obtained by dividing the entire area, and a plurality of block areas corresponding to the plurality of areas obtained by further dividing each of the plurality of whole division blocks.
  • the block selection unit manages the partial block blocks and the internal path cost corresponding to each block block, and the block selection unit determines, as at least a part of the plurality of block areas, the start block and the end block that are the partial block including the start point.
  • the end point block which is a partial block that includes, and one or more intermediate blocks, each of which is a whole divided block that does not include either the start point or the end point, are selected, and the movement route generation unit is included in the start point block
  • By generating an end point route based on the route in the block included in the end point block the start point route, the intermediate route, and the end point route are generated.
  • a moving route via a road may be generated.
  • the block selection unit further selects a start neighborhood block which is a partial division block near the start block and an end neighborhood block which is a partial division block near the end block, and a movement route generation unit. Is the start path from the start point to any intermediate block via the block ⁇ path included in each of the start point block and the start point block, and the blocks included in the end point vicinity block and the end point block, respectively. By passing through the internal route, an end route from any intermediate block to the end point is generated.
  • the apparatus further includes a receiving unit that receives designation of a waypoint to be routed in the middle of the movement route, wherein the block selecting unit determines a waypoint block which is a subdivided block including the waypoint as a part of the plurality of block areas.
  • the movement route generation unit may generate the movement route further based on the route in the block included in the route point block.
  • the block selecting unit further selects a transit point neighboring block which is a partial divided block near the transit point block, and the movement route generating unit transmits the intra-block route included in each of the transit point block and the transit point neighboring block. By passing through, a transit route from one of the intermediate blocks to any of the intermediate blocks via the transit point may be generated, and a travel route via the transit route may be generated.
  • the block management unit further manages the block facility information indicating the facilities located along the route in the block, and the route search device uses the block facility information based on the block facility information corresponding to the route in the block through which the moving route passes. It further includes a facility information generation unit that generates route facility information indicating facilities located along the travel route, and an information output unit that outputs information indicating the travel route in association with the route facility information corresponding to the travel route. May be.
  • the block management unit further manages intra-block error information indicating an error range of a required time when moving using the intra-block route, and the route search device corresponds to the intra-block route through which the moving route passes. Based on the error information in the block, path error information indicating the error range of the required time when moving using the travel path is calculated.
  • the information processing unit may further include an error information calculation unit that performs the operation, and an information output unit that outputs information indicating the movement route in association with the route error information corresponding to the movement route.
  • the block management unit receives update cost information for updating the internal route cost from a server provided outside the route search device, and updates at least a part of the internal route cost based on the update cost information. May be.
  • the block selection unit includes a template storage unit that stores a template figure having a predetermined shape, a figure size change unit that enlarges or reduces the template figure to a size including a start point and an end point, and an enlargement or reduction. And a selection execution unit for arranging the arranged template figures on the entire area with reference to the positions of the start point and the end point, and selecting a plurality of block areas including the arranged template figures.
  • the block management unit may further include a state acquisition unit that acquires at least a part of the state of the entire area, wherein the block management unit associates at least some of the intra-block paths with availability information indicating whether the intra-block paths can be used.
  • the traveling route generation unit determines whether the intra-block route is available based on the availability information. By making a determination, a movement route can be generated based on the available route in the block.
  • a route search system for searching for a movement route to be used for movement from a start point to an end point, wherein at least one of a plurality of block areas obtained by dividing an entire area including the start point and the end point is provided.
  • a server for storing update cost information for updating an internal route cost, which is a moving cost required to pass through the block area using a block internal path included in the block area, corresponding to the block;
  • the terminal manages the internal path cost required when passing through the block area using the intra-block path included in the block area corresponding to each of the plurality of block areas.
  • a block that updates the route cost corresponding to at least a part of the block area based on the update cost information received from the server.
  • a processing section a position of a start point and an end point in the entire region Based on the block selection unit that selects a plurality of block areas, and a movement path that generates a movement path from a start point to an end point via a path in a block included in each of the plurality of block areas selected by the block selection unit.
  • a moving cost calculating unit configured to calculate a route moving cost, which is a moving cost when moving using the moving route, based on an inner route cost corresponding to an inner route of the block included in the moving route.
  • a program for searching for a movement route to be used for movement from a start point to an end point wherein the program includes a plurality of block areas obtained by dividing an entire area including the start point and the end point.
  • a block management unit that manages an internal path cost, which is a moving cost required to pass through the block area using a path in the block included in the block area, and a position of a start point and an end point in the entire area.
  • the block selection unit Based on the block selection unit that selects multiple block areas and the movement path from the start point to the end point via the intra-block path included in each of the multiple block areas selected by the block selection unit.
  • the moving cost when moving using the moving route is calculated.
  • a travel cost calculating unit for calculating a certain route travel cost.
  • a route search method for searching for a movement route to be used for movement from a start point to an end point, wherein each of the plurality of block areas obtained by dividing an entire area including the start point and the end point is provided.
  • a block management stage for managing an internal route cost which is a moving cost required to pass through the block area by using an intra-block path included in the block area, and a starting point and a start point in the entire area.
  • a movement cost calculation step of calculating a path movement cost is the cost.
  • FIG. 1 is a diagram showing an example of a configuration of a route search system 50 according to an embodiment of the present invention.
  • FIG. 2 is a diagram showing an example of a plurality of block areas managed by the block management unit 104.
  • FIG. 3 is a diagram showing a detailed configuration of the primary block 304a.
  • FIG. 4 is a flowchart showing an example of the operation of the route search device 100.
  • FIG. 5 is a diagram illustrating an example of the operation of the route search device 100.
  • FIG. 6 is a diagram showing an example of the configuration of the block selection unit 112.
  • 'FIG. 7 is a diagram showing a hardware configuration of the route search device 100.
  • FIG. 1 shows an example of a configuration of a route search system 50 according to an embodiment of the present invention.
  • the route search system 50 of the present example searches at high speed for a moving route between the start point and the end point.
  • the route search system 50 includes a route search device 100 and a server 150.
  • the server 150 is provided outside the route search device 100, and provides information for the route search device 100 to use for the route search to the route search device 100.
  • the route search device 100 is an example of a terminal that communicates with the server 150.
  • the route search device 100 is, for example, a car navigation device, and searches for a movement route to be used for movement from a start point to an end point in a preset entire area.
  • the route search device 100 includes a block information storage unit 106, a facility information storage unit 108, Error information storage unit 110, block management unit 104, block selection unit 112, travel route generation unit 114, travel cost calculation unit 116, facility information generation unit 120, error information calculation It has a unit 122, a route selection unit 118, and an information input / output unit 102.
  • the block information storage unit 106 stores information corresponding to each of a plurality of block areas obtained by dividing the entire area.
  • the block information storage unit 106 stores one or a plurality of intra-block paths, which are paths included in the block area, for each block area, and uses the respective intra-block paths to execute the block.
  • block information that associates the internal route cost, which is the moving cost required to pass through the block area is stored.
  • the block information storage unit 106 stores, as the inner diameter road cost, for example, the time or fee required for passing through the corresponding block route, the turning angle or the number of signals in the block route, the weather in the block route, The moving cost such as the road width or other characteristics of the route in the block is stored as the inner-diameter road cost.
  • the facility information storage unit 108 stores block facility information indicating facilities located along the block route in association with each block route.
  • the facility information storage unit 108 stores, for example, information indicating the convenience store, the parking area, or the presence or absence of a store preset by the user, as the block facility information.
  • the error information storage unit 110 stores in-block error information indicating an error range of a required time when moving using the block route, in association with each block route.
  • the error information storage unit 110 stores, for example, information associating the error value of the required time with the probability of occurrence of the error as the error information in the block.
  • the block management unit 104 manages the information stored in the block information storage unit 106, the facility information storage unit 108, and the error information storage unit 110, so that each of the intra-block paths is managed. It manages internal route cost, block facility information, and block error information in response to.
  • the server 150 stores update cost information for updating the internal route cost.
  • the block management unit 104 receives the updated cost information from the server 150 via the information input / output unit 102, and, based on the information, updates the inner diameter path stored in the block information storage unit 106. Update costs. Further, the block management unit 104 may further update the block facility information or the error information in the block based on the information received from the server 150.
  • the block selection unit 112 receives information specifying the start point and the end point included in the entire area from the user via the information input / output unit 102 and the block management unit 104, and determines the start point and the end point in the entire area. Select multiple block areas based on location.
  • the block selecting unit 112 selects, for example, an area block within a predetermined distance from a straight line connecting the start point and the end point, among all the block areas.
  • the movement route generation unit 114 receives the block information from the block management unit 104, and generates a plurality of movement routes from the start point to the end point based on the block information.
  • the movement path generation unit 114 generates a movement path that passes through the intra-block path included in each of the plurality of block areas selected by the block selection unit 112.
  • the movement cost calculation unit 116 receives block information received from the block management unit 104 via the movement route generation unit 114. Then, the moving cost calculation unit 1 16 calculates, for each of the plurality of moving routes, the moving cost when moving using the moving route based on the inner route cost corresponding to the intra-block route included in the moving route Is calculated.
  • the facility information generation unit 120 receives the block facility information from the block management unit 104 and, based on the block facility information corresponding to the route inside the block through which the movement route passes, locates along the movement route.
  • the route facility information indicating the facility to perform is generated.
  • the error information calculation unit 122 receives the error information in the block from the block management unit 104, and moves based on the error information in the block corresponding to the route in the block through which the movement route passes, using the movement route.
  • the path error information indicating the error range of the required time is calculated.
  • the route error information is calculated based on the error value indicated as the information and the probability corresponding to the value.
  • the route selection unit 118 selects one travel route from the plurality of travel routes based on the route travel costs calculated for each of the plurality of travel routes.
  • the route selecting unit 118 may select a moving route based on route facility information or route error information.
  • the route selecting unit 118 may select a plurality of moving routes based on the respective route moving costs. They may be selected in order.
  • the information input / output unit 102 receives designation of the start point and the end point from the user, and outputs information indicating the movement route selected by the route selection unit 118 to the user.
  • the information input / output unit 102 outputs information indicating the moving route to the user by displaying the information on a display, for example.
  • the information input / output unit 102 may supply the information to, for example, another information processing device instead of outputting the information to the user.
  • the information input / output unit 102 outputs information indicating the moving route in association with the route facility information and the route error information corresponding to the moving route.
  • the information input / output unit 102 receives the updated cost information from the server 150 and supplies the updated cost information to the block management unit 104. According to this example, it is possible to appropriately search for a travel route.
  • FIG. 2 shows an example of a plurality of block areas managed by the block management unit 104.
  • the block management unit 104 manages the internal route cost corresponding to each of the plurality of primary blocks 304, the plurality of secondary blocks 306, and the plurality of tertiary blocks 308. I do.
  • the primary block 304 is an example of the whole division block, and is a block area obtained by dividing the whole area 302.
  • Each of the secondary block 306 and the tertiary block 308 is an example of a partial block, and is a block area corresponding to an area obtained by further dividing each of the plurality of primary blocks 304. .
  • the block management unit 104 manages a plurality of secondary blocks 306 corresponding to the area of one primary block 304 and corresponds to the area of one secondary block 306. And And manage a plurality of tertiary blocks 308. Also, the secondary block 306 includes a path within the block that is set in more detail than the corresponding area in the primary block 304, and the tertiary block 308 includes the corresponding area in the secondary block 306. Includes more detailed intra-block routes. In this case, the route can be searched at high speed by selecting and using the primary block 304, the secondary block 306, or the tertiary block 308 according to the distance of the route to be searched. .
  • a route search can be performed with high accuracy by selecting the tertiary block 308 for a region that requires high accuracy.
  • the primary block 304, the secondary block 303, and the tertiary block 308 are square areas each having a side of about 80 km, 10 km, and 1 km. It is.
  • the primary block 304, the secondary block 306, and the tertiary block 308 may be other two-dimensional shapes, for example, rectangular or triangular. .
  • FIG. 3 shows a detailed configuration of the primary block 304a.
  • the primary block 304a has five entrances 402a-e connecting the inside and the outside of the primary block 304a, respectively.
  • the primary block 304 a is adjacent to a plurality of primary blocks 304 b to i in the entire area, and the five entrances and exits 402 a to e correspond to the primary block 3. 0 a and a plurality of primary blocks 304 b i are connected.
  • the primary block 304 a has two of the five entrances and exits 402 a to e as one end and the other end, and has a plurality of in-block paths 404 a to h different from each other.
  • the block management unit 104 (see FIG. 1) manages a plurality of intra-block routes 404a to h corresponding to the primary block 304a. That is, the block management unit 104 manages a combination of two entrances and exits 402 among a plurality of entrances and exits 402 to a as the intra-block route 404, and The movement cost between 0 2 is managed as the inner diameter path cost corresponding to the in-block path 4 04.
  • each of the plurality of primary blocks 3 0 4 b to i is a primary block 3 0 It may have the same or similar configuration as 4a.
  • the secondary block 306 (see FIG. 2) and the tertiary block 308 (see FIG. 2), which are the area blocks included in the primary block 304, are different from the primary block except that the size of the area is different. It may have the same or similar configuration as the block 304a.
  • FIG. 4 is a flowchart illustrating an example of the operation of the route search device 100.
  • the route search device 100 first checks whether or not the route cost needs to be updated by, for example, communicating with the server 150 (S102).
  • the block management unit 10'4 updates the internal path cost (S104).
  • the block management unit 104 manages the internal road cost.
  • the information input / output unit 102 acquires information indicating a start point and an end point of the route to be searched from the user, for example (S106), and the block selection unit 112 determines the start point and the end point. Based on the indicated information, a plurality of block areas are selected (S108). Then, the movement route generation unit 114 generates a plurality of movement routes based on the selected block areas (S 110), and the movement cost calculation unit 116 calculates each of the movement routes for each of the movement routes. The route movement cost is calculated (S112). Then, the route selecting unit 118 selects one or a plurality of moving routes based on the calculated route moving cost (S114), and the information input / output unit 102 determines whether the selected moving route is Information is output (S116).
  • step S108 the block selection unit 112 selects two block areas adjacent to each other as at least a part of the plurality of block areas. Then, in S 110, the movement path generation unit 114 connects the two block areas to the intra-block paths in the respective block areas via the entrance / exit connecting the two block areas. In this way, at least a part of the travel route is generated. According to this example, a moving route can be generated at high speed.
  • the information input / output unit 102 may acquire the state of at least a part of the entire area such as disaster information.
  • block management unit 1 04 manages, for example, at least a part of the intra-block routes in association with usability information indicating whether or not the intra-block routes can be used.
  • the block management unit 104 changes the usability information for the route in the block.
  • the movement route generation unit 114 determines whether or not the route in the block can be used based on the availability information, and thereby determines the movement route based on the available route in the block. Generate Thereby, the movement route generation unit 114 can generate a more appropriate route.
  • FIG. 5 is a diagram illustrating an example of the operation of the route search device 100.
  • the block selection unit 112 selects a plurality of block areas based on the positions of the start point 516 and the end point 518.
  • the movement route generation unit 1 14 moves based on the intra-block route included in the selected block area via the start route 52 0, the intermediate route 52 2 and the end route 52 24.
  • the operation when the area corresponding to the primary block is divided into four secondary blocks and the area corresponding to the secondary block is divided into four tertiary blocks Will be described.
  • the block selector 1 1 2 includes, as a plurality of block areas, a start block 502, a plurality of blocks near the start point 504 a to f, an end point block 500, a plurality of blocks near the end point 508 a to f , And a plurality of intermediate blocks 5110a-s.
  • the start point block 502 is a block area including the start point, and the plurality of blocks near the start point 504 a to f are block areas near the start point block 502.
  • the start block 502 is a tertiary block.
  • the plurality of blocks near the starting point 504 a to c are tertiary blocks, and the plurality of blocks near the starting point 504 (! To f are secondary blocks).
  • the nearby block area for one tertiary block is, for example, another secondary block and / or tertiary block divided from the primary block including the tertiary block.
  • a nearby block area is a block area.
  • a block area whose distance from the area is smaller than a predetermined distance may be used.
  • the end point block 506 is a block area including the end point, and the plurality of end point neighboring blocks 508 a to f are block areas near the end point block 506.
  • the end point block 506 is a tertiary block 308.
  • the plurality of end point neighboring blocks 508 a to c are tertiary blocks, and the plurality of end point neighboring blocks 508 d to f are secondary blocks.
  • Each of the plurality of intermediate blocks 5110 a to s is a block area not including any of the start point 5 16 and the end point 5 18 ′.
  • the plurality of intermediate blocks 5110 a to s are primary blocks.
  • the movement path generation unit 114 may include any one of the intermediate blocks 51 from the start point 516. Generates a start point route 5 0 to 0, an end point block 5 0 6, and an end point from any of the intermediate blocks 5 10 based on the routes in the blocks included in the blocks near the end point 5 08 a to f. An end point route 5 2 4 to 5 18 is generated.
  • the movement route generation unit 114 generates the route using the secondary block and the Z block or the tertiary block in which the route in the block is set in detail, so that the start route 5200 and the end route are generated. 5 2 4 can be generated with high accuracy.
  • the movement route generation unit 114 passes through the route in the block included in each of the start block 502 and the blocks near the start point 504 d to e, so that the intermediate block A starting point route 5 20 to 5 10 n is generated.
  • the movement route generation unit 114 passes the intermediate block 5110f from the intermediate block 5108 by passing through the route in the block included in each of the end point blocks 508 d to e and the end point block 506. An end point route 5 2 4 to the end point 5 18 is generated.
  • the movement route generation unit 114 connects the start point route 52 and the end point route 52 based on the in-block routes included in each of the plurality of intermediate blocks 5110a to s. Further, an intermediate path 5 2 2 is generated. In this case, the intermediate path 5 2 2 is generated at high speed by generating the path using the primary block corresponding to the large area. can do.
  • the movement route generation unit 114 should be used for the movement from the start point 516 to the end point 518 by connecting the start route 520, the intermediate route 522, and the end route 524. Generate a travel route. Note that the movement route generation unit 114 generates a plurality of movement routes by generating a plurality of the start route 520, the end route 524, and the Z or the intermediate route 522, respectively. Good.
  • the movement cost calculation unit 1 16 calculates the inner route cost corresponding to the route in the block included in each of the start route 52 0, the intermediate route 52 2, and the end route 52 4, Calculate the starting cost, the intermediate moving cost, and the ending moving cost, which are the moving costs of the starting route 522, the intermediate route 522, and the ending route 524, respectively. Is calculated on the basis of. According to this example, a moving route can be searched at high speed and with high accuracy. As a result, a route search can be performed efficiently.
  • the block management unit 104 further adds a separation moving cost, which is a moving cost between the two block regions, to the two block regions separated from each other across the plurality of block regions. May be managed.
  • the block management unit 104 manages, for example, the distance movement cost between the intermediate blocks 5110 n and 510 f.
  • the movement cost calculating unit 116 calculates the start point movement cost corresponding to the start point route 520, the end point movement cost corresponding to the end point route 524, and the intermediate block 510 ⁇ .
  • the route movement cost is calculated based on the separation movement cost corresponding to the movement to 5 10 f. In this case, by calculating the route moving cost at high speed, the moving route can be searched at higher speed.
  • the information input / output unit 102 may further receive, for example, from the user, the designation of the route point 5 26 to be routed in the middle of the movement route.
  • the block selection, section 1 1 1 2 includes a transaction point block 5 1 2 which is a block area including the waypoints 5 2 6, Select multiple blocks near the waypoints 5 1 4 a to f You.
  • the block selecting unit 112 further selects a plurality of intermediate blocks 5110t to y based on the positions of the waypoints 526.
  • the waypoint block 5 1 2 and a plurality of waypoint blocks 5 14 a to c are tertiary blocks, and a plurality of waypoint blocks 5 14 d to f are secondary blocks. It is.
  • the moving route generation unit 114 further includes a route block 51, and a route within a block included in a plurality of route neighboring blocks 51 to 44.
  • a route 530 is generated via the waypoint 526 to any one of the intermediate blocks 510.
  • the movement route generation unit 114 transmits the route point block 512 and a plurality of route point neighboring blocks 5114 b to (! A route 530 from the intermediate block 5110 V to the intermediate block 51 Ow is generated.
  • the movement route generation unit 114 may respectively determine the start route 520 and the end route 524 via the route.
  • a plurality of intermediate paths 5 2 8-:! ⁇ 2, which respectively connect the paths 5 330, are generated.
  • the movement route generation unit 114 can determine the start route 520, the end route 524, and the plurality of intermediate routes 528— :! 22, and via route 540 A moving route via the route is generated. Therefore, according to this example, it is possible to search for an appropriate route according to the designation of a waypoint.
  • FIG. 6 shows an example of the configuration of the block selection unit 112.
  • the block selection unit 112 includes a template storage unit 602, a graphic size change unit 604, and a selection execution unit 606.
  • the template storage section 602 stores a template figure having a predetermined shape.
  • the template storage unit 602 stores, for example, a rectangular template figure.
  • the figure size changing unit 604 enlarges or reduces the template figure to a size including the designated start point and end point.
  • the figure size changing unit 604 may enlarge or reduce the template figure based on the distance connecting the start point and the end point.
  • the selection executing unit 606 arranges the enlarged or reduced template graphic on the entire area with reference to the positions of the start point and the end point, and selects a plurality of block areas including the arranged template graphic. For example, the selection execution unit 606 may select, as each of the plurality of block areas, a block area that at least partially overlaps the arranged template graphic. According to this example, a plurality of block areas can be appropriately selected.
  • the template storage section 602 may store, for example, a substantially elliptical template figure.
  • the selection executing section 606 may arrange the template graphic with the major axis of the substantially elliptical shape and the direction connecting the start point and the end point substantially parallel to each other. In this case, a more appropriate moving route can be searched for by selecting more block areas near the middle between the start point and the end point.
  • the selection executing section 606 may arrange the template graphic such that the long axis of the substantially elliptical shape is substantially parallel to the predetermined direction. In this case, the route search can be performed more efficiently.
  • FIG. 7 shows a hardware configuration of the route search device 100 (see FIG. 1) according to the present embodiment.
  • the distribution device 100 is realized by an information processing device 700 including a CPU 800, a ROM 810, a RAM 820, a communication interface 830, a hard disk drive 840, a flexible disk drive 850, and a CD-ROM drive 860. .
  • the CPU 800 operates based on programs stored in the ROM 810 and the RAM 820, and controls each unit.
  • the ROM 810 stores a boot program executed by the CPU 800 when the information processing device 700 is started, a program that depends on the hardware of the information processing device 700, and the like.
  • the RAM 820 stores programs executed by the CPU 800, data used by the CPU 800, and the like.
  • the communication interface 830 communicates with another device via a network.
  • the hard disk drive 840 stores programs and data used by the information processing device 700, and supplies the programs and data to the CPU 800 via the RAM 820. Also, the hard disk drive 840 It may operate as each of the block information storage unit 106, the facility information storage unit 108, and the error information storage unit 110 described with reference to FIG.
  • the flexible disk drive 850 reads a program or data from the flexible disk 890 and provides it to the RAM 820.
  • the CD-ROM drive 860 reads a program or data from the CD-ROM 895 and provides it to the RAM 820.
  • the program provided to the CPU 800 via the RAM 820 is stored in a recording medium such as a flexible disk 890, a CD-ROM 895, or an IC card and provided by a user.
  • the program is read from the recording medium, installed in the information processing device 700 via the RAM 820, and executed in the information processing device 700.
  • the programs installed and executed in the information processing device 700 include a block management module, a block selection module, a movement route generation module, a movement cost calculation module, and a route selection module.
  • the module of the program X includes the information processing device 700, the block management unit 104, the block selection unit 112, the movement route generation unit 114, the movement cost calculation unit 116 described with reference to FIG. Each of them is made to function as the route selector 118. .
  • the programs or modules described above may be stored in an external storage medium.
  • an optical recording medium such as DVD or PD, a magneto-optical recording medium such as MD, a tape medium, or a semiconductor memory such as an IC card can be used.
  • a storage device such as a hard disk or a RAM provided in a server system connected to a dedicated communication network or the Internet may be used as a recording medium, and the program may be provided to the information processing device 700 via the network.
  • a route search can be performed efficiently.

Abstract

Un appareil de recherche de trajet sert à la recherche d'un trajet de mouvement utilisé pour se déplacer d'un point de départ à un point de destination. La zone entière comprenant un point de départ et le point de destination est divisée en une pluralité de zones de blocs. L'appareil comprend une unité de gestion de zones destinée à gérer un coût de trajet interne qui correspond à un coût de mouvement requis lors du passage par les régions de bloc, une unité de sélection de blocs destinée à sélectionner les blocs en fonction du point de départ et du point de destination d'une région entière, un générateur de trajet de mouvement destiné à générer un trajet de mouvement du point de départ jusqu'au point de destination en passant par le trajet à l'intérieur de blocs contenu dans chacune des régions de blocs, sélectionnées par l'unité de sélection de blocs, et une unité de calcul de coûts destinée à calculer les coûts du mouvement lorsque le mouvement est effectué en suivant le trajet de mouvement en fonction du coût sur le trajet correspondant au trajet à l'intérieur du bloc contenu dans le trajet de mouvement.
PCT/JP2002/013333 2002-12-20 2002-12-20 Appareil de recherche de trajet, systeme de recherche de trajet, programme et procede de recherche de trajet WO2004057273A1 (fr)

Priority Applications (3)

Application Number Priority Date Filing Date Title
AU2002357627A AU2002357627A1 (en) 2002-12-20 2002-12-20 Route search apparatus, route search system, program, and route search method
PCT/JP2002/013333 WO2004057273A1 (fr) 2002-12-20 2002-12-20 Appareil de recherche de trajet, systeme de recherche de trajet, programme et procede de recherche de trajet
JP2004561997A JPWO2004057273A1 (ja) 2002-12-20 2002-12-20 経路探索装置、経路探索システム、プログラム、及び経路探索方法

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
PCT/JP2002/013333 WO2004057273A1 (fr) 2002-12-20 2002-12-20 Appareil de recherche de trajet, systeme de recherche de trajet, programme et procede de recherche de trajet

Publications (1)

Publication Number Publication Date
WO2004057273A1 true WO2004057273A1 (fr) 2004-07-08

Family

ID=32676922

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/JP2002/013333 WO2004057273A1 (fr) 2002-12-20 2002-12-20 Appareil de recherche de trajet, systeme de recherche de trajet, programme et procede de recherche de trajet

Country Status (3)

Country Link
JP (1) JPWO2004057273A1 (fr)
AU (1) AU2002357627A1 (fr)
WO (1) WO2004057273A1 (fr)

Cited By (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JP2005228011A (ja) * 2004-02-12 2005-08-25 Jicoux Datasystems Inc 経路算出装置、経路算出方法、及びプログラム
JP2009020773A (ja) * 2007-07-13 2009-01-29 Asyst Technologies Japan Inc 経路探索システム及び方法、搬送システム、並びにコンピュータプログラム
WO2012105554A1 (fr) * 2011-02-01 2012-08-09 クラリオン株式会社 Appareil de calcul d'itinéraires
JP2012215571A (ja) * 2011-03-29 2012-11-08 Denso It Laboratory Inc ナビゲーション装置、方法及びシステム
CN104025075A (zh) * 2011-10-26 2014-09-03 托马斯·保罗·希德 用于车队导航、调度以及多个车辆、多个目的地指定路线的方法及系统
JP2020159801A (ja) * 2019-03-26 2020-10-01 株式会社ゼンリンデータコム 経路探索装置、方法およびプログラム

Citations (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JPH06323861A (ja) * 1993-05-11 1994-11-25 Sumitomo Electric Ind Ltd 経路計算機能を有するナビゲーション装置
US5513110A (en) * 1993-07-09 1996-04-30 Xanavi Informatics Corporation Navigation system and path search method using hierarchized road data
EP0782120A1 (fr) * 1995-12-28 1997-07-02 Matsushita Electric Industrial Co., Ltd. Méthode et appareil de calcul d'itinéraire
JPH10132592A (ja) * 1996-10-25 1998-05-22 Nissan Motor Co Ltd ナビゲーション装置
JP2001091272A (ja) * 1999-09-20 2001-04-06 Fujitsu Ten Ltd 地図データ記憶媒体及びナビゲーション装置
JP2002206936A (ja) * 2001-01-09 2002-07-26 Matsushita Electric Ind Co Ltd 経路計算方法及びそれを実施する装置

Patent Citations (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JPH06323861A (ja) * 1993-05-11 1994-11-25 Sumitomo Electric Ind Ltd 経路計算機能を有するナビゲーション装置
US5513110A (en) * 1993-07-09 1996-04-30 Xanavi Informatics Corporation Navigation system and path search method using hierarchized road data
EP0782120A1 (fr) * 1995-12-28 1997-07-02 Matsushita Electric Industrial Co., Ltd. Méthode et appareil de calcul d'itinéraire
JPH10132592A (ja) * 1996-10-25 1998-05-22 Nissan Motor Co Ltd ナビゲーション装置
JP2001091272A (ja) * 1999-09-20 2001-04-06 Fujitsu Ten Ltd 地図データ記憶媒体及びナビゲーション装置
JP2002206936A (ja) * 2001-01-09 2002-07-26 Matsushita Electric Ind Co Ltd 経路計算方法及びそれを実施する装置

Cited By (9)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JP2005228011A (ja) * 2004-02-12 2005-08-25 Jicoux Datasystems Inc 経路算出装置、経路算出方法、及びプログラム
JP2009020773A (ja) * 2007-07-13 2009-01-29 Asyst Technologies Japan Inc 経路探索システム及び方法、搬送システム、並びにコンピュータプログラム
WO2012105554A1 (fr) * 2011-02-01 2012-08-09 クラリオン株式会社 Appareil de calcul d'itinéraires
JP2012159433A (ja) * 2011-02-01 2012-08-23 Clarion Co Ltd 経路演算装置
JP2012215571A (ja) * 2011-03-29 2012-11-08 Denso It Laboratory Inc ナビゲーション装置、方法及びシステム
CN104025075A (zh) * 2011-10-26 2014-09-03 托马斯·保罗·希德 用于车队导航、调度以及多个车辆、多个目的地指定路线的方法及系统
JP2015500981A (ja) * 2011-10-26 2015-01-08 トーマス ポール ヒード フリートナビゲーション、ディスパッチ及び複数の自動車で、複数の目的地を探索するための方法及びシステム
JP2020159801A (ja) * 2019-03-26 2020-10-01 株式会社ゼンリンデータコム 経路探索装置、方法およびプログラム
JP7199278B2 (ja) 2019-03-26 2023-01-05 株式会社ゼンリンデータコム 経路探索装置、方法およびプログラム

Also Published As

Publication number Publication date
AU2002357627A1 (en) 2004-07-14
JPWO2004057273A1 (ja) 2006-04-20

Similar Documents

Publication Publication Date Title
KR100316461B1 (ko) 경로 선출 방법 및 시스템
KR100822010B1 (ko) 교통정보 수집용 수치지도를 이용한 교통정보 제공 시스템및 방법
CN100543422C (zh) 导航装置
JP3173983B2 (ja) 経路選出方法およびシステム
JPH10103991A (ja) 経路選出方法およびシステム
JPH109884A (ja) 車両用経路案内装置および経路探索方法
US8977487B2 (en) Navigation device and guide route search method
CN107228677A (zh) 偏航识别方法和装置
JP6090226B2 (ja) 経路生成装置および経路生成方法
JP2007292988A (ja) 地図データ作成装置及びその地図作成方法並びにナビゲーション装置及びその経路探索方法
JPH11304517A (ja) 経路探索装置
JPWO2009150781A1 (ja) ナビゲーション装置
US8219313B2 (en) Navigation device and program
KR100822011B1 (ko) 네비게이션 단말기, 그의 교통정보 안내방법, 교통정보제공 시스템 및 방법
WO2004057273A1 (fr) Appareil de recherche de trajet, systeme de recherche de trajet, programme et procede de recherche de trajet
JP3270383B2 (ja) 経路選出方法およびシステム
JP2001141481A (ja) ナビゲーション装置
JP2010054754A (ja) 地図データのデータ構造
JP2002213982A (ja) 経路演算装置，及びナビゲーション装置，並びにコンピュータ読み取り可能な記録媒体
JP3171574B2 (ja) 経路選出方法
JPH11325935A (ja) 経路探索装置
JP2004177137A (ja) ナビゲーション装置
JPH1026535A (ja) 最適経路探索方法
JP4145756B2 (ja) ナビゲーション装置、ナビゲーション方法、そのプログラム及びそのプログラムを記録した記録媒体
Wang et al. System optimum traffic assignment for connected cars

Legal Events

Date Code Title Description
AK Designated states

Kind code of ref document: A1

Designated state(s): AE AG AL AM AT AU AZ BA BB BG BR BY BZ CA CH CN CO CR CU CZ DE DK DM DZ EC EE ES FI GB GD GE GH GM HR HU ID IL IN IS JP KE KG KP KR KZ LC LK LR LS LT LU LV MA MD MG MK MN MW MX MZ NO NZ OM PH PL PT RO RU SD SE SG SI SK SL TJ TM TN TR TT TZ UA UG US UZ VN YU ZA ZM ZW

AL Designated countries for regional patents

Kind code of ref document: A1

Designated state(s): GH GM KE LS MW MZ SD SL SZ TZ UG ZM ZW AM AZ BY KG KZ MD RU TJ TM AT BE CH CY DE DK ES FI FR GB GR IE IT LU MC NL PT SE TR BF BJ CF CG CI CM GA GN GQ GW ML MR NE SN TD TG

121 Ep: the epo has been informed by wipo that ep was designated in this application
WWE Wipo information: entry into national phase

Ref document number: 2004561997

Country of ref document: JP

32PN Ep: public notification in the ep bulletin as address of the adressee cannot be established
32PN Ep: public notification in the ep bulletin as address of the adressee cannot be established

Free format text: DEEMED TO BE WITHDRAWN SINCE NO TRANSLATION HAS BEEN FILED AND FEES HAVE NOT BEEN VALIDLY PAID

122 Ep: pct application non-entry in european phase