CN106052708A - Route planning method of self-driving tour - Google Patents

Route planning method of self-driving tour Download PDF

Info

Publication number
CN106052708A
CN106052708A CN201610673278.4A CN201610673278A CN106052708A CN 106052708 A CN106052708 A CN 106052708A CN 201610673278 A CN201610673278 A CN 201610673278A CN 106052708 A CN106052708 A CN 106052708A
Authority
CN
China
Prior art keywords
stroke
user
destination
information
request
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
Application number
CN201610673278.4A
Other languages
Chinese (zh)
Inventor
吴明
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Individual
Original Assignee
Individual
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Individual filed Critical Individual
Priority to CN201610673278.4A priority Critical patent/CN106052708A/en
Publication of CN106052708A publication Critical patent/CN106052708A/en
Pending legal-status Critical Current

Links

Classifications

    • GPHYSICS
    • G01MEASURING; TESTING
    • G01CMEASURING DISTANCES, LEVELS OR BEARINGS; SURVEYING; NAVIGATION; GYROSCOPIC INSTRUMENTS; PHOTOGRAMMETRY OR VIDEOGRAMMETRY
    • G01C21/00Navigation; Navigational instruments not provided for in groups G01C1/00 - G01C19/00
    • G01C21/26Navigation; Navigational instruments not provided for in groups G01C1/00 - G01C19/00 specially adapted for navigation in a road network
    • G01C21/34Route searching; Route guidance
    • G01C21/3407Route searching; Route guidance specially adapted for specific applications
    • G01C21/343Calculating 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)
  • Management, Administration, Business Operations System, And Electronic Commerce (AREA)

Abstract

A route planning method of self-driving tour is provided; based on a network technology, and with combination of map and navigation technologies, the tour itinerary planning method having high comprehensiveness and intelligence is provided, wherein the method includes the steps: receiving a user itinerary request; according to user real-time information, determining at least one itinerary scheme corresponding to the itinerary request; and outputting a planning result. The itinerary request includes one or more destinations and also can include user preference. The itinerary scheme includes a destination constituent itinerary order. The user real-time information includes user real-time location information and also can include user real-time time information. The map and navigation technologies include basic information and the real-time information.

Description

