CN108805314A - One kind is parked optimal route selection method and system, car-mounted terminal - Google Patents

One kind is parked optimal route selection method and system, car-mounted terminal Download PDF

Info

Publication number
CN108805314A
CN108805314A CN201710286886.4A CN201710286886A CN108805314A CN 108805314 A CN108805314 A CN 108805314A CN 201710286886 A CN201710286886 A CN 201710286886A CN 108805314 A CN108805314 A CN 108805314A
Authority
CN
China
Prior art keywords
path
parking
optimal
weight
selection index
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.)
Granted
Application number
CN201710286886.4A
Other languages
Chinese (zh)
Other versions
CN108805314B (en
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.)
Zongmu Technology Shanghai Co Ltd
Original Assignee
Zongmu Technology Shanghai Co Ltd
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 Zongmu Technology Shanghai Co Ltd filed Critical Zongmu Technology Shanghai Co Ltd
Priority to CN201710286886.4A priority Critical patent/CN108805314B/en
Publication of CN108805314A publication Critical patent/CN108805314A/en
Application granted granted Critical
Publication of CN108805314B publication Critical patent/CN108805314B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Classifications

    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06QINFORMATION 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/00Administration; Management
    • G06Q10/04Forecasting or optimisation specially adapted for administrative or management purposes, e.g. linear programming or "cutting stock problem"
    • G06Q10/047Optimisation of routes or paths, e.g. travelling salesman problem

Landscapes

  • Business, Economics & Management (AREA)
  • Human Resources & Organizations (AREA)
  • Engineering & Computer Science (AREA)
  • Strategic Management (AREA)
  • Economics (AREA)
  • Marketing (AREA)
  • Game Theory and Decision Science (AREA)
  • Entrepreneurship & Innovation (AREA)
  • Development Economics (AREA)
  • Operations Research (AREA)
  • Quality & Reliability (AREA)
  • Tourism & Hospitality (AREA)
  • Physics & Mathematics (AREA)
  • General Business, Economics & Management (AREA)
  • General Physics & Mathematics (AREA)
  • Theoretical Computer Science (AREA)
  • Traffic Control Systems (AREA)
  • Navigation (AREA)

Abstract

The present invention provides one kind and parks optimal route selection method and system, car-mounted terminal, includes the following steps:Obtain the Path selection index of each parking path;For each parking path, each Path selection index is converted into its corresponding time span parameter;The weight of acquisition approach selective goal;The time span parameter and weight corresponding to each Path selection index according to each parking path selects optimal path of parking.Park optimal route selection method and the system of the present invention, car-mounted terminal are unified on time dimension by the index of all Path selections, are parked optimal path according to the weight final choice of each index, to improve efficiency of parking, avoid parking repeatedly the inconvenience brought.

Description

