Note: Descriptions are shown in the official language in which they were submitted.
CA 02993764 2018-01-25
1
DESCRIPTION
ROUTE SEARCHING DEVICE AND ROUTE SEARCHING METHOD
TECHNICAL FIELD
[0001]
The present invention relates to a route searching device and a route
searching
method which search for a lane-basis travel route.
BACKGROUND ART
[0002]
For a device configured to guide a vehicle over a specified route, there is
proposed a technique in which roads to travel are specified and then a route
to travel is
specified from lanes of each of the specified roads (see Patent Literature 1).
This can
improve accuracy of route guidance while reducing the processing load of lane-
basis
route searching.
CITATION LIST
PATENT LITERATURE
[0003]
Patent Literature 1: Japanese Patent Application Publication No. 2006-266865
SUMMARY OF INVENTION
TECHNICAL PROBLEM
[0004]
However, the technique described in Patent Literature 1 has the following
problem. The device selects each road to travel by using a link cost and
traffic jam
information. Accordingly, unless the device selects each road including a lane
optimal
as the route, the device cannot specify an optimal route, even though it
specifies a travel
route from lanes in the selected road. For example, a road in which only one
of
multiple lanes is congested is determined to be a congested road and is not
selected as
the road for specifying the travel route.
CA 02993764 2018-01-25
2
[0005]
In view of the problem described above, an object of the present invention is
to
provide a route searching device and a route searching method which can
improve
efficiency and accuracy of lane-basis route searching.
SOLUTION TO PROBLEM
[0006]
A route searching device calculates road-basis link costs of routes reaching a
destination from a current position, extracts road-basis candidate routes
having the
road-basis link costs equal to or less than a predetermined threshold, and
calculate
lane-basis link costs of each of the candidate routes based on the traffic
information and
determine a lane-basis travel route based on the lane-basis link costs. The
route
searching device extracts a route with a shortest distance, a route with a
shortest
required time not considering the traffic information, and a route with a
shortest
required time considering the traffic information, as the candidate routes
with the
predetermined condition.
ADVANTAGEOUS EFFECTS OF INVENTION
[0007]
The present invention can provide a route searching device and a route
searching method which can improve the efficiency and accuracy of lane-basis
route
searching by selecting the lane-basis travel route from the plurality of road-
basis
candidate routes.
BRIEF DESCRIPTION OF DRAWINGS
[0008]
[Fig. 1] Fig. 1 is a block diagram explaining an example of a configuration of
a route
searching device according to an embodiment of the present invention.
[Fig. 2] Fig. 2 is a flowchart explaining a route searching method performed
by the
route searching device according to an embodiment of the present inventio
'AMENDED
SHEET
CA 02993764 2018-01-25
2a
[Fig. 3] Fig. 3 is a view explaining an operation of the route searching
device according
to the embodiment of the present invention.
DESCRIPTION OF EMBODIMENTS
[0009]
An embodiment of the present invention is described with reference to the
drawings. In the description of the drawings, the same or similar parts are
denoted by
M
FA ENDED
SHEET
CA 02993764 2018-01-25
3
the same or similar reference numerals and overlapping description is omitted.
[0010]
(Route Searching Device)
As illustrated in Fig. 1, a route searching device according to the embodiment
includes a position measurement device 10, a communication interface (I/F) 20,
a sensor
group 30, a storage 40, a processor 50, a display 60, an input I/F 70, and a
speaker 80.
For example, the route searching device according to the embodiment of the
present
invention is mounted in a vehicle V (see Fig. 3) and searches for a lane-basis
travel
route.
[0011]
The position measurement device 10 measures a current position by using a
positioning system such as a global positioning system (GPS). The position
measurement device 10 includes, for example, a GPS receiver. The position
measurement device 10 outputs the measured current position to the processor
50 time
after time.
[0012]
The communication I/F 20 is, for example, a communication unit which
wirelessly exchanges signals with outside. The communication I/F 20 can
receive, for
example, traffic information on each of various lanes from the outside by
using an
intelligent transport system (ITS) which sends traffic information such as
traffic jam
information, traffic control information, and warning information, weather
information,
and the like in real time. The ITS include VICS (Vehicle Information and
Communication System: registered trademark), telematics, and the like. The
communication I/F 20 outputs the received information to the processor 50 time
after
time.
[0013]
The sensor group 30 can be configured by a speed sensor, an acceleration
sensor, an angular speed sensor, a steering angle sensor, and the like. The
sensor
group 30 detects the speed of the vehicle V, the three-axis acceleration and
angular
speed of the vehicle V in a three-dimensional Cartesian coordinate system, and
the like
= CA 02993764 2018-01-25
4
by using the sensors, and outputs the detection results to the processor 50
time after
time. The sensor group 30 may include an image sensor which captures an image
around the vehicle V, a distance sensor such as a laser range finder (LRF)
which detects
the distance from the vehicle V to a target and the direction in which the
target is
present, a bearing sensor which detects the bearing of the vehicle V. and the
like.
[0014]
The storage 40 stores map information 41 including lanes in each road. The
storage 40 can be configured by a semiconductor memory, a magnetic disk, or
the like.
The storage 40 may include information on features present around the roads.
The
storage 40 may also store programs necessary for processing performed by the
processor 50. The storage 40 may be configured by one piece of hardware or by
multiple pieces of hardware.
[0015]
The processor 50 includes a position acquirer 51, a destination setter 52, an
information acquirer 53, a candidate route extractor 54, and a travel route
determiner 55.
The processor 50 can be configured by, for example, a microcontroller which is
an
integrated circuit including a central processing unit (CPU), a memory, an
input/output
I/F, and the like. In this case, the multiple information processors (51 to
55)
configuring the processor 50 are implemented by the CPU executing a computer
program installed in advance in the microcontroller. Parts configuring the
processor
50 may be configured by an integral piece of hardware or separate pieces of
hardware.
The microcontroller may serve also as, for example, an electronic control unit
(ECU)
used for other control associated with the vehicle V such as automatic driving
control.
[0016]
The display 60 displays images and characters according to control by the
processor 50 to present various pieces of information to an occupant of the
vehicle V.
The display 60 is formed of, for example, a display such as a liquid-crystal
display.
The display 60 displays a map of an area around the vehicle V which includes
roads
recorded in the map information 41 and lanes in each road, according to the
control of
the processor 50.
CA 02993764 2018-01-25
[0017]
The input I/F 70, for example, receives operations performed by the occupant
and outputs signals corresponding to the operations to the processor 50. The
operations performed on the input I/F 70 may be performed by voice. The
display 60
and the input I/F 70 may be integrally formed as a touch panel display. The
speaker
80 regenerates voices and sounds according to the control by the processor 50
to present
various pieces of information to the occupant of vehicle V.
[0018]
(Route Searching Method)
An example of operations of a route searching device according to the
embodiment is described with reference to the flowchart of Fig. 2.
[0019]
In step Sl, the position acquirer 51 acquires the current position of the
vehicle
V in the map information 41 based on the current position which is measured by
the
position measurement device 10 and on the movement amount of the vehicle V and
the
position of the vehicle V relative to the features which are detected by the
sensor group
30.
[0020]
In step S2, the destination setter 52 sets a destination to be reached by the
vehicle V in the map information 41, based on, for example, the operation
performed by
the occupant on the input I/F 70.
[0021]
In step S3, the information acquirer 53 acquires the traffic information on
each
lane around the vehicle V from the communication I/F 20. The traffic
information on
each lane is, for example, the traffic jam information indicating traffic jam
and
congestion, the traffic control information indicating traffic control, and
the like.
[0022]
In step S4, the candidate route extractor 54 extracts multiple road-basis
candidate routes from the map information 41 based on predetermined
conditions, the
candidate routes each reaching the destination set by the destination setter
52 from the
CA 02993764 2018-01-25
6
current position of the vehicle V obtained by the position acquirer 51. For
example,
the candidate route extractor 54 calculates road-basis link costs of routes
reaching the
destination from the current position, and extracts the candidate routes based
on the link
costs. The time required to travel over the route, fuel consumption, toll,
distance, and
the like may be used as the road-basis link costs. The link costs are
calculated based
on the type of the road, the traffic information, the type of the vehicle, and
the like.
[0023]
For example, the candidate route extractor 54 extracts a road with the
shortest
travel distance, a road with the shortest travel time not considering the
traffic
information, and a road with the shortest travel time considering the traffic
information,
from the map information 41, as three candidate routes. Moreover, the
candidate route
extractor 54 may extract, in addition to the road with the lowest link cost,
multiple roads
whose link costs are equal to or less than a predetermined threshold, as the
candidate
routes.
[0024]
In step S5, the travel route determiner 55 calculates the lane-basis link cost
of
each of the candidate routes extracted by the candidate route extractor 54,
based on the
map information 41 and the traffic information. The lane-basis link cost is,
for
example, the time required to travel over the route.
[0025]
In step S6, the travel route determiner 55 selects the lane-basis travel route
from the candidate routes extracted by the candidate route extractor 54, based
on the
lane-basis link costs calculated in step S5. For example, the travel route
determiner 55
determines the candidate route with the lowest link cost as the travel route.
[0026]
In step S7, when the travel route determined in step S6 includes a traffic jam
section indicated by the traffic information, the travel route determiner 55
searches for a
bypass route which bypasses the traffic jam section. The travel route
determiner 55
calculates the lane-basis link cost of each bypass route searched for and
compares the
calculated link cost with the link cost of the travel route determined in step
S6. When
CA 02993764 2018-01-25
7
there is a bypass route whose link cost is lower than that of the travel route
determined
in step S6, the travel route determiner 55 may determine the bypass route with
the
lowest link cost as the final travel route.
[0027]
For example, as illustrated in Fig. 3, assume that the candidate route
extractor
54 extracts four road-basis candidate routes a to d, for a current position P
of the vehicle
V acquired by the position acquirer 51 and a destination Q set by the
destination setter
52. The
candidate route a is a route which branches off from a road B on which the
vehicle V is traveling to a road A and then merges with the road B again. The
candidate route b is the road B. The candidate route c is a route which
branches off
from the road B to the road C and then merges with the road B via a road D.
The
candidate route d is a route which branches off from the road B to the road C
and then
merges with the road B again.
[0028]
In this case, the travel route determiner 55 calculates the link cost of each
of
lanes included in the candidate routes a to d, and determines a route along a
right lane of
the road A with the lowest link cost in the candidate route a, as the travel
route. For
example, the travel route determiner 55 may calculate the lane-basis link
costs only for
sections indicated by the traffic jam information in the candidate routes.
[0029]
Generally, the road A including a lane which is congested and a lane which is
not congested is considered simply as a congested road, and is not selected as
the
optimal path. The candidate route c is thus likely to be determined as the
optimal
route.
[0030]
Meanwhile, since the route searching device according to the embodiment of
the present invention extracts multiple candidate routes based the
predetermined
conditions, the route searching device can accurately search for the optimal
route by
calculating the lane-basis link cost of each candidate route. Moreover, since
the route
searching device according to the embodiment of the present invention extracts
multiple
CA 02993764 2018-01-25
8
road-basis candidate routes and then calculates the lane-basis link costs of
the respective
candidate routes, the route searching device can prevent the processing load
of the
lane-basis route searching from becoming large and efficiently search for the
optimal
travel route.
[0031]
As described above, the route searching device according to the embodiment of
the present invention calculates the lane-basis link costs of the multiple
road-basis
candidate routes and selects the lane-basis travel route from the multiple
candidate
routes. Hence, the route searching device according to the embodiment of the
present
invention can improve efficiency and accuracy of the lane-basis route
searching.
[0032]
Moreover, when any of the candidate routes includes the traffic jam section,
the
route searching device according to the embodiment of the present invention
calculates
the lane-basis link cost only for the traffic jam section. The route searching
device
according to the embodiment of the present invention can thereby reduce the
processing
load in the route searching.
[0033]
Furthermore, when the travel route includes the traffic jam section, the route
searching device according to the embodiment of the present invention searches
for a
bypass route bypassing the traffic jam section. Accordingly, when the
determined
travel route includes the traffic jam section, the route searching device
according to the
embodiment of the present invention can search for the travel route which is
more
optimal.
[0034]
Moreover, the route searching device according to the embodiment of the
present invention extracts the route with the shortest travel distance, the
route with the
shortest travel time not considering the traffic information, and the route
with the
shortest travel time considering the traffic information, as multiple
candidate routes.
The route searching device according to the embodiment of the present
invention can
thus reduce the possibility of the optimal route being excluded from the
candidate routes,
CA 02993764 2018-01-25
9
in cases such as where the routes with the shortest required time not
considering the
distance and the traffic jam information all include the traffic jam section.
[0035]
Moreover, in the route searching device according to the embodiment of the
present invention, the degree of contribution of the traffic information to
the road-basis
link costs used for the extraction of the candidate routes is lower than the
degree of
contribution of the traffic information to the lane-basis link costs used for
the
determination of the travel route. The route searching device according to the
embodiment of the present invention can thus reduce the possibility of the
optimal route
being excluded from the candidate routes, in cases such as where the routes
with the
shortest required time not considering the distance and the traffic jam
information all
include the traffic jam section.
[0036]
(Other Embodiments)
Although the present invention has been described above by using the
aforementioned embodiment, it should not be understood that the description
and
drawings forming part of this disclosure limit the present invention. From
this
disclosure, various alternative embodiments, examples, and operations
techniques will
be found by those skilled in the art.
[0037]
For example, in the embodiment described above, the current position of the
vehicle V is not limited to the current position obtained by using the
position
measurement device 10 and the sensor group 30. The position acquirer 51 may
acquire, as the current position, a start point which is set like the
destination at a
location different from the current position.
[0038]
Moreover, the present invention includes various embodiments and the like
which are not described herein such as configurations mutually adopting the
aforementioned configurations, as a matter of course. Accordingly, the
technical scope
of the present invention should be determined only by the matters specifying
the
CA 02993764 2018-01-25
invention in the scope of claims regarded as appropriate based on the
aforementioned
description.
[0039]
Furthermore, the functions described in the embodiment of the present
invention can be executed by one or multiple processing circuits. The
processing
circuit includes a programed processing device such as a processing device
including an
electric circuit. The processing circuit may include devices such as circuit
components
and an application specific integrated circuit (ASIC) designed to execute the
described
functions.
INDUSTRIAL APPLICABILITY
[0040]
The present invention can provide the route searching device and the route
searching method which can improve the efficiency and accuracy of the lane-
basis route
searching by selecting the lane-basis travel route from the multiple road-
basis candidate
routes.
REFERENCE SIGNS LIST
[0041]
40 storage
41 map information
51 position acquirer
52 destination setter
53 information acquirer
54 candidate route extractor
55 travel route determiner
