CN107796413A - A kind of multi-destination route recommendation method and system - Google Patents
A kind of multi-destination route recommendation method and system Download PDFInfo
- Publication number
- CN107796413A CN107796413A CN201710917306.7A CN201710917306A CN107796413A CN 107796413 A CN107796413 A CN 107796413A CN 201710917306 A CN201710917306 A CN 201710917306A CN 107796413 A CN107796413 A CN 107796413A
- Authority
- CN
- China
- Prior art keywords
- route
- destination
- priority
- current location
- destination address
- 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.)
- Pending
Links
Classifications
-
- G—PHYSICS
- G01—MEASURING; TESTING
- G01C—MEASURING DISTANCES, LEVELS OR BEARINGS; SURVEYING; NAVIGATION; GYROSCOPIC INSTRUMENTS; PHOTOGRAMMETRY OR VIDEOGRAMMETRY
- G01C21/00—Navigation; Navigational instruments not provided for in groups G01C1/00 - G01C19/00
- G01C21/26—Navigation; Navigational instruments not provided for in groups G01C1/00 - G01C19/00 specially adapted for navigation in a road network
- G01C21/34—Route searching; Route guidance
- G01C21/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
Landscapes
- Engineering & Computer Science (AREA)
- Radar, Positioning & Navigation (AREA)
- Remote Sensing (AREA)
- Automation & Control Theory (AREA)
- Physics & Mathematics (AREA)
- General Physics & Mathematics (AREA)
- Navigation (AREA)
Abstract
A kind of multi-destination route recommendation method and system, user can input multiple destination addresses, and method comprises the following steps:Obtain the original position of user;Obtain multiple destination addresses of user;Programme path, plan from original position and go to the order of multiple destinations and overall route, generate at least one best route, and estimate overall route spacing discrete time;Route and traffic information are shown on the electronic map.System includes original position acquisition module, destination address acquisition module, route planning module, route display module.The present invention provides the user multi-destination route planning and recommendation, provides the user rational travel route, reduces unnecessary distance of turning back, and allows users to programme path in advance, reasonable arrangement stroke, saves the travel time, lifts Consumer's Experience.
Description
Technical field
The invention belongs to electronic map field, and in particular to a kind of multi-destination route recommendation method and system.
Background technology
Recommend the basic role that reasonable circuit is electronic map for user, the route planning that electronic map provides at present is main
It is for single goal, and the route planning for multiple destinations is typically voluntarily selected a destination by user, reach
Plan next destination again afterwards, it is impossible to which directly the route map of multiple destinations is gone in planning, for unfamiliar environment, Yong Huke
Many time and moneys can be wasted turning back in distance.
This is the deficiencies in the prior art, therefore, for drawbacks described above of the prior art, there is provided a kind of multi-destination route
Recommend method and system, be necessary.
The content of the invention
It is an object of the present invention to the defects of being directed to above-mentioned current electronic map just for single goal, there is provided a kind of
Multi-destination route recommendation method and system, to solve above-mentioned technical problem.
To achieve the above object, the present invention provides following technical scheme:
A kind of multi-destination route recommendation method, user can input multiple destination addresses, comprise the following steps:
Obtain the original position of user;
Obtain multiple destination addresses of user;
Programme path, plan from original position and go to the order of multiple destinations and overall route, generate at least one optimal road
Line, and estimate overall route spacing discrete time;
Route and traffic information are shown on the electronic map.
Further, before the step of programme path, also comprise the following steps:Set the priority of multiple destination addresses.
Further, programme path comprises the following steps that:Judge whether to mark priority to multiple destination addresses;
If multiple destination addresses do not mark priority, from original position initially as current location, chosen distance is current successively
Nearest next in position does not arrive at location as current location, and planning and records between adjacent current location twice most
Good route, until traversal all purposes address, route planning terminate;
If multiple destination addresses all mark priority, from original position initially as current location, according to the excellent of destination address
The order of first level from high to low selects current location successively, and plans and record the optimal road between adjacent current location twice
Line, until traversal all purposes address, route planning terminate;
If multiple destination address parts mark the destination address of priority, first planning mark priority, then planning is planned not
Mark the destination address of priority;First from original position initially as current location, according to mark priority destination address
The order of priority from high to low selects current location successively, and plans and record the optimal road between adjacent current location twice
Line, until the destination address of all mark priority is traveled through, then from the minimum destination address of priority initially as present bit
Put, never mark nearest next in chosen distance current location in the destination address of priority successively and do not arrive at location conduct
Current location, and the best route between adjacent current location twice is planned and records, until traversal is all not to mark priority
Destination address, route planning terminates.
If multiple destination addresses do not mark priority, the nearest destination address of chosen distance original position is as first
Destination, the best route of planning original position to the first destination, the then nearest destination in the destination of chosen distance first
The best route of the first destination to the second destination is planned, successively chosen distance current destination as the second destination in location
Recently next does not arrive at location, until traversal all purposes address, route planning terminate;
If the whole mark priority of multiple destination addresses, according to the priority order from high to low of destination address, from starting
Plan best route to the destination address of limit priority and calculate route distance, then the destination to next priority in position
Location, plan best route and calculate route distance, until traversal all purposes address, route planning terminate;
If multiple destination address parts mark priority, the first destination address of planning mark priority, according to priority by
High to Low order, the destination address from original position to limit priority, plan best route and calculate route distance, then arrive
The destination address of next priority, plan best route and calculate route distance, until traveling through the purpose of all mark priority
Address, then plan the destination address for not marking priority, the nearest destination of the minimum destination address of chosen distance priority
Location is as the first destination, the best route of the minimum destination address of plan priority level to the first destination, then chosen distance
The nearest destination address in first destination plans the best route of the first destination to the second destination as the second destination,
Nearest next of chosen distance current destination in the destination address of priority is never marked successively does not arrive at location, planning
Best route, until traveling through all destination addresses for not marking priority, route planning terminates.
Further, obtaining the original position of user includes obtaining the original position being manually entered or obtains using positioning
The current location of functional localization is as original position.
Further, obtaining the destination address of user includes obtaining mark destination address on the electronic map or obtains hand
The destination address of dynamic input.
The present invention gives following technical scheme:
A kind of multi-destination route recommendation system, including:
Original position acquisition module, for obtaining user's initial address;
Destination address acquisition module, for obtaining multiple destination addresses of user;
Route planning module, for programme path, plan from original position and go to the order of multiple destinations and overall route, it is raw
Into at least one best route, and estimate overall route spacing discrete time;
Route display module, for showing route and traffic information on the electronic map.
Further, in addition to priority setup module, for setting the priority of multiple destinations.
Further, route planning module user programme path;
When multiple destination addresses do not mark priority, from original position initially as current location, chosen distance ought successively
Nearest next in front position does not arrive at location as current location, and planning and records between adjacent current location twice
Best route, until traversal all purposes address, route planning terminate;
When multiple destination addresses all mark priority, from original position initially as current location, according to destination address
The order of priority from high to low selects current location successively, and plans and record the optimal road between adjacent current location twice
Line, until traversal all purposes address, route planning terminate;
When multiple destination address parts mark priority, the destination address of planning mark priority, then planning first is planned
The destination address of priority is not marked;First from original position initially as current location, according to mark priority destination address
Priority order from high to low select current location successively, and plan and record and be between adjacent current location twice optimal
Route, until the destination address of all mark priority is traveled through, then from the minimum destination address of priority initially as current
Position, the nearest next location that do not arrive in chosen distance current location in the destination address of priority is never marked successively and is made
For current location, and plan and record the best route between adjacent current location twice, until travel through it is all do not mark it is preferential
The destination address of level, route planning terminate.
Further, original position acquisition module is obtained the original position being manually entered or obtained and determined using positioning function
The current location of position is as original position.
Further, destination address acquisition module is obtained to mark destination address on the electronic map or obtain and is manually entered
Destination address.
The beneficial effects of the present invention are:
The present invention provides the user multi-destination route planning and recommendation, provides the user rational travel route, and reduction need not
The distance of turning back wanted, programme path in advance is allowed users to, reasonable arrangement stroke, saves the travel time, lifts Consumer's Experience.
In addition, design principle of the present invention is reliable, and it is simple in construction, there is very extensive application prospect.
As can be seen here, the present invention is compared with prior art, with prominent substantive distinguishing features and significantly progressive, its implementation
Beneficial effect be also obvious.
Brief description of the drawings
Fig. 1 is flow chart of the method for the present invention;
Fig. 2 is the system schematic of the present invention;
Fig. 3 is original position and the relative distance of multiple destination addresses in embodiment;
Fig. 4 is the relative distance that embodiment moderate is crossed between destination address;
Fig. 5 is the programme path process for not marking priority in embodiment to destination address;
Fig. 6 is the programme path process for marking priority in embodiment to destination address;
Wherein, the original position of S- user;The destinations of D1- first;The destinations of D2- second;The destinations of D3- the 3rd;The mesh of D4- the 4th
Ground;The destinations of D5- the 5th.
Embodiment:
To enable the purpose of the present invention, feature, advantage more obvious and understandable, it is embodied below in conjunction with the present invention
Accompanying drawing in example, the technical scheme in the present invention is clearly and completely described.
As shown in figure 1, the present invention provides a kind of multi-destination route recommendation method, user can input multiple destination addresses,
Comprise the following steps:
Obtain the original position of user;Obtain the original position of user makes including obtaining the original position being manually entered or acquisition
The current location positioned by the use of positioning function is used as original position;
Obtain multiple destination addresses of user;The destination address for obtaining user marks destination address on the electronic map including obtaining
Or obtain the destination address being manually entered;
Set the priority of multiple destination addresses;
Programme path, plan from original position and go to the order of multiple destinations and overall route, generate at least one optimal road
Line, and estimate overall route spacing discrete time;Comprise the following steps that:Judge whether to mark priority to multiple destination addresses;
If multiple destination addresses do not mark priority, from original position initially as current location, chosen distance is current successively
Nearest next in position does not arrive at location as current location, and planning and records between adjacent current location twice most
Good route, until traversal all purposes address, route planning terminate;
If multiple destination addresses all mark priority, from original position initially as current location, according to the excellent of destination address
The order of first level from high to low selects current location successively, and plans and record the optimal road between adjacent current location twice
Line, until traversal all purposes address, route planning terminate;
If multiple destination address parts mark the destination address of priority, first planning mark priority, then planning is planned not
Mark the destination address of priority;First from original position initially as current location, according to mark priority destination address
The order of priority from high to low selects current location successively, and plans and record the optimal road between adjacent current location twice
Line, until the destination address of all mark priority is traveled through, then from the minimum destination address of priority initially as present bit
Put, never mark nearest next in chosen distance current location in the destination address of priority successively and do not arrive at location conduct
Current location, and the best route between adjacent current location twice is planned and records, until traversal is all not to mark priority
Destination address, route planning terminates.
Route and traffic information are shown on the electronic map.
As shown in Fig. 2 the present invention also provides a kind of multi-destination route recommendation system, including:
Original position acquisition module, for obtaining user's initial address;Original position acquisition module obtains the starting being manually entered
Position or acquisition use the current location that positioning function positions as original position;
Destination address acquisition module, for obtaining multiple destination addresses of user;Destination address acquisition module is obtained electronically
Figure subscript notes destination address or obtains the destination address being manually entered;
Priority setup module, for setting the priority of multiple destinations;
Route planning module, for programme path, plan from original position and go to the order of multiple destinations and overall route, it is raw
Into at least one best route, and estimate overall route spacing discrete time;
When multiple destination addresses do not mark priority, from original position initially as current location, chosen distance ought successively
Nearest next in front position does not arrive at location as current location, and planning and records between adjacent current location twice
Best route, until traversal all purposes address, route planning terminate;
When multiple destination addresses all mark priority, from original position initially as current location, according to destination address
The order of priority from high to low selects current location successively, and plans and record the optimal road between adjacent current location twice
Line, until traversal all purposes address, route planning terminate;
When multiple destination address parts mark priority, the destination address of planning mark priority, then planning first is planned
The destination address of priority is not marked;First from original position initially as current location, according to mark priority destination address
Priority order from high to low select current location successively, and plan and record and be between adjacent current location twice optimal
Route, until the destination address of all mark priority is traveled through, then from the minimum destination address of priority initially as current
Position, the nearest next location that do not arrive in chosen distance current location in the destination address of priority is never marked successively and is made
For current location, and plan and record the best route between adjacent current location twice, until travel through it is all do not mark it is preferential
The destination address of level, route planning terminate;
Route display module, for showing route and traffic information on the electronic map.
As shown in Fig. 3, Fig. 4, Fig. 5 and Fig. 6, describe in above-described embodiment multi-destination route recommendation method, programme path
The step of, the original position S, the first destination D1 of user, the second destination D2, the 3rd destination D3, the 4th destination D4 with
And the 5th destination D5 be that user sets 5 destinations, the numeral on line represents distance between the two;
As shown in figure 5,5 destination addresses do not mark priority, from the original position S of user initially as current location, choosing
The destination address first destination D1 nearest apart from the original position S of user is selected as current location, and plans the starting of user
Best route between position S and the first destination D1, the mesh of destination address second nearest the first destination of reselection distance D1
Ground D2 as current location, and plan the best route between the first destination D1 and the second destination D2, reselection distance
The destination D4 of destination address the 4th nearest second destination D2 plans the second destination D2 and the 4th mesh as current location
Ground D4 between best route, the nearest destination D3 of destination address the 3rd of the destination D4 of reselection distance the 4th are as current
Position, and the best route between the 4th destination D4 and the 3rd destination D3 is planned, the destination D3 of reselection distance the 3rd is most
The near destination D5 of destination address the 5th is planned between the 3rd destination D3 and the 5th destination D5 most as current location
Good route, route planning terminate;
As shown in fig. 6,5 destination addresses are labelled with priority, priority is followed successively by the first destination D1 from high to low, second
Destination D2, the 3rd destination D3, the 4th destination D4, the 5th destination D5, from the original position S of user initially as current
Position, the priority order from high to low according to destination address are the original position S of user to the first destination D1, the first mesh
Ground D1 to the second destination D2, the second destination D2 to the 3rd destination D3, the 3rd destination D3 to the 4th destination D4,
Four destination D4 plan best route successively to the 5th destination D5, and route planning terminates.
Embodiments of the invention are illustrative and not restrictive, and above-described embodiment is only to aid in understanding the present invention, because
This is every by those skilled in the art's technique according to the invention the invention is not restricted to the embodiment described in embodiment
Other embodiments that scheme is drawn, also belong to the scope of protection of the invention.
Claims (10)
- A kind of 1. multi-destination route recommendation method, it is characterised in that user can input multiple destination addresses, including following step Suddenly:Obtain the original position of user;Obtain multiple destination addresses of user;Programme path, plan from original position and go to the order of multiple destinations and overall route, generate at least one optimal road Line, and estimate overall route spacing discrete time;Route and traffic information are shown on the electronic map.
- A kind of 2. multi-destination route recommendation method as claimed in claim 1, it is characterised in that the step of programme path it Before, also comprise the following steps:Set the priority of multiple destination addresses.
- A kind of 3. multi-destination route recommendation method as claimed in claim 2, it is characterised in that the specific steps of programme path It is as follows:Judge whether to mark priority to multiple destination addresses;If multiple destination addresses do not mark priority, from original position initially as current location, chosen distance is current successively Nearest next in position does not arrive at location as current location, and planning and records between adjacent current location twice most Good route, until traversal all purposes address, route planning terminate;If multiple destination addresses all mark priority, from original position initially as current location, according to the excellent of destination address The order of first level from high to low selects current location successively, and plans and record the optimal road between adjacent current location twice Line, until traversal all purposes address, route planning terminate;If multiple destination address parts mark the destination address of priority, first planning mark priority, then planning is planned not Mark the destination address of priority;First from original position initially as current location, according to mark priority destination address The order of priority from high to low selects current location successively, and plans and record the optimal road between adjacent current location twice Line, until the destination address of all mark priority is traveled through, then from the minimum destination address of priority initially as present bit Put, never mark nearest next in chosen distance current location in the destination address of priority successively and do not arrive at location conduct Current location, and the best route between adjacent current location twice is planned and records, until traversal is all not to mark priority Destination address, route planning terminates.
- 4. a kind of multi-destination route recommendation method as claimed in claim 1, it is characterised in that obtain the original position of user Including obtaining the original position being manually entered or obtaining the current location for using positioning function to position as original position.
- 5. a kind of multi-destination route recommendation method as claimed in claim 1, it is characterised in that obtain the destination address of user Including obtaining mark destination address on the electronic map or obtaining the destination address being manually entered.
- A kind of 6. multi-destination route recommendation system, it is characterised in that including:Original position acquisition module, for obtaining user's initial address;Destination address acquisition module, for obtaining multiple destination addresses of user;Route planning module, for programme path, plan from original position and go to the order of multiple destinations and overall route, it is raw Into at least one best route, and estimate overall route spacing discrete time;Route display module, for showing route and traffic information on the electronic map.
- 7. a kind of multi-destination route recommendation system as claimed in claim 6, it is characterised in that mould also is set including priority Block, for setting the priority of multiple destinations.
- 8. a kind of multi-destination route recommendation system as claimed in claim 7, it is characterised in that route planning module user is advised Draw route;When multiple destination addresses do not mark priority, from original position initially as current location, chosen distance ought successively Nearest next in front position does not arrive at location as current location, and planning and records between adjacent current location twice Best route, until traversal all purposes address, route planning terminate;When multiple destination addresses all mark priority, from original position initially as current location, according to destination address The order of priority from high to low selects current location successively, and plans and record the optimal road between adjacent current location twice Line, until traversal all purposes address, route planning terminate;When multiple destination address parts mark priority, the destination address of planning mark priority, then planning first is planned The destination address of priority is not marked;First from original position initially as current location, according to mark priority destination address Priority order from high to low select current location successively, and plan and record and be between adjacent current location twice optimal Route, until the destination address of all mark priority is traveled through, then from the minimum destination address of priority initially as current Position, the nearest next location that do not arrive in chosen distance current location in the destination address of priority is never marked successively and is made For current location, and plan and record the best route between adjacent current location twice, until travel through it is all do not mark it is preferential The destination address of level, route planning terminate.
- 9. a kind of multi-destination route recommendation system as claimed in claim 6, it is characterised in that original position acquisition module obtains Take the original position being manually entered or obtain the current location for using positioning function to position as original position.
- A kind of 10. multi-destination route recommendation system as claimed in claim 6, it is characterised in that destination address acquisition module Obtain mark destination address on the electronic map or obtain the destination address being manually entered.
Priority Applications (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CN201710917306.7A CN107796413A (en) | 2017-09-30 | 2017-09-30 | A kind of multi-destination route recommendation method and system |
Applications Claiming Priority (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CN201710917306.7A CN107796413A (en) | 2017-09-30 | 2017-09-30 | A kind of multi-destination route recommendation method and system |
Publications (1)
Publication Number | Publication Date |
---|---|
CN107796413A true CN107796413A (en) | 2018-03-13 |
Family
ID=61532790
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
CN201710917306.7A Pending CN107796413A (en) | 2017-09-30 | 2017-09-30 | A kind of multi-destination route recommendation method and system |
Country Status (1)
Country | Link |
---|---|
CN (1) | CN107796413A (en) |
Cited By (6)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN108955709A (en) * | 2018-07-16 | 2018-12-07 | 深圳市元征科技股份有限公司 | A kind of regular bus route planning method, system, equipment and computer storage medium |
CN109459053A (en) * | 2019-01-02 | 2019-03-12 | 广州奥盛电子科技有限公司 | A kind of air navigation aid that multiobjective optimization path is planned automatically |
CN111102989A (en) * | 2019-12-11 | 2020-05-05 | 维沃移动通信有限公司 | Route display method and electronic equipment |
CN111288991A (en) * | 2018-12-06 | 2020-06-16 | 北京京东尚科信息技术有限公司 | Path planning method, device, robot and computer readable storage medium |
CN111442782A (en) * | 2020-03-26 | 2020-07-24 | 漳州市圆周网络科技有限公司 | System and method for planning multi-destination route along way |
CN117433557A (en) * | 2023-12-21 | 2024-01-23 | 青岛智简尚达信息科技有限公司 | Customer visit route planning and navigation method |
Citations (5)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN103308063A (en) * | 2013-07-01 | 2013-09-18 | 深圳市凯立德欣软件技术有限公司 | Navigation method and navigation equipment for multiple destinations |
CN105222784A (en) * | 2015-09-07 | 2016-01-06 | 广东欧珀移动通信有限公司 | A kind of indoor navigation method, device and terminal |
US20160018230A1 (en) * | 2014-07-17 | 2016-01-21 | Ford Global Technologies, Llc | Multiple destination vehicle interface |
CN106610986A (en) * | 2015-10-21 | 2017-05-03 | 深圳市赛格导航科技股份有限公司 | Multi-destination route planning method and system |
CN106705982A (en) * | 2017-01-25 | 2017-05-24 | 上海蔚来汽车有限公司 | Route planning method and system with multi-site dependence |
-
2017
- 2017-09-30 CN CN201710917306.7A patent/CN107796413A/en active Pending
Patent Citations (5)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN103308063A (en) * | 2013-07-01 | 2013-09-18 | 深圳市凯立德欣软件技术有限公司 | Navigation method and navigation equipment for multiple destinations |
US20160018230A1 (en) * | 2014-07-17 | 2016-01-21 | Ford Global Technologies, Llc | Multiple destination vehicle interface |
CN105222784A (en) * | 2015-09-07 | 2016-01-06 | 广东欧珀移动通信有限公司 | A kind of indoor navigation method, device and terminal |
CN106610986A (en) * | 2015-10-21 | 2017-05-03 | 深圳市赛格导航科技股份有限公司 | Multi-destination route planning method and system |
CN106705982A (en) * | 2017-01-25 | 2017-05-24 | 上海蔚来汽车有限公司 | Route planning method and system with multi-site dependence |
Cited By (6)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN108955709A (en) * | 2018-07-16 | 2018-12-07 | 深圳市元征科技股份有限公司 | A kind of regular bus route planning method, system, equipment and computer storage medium |
CN111288991A (en) * | 2018-12-06 | 2020-06-16 | 北京京东尚科信息技术有限公司 | Path planning method, device, robot and computer readable storage medium |
CN109459053A (en) * | 2019-01-02 | 2019-03-12 | 广州奥盛电子科技有限公司 | A kind of air navigation aid that multiobjective optimization path is planned automatically |
CN111102989A (en) * | 2019-12-11 | 2020-05-05 | 维沃移动通信有限公司 | Route display method and electronic equipment |
CN111442782A (en) * | 2020-03-26 | 2020-07-24 | 漳州市圆周网络科技有限公司 | System and method for planning multi-destination route along way |
CN117433557A (en) * | 2023-12-21 | 2024-01-23 | 青岛智简尚达信息科技有限公司 | Customer visit route planning and navigation method |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
CN107796413A (en) | A kind of multi-destination route recommendation method and system | |
CN107192393B (en) | A kind of maintenance system and method for road-map-data | |
CN103017780B (en) | The planing method of public bus network, system and device under mobile status | |
CN106652756A (en) | Polygon accurate drawing method based on electronic map and application method thereof | |
WO2008130828A3 (en) | Interactive mpls traffic engineering | |
CN108645421A (en) | Adaptive Online Map matching process based on Hidden Markov Model | |
CN103942976A (en) | Parking guidance system regulation and control method taking parking time into account | |
CN106534384A (en) | Method, device and system for optimizing path of shared bicycle | |
CN104680829B (en) | Bus arrival time prediction system and method based on multi-user cooperation | |
CN107092986A (en) | The bus passenger travel route choice method based on website and collinearly run | |
CN104318081A (en) | Method for allocating bicycles at public bicycle rental stations with urgent demand in city | |
CN103955955A (en) | Electronic map information processing method and device | |
CN106017492A (en) | Intelligent navigation method adopted in scenic region | |
CN107729610A (en) | A kind of tourism recommended line drawing generating method based on network travel notes | |
CN104406602B (en) | Navigation way method for pushing and device, navigation way generation method and device | |
CN106297368A (en) | Parking lot based on Internet of Things Intelligent vehicle-tracing system | |
CN104572902B (en) | A kind of method and device of information Point matching | |
CN104006817A (en) | Navigation guide system and corresponding method through real-time information communication | |
CN107580028A (en) | A kind of system that intelligently pushing is provided | |
CN101738193A (en) | Navigation electronic map-based method and device for generating TMC matching table | |
CN103900587B (en) | Evade air navigation aid and the device in section | |
CN103337084B (en) | A kind of line map spot automatic generation method based on man-made features feature | |
CN102930481B (en) | network load density analysis method and system | |
CN106855406A (en) | A kind of common pilot method based on mobile phone A PP | |
CN105256733B (en) | The outbound guidance method of subway station and system |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
PB01 | Publication | ||
PB01 | Publication | ||
SE01 | Entry into force of request for substantive examination | ||
SE01 | Entry into force of request for substantive examination | ||
RJ01 | Rejection of invention patent application after publication | ||
RJ01 | Rejection of invention patent application after publication |
Application publication date: 20180313 |