One kind is parked optimal route selection method and system, car-mounted terminal
Technical field
The present invention relates to parking path selection technical field, more particularly to one kind park optimal route selection method and System, car-mounted terminal.
Background technology
With economic rapid development, car ownership persistently increases, and causes parking stall resource more and more nervous.It is existing In technology, carry out parking path selection when, it is first determined whether can directly VEHICLES MUST PARK WITHIN THE MARKED BAY;If it is, directly choosing the road Diameter is parked;If can not directly VEHICLES MUST PARK WITHIN THE MARKED BAY, by repeatedly front and back traveling, VEHICLES MUST PARK WITHIN THE MARKED BAY.In actually parking, either Directly VEHICLES MUST PARK WITHIN THE MARKED BAY, or repeatedly VEHICLES MUST PARK WITHIN THE MARKED BAY for front and back traveling, and there may be a plurality of parking paths.
Therefore, under limited parking stall resource, how to select optimal path to park to improve efficiency of parking, avoid anti- The inconvenience brought of parking again becomes a urgent problem to be solved.
Invention content
In view of the foregoing deficiencies of prior art, it parks optimal route selection side the purpose of the present invention is to provide one kind Method and system, car-mounted terminal, by the index unification to time dimension of all Path selections, the weight according to each index is final Optimal path of parking is selected, to improve efficiency of parking, avoid parking repeatedly the inconvenience brought.
In order to achieve the above objects and other related objects, the present invention provides one kind and parks optimal route selection method, including Following steps:Obtain the Path selection index of each parking path;For each parking path, each Path selection index is turned It is changed to its corresponding time span parameter;The weight of acquisition approach selective goal;It is selected according to each path of each parking path Time span parameter and the weight corresponding to index are selected, optimal path of parking is selected.
In one embodiment of the invention, the Path selection index includes the angle summation that steering wheel rotates in path, shelves Position switching times, path key node number, path length, path distance parking stall central horizontal direction maximum distance, path away from It is combined from one or more of parking stall center vertical direction maximum distance.
In one embodiment of the invention, the weight of the Path selection index uses default value.
In one embodiment of the invention, the time span corresponding to each Path selection index according to each parking path Parameter and weight, selection optimal path of parking include the following steps:
For each parking path, the time calculated corresponding to each Path selection index that the parking path is included is long Spend the weighted sum of parameter and corresponding weight;
Select the parking path of weighted sum minimum as optimal path of parking.
Meanwhile park optimal route selection system the present invention also provides one kind, including the first acquisition module, conversion module, Second acquisition module and selecting module;
First acquisition module is used to obtain the Path selection index of each parking path;
The conversion module is connected with the first acquisition module, for for each parking path, each Path selection to be referred to Mark is converted to its corresponding time span parameter;
Second acquisition module is used for the weight of acquisition approach selective goal;
The selecting module is for the time span ginseng corresponding to each Path selection index according to each parking path Number and weight select optimal path of parking.
In one embodiment of the invention, the Path selection index includes the angle summation that steering wheel rotates in path, shelves Position switching times, path key node number, path length, path distance parking stall central horizontal direction maximum distance, path away from It is combined from one or more of parking stall center vertical direction maximum distance.
In one embodiment of the invention, in second acquisition module, the weight of the Path selection index is using acquiescence Value.
In one embodiment of the invention, selecting module selection optimal path of parking includes the following steps:
For each parking path, the time calculated corresponding to each Path selection index that the parking path is included is long Spend the weighted sum of parameter and corresponding weight;
Select the parking path of weighted sum minimum as optimal path of parking.
Correspondingly, the present invention also provides a kind of car-mounted terminal, including any of the above-described optimal route selection system that parks System.
As described above, park optimal route selection method and system, the car-mounted terminal of the present invention, have below beneficial to effect Fruit:
(1) index of all Path selections is unified onto time dimension, and gives each Distribution Indexes different weights, then Optimal path of parking is selected according to the weight of each index;
(2) it is effectively improved efficiency of parking, avoids the inconvenience parked and brought repeatedly;
(3) the user experience is improved.
Description of the drawings
Fig. 1 is shown as the flow chart of the optimal route selection method of parking of the present invention;
Fig. 2 is shown as the structural schematic diagram of the optimal route selection system of parking of the present invention;
Fig. 3 is shown as the structural schematic diagram of the car-mounted terminal of the present invention.
Component label instructions
1 parks optimal route selection system
11 first acquisition modules
12 conversion modules
13 second acquisition modules
14 selecting modules
Specific implementation mode
Illustrate that embodiments of the present invention, those skilled in the art can be by this specification below by way of specific specific example Disclosed content understands other advantages and effect of the present invention easily.The present invention can also pass through in addition different specific realities The mode of applying is embodied or practiced, the various details in this specification can also be based on different viewpoints with application, without departing from Various modifications or alterations are carried out under the spirit of the present invention.It should be noted that in the absence of conflict, following embodiment and implementation Feature in example can be combined with each other.
It should be noted that the diagram provided in following embodiment only illustrates the basic structure of the present invention in a schematic way Think, component count, shape and size when only display is with related component in the present invention rather than according to actual implementation in schema then Draw, when actual implementation kenel, quantity and the ratio of each component can be a kind of random change, and its assembly layout kenel It is likely more complexity.
The present invention park optimal route selection method and system, car-mounted terminal uniformly arrive the index of all Path selections It on time dimension, is parked optimal path according to the weight final choice of each index, to improve efficiency of parking, avoids mooring repeatedly The inconvenience that vehicle is brought, the user experience is improved.
As shown in Figure 1, the optimal route selection method of parking of the present invention includes the following steps:
Step S1, the Path selection index of each parking path is obtained.
In practical driving procedure, when determining current location and parking space, it may appear that multiple parking paths.The present invention Optimal path of parking is selected i.e. in the multiple parking path.Therefore it needs to be analyzed and determined for each parking path.
Specifically, Path selection index includes the angle summation that steering wheel rotates in path, gear switch number, path pass Key node number, path length, path distance parking stall central horizontal direction maximum distance, path distance parking stall center vertical direction One or more of maximum distance combines.
Step S2, for each parking path, each Path selection index is converted into its corresponding time span parameter.
In practical driver behavior, driver completes specific driver behavior and needs the regular hour.In order to preferably real It now parks the selection of optimal path, for each parking path, each Path selection index for being included by it is converted to realization Time span corresponding to the Path selection index, in order to more intuitively, more select optimal path of parking to visualization.
Specifically, for each Path selection index, according to driver's General reactions actuation time, the time required to estimating it Length, to obtain its corresponding time span parameter.For example, it is assumed that a gear switch probably needs 3 seconds, then gear The total time of switching is:Gear switch number * 3 (s), the time are the corresponding time span parameter of gear switch number.Again Such as, path length 10m, vehicle parking speed are about 3.6km/h, i.e. 1m/s, then path total time be:10/1=10 (s), The time is the corresponding time span parameter of path length.
It should be noted that in practical transfer process, under different road surfaces and road conditions, each Path selection index conversion Algorithm for corresponding time span parameter may be the same or different.This does not influence the choosing of final optimal path of parking Select result.The algorithm of the corresponding time span parameter of each Path selection index to those skilled in the art, belongs into The ripe prior art is not belonging to the content that emphasis of the present invention illustrates, therefore details are not described herein.
Step S3, the weight of acquisition approach selective goal.
For different drivers, due to the difference of its driving habit, driving ability etc., the optimal road assert The standard of diameter is also not quite similar.Therefore need to obtain the weight of the Path selection index of driver personalityization.
In one embodiment of the present invention, driver is selected by button on car-mounted terminal or touch screen to input path Select the weight of index.
In another preferred embodiment of the present invention, the hobby for the different type driver that can be obtained according to statistics, not Same type pattern is given a definition the weight of each Path selection index.Driver only need to be by selecting concrete type pattern to can determine The weight of each Path selection index.Preferably, system is provided with the default-weight of Path selection index.Driver is only having When oneself requirement, the weight of each Path selection index under reselection corresponding types pattern.
For example, in acquired Path selection index, steering wheel rotates in path angle summation, gear switch number, Path key node number, path length, path distance parking stall central horizontal direction maximum distance, path distance parking stall center are hung down Histogram may respectively be 0.3,0.25,0.15,0.1,0.1,0.1 to the weight of maximum distance.
It should be noted that for different drivers, the weight of acquired path metric can be different, as long as its summation It is 1.
Step S4, the time span parameter and weight corresponding to each Path selection index according to each parking path, Select optimal path of parking.
Specifically, include the following steps:
41) for each parking path, calculate corresponding to each Path selection index that the parking path is included when Between length parameter and corresponding weight weighted sum.
42) select the parking path of weighted sum minimum as optimal path of parking.
That is, after weighted sum, spent time minimum path is as currently parked optimal path.
As shown in Fig. 2, the present invention park optimal route selection system 1 include the first acquisition module 11, conversion module 12, Second acquisition module 13 and selecting module 14.
First acquisition module 11 is used to obtain the Path selection index of each parking path.
In practical driving procedure, when determining current location and parking space, it may appear that multiple parking paths.The present invention Optimal path of parking is selected i.e. in the multiple parking path.Therefore it needs to be analyzed and determined for each parking path.
Specifically, Path selection index includes the angle summation that steering wheel rotates in path, gear switch number, path pass Key node number, path length, path distance parking stall central horizontal direction maximum distance, path distance parking stall center vertical direction One or more of maximum distance combines.
Conversion module 12 is connected with the first acquisition module 11, for for each parking path, each Path selection to be referred to Mark is converted to its corresponding time span parameter.
In practical driver behavior, driver completes specific driver behavior and needs the regular hour.In order to preferably real It now parks the selection of optimal path, for each parking path, each Path selection index for being included by it is converted to realization Time span corresponding to the Path selection index, in order to more intuitively, more select optimal path of parking to visualization.
Specifically, for each Path selection index, according to driver's General reactions actuation time, the time required to estimating it Length, to obtain its corresponding time span parameter.For example, it is assumed that a gear switch probably needs 3 seconds, then gear The total time of switching is:Gear switch number * 3 (s), the time are the corresponding time span parameter of gear switch number.Again Such as, path length 10m, vehicle parking speed are about 3.6km/h, i.e. 1m/s, then path total time be:10/1=10 (s), The time is the corresponding time span parameter of path length.
It should be noted that in practical transfer process, under different road surfaces and road conditions, each Path selection index conversion Algorithm for corresponding time span parameter may be the same or different.This does not influence the choosing of final optimal path of parking Select result.The algorithm of the corresponding time span parameter of each Path selection index to those skilled in the art, belongs into The ripe prior art is not belonging to the content that emphasis of the present invention illustrates, therefore details are not described herein.
Second acquisition module 13 is used for the weight of acquisition approach selective goal.
For different drivers, due to the difference of its driving habit, driving ability etc., the optimal road assert The standard of diameter is also not quite similar.Therefore need to obtain the weight of the Path selection index of driver personalityization.
In one embodiment of the present invention, driver is selected by button on car-mounted terminal or touch screen to input path Select the weight of index.
In another preferred embodiment of the present invention, the hobby for the different type driver that can be obtained according to statistics, not Same type pattern is given a definition the weight of each Path selection index.Driver only need to be by selecting concrete type pattern to can determine The weight of each Path selection index.Preferably, system is provided with the default-weight of Path selection index.Driver is only having When oneself requirement, the weight of each Path selection index under reselection corresponding types pattern.
For example, in acquired Path selection index, steering wheel rotates in path angle summation, gear switch number, Path key node number, path length, path distance parking stall central horizontal direction maximum distance, path distance parking stall center are hung down Histogram may respectively be 0.3,0.25,0.15,0.1,0.1,0.1 to the weight of maximum distance.
It should be noted that for different drivers, the weight of acquired path metric can be different, as long as its summation It is 1.
14 selecting modules are connected with conversion module 12 and the second acquisition module 13, for according to each of each parking path Time span parameter corresponding to Path selection index and weight select optimal path of parking.
Specifically, include the following steps:
41) for each parking path, calculate corresponding to each Path selection index that the parking path is included when Between length parameter and corresponding weight weighted sum.
42) select the parking path of weighted sum minimum as optimal path of parking.
That is, after weighted sum, spent time minimum path is as currently parked optimal path.
As shown in figure 3, the car-mounted terminal of the present invention includes above-mentioned optimal route selection system of parking.When being installed on vehicle The multiple parking paths occurred when having the car-mounted terminal, when can be to parking carry out comprehensive assessment, and select optimal path, with Driver is assisted to carry out parking manoeuvres, concrete principle is as described above, therefore details are not described herein.
In conclusion park optimal route selection method and the system of the present invention, car-mounted terminal are by all Path selections In index unification to time dimension, and give each Distribution Indexes different weights, the weight selection further according to each index is parked Optimal path;It is effectively improved efficiency of parking, avoids the inconvenience parked and brought repeatedly;The user experience is improved.So this Invention effectively overcomes various shortcoming in the prior art and has high industrial utilization.
The above-described embodiments merely illustrate the principles and effects of the present invention, and is not intended to limit the present invention.It is any ripe The personage for knowing this technology can all carry out modifications and changes to above-described embodiment without violating the spirit and scope of the present invention.Cause This, institute is complete without departing from the spirit and technical ideas disclosed in the present invention by those of ordinary skill in the art such as At all equivalent modifications or change, should by the present invention claim be covered.