A kind of stroke planning method of self-driving travel
Technical field
A kind of stroke planning method of self-driving travel, is on the basis of network technology, for convenience of the one planning itinerary There is high integrity and intelligent method, belong to networking technology area.
Background technology
The intelligent stroke planning technology of self-driving travel, the most nearly all belongs to blank, major part Traveller also rests on the stage doing it yourself little by little to plan, wastes time and energy.Manually the supplementary mode of planning typically by Collect various data as reference, such as travel notes, Lu Shu, introduction etc., but gather information with and subsequent arrange and distinguish Comparision is numerous and diverse, still wastes time and energy.
At present any self-driving travel planning technology of intelligent, is the most all merely resting on the stroke assisted Selection before travelling, And travelling after stroke share.But, this stroke ancillary technique, generally require oneself and adjust the order of stroke, it is impossible to intelligence Can user's stroke is planned or optimizes.And this stroke ancillary technique is not based on airmanship, it is impossible to dynamically Real-time renewal and change, still cannot meet people's intelligentized requirement further to stroke planning.For overcoming existing skill The deficiency of art, the stroke planning method of a kind of self-driving travel of the present invention, use more intelligentized planing method to help to solve Various travelling planning difficult problems.
Summary of the invention
For the problem overcoming prior art to exist, the present invention uses a kind of stroke planning method of self-driving travel, it is possible to use The accuracy of the stroke planning of family self-driving travel, convenience and multiformity are greatly improved, to user friendly plan and Trip has positive effect.
A kind of stroke planning method of self-driving travel, based on network technology, and combines map and airmanship, and its feature exists In, described method includes: receive the stroke request of user;According to user's real time information, determine that the request of described stroke is corresponding extremely Few a kind of travel schedule;Output program results.
Described method also includes: know the variations or modifications of the stroke request of user;According to user's real time information, the most really At least one travel schedule of stroke request correspondence after fixed described variations or modifications;Output program results.
Described at least one travel schedule determining that the request of described stroke is corresponding, comprises determining that the stroke sequence of destination, Described stroke sequence is a kind of permutation and combination of destination.
Described output program results, including: combine map and airmanship, described travel schedule is exported to user.
Described stroke is asked, including: one or more destinatioies.Can also include: planning preference information.
Described travel schedule, including: the stroke sequence of destination's composition.
Described user's real time information, including: user's real-time position information, it is also possible to including: user's real-time time information.
Accompanying drawing explanation
Figure of description Fig. 1 is the schematic flow sheet of one embodiment of the present invention, and wherein S1 represents reception user's Itinerary is asked;S2 represents according to user's real time information, determines at least one travel schedule that the request of described stroke is corresponding;S3 Represent output program results.
Detailed description of the invention
For the detailed description of the invention of a kind of itinerary planing method being described, in conjunction with Figure of description and citing, with network The mode of technology is illustrated and is the most clearly and completely described and implement this method.
Figure of description illustrates following each exemplary embodiment and the function of system, operation and architectural framework. Flow chart in Figure of description and/or each square frame in block diagram all can represent a module, program segment or code A part, a part for described module, program segment or code can include that one or more is for realizing embodiment The executable instruction of the logic function of middle defined.Meanwhile, the flow chart in Figure of description and/or each side in block diagram Frame, it is also possible to represent module or program segment or a part for code or other implementation in addition.Figure of description In flow chart and/or each square frame in block diagram in the function that marked not by specific order of restriction.Such as, according to institute The concrete function related to, two square frames represented by connection can be performed in a reverse order, or can be parallel Ground performs.And, in each square frame in flow chart and/or block diagram in Figure of description, and flow chart and/or block diagram The combination of multiple square frames, can realize by using the hardware based system performing predetermined function or operation, or also may be used To use hardware to realize with the combination of dependent instruction.Use any hardware-related embodiment, also belong to the present invention The scope of protection.
Shown in Figure of description Fig. 1, for the schematic flow sheet of a kind of illustrative embodiments of the present invention, this example includes Step is as follows:
S1: receive the itinerary request of user;
Described stroke is asked, including: one or more destinatioies.Can also include: planning preference information.
User can input itinerary ask, in the request of described itinerary in UI interface (User Interface) Specifically may include that one or more destination information.Destination information, specifically may include that city, sight spot, lodging, dining room At least one in etc..
Stroke is asked, in addition to destination information, it is also possible to include other information, such as plan preference information.Planning preference The acquisition mode of information, can be user select or arrange preference, at least one in the mode such as default default preferences, but Being not limited only to cited mode, the acquisition methods of planning preference information is not any limitation as by embodiments of the present invention.With The preference that family selects or arranges, can be any preference, such as, the same day must return, uneasy seniority among brothers and sisters journeys after evening 7, away from From the shortest etc..The default preferences preset, can have a variety of, and such as, total drive time is the shortest, the dinner hour is that 11:30 arrives Meet one or more preference in the preference of mass psychology between 13:30 etc., but be not limited only to cited content. User can change default preferences.If select from user or the preference arranged and the default preferences preset obtain planning simultaneously Preference information, then user selects or the preference of setting cannot be to repeat mutually or phase with the preference information in the default preferences preset Contradiction.
The content and form that stroke request is included by embodiments of the present invention is not any limitation as, and believes destination The specifying information comprised in breath or planning preference information is not any limitation as.
S2: according to user's real time information, determine at least one travel schedule that the request of described stroke is corresponding;
Described travel schedule, including: the stroke sequence of destination's composition.
Described user's real time information, including: user's real-time position information.
Illustrate 1, described at least one travel schedule determining that the request of described stroke is corresponding, comprise determining that the row of destination Cheng Shunxu.Described stroke sequence, for a kind of permutation and combination of destination.User can specify all or part of of target information Sequencing.Particular order can not also be specified, according to relevant information, carry out the planning of stroke sequence for user.
Citing E1, user, using Zhongshan City, Guangdong Province as original position, carries out self-driving travel travelling, and destination is new sky, the south of the Five Ridges Ground (Foshan City), Foshan Ancestral Temple (Foshan City), Qing Hui garden (Foshan City), Dr. Sun Yan-sen's Former Residence (Zhongshan city), Bao Mo garden (Guangzhou), At totally five.According to this destination information at 5, plan stroke sequence for user.Possible concrete stroke sequence can have 5 altogether × 4 × 3 × 2 × 1=120 kind.
Illustrate 2, described at least one travel schedule determining that the request of described stroke is corresponding, also include: combined destination with And at least one in Back ground Information between destination, characteristic information, real time information, travel schedule is planned and selects Take.
Back ground Information between destination and destination includes: relatively-stationary Back ground Information, such as, it is recommended that during visit Between, pouplarity, destination's introduction, destination's geographical location information, belonging to destination between regional information, destination away from Transport information between information, destination, the average self-driving travel time between destination, etc..
Characteristic information between destination and destination includes: the information relevant with popular self-driving travel behavioural habits, than As, history stroke, classical stroke, recommendation stroke etc., and the relevant information of correspondence.
Real time information between destination and destination includes: the information relevant with real time status, and such as, the same day is oily Real-time self-driving travel time between valency, real-time weather information, destination, Real-time Traffic Information etc..
Embodiments of the present invention, to Back ground Information between destination and destination, characteristic information, real time information Particular content is not intended to.Back ground Information between destination and destination, characteristic information, real time information can obtain from network Take, or acquisition etc. from locally created data base.Embodiments of the present invention, to the base between destination and destination Plinth information, characteristic information, the acquisition mode of real time information are also not intended to.
Citing E2, user is from Melbourne, AUS intown apartment QV, after carrying out the self-driving travel travelling of 3 days Returning to one's starting point, destination is zoo, Melbourne Melburne Zoo (Melbourne), strangles than villa garden Werribee Mansion (Melbourne), Ba Lalante goldfield Ballarat Goldfields (Ba Lalante), Geelong urban district Geelong City (Ji Bright), at totally 4.In conjunction with this at 4 in Back ground Information between destination and destination, characteristic information, real time information at least one Kind, travel schedule planned and chooses, in this example, being specifically set as: the average visiting time of destination and opening During the real-time self-driving travel distance real-time self-driving travel between (real time information), destination between time (Back ground Information), destination Between (real time information).Travel schedule planning and the principle chosen are the shortest for distance of always driving.
In example E2, it was known that the average visiting time of destination and open hour are: zoo, Melbourne (4 hours, 9:00- 17:00), strangle than villa garden (3 hours, 10:00-16:00), Ba Lalante goldfield (5 hours, 10:00-17:00), Geelong urban district (2 hours, 0:00-24:00).The real-time self-driving travel time between real-time self-driving travel distance and destination between destination is respectively As shown in following Tables 1 and 2.Between 2 destination A and B of any of which, from A to B and from B to A, required time or distance May be different.According to specific needs, all or part of information can be obtained from above relevant information, for the rule of travel schedule Draw and choose.
Real-time self-driving travel distance between table 1 destination
The real-time self-driving travel time between table 2 destination
In example E2, possible the putting in order that 4 destinatioies are corresponding, altogether can there is 4 × 3 × 2 × 1=24 kind.Often One puts in order, and distributes according to the requirement of travelling in 3 days, altogether can haveKind possible according to natural law The method of salary distribution.Such as, for a kind of stroke sequence: zoo, Melbourne, Geelong urban district, Ba Lalante goldfield, Le ratio villa garden, According to the requirement of travelling in 3 days, (zoo, Melbourne), (Geelong urban district), (Ba Lalante goldfield, the Le Bi village can be assigned as Garden), or (zoo, Melbourne), (Geelong urban district, Ba Lalante goldfield), (strangling than villa garden), or (Melbourne animal Garden, Geelong urban district), (Ba Lalante goldfield), (strangle than villa garden), totally 3 kinds of methods of salary distribution.In bracket in example, represent Therein on purpose, be arranged at and travel on the same day.So, 4 destinatioies and self-driving travel in 3 days, the two information institute is right The stroke planning answered, having 24 × 3=72 kind may.
In example E2, real-time self-driving travel between the average visiting time of combined destination and open hour, destination distance, The real-time self-driving travel time between destination, carry out the planning of scheme for user and choose.Such as, (zoo, Melbourne), (Ji Bright urban district), (Ba Lalante goldfield, strangle than villa garden), this stroke planning is exactly infeasible.Because Ba Lalante goldfield Starting a business from 10:00, average visiting time is 5 hours, then the earliest time that anticipated visit terminates is 15:00.From Ba Lalan It is 77 minutes that special goldfield rushes to strangle than the real-time used time of villa garden, then user estimates that visit is strangled and than the earliest time of villa garden is 16:17.Strangling than the business hours of villa garden is 10:00-16:00, now strangles and has closed the door than villa garden.This scheme is infeasible.
In example E2, meet the scheme of the condition of choosing, it should meet distance of always driving the shortest.Namely for this The stroke sequence (include departure place and return to ground) of travel schedule: QV, destination 1, destination 2, destination 3, destination 4, QV, The summation of the real-time self-driving travel distance between all adjacent 2 places, should be the shortest.
In example E2, do not provide other possible information, such as, the place in hotel and positional information etc..True On, other information, according to user's request, also can participate in stroke planning.
The citing being more than intended merely to clearly illustrate this method and carry out, embodiments of the present invention are to determining stroke side The physical planning that uses during case and choose mode and be not intended to.
Illustrate 3, described at least one travel schedule determining that the request of described stroke is corresponding, also include: combine planning preference Information, carries out the planning of travel schedule.
Citing E3, user, from the somewhere real time position X of Shenyang City, Liaoning Province, carries out self-driving travel travelling, and destination is Peng residence (Liaoyang City), water hole, Benxi (Benxi), at totally 2, finally return to position Y.And this does not all have at 2 permissible in scenic spot The dining room of dining.According to this destination information at 2, plan travel schedule for user.Meanwhile, the preference of planning is arranged by user Have: come and go in 1 day.The preference of acquiescence is provided with lunchtime 11:30-12:30.Travel schedule planning and the principle chosen are Drive time is the shortest.
In example E3, it was known that the average visiting time of destination and open hour are: Peng residence (3 hours, 9:00-17: 00), water hole, Benxi (3 hours, 8:30-17:00).From water hole, Benxi to Peng residence, or from Peng residence to water hole, Benxi, drive to need Want 1.5 hours.
In example E3,1) a kind of stroke sequence is (include departure place and return to ground): position X, Peng residence, water hole, Benxi, Position Y, corresponding stroke planning, for irrational solution.Because Peng residence 9:00 opens to business, it is contemplated that complete Peng public The time that shop is visited is 12:00, and the user-defined lunchtime is 11:30-12:30.User's request cannot be met.2) another Plant stroke sequence for (include departure place and return to ground): position X, water hole, Benxi, Peng residence, position Y, the stroke planning of correspondence, For relatively reasonable solution.Because water hole, Benxi 8:30 opens the door, from position X, catch up with arrival water hole, Benxi before 8:30, The anticipated time terminating visit from water hole, Benxi is 11:30, is just the user-defined lunchtime.User has dinner the end time Being expected to be 12:30, Peng residence of and then rushing from water hole, Benxi, the time arriving Peng residence is expected to be 14:00, terminates visit Peng The time in residence is expected to be 17:00, identical with Time Out.This scheme can meet the requirement of preference information.
Illustrate 4, described at least one travel schedule determining that the request of described stroke is corresponding, specific algorithm can be used to carry out Plan and choose, it is also possible to plan according to other modes and choose.Such as, with reference to history stroke, classical stroke, row is recommended Journey etc. also carries out locally revising as required.For another example, travel schedule marked and select the forward scheme of score.Even also The way that various ways can be taked to combine is planned and chooses.Embodiments of the present invention are to determining travel schedule Physical planning and choose mode and be not intended to.
Embodiments of the present invention, to all specific algorithms related to during planning travel schedule, are not limited System, such as, the method for exhaustion, recursive algorithm, greedy algorithm, bubbling algorithm, depth-priority-searching method, width first traversal, dynamic programming, Shortest path first etc. any particular algorithms or algorithm combination.During this method is planned for travel schedule, may Relate to specifically marks and chooses mode, is not any limitation as.
Illustrate 5, described at least one travel schedule determining that the request of described stroke is corresponding, also include: based on self-driving travel Mode of transportation, local is wanted to combine other modes of transportation of free walker.Such as, walking, ride, call a taxi, take public transport etc., Embodiments of the present invention, to other modes of transportation that may combine with self-driving travel, are not intended to.
S3: output program results.
Described output program results, including: combine map and airmanship, described travel schedule is exported to user.
Described output program results, including: user selects at least one travel schedule from multiple travel schedule.
The inventive method can be according to the various information in the stroke request of user, including destination and planning preference, knot Close the relevant information in stroke, application map and airmanship, plan the stroke of self-driving travel for user intelligently, it is to avoid user Carry out the stroke planning work of complexity.Generally, the inventive method is the planing method of a kind of height intelligence, improves user The convenience of self-driving travel.
The stroke planning method of described a kind of self-driving travel, also includes: know the variations or modifications of the stroke request of user;Root According to user's real time information, redefine at least one travel schedule that the request of the stroke after described variations or modifications is corresponding;Output Program results.
Citing, in above-mentioned E1 example, user has rejoined 2 restaurants and 1 hotel as destination: red sun restaurant (Zhongshan city), Tai Aili dining room (Foshan City), Foshan Hilton Hotel (Foshan City).Then stroke request there occurs change or adjusts Whole.Current destination has: south of the Five Ridges new world, Foshan Ancestral Temple, Qing Hui garden, Dr. Sun Yan-sen's Former Residence, Bao Mo garden, red sun restaurant, safe love In dining room, Foshan Hilton Hotel, at totally 8.According to this destination information at 8, again plan travel schedule for user.
The present invention is illustrated rather than limits the invention by above-mentioned embodiment, can be according to the method for the present invention Design other detailed description of the invention.Any reference marks that should not will be located between bracket is configured to the limit to claim System;Word " comprises ", " including " shows that containing existence is not listed in claim or the process of detailed description of the invention citing, side Method, article, situation or step etc., it addition, explanation 1 and explanation 2, destination A and destination B, destination 1 and destination 2 etc Relational terms be used merely to make a distinction a situation, operation or entity etc. with another situation, operation or entity etc., and Not necessarily require or imply relation or the order that there is any this reality between these situations, operation or entity etc..Depend on According to method and the scope of the present invention, other embodiments obtained or technical scheme broadly fall into the scope of the present invention.
A kind of stroke planning method of self-driving travel, uses more intelligentized planing method, has and makes people more accurately, more The advantage that itinerary drawn by control gauges convenient, more.

