CN116834670A - Automatic driving and managing system and method for self-driving community - Google Patents
Automatic driving and managing system and method for self-driving community Download PDFInfo
- Publication number
- CN116834670A CN116834670A CN202310782751.2A CN202310782751A CN116834670A CN 116834670 A CN116834670 A CN 116834670A CN 202310782751 A CN202310782751 A CN 202310782751A CN 116834670 A CN116834670 A CN 116834670A
- Authority
- CN
- China
- Prior art keywords
- route
- driving
- place
- central control
- control screen
- 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
- 238000000034 method Methods 0.000 title claims abstract description 39
- 230000005540 biological transmission Effects 0.000 claims abstract description 41
- 239000003550 marker Substances 0.000 claims description 19
- 238000004364 calculation method Methods 0.000 description 5
- 230000009286 beneficial effect Effects 0.000 description 1
- 125000004122 cyclic group Chemical group 0.000 description 1
- 238000010586 diagram Methods 0.000 description 1
- 230000000694 effects Effects 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
- 238000006467 substitution reaction Methods 0.000 description 1
Classifications
-
- B—PERFORMING OPERATIONS; TRANSPORTING
- B60—VEHICLES IN GENERAL
- B60R—VEHICLES, VEHICLE FITTINGS, OR VEHICLE PARTS, NOT OTHERWISE PROVIDED FOR
- B60R11/00—Arrangements for holding or mounting articles, not otherwise provided for
- B60R11/02—Arrangements for holding or mounting articles, not otherwise provided for for radio sets, television sets, telephones, or the like; Arrangement of controls thereof
- B60R11/0229—Arrangements for holding or mounting articles, not otherwise provided for for radio sets, television sets, telephones, or the like; Arrangement of controls thereof for displays, e.g. cathodic tubes
-
- B—PERFORMING OPERATIONS; TRANSPORTING
- B60—VEHICLES IN GENERAL
- B60R—VEHICLES, VEHICLE FITTINGS, OR VEHICLE PARTS, NOT OTHERWISE PROVIDED FOR
- B60R16/00—Electric or fluid circuits specially adapted for vehicles and not otherwise provided for; Arrangement of elements of electric or fluid circuits specially adapted for vehicles and not otherwise provided for
- B60R16/02—Electric or fluid circuits specially adapted for vehicles and not otherwise provided for; Arrangement of elements of electric or fluid circuits specially adapted for vehicles and not otherwise provided for electric constitutive elements
- B60R16/023—Electric or fluid circuits specially adapted for vehicles and not otherwise provided for; Arrangement of elements of electric or fluid circuits specially adapted for vehicles and not otherwise provided for electric constitutive elements for transmission of signals between vehicle parts or subsystems
-
- B—PERFORMING OPERATIONS; TRANSPORTING
- B60—VEHICLES IN GENERAL
- B60W—CONJOINT CONTROL OF VEHICLE SUB-UNITS OF DIFFERENT TYPE OR DIFFERENT FUNCTION; CONTROL SYSTEMS SPECIALLY ADAPTED FOR HYBRID VEHICLES; ROAD VEHICLE DRIVE CONTROL SYSTEMS FOR PURPOSES NOT RELATED TO THE CONTROL OF A PARTICULAR SUB-UNIT
- B60W60/00—Drive control systems specially adapted for autonomous road vehicles
- B60W60/001—Planning or execution of driving tasks
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04M—TELEPHONIC COMMUNICATION
- H04M1/00—Substation equipment, e.g. for use by subscribers
- H04M1/72—Mobile telephones; Cordless telephones, i.e. devices for establishing wireless links to base stations without route selection
- H04M1/724—User interfaces specially adapted for cordless or mobile telephones
- H04M1/72403—User interfaces specially adapted for cordless or mobile telephones with means for local support of applications that increase the functionality
- H04M1/72409—User interfaces specially adapted for cordless or mobile telephones with means for local support of applications that increase the functionality by interfacing with external accessories
- H04M1/724098—Interfacing with an on-board device of a vehicle
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04M—TELEPHONIC COMMUNICATION
- H04M1/00—Substation equipment, e.g. for use by subscribers
- H04M1/72—Mobile telephones; Cordless telephones, i.e. devices for establishing wireless links to base stations without route selection
- H04M1/724—User interfaces specially adapted for cordless or mobile telephones
- H04M1/72403—User interfaces specially adapted for cordless or mobile telephones with means for local support of applications that increase the functionality
- H04M1/72409—User interfaces specially adapted for cordless or mobile telephones with means for local support of applications that increase the functionality by interfacing with external accessories
- H04M1/72412—User interfaces specially adapted for cordless or mobile telephones with means for local support of applications that increase the functionality by interfacing with external accessories using two-way short-range wireless interfaces
-
- B—PERFORMING OPERATIONS; TRANSPORTING
- B60—VEHICLES IN GENERAL
- B60R—VEHICLES, VEHICLE FITTINGS, OR VEHICLE PARTS, NOT OTHERWISE PROVIDED FOR
- B60R11/00—Arrangements for holding or mounting articles, not otherwise provided for
- B60R2011/0001—Arrangements for holding or mounting articles, not otherwise provided for characterised by position
- B60R2011/0003—Arrangements for holding or mounting articles, not otherwise provided for characterised by position inside the vehicle
- B60R2011/0007—Mid-console
-
- B—PERFORMING OPERATIONS; TRANSPORTING
- B60—VEHICLES IN GENERAL
- B60W—CONJOINT CONTROL OF VEHICLE SUB-UNITS OF DIFFERENT TYPE OR DIFFERENT FUNCTION; CONTROL SYSTEMS SPECIALLY ADAPTED FOR HYBRID VEHICLES; ROAD VEHICLE DRIVE CONTROL SYSTEMS FOR PURPOSES NOT RELATED TO THE CONTROL OF A PARTICULAR SUB-UNIT
- B60W2556/00—Input parameters relating to data
- B60W2556/45—External transmission of data to or from the vehicle
Landscapes
- Engineering & Computer Science (AREA)
- Mechanical Engineering (AREA)
- Human Computer Interaction (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Automation & Control Theory (AREA)
- Transportation (AREA)
- Navigation (AREA)
Abstract
The invention provides an automatic driving and managing system and method of a self-driving community, wherein the system comprises a car body, a data display end of a central control screen processor is connected with data of a display screen, a data Bluetooth end of the central control screen processor is connected with a data end of a Bluetooth module, a data transmission end of the central control screen processor is connected with a data end of a data wireless transmission module, and the central control screen processor is connected with a central control screen through a smart phone, so that the car can automatically drive to the destination according to a driving route by locating a departure place and an input destination place through the smart phone. The invention can provide better selection for self-drivers and enhance experience.
Description
Technical Field
The invention relates to the technical field of vehicle driving, in particular to an automatic driving and managing system and method for a self-driving community.
Background
The self-driving tour belongs to a type of self-service tour, and is a new tour form different from the traditional collective tour. The self-driving tour provides flexible space for tourists in the aspects of selecting objects, participating programs, experiencing freedom and the like, has the inherent characteristics of freedom and individuality, flexibility and comfort, selectivity and seasonality and the like, and has the characteristics and charm compared with the traditional ginseng-block mode. The patent application number 2015108246451, named as an intelligent self-driving method, discloses a plurality of smart phones and a server which are connected through a mobile terminal network, wherein the smart phones are matched by users and are provided with a mobile phone App and a GPS positioning module for foreground intelligent self-driving, the server is provided with a module for background intelligent self-driving, a coordinate range for sending prompt information and corresponding prompt information in a route, on one hand, the necessary prompt information is provided for warning the participants of the self-driving tour, on the other hand, the participants of the self-driving tour can know the positions of the self-driving tour, and the unobstructed effect of knowing each other is realized. However, the patent application does not give a better self-driving tour route, which is not beneficial to experience.
Disclosure of Invention
The invention aims at least solving the technical problems in the prior art, and particularly creatively provides a self-driving community automatic driving and management system and method.
In order to achieve the above-mentioned purpose of the invention, the invention provides a self-driving community automatic driving and management system, comprising a car body, wherein a central control screen fixed mounting seat for fixedly mounting a central control screen is arranged in the car body, the central control screen is fixedly mounted on the central control screen fixed mounting seat, the central control screen comprises a shell and a display screen arranged on the shell, a PCB printed circuit board fixed mounting seat for fixedly mounting a PCB printed circuit board is arranged in the shell, the PCB printed circuit board is fixedly mounted on the PCB printed circuit board fixed mounting seat, a central control screen processor, a Bluetooth module and a data wireless transmission module are arranged on the PCB printed circuit board, a data display end of the central control screen processor is connected with data of the display screen, a data Bluetooth end of the central control screen processor is connected with a data end of the Bluetooth module, a data transmission end of the central control screen processor is connected with a data end of the data wireless transmission module through a smart phone, and a departure place and an input destination place positioned through the smart phone are connected with the central control screen, so that the car can automatically drive to the destination place according to a driving route.
In a preferred embodiment of the present invention, the data wireless transmission module includes one or any combination of a 3G data wireless transmission module, a 4G data wireless transmission module, and a 5G data wireless transmission module;
the data transmission 3G end of the central control screen processor is connected with the data end of the 3G data wireless transmission module, the data transmission 4G end of the central control screen processor is connected with the data end of the 4G data wireless transmission module, and the data transmission 5G end of the central control screen processor is connected with the data end of the 5G data wireless transmission module.
The invention also discloses a self-driving community automatic driving and managing method, which comprises the following steps:
s1, a smart phone acquires a departure place and a destination place, and transmits the acquired departure place and destination place to a central control screen;
s2, after the central control screen receives the departure place and the destination place transmitted by the smart phone, the central control screen transmits the received departure place and destination place to the self-driving management platform;
s3, after the self-driving management platform receives the departure place and the destination place transmitted by the central control screen, the self-driving management platform generates a driving route node according to the departure place and the destination place transmitted by the central control screen, and the self-driving management platform transmits the driving route node to the central control screen;
and S4, after the central control screen receives the driving route node transmitted by the self-driving management platform, the central control screen generates a driving route according to the received self-driving route node, and the car automatically drives to a destination point according to the driving route.
In a preferred embodiment of the present invention, in step S1, the method for acquiring a departure place and an end place by a smart phone and transmitting the acquired departure place and end place to a central control screen includes the steps of:
s11, establishing Bluetooth communication between the smart phone and the central control screen, and executing the next step after the smart phone establishes Bluetooth communication with the central control screen;
s12, the smart phone judges whether map software is opened on the smart phone:
if the map software is opened on the smart phone, the smart phone automatically locates the position of the smart phone, and the automatically located position of the smart phone is used as a departure place of the car to execute the next step;
if the map software is not opened on the smart phone, waiting to open the map software on the smart phone, and returning to the step S12;
s13, inputting a destination point on the smart phone, and judging whether the destination point is input by the smart phone:
if the destination point is input, executing the next step;
if the destination point is not input, waiting for inputting the destination point, and executing the next step;
s14, transmitting the destination point and the automatically positioned position input on the smart phone to the central control screen.
In a preferred embodiment of the present invention, in step S3, the method for generating a driving route node by the self-driving management platform according to the departure place and the destination place transmitted by the central control screen includes the following steps:
s31, the self-driving management platform generates a departure place marking code and an end place marking code of the received departure place and end place;
s32, after the departure place marking code and the destination place marking code are generated, determining a selected route according to the departure place marking code and the destination place marking code;
s33, determining driving route nodes according to the selected route, and transmitting the driving route nodes to the central control screen.
In a preferred embodiment of the invention, the method for determining a selected route from the departure point marking code and the destination point marking code in step S32 comprises the following steps:
s321, let cycle number i=1;
s322, judgment ThedeparturepointmarkingNO, destinationMarkerNO and A i Relationship between:
if TheedepaturepointmarkingNO E A i And DestinationMarker NO ε A i Wherein TheedetaturepointmarkingNO represents a departure point marking code, destinationnArkerNO represents an end point marking code, E represents a logical symbol between elements and sets belonging to A i Represents the ith route, A i ∈A={A 1 ,A 2 ,A 3 ,...,A a ' A represents a route set, A 1 Represents route 1, A 2 Represents route 2, A 3 Represents route 3, A a A represents an a-th route, a represents the number of the concentrated routes of the route; a is that j ={A j,1 ,A j,2 ,A j,3 ,...,A j,j′ },A j Represents the jth route, j=1, 2, 3, … …, a j,1 1 st marking code representing the jth route, A j,2 A 2 nd mark code for constituting a j-th route, A j,3 3 rd marking code representing the jth route, A j,j′ A j 'th mark code representing a j' th route, j 'representing the number of mark codes constituting the j' th route; selecting an ith route, taking the selected ith route as a selected route, and executing step S33;
if it isOr->Wherein TheedetaturepointmarkingNO represents a departure place marker code, destinationnArkerNO represents a destination place marker code, +.>Representing that logical symbols between elements and sets do not belong to, A i Represents the ith route, A i ∈A={A 1 ,A 2 ,A 3 ,...,A a ' A represents a route set, A 1 Represents route 1, A 2 Represents route 2, A 3 Represents route 3, A a A represents an a-th route, a represents the number of the concentrated routes of the route; a is that j ={A j,1 ,A j,2 ,A j,3 ,...,A j,j′ },A j Represents the jth route, j=1, 2, 3, … …, a j,1 1 st marking code representing the jth route, A j,2 A 2 nd mark code for constituting a j-th route, A j,3 3 rd marking code representing the jth route, A j,j′ A j 'th mark code representing a j' th route, j 'representing the number of mark codes constituting the j' th route; then the next step is performed;
s323, judging the relation between i and a-1:
if i > a-1, selecting an a-th route, taking the selected a-th route as a selected route, and executing step S33;
if i is equal to or less than a-1, i=i+1, and the process returns to step S322.
In summary, due to the adoption of the technical scheme, the method and the device can provide better choices for self-drivers and enhance experience.
Additional aspects and advantages of the invention will be set forth in part in the description which follows, and in part will be obvious from the description, or may be learned by practice of the invention.
Drawings
The foregoing and/or additional aspects and advantages of the invention will become apparent and may be better understood from the following description of embodiments taken in conjunction with the accompanying drawings in which:
fig. 1 is a schematic block diagram of a flow of the present invention.
Detailed Description
Embodiments of the present invention are described in detail below, examples of which are illustrated in the accompanying drawings, wherein like or similar reference numerals refer to like or similar elements or elements having like or similar functions throughout. The embodiments described below by referring to the drawings are illustrative only and are not to be construed as limiting the invention.
The invention discloses an automatic driving and managing system of a self-driving community, which comprises a car body, wherein a central control screen fixing mounting seat for fixing a central control screen is arranged in the car body, the central control screen is fixedly arranged on the central control screen fixing mounting seat, the central control screen comprises a shell and a display screen arranged on the shell, a PCB printed circuit board fixing mounting seat for fixing a PCB printed circuit board is arranged in the shell, the PCB printed circuit board is fixedly arranged on the PCB printed circuit board fixing mounting seat, a central control screen processor, a Bluetooth module and a data wireless transmission module are arranged on the PCB printed circuit board, a data display end of the central control screen processor is connected with data of the display screen, a data Bluetooth end of the central control screen processor is connected with a data end of the Bluetooth module, and a data transmission end of the central control screen processor is connected with a data end of the data wireless transmission module and is connected with the central control screen through a smart phone, so that a departure place and an input destination place positioned by the smart phone can realize automatic driving to the destination place according to a driving route.
In a preferred embodiment of the present invention, the data wireless transmission module includes one or any combination of a 3G data wireless transmission module, a 4G data wireless transmission module, and a 5G data wireless transmission module;
the data transmission 3G end of the central control screen processor is connected with the data end of the 3G data wireless transmission module, the data transmission 4G end of the central control screen processor is connected with the data end of the 4G data wireless transmission module, and the data transmission 5G end of the central control screen processor is connected with the data end of the 5G data wireless transmission module.
The invention also discloses a self-driving community automatic driving and managing method, as shown in fig. 1, comprising the following steps:
s1, a smart phone acquires a departure place and a destination place, and transmits the acquired departure place and destination place to a central control screen;
s2, after the central control screen receives the departure place and the destination place transmitted by the smart phone, the central control screen transmits the received departure place and destination place to the self-driving management platform;
s3, after the self-driving management platform receives the departure place and the destination place transmitted by the central control screen, the self-driving management platform generates a driving route node according to the departure place and the destination place transmitted by the central control screen, and the self-driving management platform transmits the driving route node to the central control screen;
and S4, after the central control screen receives the driving route node transmitted by the self-driving management platform, the central control screen generates a driving route according to the received self-driving route node, and the car automatically drives to a destination point according to the driving route.
In a preferred embodiment of the present invention, in step S1, the method for acquiring a departure place and an end place by a smart phone and transmitting the acquired departure place and end place to a central control screen includes the steps of:
s11, establishing Bluetooth communication between the smart phone and the central control screen, and executing the next step after the smart phone establishes Bluetooth communication with the central control screen;
s12, the smart phone judges whether map software is opened on the smart phone:
if the map software is opened on the smart phone, the smart phone automatically locates the position of the smart phone, and the automatically located position of the smart phone is used as a departure place of the car to execute the next step;
if the map software is not opened on the smart phone, waiting to open the map software on the smart phone, and returning to the step S12;
s13, inputting a destination point on the smart phone, and judging whether the destination point is input by the smart phone:
if the destination point is input, executing the next step;
if the destination point is not input, waiting for inputting the destination point, and executing the next step;
s14, transmitting the destination point and the automatically positioned position input on the smart phone to the central control screen.
In a preferred embodiment of the present invention, in step S3, the method for generating a driving route node by the self-driving management platform according to the departure place and the destination place transmitted by the central control screen includes the following steps:
s31, the self-driving management platform generates a departure place marking code and an end place marking code of the received departure place and end place;
s32, after the departure place marking code and the destination place marking code are generated, determining a selected route according to the departure place marking code and the destination place marking code;
s33, determining driving route nodes according to the selected route, and transmitting the driving route nodes to the central control screen.
In a preferred embodiment of the invention, the method for determining a selected route from the departure point marking code and the destination point marking code in step S32 comprises the following steps:
s321, let cycle number i=1;
s322, judgment ThedeparturepointmarkingNO, destinationMarkerNO and A i Relationship between:
if TheedepaturepointmarkingNO E A i And DestinationMarker NO ε A i Wherein TheedetaturepointmarkingNO represents a departure point marking code, destinationnArkerNO represents an end point marking code, E represents a logical symbol between elements and sets belonging to A i Represents the ith route, A i ∈A={A 1 ,A 2 ,A 3 ,...,A a ' A represents a route set, A 1 Represents route 1, A 2 Represents route 2, A 3 Represents route 3, A a A represents an a-th route, a represents the number of the concentrated routes of the route; a is that j ={A j,1 ,A j,2 ,A j,3 ,...,A j,j′ },A j Represents the jth route, j=1, 2, 3, … …, a j,1 1 st marking code representing the jth route, A j,2 A 2 nd mark code for constituting a j-th route, A j,3 3 rd marking code representing the jth route, A j,j′ The j 'mark code representing the j route, j' representing the routeThe number of marking codes of j routes; selecting an ith route, taking the selected ith route as a selected route, and executing step S33;
if it isOr->Wherein TheedetaturepointmarkingNO represents a departure place marker code, destinationnArkerNO represents a destination place marker code, +.>Representing that logical symbols between elements and sets do not belong to, A i Represents the ith route, A i ∈A={A 1 ,A 2 ,A 3 ,...,A a ' A represents a route set, A 1 Represents route 1, A 2 Represents route 2, A 3 Represents route 3, A a A represents an a-th route, a represents the number of the concentrated routes of the route; a is that j ={A j,1 ,A j,2 ,A j,3 ,...,A j,j′ },A j Represents the jth route, j=1, 2, 3, … …, a j,1 1 st marking code representing the jth route, A j,2 A 2 nd mark code for constituting a j-th route, A j,3 3 rd marking code representing the jth route, A j,j′ A j 'th mark code representing a j' th route, j 'representing the number of mark codes constituting the j' th route; then the next step is performed;
s323, judging the relation between i and a-1:
if i > a-1, selecting an a-th route, taking the selected a-th route as a selected route, and executing step S33;
if i is equal to or less than a-1, i=i+1, and the process returns to step S322.
In a preferred embodiment of the invention, the method of determining driving route nodes from the selected route in step S33 comprises the steps of:
s331, marking the corresponding start point marking code and end point marking code on the selected route;
s332, selecting a route corresponding to the departure place mark code and the end place mark code on the selected route as a driving route;
s333, corresponding driving route nodes, namely, the 1 st driving route node, the 2 nd driving route node, the 3 rd driving route node, the … … nd driving route node, and the B-th driving route node are sequentially extracted from the driving route, B represents the number of driving route nodes in the driving route, and the driving route nodes sequentially pass through the 1 st driving route node, the 2 nd driving route node, the 3 rd driving route node, the … … nd driving route node, and the B-th driving route node from the departure point to the destination point.
In a preferred embodiment of the present invention, in step S31, the method for generating the departure point marking code includes:
ThedeparturepointmarkingNO=Abstractalgorithm<Startingpointcoordinates>,
TheedepaturepoiintmarkingNO represents a departure location marker code;
abstractalgorithm </SUB > represents a calculation method of a departure place marker code, and MD5 is generally adopted;
startingpointcodedinates represent departure places;
the method for generating the destination point marking code comprises the following steps:
DestinationMarkerNO=Abstractalgorithm′<Coordinatesofdestination>,
the DestinationnMARKNO represents a destination point marking code;
abstractalgorithm' represents a calculation method of a destination point marking code, and MD5 is generally adopted;
coordinatestofdestination indicates the destination.
In a preferred embodiment of the present invention, in step S4, the method for generating a driving route by the central control screen according to the received self-driving route node includes the steps of:
s41, displaying a map on a central control screen;
s42, marking departure places and destination places as well as B driving route nodes on a map, wherein the B driving route nodes are respectively a 1 st driving route node, a 2 nd driving route node, a 3 rd driving route node, … … and a B driving route node;
and S43, route connection is carried out according to the order of the departure place, the 1 st driving route node, the 2 nd driving route node, the 3 rd driving route node, … …, the B-th driving route node and the destination place, and thus a driving route is obtained.
In a preferred embodiment of the present invention, the method further includes step S0, generating a route set on the self-driving management platform, and the method for generating the route set by the self-driving management platform includes the following steps:
s01, acquiring a departure place and a destination place input by a user; generating a departure point platform marking code and a destination point platform marking code for the departure point and the destination point;
s02, judging whether the departure place platform marking code and the destination place platform marking code exist in the platform route set or not:
if the departure place platform marking code and the destination place platform marking code exist in the platform route set, executing the departure place and the destination place input by the next user;
if the departure point platform marking code and the destination point platform marking code do not exist in the platform route set, executing the next step;
s03, searching for a 1 st route node adjacent to a route where a departure point (the departure point is not located at a node) is located, namely a 1 st driving route node 1 and a 1 st driving route node 2, and selecting the 1 st driving route node 1 or the 1 st driving route node 2 as a next departure point;
s04, searching for adjacent 2 nd route nodes on the route of the departure place (here, the departure place is a node, two or more selected routes exist, including three or more selected routes exist in the own case), namely, the 2 nd driving route node 1, the 2 nd driving route node 2, the 2 nd driving route nodes 3, … … and the 2 nd driving route node C 2 ,C 2 Node number indicating the 2 nd route node, and selecting the 2 nd driving route node 1 or the 2 nd driving routeNode 2 or 2 nd driving route node 3 or … … or 2 nd driving route node C 2 As the next departure location;
s05, searching adjacent 3 rd route nodes on the routes of the departure points, namely 3 rd driving route node 1, 3 rd driving route node 2, 3 rd driving route node 3, … … and 3 rd driving route node C 3 ,C 3 Node number indicating 3 rd route node, 3 rd driving route node 1 or 3 rd driving route node 2 or 3 rd driving route node 3 or … … or 3 rd driving route node C is selected 3 As the next departure location;
s06, searching adjacent 4 th route nodes on the route of the departure point, namely 4 th driving route node 1, 4 th driving route node 2, 4 th driving route node 3, … … and 4 th driving route node C 4 ,C 4 Node number indicating the 4 th route node, 4 th driving route node 1 or 4 th driving route node 2 or 4 th driving route node 3 or … … or 4 th driving route node C is selected 4 As the next departure location;
……;
s07, until a destination point is found; after searching the destination point, sequentially connecting the routes of each departure point according to the sequence, connecting the routes of the destination points to obtain a driving route, calculating the point mark codes of all points in the driving route, and putting the calculated points into a route set; the departure location and the destination location input by the next user are executed.
In a preferred embodiment of the present invention, in step S01, the method for generating the departure point platform flag code and the destination point platform flag code for the departure point and the destination point includes:
ThedeparturepointmarkingNO′=Abstractalgorithm″<Startingpointcoordinates′>,
TheedepaturepointmarkingNO' represents a departure location platform marker code;
abstractalgorithm' represents a calculation method of a departure point platform marking code, and MD5 is generally adopted;
startingpointdocuments' represent the departure location entered by the user;
DestinationMarkerNO′=Abstractalgorithm″′<Coordinatesofdestination′>,
the DestinationnMARKNO' represents a terminal place platform marking code;
abstractalgorithm' "represents the calculation method of the terminal point platform marking code, and MD5 is generally adopted;
the Coordinatestofdestination' represents the destination location entered by the user.
In a preferred embodiment of the present invention, in step S02, the method for determining whether the departure point platform marker code and the destination point platform marker code exist in the route set is as follows:
s021, let the number of cyclic platforms i' =1;
s022, judging TheedepitureintmarkingNO ', destinationnMARKNO' and A i Relationship between:
if TheedepaturepointmarkingNO '∈A' i′ And DestinationMarker NO '∈A' i′ Wherein TheedetaturepointmarkingNO ' represents a departure place platform marking code, destinationnMArkerNO ' represents a destination place platform marking code, E represents logical symbol belongings between elements and sets, A ' i′ Represents the ith platform route, A' i′ ∈A′={A′ 1 ,A′ 2 ,A′ 3 ,...,A′ a′ A 'represents a set of platform routes, A' 1 Represents the 1 st platform route, A' 2 Represents the 2 nd platform route, A' 3 Represents the 3 rd platform route, A' a′ A 'represents a platform route, and a' represents the number of the concentrated routes of the platform route; a's' j″ ={A′ j″,1 ,A′ j″,2 ,A′ j″,3 ,...,A′ j″,j″′ },A′ j″ Represents the j "th plateau course, j" =1, 2, 3, … …, a' j″,1 1 st mark code representing the path of the jth platform, A' j″,2 A ' represents the 2 nd marker code constituting the j ' th land route ' j″,3 Representing compositionThe 3 rd mark code of the j 'th platform route, A' j″,j″′ A j '"tag code representing a j'" th plateau route, j '"representing a number of tag codes constituting a j'" th plateau route; the departure point platform marking code and the destination point platform marking code exist in the platform route set;
if it isOr->Wherein, theedepitureintmarkingNO 'represents a departure place platform marking code, destinationnMARKNO' represents the terminal location platform marker code,/for the terminal location platform marker code>Representing that the logical symbol between the element and the set does not belong to A' i′ Represents the ith platform route, A' i′ ∈A′={A′ 1 ,A′ 2 ,A′ 3 ,...,A′ a′ A 'represents a set of platform routes, A' 1 Represents the 1 st platform route, A' 2 Represents the 2 nd platform route, A' 3 Represents the 3 rd platform route, A' a′ A 'represents a platform route, and a' represents the number of the concentrated routes of the platform route; a's' j″ ={A′ j″,1 ,A′ j″,2 ,A′ j″,3 ,…,A′ j″,j″′ },A′ j″ Represents the j "th plateau course, j" =1, 2, 3, … …, a' j″,1 1 st mark code representing the path of the jth platform, A' j″,2 A ' represents the 2 nd marker code constituting the j ' th land route ' j″,3 A ' represents the 3 rd marker code constituting the j ' th land route ' j″,j″′ A j '"tag code representing a j'" th plateau route, j '"representing a number of tag codes constituting a j'" th plateau route; then the next step is performed;
s023, judging the relation between i 'and a':
if i '> a', a '=a' +1, the departure point platform marker code and the destination point platform marker code are not present in the platform route set;
if i '+.a', i '=i' +1, return to step S022.
In a preferred embodiment of the present invention, in step S03, the method for selecting the 1 st driving route node 1 or the 1 st driving route node 2 as the next departure point is:
if it isThen the 1 st driving route node 1 is selected as the next departure location;
wherein, (x) 1,1 ,y 1,1 ,z 1,1 ) A coordinate point indicating the 1 st driving route node 1;
(x 1,2 ,y 1,2 ,z 1,2 ) A coordinate point representing the 1 st driving route node 2;
(x 0 ,y 0 ,z 0 ) A coordinate point indicating a destination point;
if it isThen the 1 st driving route node 2 is selected as the next departure location;
wherein, (x) 1,1 ,y 1,1 ,z 1,1 ) A coordinate point indicating the 1 st driving route node 1;
(x 1,2 ,y 1,2 ,z 1,2 ) A coordinate point representing the 1 st driving route node 2;
(x 0 ,y 0 ,z 0 ) A coordinate point indicating a destination point;
if it isThen either the 1 st driving route node 1 or the 1 st driving route node 2 is selected as the next departure location;
wherein, (x) 1,1 ,y 1,1 ,z 1,1 ) A coordinate point indicating the 1 st driving route node 1;
(x 1,2 ,y 1,2 ,z 1,2 ) A coordinate point representing the 1 st driving route node 2;
(x 0 ,y 0 ,z 0 ) A coordinate point indicating a destination point.
In a preferred embodiment of the invention, in step S04, a 2 nd driving route node 1 or 2 nd driving route node 2 or 2 nd driving route node 3 or … … or 2 nd driving route node C is selected 2 The method of (1) is as follows:
wherein, min { } is the minimum value;
representing departure location to 2 nd driving route node c 2 A front coordinate point; c 2 =1、2、3、……、C 2 ;
(x 0 ,y 0 ,z 0 ) A coordinate point indicating a destination point;
c′ 2 the step (c) is to select the 2 nd driving route node corresponding to the minimum pointed to as the next departure place;
d 2,1 representing the distance from the departure point to the front of the 2 nd driving route node 1;
d 2,2 representing the distance from the departure point to the front of the 2 nd driving route node 2;
d 2,3 representing the distance from the departure point to the front of the 2 nd driving route node 3;
representing departure location to 2 nd driving route node C 2 Front (front)Distance. The starting point in this step is the 1 st driving route node 1 or the 1 st driving route node 2 in step S03, which is derived from step S03.
In a preferred embodiment of the invention, in step S05, a 3 rd driving route node 1 or a 3 rd driving route node 2 or a 3 rd driving route node 3 or … … or a 3 rd driving route node C is selected 3 The method of (1) is as follows:
wherein, min { } is the minimum value;
representing departure point to 3 rd driving route node c 3 A front coordinate point; c 3 =1、2、3、……、C 3 ;
(x 0 ,y 0 ,z 0 ) A coordinate point indicating a destination point;
c′ 3 the step of selecting a 3 rd driving route node corresponding to the minimum point as the next departure point;
d 3,1 representing the distance from the departure point to the front of the 3 rd driving route node 1;
d 3,2 representing the distance from the departure point to the front of the 3 rd driving route node 2;
d 3,3 representing the distance from the departure point to the front of the 3 rd driving route node 3;
representing departure location to 3 rd driving route node C 3 A forward distance. The starting point in this step is the 2 nd driving route node 1 or 2 nd driving route node 2 in step S042 driving route node 3 or … … or 2 nd driving route node C 2 According to step S04.
In a preferred embodiment of the invention, in step S06, a 4 th driving route node 1 or 4 th driving route node 2 or 4 th driving route node 3 or … … or 4 th driving route node C is selected 4 The method of (1) is as follows:
wherein, min { } is the minimum value;
representing departure point to 4 th driving route node c 4 A front coordinate point; c 4 =1、2、3、……、C 4 ;
(x 0 ,y 0 ,z 0 ) A coordinate point indicating a destination point;
c′ 4 the step (c) is to select the 4 th driving route node corresponding to the minimum pointed to as the next departure place;
d 4,1 representing the distance from the departure point to the front of the 4 th driving route node 1;
d 4,2 representing the distance from the departure point to the front of the 4 th driving route node 2;
d 4,3 representing the distance from the departure point to the front of the 4 th driving route node 3;
representing departure location to 4 th driving route node C 4 A forward distance. The starting point in this step is the 3 rd driving route node 1 or 3 rd driving route node 2 or 3 rd driving route node 3 or … … in step S053 rd driving route node C 3 According to step S05.
In a preferred embodiment of the present invention, in step S07, the method of calculating the place-marking codes for all places in the driving route includes the steps of:
s071, let the number η=1;
s072, calculating a place marking code, wherein the place marking code is calculated by the following steps:
ThedeparturepointmarkingNO η =Abstractalgorithm″″<intcoordinates η >,
ThedeparturepointmarkingNO η representing an eta place marker code;
the calculation method of the Abstractalgorithm' represents the location mark code, generally adopts MD5;
intcoordinates η representing an eta point in the driving route;
s073, judging eta andrelationship between:
indicating the number of all places in the driving route, and ending;
if the number of all the points in the driving route is indicated, η=η+1, and the process returns to step S072.
While embodiments of the present invention have been shown and described, it will be understood by those of ordinary skill in the art that: many changes, modifications, substitutions and variations may be made to the embodiments without departing from the spirit and principles of the invention, the scope of which is defined by the claims and their equivalents.
Claims (6)
1. The utility model provides an automatic driving of self-driving community and management system, includes the car body, is provided with the well accuse screen fixed mounting seat that is used for the fixed mounting well accuse screen in the car body, well accuse screen fixed mounting is on well accuse screen fixed mounting seat, well accuse screen includes the casing and sets up display screen on the casing be provided with the PCB printed wiring board fixed mounting seat that is used for the fixed mounting PCB printed wiring board in the casing, PCB printed wiring board fixed mounting is provided with well accuse screen treater, bluetooth module and data wireless transmission module on PCB printed wiring board, the data display end of well accuse screen treater links to each other with the data of display screen, and the data transmission end of well accuse screen treater links to each other with the data end of data wireless transmission module, and its characterized in that, through smart mobile phone and well accuse screen link to each other, will realize driving route automatic to the terminal according to the terminal place of departure and the terminal place of input of driving.
2. The self-driving community automatic driving and management system according to claim 1, wherein the data wireless transmission module comprises one or any combination of a 3G data wireless transmission module, a 4G data wireless transmission module, and a 5G data wireless transmission module;
the data transmission 3G end of the central control screen processor is connected with the data end of the 3G data wireless transmission module, the data transmission 4G end of the central control screen processor is connected with the data end of the 4G data wireless transmission module, and the data transmission 5G end of the central control screen processor is connected with the data end of the 5G data wireless transmission module.
3. The automatic driving and managing method for the self-driving community is characterized by comprising the following steps of:
s1, a smart phone acquires a departure place and a destination place, and transmits the acquired departure place and destination place to a central control screen;
s2, after the central control screen receives the departure place and the destination place transmitted by the smart phone, the central control screen transmits the received departure place and destination place to the self-driving management platform;
s3, after the self-driving management platform receives the departure place and the destination place transmitted by the central control screen, the self-driving management platform generates a driving route node according to the departure place and the destination place transmitted by the central control screen, and the self-driving management platform transmits the driving route node to the central control screen;
and S4, after the central control screen receives the driving route node transmitted by the self-driving management platform, the central control screen generates a driving route according to the received self-driving route node, and the car automatically drives to a destination point according to the driving route.
4. The method for autopilot and management in a self-driving community according to claim 3, wherein in step S1, the smart phone acquires a departure place and a destination place, and the method for transmitting the acquired departure place and destination place to the center control screen comprises the steps of:
s11, establishing Bluetooth communication between the smart phone and the central control screen, and executing the next step after the smart phone establishes Bluetooth communication with the central control screen;
s12, the smart phone judges whether map software is opened on the smart phone:
if the map software is opened on the smart phone, the smart phone automatically locates the position of the smart phone, and the automatically located position of the smart phone is used as a departure place of the car to execute the next step;
if the map software is not opened on the smart phone, waiting to open the map software on the smart phone, and returning to the step S12;
s13, inputting a destination point on the smart phone, and judging whether the destination point is input by the smart phone:
if the destination point is input, executing the next step;
if the destination point is not input, waiting for inputting the destination point, and executing the next step;
s14, transmitting the destination point and the automatically positioned position input on the smart phone to the central control screen.
5. The method for autopilot and management in a self-driving community of claim 3 wherein in step S3, the method for generating a driving route node by the autopilot management platform from the departure location and the destination location transmitted by the central control screen comprises the steps of:
s31, the self-driving management platform generates a departure place marking code and an end place marking code of the received departure place and end place;
s32, after the departure place marking code and the destination place marking code are generated, determining a selected route according to the departure place marking code and the destination place marking code;
s33, determining driving route nodes according to the selected route, and transmitting the driving route nodes to the central control screen.
6. The self-driving community automatic driving and managing method according to claim 3, wherein the method of determining the selected route according to the departure place marking code and the destination place marking code in step S32 comprises the steps of:
s321, let cycle number i=1;
s322, judgment ThedeparturepointmarkingNO, destinationMarkerNO and A i Relationship between:
if TheedepaturepointmarkingNO E A i And DestinationMarker NO ε A i Wherein TheedetaturepointmarkingNO represents a departure point marking code, destinationnArkerNO represents an end point marking code, E represents a logical symbol between elements and sets belonging to A i Represents the ith route, A i ∈A={A 1 ,A 2 ,A 3 ,...,A a ' A represents a route set, A 1 Represents route 1, A 2 Represents route 2, A 3 Represents route 3, A a A represents an a-th route, a represents the number of the concentrated routes of the route; a is that j ={A j,1 ,A j,2 ,A j,3 ,...,A j,j′ },A j Represents the jth route, j=1, 2, 3, … …, a j,1 1 st marking code representing the jth route, A j,2 A 2 nd mark code for constituting a j-th route, A j,3 3 rd marking code representing the jth route, A j,j′ A j 'th mark code representing a j' th route, j 'representing the number of mark codes constituting the j' th route; selecting an ith route, taking the selected ith route as a selected route, and executing step S33;
if it isOr->Wherein TheedetaturepointmarkingNO represents a departure place marker code, destinationnArkerNO represents a destination place marker code, +.>Representing that logical symbols between elements and sets do not belong to, A i Represents the ith route, A i ∈A={A 1 ,A 2 ,A 3 ,...,A a ' A represents a route set, A 1 Represents route 1, A 2 Represents route 2, A 3 Represents route 3, A a A represents an a-th route, a represents the number of the concentrated routes of the route; a is that j ={A j,1 ,A j,2 ,A j,3 ,...,A j,j′ },A j Represents the jth route, j=1, 2, 3, … …, a j,1 1 st marking code representing the jth route, A j,2 A 2 nd mark code for constituting a j-th route, A j,3 3 rd marking code representing the jth route, A j,j′ A j 'th mark code representing a j' th route, j 'representing the number of mark codes constituting the j' th route; then the next step is performed;
s323, judging the relation between i and a-1:
if i > a-1, selecting an a-th route, taking the selected a-th route as a selected route, and executing step S33;
if i is equal to or less than a-1, i=i+1, and the process returns to step S322.
Priority Applications (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CN202310782751.2A CN116834670A (en) | 2023-06-29 | 2023-06-29 | Automatic driving and managing system and method for self-driving community |
Applications Claiming Priority (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CN202310782751.2A CN116834670A (en) | 2023-06-29 | 2023-06-29 | Automatic driving and managing system and method for self-driving community |
Publications (1)
Publication Number | Publication Date |
---|---|
CN116834670A true CN116834670A (en) | 2023-10-03 |
Family
ID=88166358
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
CN202310782751.2A Pending CN116834670A (en) | 2023-06-29 | 2023-06-29 | Automatic driving and managing system and method for self-driving community |
Country Status (1)
Country | Link |
---|---|
CN (1) | CN116834670A (en) |
Citations (5)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN109491380A (en) * | 2018-10-26 | 2019-03-19 | 黄鑫 | A kind of intelligent automobile Unmanned Systems and application method |
CN112966881A (en) * | 2021-04-13 | 2021-06-15 | 王正江 | Outdoor use equipment |
CN214396603U (en) * | 2020-12-15 | 2021-10-15 | 深圳傲途乐电子科技有限公司 | Central control navigator and automobile |
CN115493608A (en) * | 2022-09-21 | 2022-12-20 | 重庆三三电器股份有限公司 | Method for realizing big data driving by using mobile intelligent handheld terminal |
CN115523928A (en) * | 2022-09-21 | 2022-12-27 | 重庆三三电器股份有限公司 | Working method based on big data safe trip |
-
2023
- 2023-06-29 CN CN202310782751.2A patent/CN116834670A/en active Pending
Patent Citations (5)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN109491380A (en) * | 2018-10-26 | 2019-03-19 | 黄鑫 | A kind of intelligent automobile Unmanned Systems and application method |
CN214396603U (en) * | 2020-12-15 | 2021-10-15 | 深圳傲途乐电子科技有限公司 | Central control navigator and automobile |
CN112966881A (en) * | 2021-04-13 | 2021-06-15 | 王正江 | Outdoor use equipment |
CN115493608A (en) * | 2022-09-21 | 2022-12-20 | 重庆三三电器股份有限公司 | Method for realizing big data driving by using mobile intelligent handheld terminal |
CN115523928A (en) * | 2022-09-21 | 2022-12-27 | 重庆三三电器股份有限公司 | Working method based on big data safe trip |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
KR101983082B1 (en) | Personal Information Appratus and System for Sharing Map-Based User Creating Contents for SNS and Operating Method for the Same | |
CN106895839A (en) | A kind of indoor positioning air navigation aid based on scanning identification code | |
WO2011034454A1 (en) | Range-centric contextual information systems and methods | |
CN110444133A (en) | A kind of method and apparatus of tourist attraction intelligent guide | |
CN105300398B (en) | The methods, devices and systems of gain location information | |
CN110308468A (en) | Location recommendation method and device | |
JP4801657B2 (en) | Advertisement map display system and server | |
CN112839305B (en) | Cluster management method, terminal, server and computer readable storage medium | |
CN106658415A (en) | Method for seeking shared vehicle in realistic view, vehicle-booking and system | |
CN107102833A (en) | Line information interactive approach and electronic equipment | |
CN107270907B (en) | Tourist attraction information sharing method, route planning method and information sharing system | |
CN107705576A (en) | Vehicle fake-license detection method, server and storage medium | |
CN107657823A (en) | For the upcoming method and apparatus for turning to identification and auxiliary | |
CN106131798A (en) | Rescue mode based on unmanned plane and device | |
CN106850921A (en) | For specific user determines telephone number priority list | |
CN101639360A (en) | Navigation platform and navigation system | |
CN101087227A (en) | Wireless short distance friends making agency system | |
CN107454145A (en) | Road doorplate urban information guide system and method based on Quick Response Code | |
CN116834670A (en) | Automatic driving and managing system and method for self-driving community | |
US10068299B1 (en) | System for providing tourist tracking on a mobile device | |
CN108900973A (en) | A kind of vehicle positioning method, device, system, terminal and readable medium | |
CN104160675A (en) | Method of filtering applications | |
JP4637133B2 (en) | Guidance system, guidance server device, guidance method and program implementing the method | |
CN111221928B (en) | Thematic map display method and vehicle-mounted terminal | |
JP4805126B2 (en) | Mobility support navigation system for fixed terminals |
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 |