Claims (9)

  1. The optimal route selection method 1. one kind is parked, it is characterised in that:Include the following steps:
    Obtain the Path selection index of each parking path;
    For each parking path, each Path selection index is converted into its corresponding time span parameter;
    The weight of acquisition approach selective goal;
    The time span parameter and weight corresponding to each Path selection index according to each parking path, selection are parked optimal Path.
  2. 2. optimal route selection method according to claim 1 of parking, it is characterised in that:The Path selection index includes The angle summation of steering wheel rotation, gear switch number, path key node number, path length, path distance vehicle in path The combination of one or more of position central horizontal direction maximum distance, path distance parking stall center vertical direction maximum distance.
  3. 3. optimal route selection method according to claim 1 of parking, it is characterised in that:The power of the Path selection index Default value is used again.
  4. 4. optimal route selection method according to claim 1 of parking, it is characterised in that:According to each of each parking path Time span parameter corresponding to a Path selection index and weight, selection optimal path of parking include the following steps:
    For each parking path, the time span ginseng corresponding to each Path selection index that the parking path is included is calculated Number and the weighted sum of corresponding weight;
    Select the parking path of weighted sum minimum as optimal path of parking.
  5. The optimal route selection system 5. one kind is parked, it is characterised in that:It is obtained including the first acquisition module, conversion module, second Module and selecting module;
    First acquisition module is used to obtain the Path selection index of each parking path;
    The conversion module is connected with the first acquisition module, for for each parking path, each Path selection index to be turned It is changed to its corresponding time span parameter;
    Second acquisition module is used for the weight of acquisition approach selective goal;
    The selecting module for corresponding to each Path selection index according to each parking path time span parameter and Weight selects optimal path of parking.
  6. 6. optimal route selection system according to claim 5 of parking, it is characterised in that:The Path selection index includes The angle summation of steering wheel rotation, gear switch number, path key node number, path length, path distance vehicle in path The combination of one or more of position central horizontal direction maximum distance, path distance parking stall center vertical direction maximum distance.
  7. 7. optimal route selection system according to claim 5 of parking, it is characterised in that:In second acquisition module, The weight of the Path selection index uses default value.
  8. 8. optimal route selection system according to claim 5 of parking, it is characterised in that:The selecting module selection is parked Optimal path includes the following steps:
    For each parking path, the time span ginseng corresponding to each Path selection index that the parking path is included is calculated Number and the weighted sum of corresponding weight;
    Select the parking path of weighted sum minimum as optimal path of parking.
  9. 9. a kind of car-mounted terminal, it is characterised in that:Including the optimal route selection system of parking described in one of claim 5-8.