Claims (5)

1. a stroke planning method for self-driving travel, based on network technology, and combines map and airmanship, it is characterised in that Described method includes: receive the stroke request of user;According to user's real time information, determine at least the one of described stroke request correspondence Plant travel schedule;Output program results.
Described stroke is asked, including: one or more destinatioies.
Described stroke is asked, it is also possible to including: planning preference information.
Described travel schedule, including: the stroke sequence of destination's composition.
Described user's real time information, including: user's real-time position information, it is also possible to including: user's real-time time information.
Method the most according to claim 1, it is characterised in that described method also includes: know the stroke request of user Variations or modifications;According to user's real time information, redefine the stroke after described variations or modifications and ask corresponding at least one Travel schedule;Output program results.
Method the most according to claim 1, it is characterised in that described at least one row determining that the request of described stroke is corresponding Journey scheme, comprises determining that a kind of permutation and combination that the stroke sequence of destination, described stroke sequence are destination.
Method the most according to claim 1, it is characterised in that described output program results, including: combine map and navigation Technology, exports described travel schedule to user.
Method the most according to claim 1, it is characterised in that described at least one row determining that the request of described stroke is corresponding Journey scheme, also includes: with self-driving travel for main traffic mode, and local combines other modes of transportation of free walker.
CN201610673278.4A 2016-07-28 2016-07-28 Route planning method of self-driving tour Pending CN106052708A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201610673278.4A CN106052708A (en) 2016-07-28 2016-07-28 Route planning method of self-driving tour

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201610673278.4A CN106052708A (en) 2016-07-28 2016-07-28 Route planning method of self-driving tour

