CN101473358B - Route retrieval system, route retrieval server, terminal device and route retrieval method - Google Patents
Route retrieval system, route retrieval server, terminal device and route retrieval method Download PDFInfo
- Publication number
- CN101473358B CN101473358B CN2006800550448A CN200680055044A CN101473358B CN 101473358 B CN101473358 B CN 101473358B CN 2006800550448 A CN2006800550448 A CN 2006800550448A CN 200680055044 A CN200680055044 A CN 200680055044A CN 101473358 B CN101473358 B CN 101473358B
- Authority
- CN
- China
- Prior art keywords
- activity
- mentioned
- place
- path
- node
- Prior art date
- Legal status (The legal status 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 status listed.)
- Expired - Fee Related
Links
- 238000000034 method Methods 0.000 title claims description 30
- 230000000694 effects Effects 0.000 claims description 264
- 230000007246 mechanism Effects 0.000 claims description 103
- 230000009471 action Effects 0.000 claims description 8
- 238000012545 processing Methods 0.000 claims description 4
- 238000004891 communication Methods 0.000 description 14
- 230000015572 biosynthetic process Effects 0.000 description 12
- 238000009826 distribution Methods 0.000 description 10
- 238000012546 transfer Methods 0.000 description 7
- 238000010295 mobile communication Methods 0.000 description 4
- 238000010586 diagram Methods 0.000 description 3
- 238000003860 storage Methods 0.000 description 3
- 238000009825 accumulation Methods 0.000 description 2
- 230000033228 biological regulation Effects 0.000 description 2
- 230000003796 beauty Effects 0.000 description 1
- 230000008901 benefit Effects 0.000 description 1
- 230000008859 change Effects 0.000 description 1
- 238000013500 data storage Methods 0.000 description 1
- 230000004069 differentiation Effects 0.000 description 1
- 238000005516 engineering process Methods 0.000 description 1
- 238000012905 input function Methods 0.000 description 1
- 230000014759 maintenance of location Effects 0.000 description 1
- 230000006855 networking Effects 0.000 description 1
- 230000008929 regeneration Effects 0.000 description 1
- 238000011069 regeneration method Methods 0.000 description 1
- 238000011160 research Methods 0.000 description 1
- 230000003068 static effect Effects 0.000 description 1
- 208000004371 toothache Diseases 0.000 description 1
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q50/00—Information and communication technology [ICT] specially adapted for implementation of business processes of specific business sectors, e.g. utilities or tourism
- G06Q50/40—Business processes related to the transportation industry
-
- G—PHYSICS
- G09—EDUCATION; CRYPTOGRAPHY; DISPLAY; ADVERTISING; SEALS
- G09B—EDUCATIONAL OR DEMONSTRATION APPLIANCES; APPLIANCES FOR TEACHING, OR COMMUNICATING WITH, THE BLIND, DEAF OR MUTE; MODELS; PLANETARIA; GLOBES; MAPS; DIAGRAMS
- G09B29/00—Maps; Plans; Charts; Diagrams, e.g. route diagram
- G09B29/003—Maps
- G09B29/006—Representation of non-cartographic information on maps, e.g. population distribution, wind direction, radiation levels, air and sea routes
- G09B29/007—Representation of non-cartographic information on maps, e.g. population distribution, wind direction, radiation levels, air and sea routes using computer methods
-
- 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/3407—Route searching; Route guidance specially adapted for specific applications
- G01C21/3423—Multimodal routing, i.e. combining two or more modes of transportation, where the modes can be any of, e.g. driving, walking, cycling, public transport
-
- 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/3407—Route searching; Route guidance specially adapted for specific applications
- G01C21/343—Calculating itineraries, i.e. routes leading from a starting point to a series of categorical destinations using a global route restraint, round trips, touristic trips
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q10/00—Administration; Management
- G06Q10/04—Forecasting or optimisation specially adapted for administrative or management purposes, e.g. linear programming or "cutting stock problem"
- G06Q10/047—Optimisation of routes or paths, e.g. travelling salesman problem
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q50/00—Information and communication technology [ICT] specially adapted for implementation of business processes of specific business sectors, e.g. utilities or tourism
-
- G—PHYSICS
- G08—SIGNALLING
- G08G—TRAFFIC CONTROL SYSTEMS
- G08G1/00—Traffic control systems for road vehicles
- G08G1/005—Traffic control systems for road vehicles including pedestrian guidance indicator
-
- G—PHYSICS
- G08—SIGNALLING
- G08G—TRAFFIC CONTROL SYSTEMS
- G08G1/00—Traffic control systems for road vehicles
- G08G1/09—Arrangements for giving variable traffic instructions
- G08G1/0962—Arrangements for giving variable traffic instructions having an indicator mounted inside the vehicle, e.g. giving voice messages
- G08G1/0968—Systems involving transmission of navigation instructions to the vehicle
- G08G1/096805—Systems involving transmission of navigation instructions to the vehicle where the transmitted instructions are used to compute a route
- G08G1/096811—Systems involving transmission of navigation instructions to the vehicle where the transmitted instructions are used to compute a route where the route is computed offboard
Landscapes
- Engineering & Computer Science (AREA)
- Physics & Mathematics (AREA)
- Business, Economics & Management (AREA)
- General Physics & Mathematics (AREA)
- Remote Sensing (AREA)
- Radar, Positioning & Navigation (AREA)
- Human Resources & Organizations (AREA)
- Theoretical Computer Science (AREA)
- Economics (AREA)
- Strategic Management (AREA)
- Marketing (AREA)
- General Business, Economics & Management (AREA)
- Tourism & Hospitality (AREA)
- Automation & Control Theory (AREA)
- Primary Health Care (AREA)
- General Health & Medical Sciences (AREA)
- Health & Medical Sciences (AREA)
- Game Theory and Decision Science (AREA)
- Educational Administration (AREA)
- Computer Hardware Design (AREA)
- General Engineering & Computer Science (AREA)
- Life Sciences & Earth Sciences (AREA)
- Ecology (AREA)
- Mathematical Physics (AREA)
- Development Economics (AREA)
- Educational Technology (AREA)
- Entrepreneurship & Innovation (AREA)
- Operations Research (AREA)
- Quality & Reliability (AREA)
- Navigation (AREA)
- Instructional Devices (AREA)
- Traffic Control Systems (AREA)
Abstract
A route search system for simply searching for a guidance route for participating in one of the events of the same kind held within time zones at places. The route search system (10) comprises route search network data (35) for searching for a route on foot and by public transportation, route searching means (33), network data editing means (38), and event data (39) including the event holding place and the event holding time. The network data editing means (38) connects the event holding place as an event site node involving position information to the route search network data (35), registers the event as an event virtual node not involving any position information, and connects the event site node to the event virtual node through links according to the different event holding times. The route searching means searches for a guidance route from the departure place to the relevant event virtual node as the destination when search for a route from a desired place as a departure place to the place of a specific event among the events is requested.
Description
Technical field
Show as film, when the present invention relates in a plurality of places and band of a plurality of time, hold connatural activity, retrieve the optimal path of one of activity held, path candidate etc. are participated in utilization on foot with the vehicles route retrieval system more to guiding path.
The present invention relates to route retrieval system, this route retrieval system is in aforesaid route retrieval system, each activity held the place as the movable meeting-place node that positional information is arranged, with movable as the activity imaginary node that does not have positional information, connect the movable meeting-place node of holding this activity, with between movable meeting-place node and activity imaginary node, use based on the holding link constantly of activity and connect, above-mentioned movable meeting-place node is connected the route search that comprises the transportation network data uses in the network data, thereby carry out route search.
Background technology
In the past, utilized map datum, road data, retrieval from the starting point of expectation to the path of destination, thereby guide user's guider, navigational system are by known.As such guider, navigational system and the device that is practical is to be loaded on the automobile and to the vehicle navigation apparatus of driver to guiding path; Be used as navigation terminal with portable phone,, receive its result, accept the communication type navigational system of route guidance etc. to route retrieval server transmit path retrieval requirement.
Especially, the communication type navigational system is that the portable terminal device with portable phone etc. is used as navigation terminal, also can be used as the navigational system that the pedestrian uses and is used.The navigational system of using as the pedestrian, the preferably additional route guidance function that has comprised the vehicles, add the retrieval and the guide in path on foot, on route retrieval server the storage vehicles route or the time of running data, to be added in the retrieval and guide in path on foot from the stand path (by bus candidate's train) of point of destination of expectation of expectation, thereby the navigational system with guide function also exists.In addition, also exist and do not follow the route search in path on foot, accept the distribution of the information of the route, timetable of the vehicles, the train that can ride etc. from information distributing server, thus the traffic guidance system that shows.
Be used in general guider, the path searching device of communication and navigation system, path searching method, for example open in following patent documentation 1 (spy opens communique 2001-No. 165681).This navigational system sends to information distributing server from portable navigation terminal with the information of departure place and destination, in information distributing server, and the path of retrieval symbol search condition from the data of road net, the network of communication lines and carry out guide.As search condition, have travel mechanism from origin to destination, for example on foot, automobile, railway and on foot and use etc., these are carried out route search as one of search condition.
Information distributing server possesses, with the position of the point of crossing of the road (path) of map datum, turning point as node, connect each node the path as link, all the cost information of links (distance, required time) is as database.And, information distributing server by the comparable data storehouse, is retrieved the link from the node of departure place to the node of destination in turn, the node, link of looking for link cost information minimum can carry out the guide of shortest path to portable navigation terminal as to guiding path.The method of such route search, employing be the method that is called label setting method or Di Jiesitela (Dijkstra) algorithm.The method of the route search that utilizes this Di Jiesitela (Dijkstra) algorithm is also disclosed in patent documentation 1.
Retrieval utilizes the route retrieval system in the path of the vehicles to possess, according to the route search condition of time sailing date of user's appointment, departure place, destination, due in etc., the data time of running of each vehicles are carried out the database and transportation network is carried out the data of data base system based on this database time of running of data base system.And, with reference to these databases, to comprise then change take advantage of (transfer) and connect departure place and destination, available each transport body (each electric car, route motorbus) is as the path, thereby it is looked in turn, point out one or more to meet the candidate to guiding path (transport bodies of station, departure place, station, destination, route, train etc.) of route search condition.As the route search condition, generally can also specify the condition of required time, number of transfer, freight charges etc.
In addition, system as the retrieval of carrying out the relevant vehicles, guide, following navigational system also is provided, promptly, from the end device of portable phone etc., connect the route information of the guide vehicles or the information distributing server of table information, specify expectation the station of setting out, set out constantly, stand in order ground etc., the distribution of information of the route that acceptance can be ridden or the transport body of train, electric car etc. is presented at the navigational system on the end device.Generally when end device carries out such utilization, to input to end device for the specific URL (Uniform Resource Locator) that wants the place that the information downloaded exists or with the address information of zone name etc., visit is by this address information specific Distributor (information site), thus the formation of the information of download expectation.
Utilized the route search network data in the navigational system of route search, route guidance of the vehicles, identical with the road network data in vehicle mounted navigational system or the pedestrian navigation system, except respectively standing with traffic route as node, carry out outside the data of networking between standing as both sides' link, on the transport body that moves on each each traffic route, add the time of running, required time of each link data as link cost.Also have, also exist to add the freight charges data, add the system that carries out guide to the freight charges of guiding path of retrieval.
Therefore, be distributed on the guide path data of end device, comprise the motorbus of riding as the route route search condition, from origin to destination path, guide, electric car, train of user's appointment and constantly, timetable etc. is pasted at disclosed so-called station, time of running table or railway station, be processed into the form of former state or the necessary video data that partly can be presented at picture etc., thereby be distributed to end device.On end device, show that show or station subsides timetable data, the time of running to guiding path, can confirm path, the transport body that should ride.
Utilize the vehicles and carry out the path searching method of route search, for example, in following patent documentation 2 (spy opens communique 2000-No. 258184), as the transportation network path searching method and by open.Disclosed transportation network path searching method is in this patent documentation 2, with the place as node, intersite shows transportation network as link, utilize computing machine, by the label setting method, with the transportation network path searching method in the shortest cost conditional information retrieval path in place, ground from the departure place to the order.
In the method, as from the departure place and the destination, arrive the path at the station of the vehicles that utilize, utilize the latitude longitude information, try to achieve from the departure place and the destination, arrive the air line distance at the station of the vehicles that utilize, and from the destination to the air line distance at the station of the vehicles that utilize, this air line distance is calculated average unit cost as variable, try to achieve all stations that utilizes the vehicles in the cost scope that is included in above-mentioned average unit cost appointment, decision walking path, the walking path of trying to achieve is programmed on the transportation network path of the vehicles, performance comprehensive traffic network, utilize computing machine, under the cost condition that the method for determining by label is tried to achieve, retrieve.
If utilize and with on foot with the route retrieval system of transport body, the user moves to the nearest station of periphery on foot from the departure place (for example own dwelling house) of expectation, move to the nearest station of destination (for example cinema) with the vehicles, also have, move to destination (cinema) on foot from nearest station, will carry out the result of integrated retrieval as obtaining to optimal path respectively to guiding path.Yet during as the destination, it is purpose that nature is viewed and admired with film with cinema.
Generally provide the system of the information of activities such as relevant film to be, for example in following patent documentation 3 (spy opens communique 2001-No. 325514), disclose " server unit ".Disclosed server unit in this patent documentation 3, be the film introduction information of showing film etc. that can distribute desired region, type, the guide look information that receives the area information that sends from mobile communication terminal, area information is relevant therewith movie title sends to mobile communication terminal and constitutes like that.
And, receive the information of any movie title that send from mobile communication terminal, in the above-mentioned guide look information of expression, will send on the mobile communication terminal with the film introduction information of the film of the movie title of the information representation of this reception.Thus, the user can accept the distribution of the film introduction information in the desired region from server unit.
When viewing and admiring film or during just disclosed recent film, shown identical film in a plurality of cinemas.At this moment, be not that showing of whole cinema is constantly all identical, it is all different generally to be that the time is shown by each cinema.Therefore, with cinema as the destination, utilize route retrieval system and when carrying out route search, the user also needs showing of film is present to the mind, is that condition requires route search as the due in to the destination zero hour except that specific cinema as the destination.
Patent documentation 1: the spy opens 2001-No. 165681 communiques (Fig. 1, Fig. 2)
Patent documentation 2: the spy opens 2000-No. 258184 communiques (Fig. 4, Fig. 7)
Patent documentation 3: the spy opens 2001-No. 325514 communiques (Fig. 1, Fig. 6)
Summary of the invention
The problem that invention is solved
As mentioned above, viewing and admiring film reaches, when just disclosing recent film, shows identical film in a plurality of cinemas.At this moment, be not constantly all identical showing of whole cinemas, generally each cinema show all different constantly.Therefore, with cinema as the destination, when utilizing the route retrieval system searching route, the user is except that specific cinema as the destination, also need be present to the mind the zero hour of showing of film, with the due in to the destination is that condition requires route search, as above-mentioned patent documentation 3 disclosed server units be, the information of relevant film is provided, but there is following problems, in order to view and admire film, which cinema the user must determine to select, and its path to cinema will be selected which path etc.
In addition, in patent documentation 2 disclosed route retrieval systems, can retrieve will be as the physical location of the cinema of destination as node, utilize on foot, transport body, to the optimal path that arrives that node, a plurality of selectable path candidate, but also there is the route search constantly of showing that to consider film.Therefore, in order relatively to arrive near the path of a plurality of cinemas of showing same film, each cinema need be carried out route search individually as the destination.
Utilize and with on foot with the route retrieval system of transport body, when retrieval arrives the path of cinema, accept the result of route search, to the optimal path guide of the cinema that sets as the destination, even go to this cinema, also can often experience that time and show because of full situation that can not admission.At that time, identical film is shown by near other cinemas existing, the situation that cinema has vacant position over there.Under these circumstances, in patent documentation 2 disclosed route retrieval systems, as mentioned above, exist and to set a plurality of cinemas, carry out the problem of route search respectively as the destination.
Such problem is not limited to due to film and is viewed and admired, and is in a plurality of places and a plurality of time band is held connaturally when movable, and retrieval utilization is participated in the problem of common generation when holding one of movable path on foot with the vehicles.For example, in the beauty parlor, a plurality of places such as hospital, western-style restaurant, existing provides the almost facility of congeniality service, can determine to provide the time band of service by reservation, even the route search in the service of the empty time band of also not preengage that is used for accepting data base system also can produce same problem.
In this manual, will be in a plurality of like this places and band of a plurality of time situation of holding connatural activity, service be called " holding activity " more, the invention provides a kind of utilization is used to participate in the optimal path, path candidate etc. of one of activity held on foot with the vehicles, retrieval route retrieval system to guiding path.
The application's inventor, in order to address the above problem, repeat the result of various researchs: if activity held the place as the movable meeting-place node with positional information, with movable as the activity imaginary node that does not have positional information, connect the movable meeting-place node of holding this activity, use based on the difference of activity hold constantly a plurality of links and between connection activity meeting-place node and activity imaginary node, with above-mentioned movable meeting-place node be connected comprise the transportation network data route search with on the network data, carry out route search, thereby can address the above problem a little, reach and finish purpose of the present invention.
That is to say, the objective of the invention is to, a kind of a plurality of places that are not set at are provided, can retrieve simply and be used to participate in a plurality of places and the route retrieval system to guiding path, route retrieval server, end device and the path searching method of one of connatural activity that a plurality of time band is held.
Be used to solve the method for problem
In order to solve above-mentioned problem, the application's the 1st invention is characterized in that, is the departure place of setting expectation, and retrieval is used to participate in the route retrieval system in the path of one of connatural activity that a plurality of places and band of a plurality of time hold,
Above-mentioned route retrieval system possesses: be used to retrieve utilized on foot with the route search in the path of the vehicles with network data, route search mechanism, network data editor mechanism and possessed holding the place, holding activity data constantly of above-mentioned activity,
Above-mentioned network data editor mechanism, above-mentioned activity held the place as the movable meeting-place node with positional information, connect above-mentioned route search network data, with above-mentioned movable as the activity imaginary node that does not have positional information, use a plurality of links of holding constantly to connect from movable meeting-place node to the activity imaginary node based on the difference of activity
With the expectation the place as the departure place, when from above-mentioned activity, specify specific activity, when requiring route search, above-mentioned route search mechanism, with this activity imaginary node as the destination, retrieval from above-mentioned departure place to guiding path, guide should activity and this activity hold the place.
In above-mentioned the 1st invention, above-mentioned route search mechanism is, preferably will be from above-mentioned departure place to as the optimal path of the activity imaginary node of destination or a plurality of path candidates of comprising optimal path as retrieving to guiding path.
In above-mentioned the 1st invention, constantly the link of holding based on above-mentioned activity preferably is used in the movable zero hour, from movable meeting-place node, in the form performance of the transit schedules of the termination arrival activity constantly imaginary node of activity.
In above-mentioned the 1st invention, above-mentioned activity data is, by network, provides the server from the action message that relevant this action message is provided and to obtain.
In addition, in above-mentioned the 1st invention, above-mentioned activity is distinguished by kind, above-mentioned network data editor mechanism, the kind of above-mentioned activity is registered as the kind imaginary node that does not have positional information, from the activity imaginary node to the kind imaginary node, connect with link with certain cost
With the expectation the place as the departure place, when from mentioned kind, specify specific kind, when requiring route search, above-mentioned route search mechanism can be with this kind imaginary node as the destination, retrieval from above-mentioned departure place to guiding path, guide should activity and this activity hold the place.
In above-mentioned the 1st invention, also have, above-mentioned route search mechanism, the optimal path of kind imaginary node that preferably will be from above-mentioned departure place to the destination or a plurality of path candidates of comprising optimal path are as retrieving to guiding path, guide should activity and this activity hold the place.
In addition, the application's the 2nd invention is characterized in that,
Route retrieval server is connected with the end device of setting the departure place by network, and it has possessed to be used to retrieve and has utilized on foot with the route search usefulness network data in the path of the vehicles and route search mechanism,
Above-mentioned route retrieval server in order to retrieve the path that is used to participate in one of congeniality activity that a plurality of places and band of a plurality of time hold, possesses: network data editor mechanism and possessed above-mentioned activity and hold the place, hold activity data constantly,
Above-mentioned network data editor mechanism, the place of holding of above-mentioned activity is connected above-mentioned route search network data as the movable meeting-place node with positional information, above-mentioned activity is registered as the activity imaginary node that does not have positional information, from movable meeting-place node to the activity imaginary node, use a plurality of links of holding constantly to connect based on the difference of activity
With the expectation the place as the departure place, when requiring route search when from above-mentioned activity, specifying specific activity, above-mentioned route search mechanism with this activity imaginary node as destination, retrieval from above-mentioned departure place to guiding path, to above-mentioned end device guide should activity and this activity hold the place.
In above-mentioned the 2nd invention, above-mentioned route search mechanism, preferably will be from above-mentioned departure place to as the optimal path of the activity imaginary node of destination or comprise a plurality of path candidates of optimal path, as retrieving to guiding path.
In above-mentioned the 2nd invention, based on the link constantly of holding of above-mentioned activity, preferably adopt following form to show, promptly, in the zero hour of activity, from movable meeting-place node, at the form of the transit schedules of the termination arrival activity constantly imaginary node of activity.
In above-mentioned the 2nd invention, above-mentioned activity data is, by network, provides the server from the action message that relevant this action message is provided and to obtain.
In addition, in above-mentioned the 2nd invention, above-mentioned activity is distinguished by kind, above-mentioned network data editor mechanism registers the kind of above-mentioned activity as the kind imaginary node that does not have positional information, from the activity imaginary node to the kind imaginary node be, connect with link with certain cost
With the expectation the place as the departure place, specify specific kind and when requiring route search from mentioned kind, above-mentioned route search mechanism is, with this kind imaginary node as the destination, retrieval from above-mentioned departure place to guiding path, guide should activity and this activity hold the place.
In above-mentioned the 2nd invention, also have, above-mentioned route search mechanism, will be from above-mentioned departure place to as the optimal path of the kind imaginary node of destination or a plurality of path candidates of comprising optimal path as retrieving to guiding path, guide should activity and this activity hold the place.
In addition, the application's the 3rd invention is characterized in that,
Be the departure place of setting expectation, retrieval is used for participating in the path searching method of route retrieval system in the path of one of connatural activity that a plurality of places and band of a plurality of time hold,
Above-mentioned route retrieval system possesses: be used to retrieve the route search network data of having utilized on foot with the path of the vehicles, and route search mechanism, network data editor mechanism, and possessed holding the place, holding activity data constantly of above-mentioned activity,
Above-mentioned network data editor mechanism has: with above-mentioned activity hold the place as movable meeting-place node with positional information, connect the step of above-mentioned route search with network data; Above-mentioned activity is registered as the activity imaginary node that does not have positional information, be, use based on the difference of activity and hold a plurality of link-attached step constantly from movable meeting-place node to the activity imaginary node; With the expectation the place as the departure place, when requiring route search when from above-mentioned activity, specifying specific activity, above-mentioned route search mechanism with this activity imaginary node as the destination, retrieval is from the step to guiding path of above-mentioned departure place, and guide is carried out in the place of holding of this activity and this activity.
In above-mentioned the 3rd invention, the retrieval of above-mentioned route search mechanism is to the step of guiding path, preferably comprise retrieval from above-mentioned departure place to as the optimal path of the activity imaginary node of destination or comprise the processing of a plurality of path candidates of optimal path.
In addition, in above-mentioned the 3rd invention, above-mentioned activity is passed through and the kind differentiation, best above-mentioned network data editor mechanism also has, the kind of above-mentioned activity is registered as the kind imaginary node that does not have positional information, usefulness has the link-attached step of certain cost from the activity imaginary node to the kind imaginary node
With will with the expectation the place as the departure place, when requiring route search when from mentioned kind, specifying specific kind, above-mentioned route search mechanism, with this kind imaginary node as the destination, retrieval is from the step to guiding path of above-mentioned departure place, and guide is carried out in the place of holding of this activity and this activity.
In above-mentioned the 3rd invention, also have, the retrieval of above-mentioned route search mechanism is to the step of guiding path, preferably comprise retrieval from above-mentioned departure place to as the optimal path of the activity imaginary node of destination or comprise the processing of a plurality of path candidates of optimal path.
In addition, the application's the 4th invention is characterized in that,
In order to retrieve the path of participating in one of connatural activity that a plurality of places and band of a plurality of time hold, end device possesses: route search network data, route search mechanism, network data editor mechanism, and possessed holding the place, holding activity data constantly of above-mentioned activity
Above-mentioned network data editor mechanism, with above-mentioned activity hold the place as movable meeting-place node with positional information, connect above-mentioned route search network data; Above-mentioned activity is registered as the activity imaginary node that does not have positional information, be, use a plurality of links of holding constantly to connect based on the difference of activity from movable meeting-place node to the activity imaginary node; Specify the departure place, from above-mentioned activity, specify specific activity from end device, when requiring route search, above-mentioned route search mechanism is by network, connects with this activity imaginary node as destination, the retrieval route retrieval server to guiding path from above-mentioned departure place.
Above-mentioned end device has possessed the departure place and the activity of specifying expectation to above-mentioned route retrieval server, thus the mechanism that the transmit path retrieval requires.
In above-mentioned the 4th invention, also have, above-mentioned activity is distinguished by kind, best above-mentioned network data editor mechanism, the kind of above-mentioned activity is registered as the kind imaginary node that does not have positional information, from the activity imaginary node be to the kind imaginary node, connect with link with certain cost, with the expectation the place as the departure place, when requiring route search when specify specific kind from mentioned kind, above-mentioned route search mechanism is to connect with this kind imaginary node as the destination, retrieval is from the route retrieval server to guiding path of above-mentioned departure place
Above-mentioned end device preferably also possesses the departure place and the kind of specifying expectation to above-mentioned route retrieval server, the mechanism that the transmit path retrieval requires.
The effect of invention
In the application's the 1st invention, above-mentioned route retrieval system, possess: be used to retrieve utilized on foot with the route search in the path of the vehicles with network data, route search mechanism, network data editor mechanism and possessed holding the place, holding activity data constantly of above-mentioned activity
Above-mentioned network data editor mechanism, the place of holding of above-mentioned activity is connected above-mentioned route search network data as the movable meeting-place node with positional information, above-mentioned activity is registered as the activity imaginary node that does not have positional information, use from movable meeting-place node to the activity imaginary node based on the difference of activity and hold a plurality of links constantly and connect
With the expectation the place as the departure place, when requiring route search when from above-mentioned activity, specifying specific activity, above-mentioned route search mechanism, with this activity imaginary node as the destination, retrieval from above-mentioned departure place to guiding path, guide should activity and this activity hold the place.
By such formation, show as film, hold connatural movable as the playground node with the positional information of holding the place of holding this activity can be with in a plurality of places and a plurality of time, each activity is held the activity imaginary node that does not have positional information of the movable meeting-place node of this activity as connection, connect therebetween by a plurality of links of holding based on the difference of activity constantly, access path retrieval network, so can and utilize the node of the common vehicles to carry out same treatment, specified activities with activity, retrieve simply with the activity of this appointment optimal path or path candidate from the departure place of expectation as the destination.
In addition, in the application's the 2nd invention, the route retrieval server of the route retrieval system of the 1st invention that constitutes relevant the application can be provided, in the application's the 3rd invention, can be provided for realizing the path searching method of route retrieval system of relevant the application's the 1st invention.In addition, in the application's the 4th invention, can provide the end device of the route retrieval system of the 1st invention that constitutes relevant the application.
Description of drawings
Fig. 1 is system's pie graph that the route retrieval system of the relevant embodiments of the invention of expression constitutes.
Fig. 2 is the module map of detailed formation of the route retrieval system of the relevant embodiments of the invention of expression.
Fig. 3 be expression storage relevant in a plurality of places and the data of database of the information (activity data) of the connatural activity held of band of a plurality of time constitute the figure of an example.
Fig. 4 is the mode chart of the concept data of expression road network.
Fig. 5 is the mode chart of the concept data of expression transportation network.
Fig. 6 is that expression activity meeting-place node has connected the state model figure of route search with network data.
Fig. 7 is the continue conceptual schema figure of activity meeting-place node and activity imaginary node of expression.
Fig. 8 be expression with the kind of activity as the kind imaginary node, the conceptual schema figure of the activity imaginary node of this kind that continues.
To be expression carry out the result's of route search mode chart with the place S of Fig. 7 to Fig. 9 as starting point, selection activity.
Figure 10 is the notion of route search is carried out in expression as the final destination as the place that has other physical locations via ground, with its front with the activity imaginary node a mode chart.
Symbol description
10: guider 12: network
20: end device 21: control gear
22: communication agency 23: location mechanism
24: indication mechanism 25: guide path data storing mechanism
26: distribution requires editor mechanism 27: the operation input mechanism
30: route retrieval server 31: control gear
32: route guidance mechanism 33: route search mechanism
34: communication agency 35: the route search network data
36: road network data 37: the transportation network data
38: network data editor mechanism 39: activity data
40: application link mechanism 50: information distributing server
Embodiment
Below, utilize embodiment and accompanying drawing, explain concrete example of the present invention.But embodiment shown below, just illustration is used for specializing the route retrieval system of technological thought of the present invention, be not with the present invention specific to this route retrieval system, the route retrieval system that is included in other embodiments in the claim scope also can be suitable equally.
The route retrieval system 10 of relevant embodiments of the invention as shown in Figure 1, is following formation, and by the network 12 of the Internet etc., connection will utilize the end device 20 and the route retrieval server 30 of the portable terminal device of portable phone, PDA, music player etc.Also have, in the present embodiment, to route search that communication type is provided, be illustrated as concrete example to the route retrieval system 10 of guiding path, but the present invention is not limited thereto, also applicable to the route retrieval system of self (stand-alone type).
Fig. 2 is the module map of detailed formation of the route retrieval system 10 of the relevant embodiments of the invention of expression.The route retrieval system 10 of relevant embodiments of the invention, as described in the module map of Fig. 2, its formation possesses, end device 20, route retrieval server 30 and information distributing server 50 that the network 12 by the Internet etc. communicates.
In the present embodiment, being with the connatural activity of holding as a plurality of places and a plurality of time, is that concrete example describes with the film.In the past, want to view and admire the people of film, utilize above-mentioned patent documentation 1 disclosed system etc., select zone (region of cinema), type (kind of film), view and admire the time band, thereby the film viewed and admired of decision accepts to show the distributing information of map of the cinema of this film.That is, the information of publication as up-to-date information from the thing that portable terminal device is obtained is on film magazine etc., has not changed since in the past.
Especially in the city, the film that popularity is arranged is in the premiere of a plurality of cinemas, even in same area, show in a plurality of cinemas, at the full seat in certain zone and the retrieval of free seat etc. is arranged is very important in nigh zone.In addition, according to cinema, owing to show the difference zero hour, so if consider the required time etc. in its actual path that goes to the cinema, options is very many, is difficult to make selection best concerning own.
Therefore, in the present invention,, decision start time and termination time, can participate in a plurality of places, a plurality of time in addition simply and be with the route search for the moment of holding activity as showing like that of film at the cinema.Therefore, the data storage that relevant film is shown is in activity data 39.
Be stored in the data in the activity data 39, starting application link mechanism 40 for example constitutes according to data shown in Figure 3, collects from information distributing server 50.That is to say, activity held the place if movie title (movable title), the film kind that the positional information of each cinema of words of film (latitude longitude), each cinema are shown, store during holding.Showing constantly of cinema distinguished, each activity (film is shown) of repeatedly showing is as each activity, and attached with distinguished symbol (movable ID), write down it and show the zero hour, stop constantly.And, relevant each activity, attached with based on showing the zero hour, stopping link number constantly.
In Fig. 3, the latitude longitude of the A of cinema (Theater A) position is respectively (X1Y1), the film of showing be film 1 (Movie 1, and kind is Romance: describing love affairs), according to 4 times of A101～A104 of ID, hold at each of Fig. 3 and constantly to show.The position of the B of cinema (Theater B), the latitude longitude is respectively (X2Y2), the film of showing be the film 1 identical with the A of cinema (Movie1, kind is Romance: describing love affairs), according to 4 times of B101～B104 of ID, Fig. 3 each hold and constantly show.
Showing the A of cinema, the B of cinema of film 1, is the movable meeting-place node with positional information (latitude longitude), and when network data was used in the access path retrieval, can retrieve with the A of cinema, the B of cinema was the path of destination.And, the film that each cinema is shown defines as the activity imaginary node, use based on different a plurality of links of showing band constantly (zero hour, stop constantly) (with reference to link L-AM1 of Fig. 3 etc.) when being connected with movable meeting-place node, the activity imaginary node is equivalent to the station of the vehicles, each link can be with the A of cinema, the B of cinema with movable meeting-place node, and handles in the same manner as the electric car at the station of setting out.
Here, different with transportation network is that the activity imaginary node is not have positional information as the tram stop.And movable meeting-place node and activity imaginary node are used based on the different a plurality of links constantly (with reference to link L-AM1 of Fig. 3 etc.) of holding to connect.Here as described above, the link of connection activity meeting-place node and activity imaginary node can be the station of setting out with movable meeting-place, and is the electric car at arrival station with the activity imaginary node, thereby defines equally and show.Also have, in the present invention, the so-called activity imaginary node that does not have positional information, it is the implication that does not need the node of positional information, even if added any positional information, do not use its positional information yet, be essentially activity imaginary node with positional information.
Network data editor mechanism 38, specify the departure place of expectation from end device 20, select as movable film, when carrying out the route search requirement, with reference to activity data 39, as described above, the film (activity) of appointment held the place (A of cinema, the B of cinema) as movable meeting-place node with positional information, access path retrieval network data 35, each activity is registered as the activity imaginary node that does not have positional information, from movable meeting-place node to the activity imaginary node, use based on the difference of activity and hold a plurality of link-attached editor constantly, route search mechanism 33, with reference to the route search network data of being edited, can view and admire film with being used to and appointed the best to guiding path or comprise the best to several path candidates of guiding path as retrieving to guiding path.
Below, the route search that connects above-mentioned movable meeting-place joint or activity imaginary node is described with network data.Be used for the pedestrian navigation, be used for the road network data 36 that the route search of the automobile navigation of automobile is used, have as following formation.For example, road as shown in Figure 4, when by road A, B, when C forms, with the end points of road A, B, C, crossing, turning point etc. as node, represent to connect each internodal road with the link of aeoplotropism, the link cost (required time of walking link range or link) of node data (the latitude longitude of node), link data (link number) and each link is carried out the link cost data formation of datumization.
That is to say that in Fig. 4, Nn, Nm represent node, Nm represents the crossing of road.The link that connects each internodal aeoplotropism with arrow line (solid line, dotted line, 2 dot-and-dash lines) expression.There is the link towards up, the descending all directions of road in link, in Fig. 4, in order to simplify diagram, only illustrates the link of the direction of arrow.
When the data of such road network are carried out route search as route search with database, look for the link that connects from the node of departure place to the destination node, accumulate its link cost, the retrieval accumulation minimum path of link cost and carry out guide.That is to say, in Fig. 4, be that node AX, destination are when carrying out route search for node CY with the departure place, look for from node AX walking road A in turn, turn right at the 2nd crossing, enter the link of road C, arrival node CY, the accumulation link cost, the retrieval link cost the minimum link of accumulated value and carry out guide.
In Fig. 4, the path of other from node AX to node CY is not shown, in fact also has such path, and same retrieval can arrive the path of node CY from node AX, determines the minimum path of link cost in those paths as optimal path.The method is for example undertaken by the known algorithm that is called the Di Jiesite pulling method.
Relative therewith, be used for the transportation network data 37 of the route search of the vehicles, have following formation.For example, as shown in Figure 5, when by traffic route A, B, when C forms, each traffic route A, B, last each that is provided with of C are stood (referring to each airport on the aircraft route) as node, represent to connect each internodal interval with the link of aeoplotropism, with node data (latitude longitude), link data (link number) as network data.In Fig. 5, Nn, Nm represent node, and Nm represents the transfer point (transfer stop etc.) of traffic route, connect the link of each internodal aeoplotropism with arrow line (solid line, dotted line, 2 dot-and-dash lines) expression.There is the link towards up, the descending all directions of traffic route in link, in order to simplify diagram, only illustrates the link of the direction of arrow among Fig. 5.
Yet transportation network is compared with road network, the link cost fundamental difference.That is to say in road network, link cost is that fix, static, and in transportation network, as shown in Figure 5, a plurality of trains that move, aircraft (following each path with each train, aircraft etc. is called transport body) are arranged on traffic route.Regulation is at every turn from moment of the node of each transport body with arrive moment (with timetable data, service data regulation) of next node, and, exist each path may not link the situation of adjacent node.For example, walk rapidly and each such situation of train of standing and stopping.Under these circumstances, on identical traffic route, there are different a plurality of links, exist internodal required time according to transport body and different situations in addition.
In the illustrative transportation network of Fig. 5, there is a plurality of transport bodies (path) Aa～Ac on the same link of traffic route A ..., have a plurality of transport bodies (path) Ca～Cc on the traffic route C.Therefore, the operational network of the vehicles is different with simple road network, and each data of node, link, link cost become the total proportional data volume with transport body (paths of each aircraft, train etc.).Thus, the data of transportation network are compared with the data volume of road network, become huge data volume.Therefore, in view of the above the required time of route search, also becoming needs a lot of time.
Want to utilize such transportation network data, when retrieving path, can use whole transport body of (riding), the specific transport body that meets search condition when needing retrieval to arrive the destination from the departure place from certain departure place to the destination.
For example, in Fig. 5, appointment is with departure place certain specific setting out constantly as the node AX of traffic route A, carry out node CY with traffic route C when being the route search of destination, transport body Aa～the Ac that on traffic route A, moves ... in, with set out constantly later whole transport body when setting out in turn the path and select.And, due in according to the transfer node that arrives traffic route C, each the transport body Ca～Cc that on traffic route C, moves ... in, on the transfer node, whole combinations of the transport body that the moment that retrieval can be ridden is later, required time, number of transfer of accumulating each path etc. carries out guide.
Therefore, if in this retrieval above-mentioned movable meeting-place of connection node, activity imaginary node on the network data 35, set the departure place of expectation, during activity (film 1, film 2) that appointment is wanted to participate in, with this suitable activity imaginary node as the destination, route search mechanism 33 can be identical with common route search, carries out searching route.And, expectation can be arrived the optimal path of destination (stopping film views and admires), several path candidate constantly as retrieving to guiding path, guide connects the movable meeting-place node of this activity imaginary node.
On the other hand, end device 20, its formation possesses control gear 21, communication agency 22, location mechanism 23, indication mechanism 24, guide path data storing mechanism 25, distribution requires editor mechanism 26, operation input mechanism 27.Control gear 31 is not shown, is the microprocessor with RAM, ROM, processor, by being kept at the operation of the control program control each several part on the ROM.Location mechanism 23 possesses the GPS receiver, receives and handle gps satellite signal, the current location of location navigation terminal device 20 (latitude longitude).
Distribution requires editor mechanism 26, with use the departure place, destination of operation input mechanism 27 inputs or with the current location of the navigation terminal device 20 of location mechanism 23 locations as the departure place, according to these information, generate the route search requirement that sends to route retrieval server 30.When route retrieval server 30 requires to be used to participate in the route search of activity of film etc., on the menu screen that the user shows from operation input mechanism 27 or from indication mechanism 24, specify the moment (film stop constantly etc.) of the departure place of expectation, the film of wanting to view and admire (activity), expectation.
Also have, distribution requires editor mechanism 26, as described later, when route retrieval server 30 have will expression film kind kind imaginary node when being connected route search with the function of network data 35, also can utilize operation input mechanism 27 or be presented at menu screen on the indication mechanism 24, the film kind of viewing and admiring is wanted in appointment, the route search requirement that editor sends to route retrieval server 30.
Guide path data storing mechanism 25, the guide path data as the route search result of store path retrieval server 30 distributions, map datum, guiding etc., these data based needs are read from guide path data storing mechanism 25, are presented on the indication mechanism 24.General, on the map of certain reduced scale of the current location of the navigation terminal device 20 that comprises location mechanism 23 locations, certain limit, make to the sign of the current location of guiding path and expression navigation terminal device 20 overlapping, thereby show at the display frame center with this current location sign.
By location mechanism 23, receive gps satellite signal and carry out comprising error on the current location information (information of latitude longitude) of location, even handle so current location from when guiding path misplaces, also can carry out current location is adapted to the route matching treatment on the guiding path, the map match that matches on the road of map.In addition, when having added voice guiding (for example " the place ahead 300m is a crossing, please turn left " wait voice messaging) data on the guide path data of route retrieval server 30 distribution, by loudspeaker, voice messaging, guide user are exported in regeneration.
Below, edit methods, the path searching method of the network data in the route retrieval system 10 of the embodiments of the invention of relevant above-mentioned explanation is described in detail.In following example, illustrated, for example, from current ground (self dwelling house) example for the route search of the film of seeing expectation the earliest.
Fig. 6 is that the expression of pattern is as the A of cinema of movable meeting-place node, the figure that the state of network data 35 is used in the retrieval of the B of cinema access path.In Fig. 6, solid line TR represents the traffic route interval, and dotted line RD represents (road interval) between the walking area, and reference marks TA, TB represent that as the A of cinema of movable meeting-place node, the B of cinema ST represents each station of traffic route.The A of cinema, the B of cinema be according to latitude longitude ad-hoc location, so Biao Shi road interval (between the walking area) by a dotted line can be connected on the node of nearest station ST.Movable meeting-place node is a plurality of in addition in addition, but only illustrates the A of cinema, the B of cinema typically among Fig. 6.
Fig. 7 be the expression of the pattern cinematographic work of holding with movable meeting-place node TA, TB (A of cinema, the B of cinema) etc. as activity, the concept map of connection activity meeting-place node.Also have, for easy understanding, Fig. 7 is the figure that utilizes the route search of corresponding diagram 6 to show with the network data of network data.As activity, film M1, film M2, film M3 are for example arranged, give activity imaginary node M1～M3 respectively.This imaginary node is included in the route search network, but does not have positional information (also can be attached with suitable positional information, but can not be used for route search).In addition, these activity imaginary node connect link from the cinema of showing.
Link is connection activity meeting-place node and activity imaginary node, shows on the time band (zero hour and termination are constantly) of film M1 at each, connects with different a plurality of links.In Fig. 7, for easy understanding, the link that is connected the film 1 (activity imaginary node) that the TA of cinema (movable meeting-place node) shows only illustrates link L-AM1, and the link that is connected the film 1 (activity imaginary node) that the TB of cinema (movable meeting-place node) shows only illustrates link L-BM1 (other link is with reference to Fig. 3).These links be folk prescription to link, expand to film from cinema.These link association timetables (holding the time band) comprise showing the zero hour and stopping the moment of film on its timetable.This timetable as shown in Figure 3, be with electric car etc. the time of running epiphase with the data of form.
That is to say,, show as following timetable if contrast electric car timetable is the timetable at station, arrival station of setting out with movable meeting-place node.
Film M1 shows 10:00 for the 1st time and sends out 12:30 and arrive
Film M1 shows 13:00 for the 2nd time and sends out 15:30 and arrive
Film M1 shows 16:00 for the 3rd time and sends out 18:30 and arrive
Film M1 the 4th is shown 19:00 and is sent out 21:30 and arrive
If compile like this, seemingly respectively to show at the cinema and arrive the such transportation network of film imaginary node when being multiplied by electric car, film end the zero hour.
In addition, on the kind of movable (film), set the kind imaginary node, to this kind, connect link L-M1R from movable (film).For example, when the affiliated kind (field) as movable film M1 is describing love affairs (Romance), the kind imaginary node from the activity imaginary node to " Romance ", connection link L-M1R.Take out this part and the illustrated Fig. 8 of being.This link L-M1R also be folk prescription to kind to link, the link cost of this part, in the mode of no difference, decision is 0 or certain value.At this moment, if on the kind imaginary node of " Romance ", film 2 also is when belonging to the film of identical type, also connects this film 2.Like this, as described later, also can select the kind imaginary node, i.e. film kind is selected the film be concerned about, the route search that is used to view and admire.
Get back to Fig. 7, want the route search of seeing a film at 1 o'clock if illustrate from current ground S (for example self dwelling house), obtain the position of current ground S with GPS etc., with current ground S as the departure place, if wanting the film of seeing is film 1 (M1), route search is carried out as the activity imaginary node of film 1 (M1) in the destination.This route search itself, above-mentioned patent documentation 2, the spy of timetable that also can be by having considered electric car open 2003-No. 227732 communique disclosed methods and carry out.
For example, under this condition of departure place, its route search result becomes Fig. 9 at 9:30, can see a film the earliest (finishing watching out) be the result for retrieval that the TA of cinema shows 10:30 for the 1st time.Near the departure place be the TB of cinema, if comprehensive consideration is shown constantly, traveling time, obtain The above results.Also have, this retrieval does not repeat tentative mistake, according to condition, asks the optimal path that obtains the destination, obtains the suitableeest separating for 1 time.In addition, route search mechanism 33 is not only an optimal path, also can retrieve the several path candidates that satisfy condition and carries out guide.If the guide path candidate, the user also can study and move to the following cinema of the 2nd candidate when expiring seat with the specific cinema in the footpath of suiting the needs most.
In addition, also can directly not specify the film wanting to see, specify with kind.If given category " Romance ", the kind imaginary node of Romance become the destination, the footpath retrieval of suiting the needs most.When the kind under the film 2 is Romance,, so as shown in Figure 7,, the situation of film 2 for the footpath of suiting the needs most of selecting arranged also according to showing constantly because the kind imaginary node of Romance also connects film 2.If like this, to select kind, a plurality of activities (film) under its kind, retrieval can be in the cinema that the time of expectation band is viewed and admired, if interested in its film, available movies is viewed and admired and is spent desired time.
Also have, in the above description, retrieve, also can arrive the due in of imaginary node and retrieve, near the mode of due in, find the path of finishing watching film with as condition with this condition of wanting the earliest to see a film.
In addition, in the above description, be that the route search of destination is illustrated to film activity imaginary node, but the situation of also expecting its path, front is also arranged as activity.That is to say that cinema is via ground, also have the situation of its front next one of setting via ground, final destination.For the such purposes of correspondence, be not starting point, as shown in figure 10, return the path before getting there with the activity imaginary node, turning back to the node with physical location is the path of TA of cinema or the TB of cinema (movable meeting-place node), begins the route search from that to next destination.
As described above, by the present invention, as film, by having initial significant timetable to the end from its activity as imaginary node, make on its link that arrives imaginary node to have time information, thereby can carry out route search integratedly with transportation network.Therefore, activity is not limited to film.For example, toothache appears, in the time of must carrying out 30 minutes treatment in certain dental hospital in the travelling, if the online reservation free time hurdle of the dental hospital that scatters is replaced as activity, can be identical with the film situation, searching route finds the dental hospital that obtains treatment the earliest.In addition, also can retrieve arrive the path final destination, that do not influence as far as possible.
Claims (16)
1. a route retrieval system is characterized in that, this route retrieval system is set the departure place of expectation, and retrieval is used to participate in the path of one of connatural activity that a plurality of places and a plurality of time period hold,
Above-mentioned route retrieval system possesses, the route search network data, and this route search is used to retrieve on foot and the path that utilizes the vehicles with network data; Route search mechanism; Network data editor mechanism; Possess holding the place, holding activity data constantly of above-mentioned activity,
Above-mentioned network data editor mechanism, above-mentioned activity held the place as the movable meeting-place node with positional information, connect above-mentioned route search network data, above-mentioned activity is registered as the activity imaginary node that does not have positional information, from movable meeting-place node be to the activity imaginary node, use a plurality of links of holding constantly to connect based on the difference of activity
With the expectation the place as the departure place, when requiring route search when from above-mentioned activity, specifying specific activity, above-mentioned route search mechanism with this activity imaginary node as the destination, retrieval from above-mentioned departure place to guiding path, guide should activity and this activity hold the place.
2. route retrieval system according to claim 1 is characterized in that,
Above-mentioned route search mechanism, will be from above-mentioned departure place to optimal path as the activity imaginary node of destination, or a plurality of path candidates that comprise optimal path are as retrieving to guiding path.
3. route retrieval system according to claim 1 is characterized in that,
Constantly the link of holding based on above-mentioned activity is that form with following transit schedules shows, and the form of this transit schedules is, in the zero hour of activity, and from movable meeting-place node, in the termination of activity constantly, arrival activity imaginary node.
4. route retrieval system according to claim 1 is characterized in that,
Above-mentioned activity data is by network, provides from action message that relevant this action message is provided and obtains the server.
5. route retrieval system according to claim 1 is characterized in that,
Above-mentioned activity is distinguished according to kind, above-mentioned network data editor mechanism registers the kind of above-mentioned activity as the kind imaginary node that does not have positional information, to connect with link from the activity imaginary node to the kind imaginary node with certain cost
With the expectation the place as the departure place, when requiring route search when specify specific kind from mentioned kind, above-mentioned route search mechanism can be with this kind imaginary node as the destination, retrieval from above-mentioned departure place to guiding path, guide should activity and this activity hold the place.
6. route retrieval system according to claim 5 is characterized in that,
Above-mentioned route search mechanism, will be from above-mentioned departure place to as the optimal path of the kind imaginary node of destination or a plurality of path candidates of comprising optimal path as retrieving to guiding path, guide should activity and this activity hold the place.
7. a route retrieval server is characterized in that possessing, route search network data and route search mechanism, this route retrieval server is connected with the end device of setting the departure place by network, and this route search is used to retrieve on foot and the path that utilizes the vehicles with network data
Above-mentioned route retrieval server possesses route search mechanism, network data editor mechanism and possessed and movablely hold the place, hold activity data constantly, this route search mechanism is used for being chosen in the congeniality activity that a plurality of places and a plurality of time period hold and sets the departure place of expectation, thereby this movable path is participated in retrieval
Above-mentioned network data editor mechanism, the place of holding of above-mentioned activity is connected above-mentioned route search network data as the movable meeting-place node with positional information, above-mentioned activity is registered as the activity imaginary node that does not have positional information, from movable meeting-place node be to the activity imaginary node, use a plurality of links of holding constantly to connect based on the difference of activity
With the expectation the place as the departure place, from above-mentioned activity, specify specific activity and when requiring route search, above-mentioned route search mechanism with this activity imaginary node as the destination, retrieval from above-mentioned departure place to guiding path, to above-mentioned end device guide should activity and this activity hold the place.
8. route retrieval server according to claim 7 is characterized in that,
Above-mentioned route search mechanism, will be from above-mentioned departure place to as the optimal path of the activity imaginary node of destination or comprise a plurality of path candidates of optimal path, as retrieving to guiding path.
9. route retrieval server according to claim 7 is characterized in that,
Constantly the link of holding based on above-mentioned activity is that form with following transit schedules shows, and the form of this transit schedules is, in the zero hour of activity, and from movable meeting-place node, in the termination of activity constantly, arrival activity imaginary node.
10. route retrieval server according to claim 7 is characterized in that,
Above-mentioned activity data is by network, provides the server from the action message that relevant this action message is provided and obtains.
11. route retrieval server according to claim 7 is characterized in that,
Above-mentioned activity is distinguished according to kind, above-mentioned network data editor mechanism, the kind of above-mentioned activity is registered as the kind imaginary node that does not have positional information, is to adopt to have the link of certain cost and connect from the activity imaginary node to the kind imaginary node
With the expectation the place as the departure place, from mentioned kind, specify specific kind and when requiring route search, above-mentioned route search mechanism, with this kind imaginary node as the destination, retrieval from above-mentioned departure place to guiding path, guide should activity and this activity hold the place.
12. route retrieval server according to claim 11 is characterized in that,
Above-mentioned route search mechanism, will be from above-mentioned departure place to as the optimal path of the kind imaginary node of destination or a plurality of path candidates of comprising optimal path as retrieving to guiding path, guide should activity and this activity hold the place.
13. a path searching method is characterized in that,
This path searching method is, sets the departure place of expectation, and retrieval is used for participating in the path searching method in the route retrieval system in path of an activity in the connatural activity that a plurality of places and a plurality of time period hold,
Above-mentioned route retrieval system possesses: be used to retrieve on foot the route search network data with the path that utilizes the vehicles; Route search mechanism; Network data editor mechanism; Possessed holding the place, holding activity data constantly of above-mentioned activity,
Above-mentioned path searching method comprises, above-mentioned network data editor mechanism holds the place as the movable meeting-place node with positional information with above-mentioned activity, connects the step of above-mentioned route search with network data; Each activity is registered as the activity imaginary node that does not have positional information, use the link constantly of holding to carry out step of connecting from movable meeting-place node to the activity imaginary node based on activity; With the expectation the place as the departure place, when requiring route search when from above-mentioned activity, specifying specific activity, as the destination, retrieval is from the step to guiding path of above-mentioned departure place with this activity imaginary node in above-mentioned route search mechanism, and guide should activity and this activity hold the place.
14. path searching method according to claim 13 is characterized in that,
Above-mentioned route search mechanism with this activity imaginary node as the destination, retrieval from the step to guiding path of above-mentioned departure place comprise retrieval from above-mentioned departure place to as the optimal path of the activity imaginary node of destination or comprise the processing of a plurality of path candidates of optimal path.
15. path searching method according to claim 13 is characterized in that, also has
Above-mentioned activity is distinguished by kind, above-mentioned network data editor mechanism registers the kind of above-mentioned activity as the kind imaginary node that does not have positional information, from the activity imaginary node to the kind imaginary node be, carry out step of connecting reaches with the link with certain cost
With the expectation the place as the departure place, when requiring route search when from mentioned kind, specifying specific kind, as the destination, retrieval is from the step to guiding path of above-mentioned departure place with this kind imaginary node in above-mentioned route search mechanism, and guide should activity and this activity hold the place.
16. path searching method according to claim 13 is characterized in that,
Above-mentioned route search mechanism with this activity imaginary node as the destination, retrieval from the step to guiding path of above-mentioned departure place comprise retrieval from above-mentioned departure place to as the optimal path of the activity imaginary node of destination or comprise the processing of a plurality of path candidates of optimal path.
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| PCT/JP2006/312275 WO2007148378A1 (en) | 2006-06-20 | 2006-06-20 | Route search system, route search server, terminal, and route search method |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN101473358A CN101473358A (en) | 2009-07-01 |
| CN101473358B true CN101473358B (en) | 2011-11-02 |
Family
ID=38833131
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN2006800550448A Expired - Fee Related CN101473358B (en) | 2006-06-20 | 2006-06-20 | Route retrieval system, route retrieval server, terminal device and route retrieval method |
Country Status (6)
| Country | Link |
|---|---|
| US (1) | US20100235082A1 (en) |
| EP (1) | EP2031570B1 (en) |
| JP (1) | JP4038528B1 (en) |
| KR (1) | KR101047734B1 (en) |
| CN (1) | CN101473358B (en) |
| WO (1) | WO2007148378A1 (en) |
Families Citing this family (13)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| KR101054287B1 (en) * | 2008-07-03 | 2011-08-08 | 삼성전자주식회사 | Method for providing location information based service in mobile terminal and mobile terminal implementing same |
| CN101340718B (en) * | 2008-08-12 | 2012-04-25 | 苏州佳世达电通有限公司 | Wireless mobile apparatus and method for setting searching time by communication network |
| JP5547112B2 (en) * | 2011-02-16 | 2014-07-09 | 株式会社日立製作所 | Route search system |
| KR101471247B1 (en) * | 2012-08-07 | 2014-12-10 | 에스케이씨앤씨 주식회사 | System and Method for Hospital Use Guide using NFC and IPS |
| US8972185B1 (en) * | 2012-10-01 | 2015-03-03 | Google Inc. | Constructing a transit transfer network from transit data |
| CN104977008A (en) * | 2014-04-09 | 2015-10-14 | 广东融讯信息科技有限公司 | Navigation system achieving self-driving and bus seamless connection |
| US9212924B1 (en) | 2014-08-21 | 2015-12-15 | Microsoft Technology Licensing, Llc | Multimode transportation transitions |
| US9803988B2 (en) * | 2014-12-30 | 2017-10-31 | Excalibur Ip, Llc | Method and/or system for walking route recommendation |
| US10337876B2 (en) * | 2016-05-10 | 2019-07-02 | Microsoft Technology Licensing, Llc | Constrained-transportation directions |
| US10386197B2 (en) | 2016-05-17 | 2019-08-20 | Microsoft Technology Licensing, Llc | Calculating an optimal route based on specified intermediate stops |
| US10060752B2 (en) | 2016-06-23 | 2018-08-28 | Microsoft Technology Licensing, Llc | Detecting deviation from planned public transit route |
| CN108151746B (en) * | 2017-12-27 | 2020-11-10 | 中国人民解放军国防科技大学 | Improved label real-time airway re-planning method based on multi-resolution situation mapping |
| CN109447343B (en) * | 2018-10-26 | 2022-02-01 | 北京交通大学 | Urban rail train transfer and connection optimization method based on wire net structure and time sequence combination |
Family Cites Families (14)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JP3750400B2 (en) | 1999-03-08 | 2006-03-01 | 株式会社ナビタイムジャパン | Traffic network route search method and apparatus |
| JP2001014297A (en) * | 1999-06-28 | 2001-01-19 | Sony Corp | Method and device for predicting action and providing information |
| US6650902B1 (en) * | 1999-11-15 | 2003-11-18 | Lucent Technologies Inc. | Method and apparatus for wireless telecommunications system that provides location-based information delivery to a wireless mobile unit |
| JP2001165681A (en) | 1999-12-09 | 2001-06-22 | Navitime Japan Co Ltd | Traffic network route searing method |
| JP2001325514A (en) | 2000-05-15 | 2001-11-22 | Kyubunkan:Kk | Server device, terminal device, and recording medium |
| JP2002269151A (en) * | 2001-03-09 | 2002-09-20 | Fujitsu Ltd | System and method for displaying event-related information |
| US7139722B2 (en) * | 2001-06-27 | 2006-11-21 | Bellsouth Intellectual Property Corporation | Location and time sensitive wireless calendaring |
| JP2003227732A (en) * | 2001-10-02 | 2003-08-15 | Navitime Japan Co Ltd | System and computer system for distributing information |
| JP2003114135A (en) | 2001-10-04 | 2003-04-18 | Communication Research Laboratory | Geographical information-supplying method and apparatus, and software |
| US6816778B2 (en) * | 2001-12-29 | 2004-11-09 | Alpine Electronics, Inc | Event finder with navigation system and display method thereof |
| JP3924683B2 (en) * | 2003-10-02 | 2007-06-06 | 株式会社ナビタイムジャパン | Navigation device, navigation method and program |
| JP4419621B2 (en) * | 2004-03-17 | 2010-02-24 | アイシン・エィ・ダブリュ株式会社 | Travel planning management system |
| JP4271107B2 (en) * | 2004-08-18 | 2009-06-03 | 株式会社東芝 | Navigation system |
| US7668653B2 (en) * | 2007-05-31 | 2010-02-23 | Honda Motor Co., Ltd. | System and method for selectively filtering and providing event program information |
-
2006
- 2006-06-20 US US12/305,293 patent/US20100235082A1/en not_active Abandoned
- 2006-06-20 CN CN2006800550448A patent/CN101473358B/en not_active Expired - Fee Related
- 2006-06-20 WO PCT/JP2006/312275 patent/WO2007148378A1/en active Application Filing
- 2006-06-20 KR KR1020087030975A patent/KR101047734B1/en not_active IP Right Cessation
- 2006-06-20 EP EP06766936A patent/EP2031570B1/en not_active Not-in-force
- 2006-06-20 JP JP2007523912A patent/JP4038528B1/en active Active
Also Published As
| Publication number | Publication date |
|---|---|
| EP2031570B1 (en) | 2013-02-13 |
| KR20090018148A (en) | 2009-02-19 |
| EP2031570A4 (en) | 2010-09-08 |
| CN101473358A (en) | 2009-07-01 |
| US20100235082A1 (en) | 2010-09-16 |
| JP4038528B1 (en) | 2008-01-30 |
| JPWO2007148378A1 (en) | 2009-11-12 |
| EP2031570A1 (en) | 2009-03-04 |
| WO2007148378A1 (en) | 2007-12-27 |
| KR101047734B1 (en) | 2011-07-07 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN101473358B (en) | Route retrieval system, route retrieval server, terminal device and route retrieval method | |
| US11506507B2 (en) | Multimodal vehicle routing system and method with vehicle parking | |
| KR101022148B1 (en) | Navigation system, route search server, route search method, program and computer readable medium having program | |
| CN1673686B (en) | Navigation systems | |
| US20080046298A1 (en) | System and Method For Travel Planning | |
| US20220136840A1 (en) | Method for dynamic creation of customized tour guides | |
| KR100873047B1 (en) | Real time tour service method and system the same | |
| JP5047920B2 (en) | Route information distribution system, route information guidance server, terminal device, and route information distribution method | |
| JP2002357438A (en) | Guide information request device and guide information providing device | |
| JP2009103657A (en) | Navigation system, server and method for route search, and terminal device | |
| JP2001222798A (en) | Customer information providing system for commercial vehicle | |
| JP2009036720A (en) | Information delivery system, information delivery server, mobile terminal device, and information delivery method | |
| CN110753917A (en) | Data processing method for realizing multi-hop car pooling | |
| JP4448532B2 (en) | Route search system, route search server, terminal device, and route search method | |
| JP2020193911A (en) | Information processing system, information processing program, information processing device, and information processing method | |
| KR102724960B1 (en) | Server for providing bus service that can recommend drop-off points and its operation method | |
| JP4614364B2 (en) | Navigation system, route search server, route search method, and navigation terminal device | |
| JP2022085332A (en) | Information processing system, information processing program, information processing device, and information processing method | |
| JP6451349B2 (en) | Navigation system, method and program | |
| Kayıkcı | Mobility-on-demand servıce in mass transit: hypercommute options | |
| JP5351997B2 (en) | Route information distribution system, route information guidance server, terminal device, and route information distribution method | |
| JP4829362B2 (en) | Navigation system, route search server, route search method, and navigation terminal device | |
| JP4142090B1 (en) | Navigation system, route search server, route search method, and terminal device | |
| JP2010262349A (en) | Transfer search system, transfer search server, and transfer search method | |
| TW201028664A (en) | Navigation apparatus, server apparatus and method of providing an indication of likelihood of occupation of a parking location |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| C14 | Grant of patent or utility model | ||
| GR01 | Patent grant | ||
| C17 | Cessation of patent right | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20111102 Termination date: 20130620 |