CN201710286886.4A 2017-04-27 2017-04-27 Optimal parking path selection method and system and vehicle-mounted terminal Active CN108805314B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201710286886.4A CN108805314B (en) 2017-04-27 2017-04-27 Optimal parking path selection method and system and vehicle-mounted terminal

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201710286886.4A CN108805314B (en) 2017-04-27 2017-04-27 Optimal parking path selection method and system and vehicle-mounted terminal

Publications (2)

Publication Number Publication Date
CN108805314A true CN108805314A (en) 2018-11-13
CN108805314B CN108805314B (en) 2021-12-14

Family

ID=64070400

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201710286886.4A Active CN108805314B (en) 2017-04-27 2017-04-27 Optimal parking path selection method and system and vehicle-mounted terminal

Country Status (1)

Country Link
CN (1) CN108805314B (en)

Cited By (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN110045734A (en) * 2019-04-04 2019-07-23 百度在线网络技术(北京)有限公司 Method, apparatus and computer equipment are determined based on the parameters weighting of path planning
CN110164162A (en) * 2019-05-23 2019-08-23 济南大学 A kind of special vehicle fining guidance system and passing method
CN112414422A (en) * 2020-11-01 2021-02-26 北京航空航天大学 Automatic parking path planning method and device and storage medium

Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN102800189A (en) * 2012-07-22 2012-11-28 江南大学 Method for optimizing intelligent parking path in environment of Internet of things
US20140163862A1 (en) * 2012-12-11 2014-06-12 Hyundai Motor Company Apparatus and method for controlling parking assistance
CN104541131A (en) * 2012-08-10 2015-04-22 歌乐株式会社 Route calculation system, navigation device, and route calculation method
US20160140846A1 (en) * 2014-09-25 2016-05-19 Christopher Scott Outwater System and Method for Parking Management Based on Location Tracking
CN105857306A (en) * 2016-04-14 2016-08-17 中国科学院合肥物质科学研究院 Vehicle autonomous parking path programming method used for multiple parking scenes

Patent Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN102800189A (en) * 2012-07-22 2012-11-28 江南大学 Method for optimizing intelligent parking path in environment of Internet of things
CN104541131A (en) * 2012-08-10 2015-04-22 歌乐株式会社 Route calculation system, navigation device, and route calculation method
US20140163862A1 (en) * 2012-12-11 2014-06-12 Hyundai Motor Company Apparatus and method for controlling parking assistance
US20160140846A1 (en) * 2014-09-25 2016-05-19 Christopher Scott Outwater System and Method for Parking Management Based on Location Tracking
CN105857306A (en) * 2016-04-14 2016-08-17 中国科学院合肥物质科学研究院 Vehicle autonomous parking path programming method used for multiple parking scenes

Cited By (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN110045734A (en) * 2019-04-04 2019-07-23 百度在线网络技术(北京)有限公司 Method, apparatus and computer equipment are determined based on the parameters weighting of path planning
CN110164162A (en) * 2019-05-23 2019-08-23 济南大学 A kind of special vehicle fining guidance system and passing method
CN112414422A (en) * 2020-11-01 2021-02-26 北京航空航天大学 Automatic parking path planning method and device and storage medium

Also Published As

Publication number Publication date
CN108805314B (en) 2021-12-14

Similar Documents

Publication Publication Date Title
Weinert et al. The transition to electric bikes in China: history and key reasons for rapid growth
CN108805314A (en) One kind is parked optimal route selection method and system, car-mounted terminal
CN109409982B (en) Shared vehicle recommendation method and device
CN108595823A (en) A kind of computational methods of Autonomous Vehicles lane-change strategy that combining driving style and theory of games
CN106940928A (en) Order allocation method and device
CN108961803A (en) Vehicle drive assisting method, device, system and terminal device
CN109003467A (en) A kind of method, apparatus and system preventing vehicle collision
CN110414728A (en) Electric quantity consumption prediction technique, system and the electronic equipment of new energy vehicle
McIlroy et al. Getting drivers to do the right thing: a review of the potential for safely reducing energy consumption through design
CN107918804A (en) Plug between the vehicles planing method, system, storage medium and the terminal of route
CN104318081A (en) Method for allocating bicycles at public bicycle rental stations with urgent demand in city
CN108827332A (en) Combination of paths planing method, system, equipment and the storage medium driven with subway
CN106530691A (en) Hybrid vehicle model multilane cellular automaton model considering vehicle occupancy space
Li et al. An innovative car sharing technological paradigm towards sustainable mobility
CN103280120A (en) Road train comprehensive decision-making device
Annema Policy implications of the potential carbon dioxide (CO2) emission and energy impacts of highly automated vehicles
CN105741607A (en) Excitation-based method for discovering VANETs indoor parking space
CN105953808B (en) Route planning method and device
CN106341388B (en) A kind of Research on Vehicle Remote Monitoring System Based on GPRS and its networking control method
CN113978469B (en) Cheng Chexing driving mode intelligent control method and device and electronic equipment
Sanchez et al. Can autonomy make bicycle-sharing systems more sustainable? An environmental impact analysis
Lu et al. Enhancement of safety and comfort of cyclists at intersections
CN109711926A (en) It is a kind of to purchase by group the method, system and server made house calls
CN107818687A (en) Control method, the device and system of vehicle clearance on road
Pandyaswargo et al. Global distribution and readiness status of artificial intelligence application on mobility projects

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
GR01 Patent grant
GR01 Patent grant