Publications (1)

Publication Number Publication Date
CN106052708A true CN106052708A (en) 2016-10-26

Family

ID=57480477

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201610673278.4A Pending CN106052708A (en) 2016-07-28 2016-07-28 Route planning method of self-driving tour

Country Status (1)

Country Link
CN (1) CN106052708A (en)

Cited By (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN107490385A (en) * 2017-08-21 2017-12-19 百度在线网络技术(北京)有限公司 Traffic path planing method and its device
CN109214878A (en) * 2017-07-03 2019-01-15 北京嘀嘀无限科技发展有限公司 Method for processing business and device
CN109387464A (en) * 2018-09-21 2019-02-26 浙江华诚工程管理有限公司 A kind of construction supervision scene dust automated processing system
CN109556621A (en) * 2017-09-27 2019-04-02 腾讯科技(深圳)有限公司 A kind of method and relevant device of route planning
CN114091749A (en) * 2021-11-20 2022-02-25 深圳市龙德武术文化传播有限公司 Route planning method for self-driving tour and related product

Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN103994769A (en) * 2013-02-19 2014-08-20 腾讯科技(深圳)有限公司 Map navigation route acquiring method and terminal
CN104019808A (en) * 2013-02-28 2014-09-03 联想(北京)有限公司 Navigation mode switching method and device
JP2014228550A (en) * 2013-05-24 2014-12-08 クラリオン株式会社 On-vehicle device, navigation information output method, mobile phone and car navigation system
CN104215252A (en) * 2013-05-29 2014-12-17 文浩 Path map
CN105389751A (en) * 2015-10-27 2016-03-09 北京妙计科技有限公司 Travel service method and device

Patent Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN103994769A (en) * 2013-02-19 2014-08-20 腾讯科技(深圳)有限公司 Map navigation route acquiring method and terminal
CN104019808A (en) * 2013-02-28 2014-09-03 联想(北京)有限公司 Navigation mode switching method and device
JP2014228550A (en) * 2013-05-24 2014-12-08 クラリオン株式会社 On-vehicle device, navigation information output method, mobile phone and car navigation system
CN104215252A (en) * 2013-05-29 2014-12-17 文浩 Path map
CN105389751A (en) * 2015-10-27 2016-03-09 北京妙计科技有限公司 Travel service method and device

Cited By (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN109214878A (en) * 2017-07-03 2019-01-15 北京嘀嘀无限科技发展有限公司 Method for processing business and device
CN107490385A (en) * 2017-08-21 2017-12-19 百度在线网络技术(北京)有限公司 Traffic path planing method and its device
CN109556621A (en) * 2017-09-27 2019-04-02 腾讯科技(深圳)有限公司 A kind of method and relevant device of route planning
CN109556621B (en) * 2017-09-27 2022-03-25 腾讯科技(深圳)有限公司 Route planning method and related equipment
CN109387464A (en) * 2018-09-21 2019-02-26 浙江华诚工程管理有限公司 A kind of construction supervision scene dust automated processing system
CN114091749A (en) * 2021-11-20 2022-02-25 深圳市龙德武术文化传播有限公司 Route planning method for self-driving tour and related product

Similar Documents

Publication Publication Date Title
CN106052708A (en) Route planning method of self-driving tour
CN109344529A (en) A kind of customization public bus network design method based on two-phase heuristic algorithm
CN103440780B (en) The complicated traffic environment Route Guidance System in a kind of city based on positioning label and method
CN109764884A (en) A kind of school bus paths planning method and device for planning
CN106197449A (en) A kind of map path method and system for planning based on network path selection algorithm
CN109242214A (en) Distribution route planing method and distribution route device for planning
CN109059926A (en) Across floor paths planning method and system
CN106779212A (en) A kind of city tour's route planning method based on improvement ant group algorithm
CN101483806A (en) Outdoor blind guidance service system and method oriented to blind disturbance people
Antsfeld et al. Finding multi-criteria optimal paths in multi-modal public transportation networks using the transit algorithm
CN109120516A (en) Full-time position navigation sharing method based on mobile phone chats group
CN106408097A (en) Travel journey planning system based on genetic algorithm
CN108304951A (en) Acquisition methods, device and the non-transient computer readable storage medium of traffic information
CN109857947A (en) A kind of broadband installation site selecting method and system based on GIS map
CN104636457B (en) A kind of method and device of location finding cognition
Salama et al. Knowledge economy as an initiator of sustainable urbanism in emerging metropolises: the case of Doha, Qatar
CN108446298A (en) Room method and device is looked in a kind of commuting
Zhou et al. Digital manufacturing and urban conservation based on the Internet of Things and 5 G technology in the context of economic growth
Samsudin et al. A comparative study of smart city initiatives in Malaysia: Putrajaya and Iskandar Puteri
CN104464346A (en) Android-based intelligent campus parking guide analysis method
CN109493639A (en) A kind of parking stall management method and apparatus based on target position
CN104298717B (en) A kind of intelligent service system based on information word
CN108534791A (en) Holography tourism path dynamic programming method, device, electronic equipment and system
CN106092109B (en) A kind of road connection logically method and application of the efficient pathfinding of electronic map
Sousa et al. Realistic mobility modeling of pedestrian traffic in wireless networks

Legal Events

Date Code Title Description
C06 Publication
PB01 Publication
C10 Entry into substantive examination
SE01 Entry into force of request for substantive examination
WD01 Invention patent application deemed withdrawn after publication

Application publication date: 20161026

WD01 Invention patent application deemed withdrawn after publication