CN111859037A - Driving intention identification method and device, electronic equipment and storage medium - Google Patents

Driving intention identification method and device, electronic equipment and storage medium Download PDF

Info

Publication number
CN111859037A
CN111859037A CN202010494559.XA CN202010494559A CN111859037A CN 111859037 A CN111859037 A CN 111859037A CN 202010494559 A CN202010494559 A CN 202010494559A CN 111859037 A CN111859037 A CN 111859037A
Authority
CN
China
Prior art keywords
character string
sign bit
sign
matching degree
bits
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
CN202010494559.XA
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.)
Apollo Zhilian Beijing Technology Co Ltd
Original Assignee
Beijing Baidu Netcom Science and Technology 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 Beijing Baidu Netcom Science and Technology Co Ltd filed Critical Beijing Baidu Netcom Science and Technology Co Ltd
Priority to CN202010494559.XA priority Critical patent/CN111859037A/en
Publication of CN111859037A publication Critical patent/CN111859037A/en
Pending legal-status Critical Current

Links

Images

Classifications

    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F16/00Information retrieval; Database structures therefor; File system structures therefor
    • G06F16/90Details of database functions independent of the retrieved data types
    • G06F16/903Querying
    • G06F16/90335Query processing
    • G06F16/90344Query processing by using string matching techniques

Abstract

The application discloses driving intention identification method, device, electronic equipment and storage medium, and relates to the field of internet of vehicles, wherein the method comprises the following steps: acquiring original parameters reported by a vehicle; converting the obtained original parameters into a first character string consisting of 0 and 1; aiming at any candidate driving intention, determining the matching degree score of the candidate driving intention according to a second character string and a first character string which are used for representing the candidate driving intention, wherein the second character string is composed of 0 and/or 1; and sequencing the candidate driving intentions according to the sequence of the matching degree score from high to low, taking the candidate driving intentions at the front N positions after sequencing as the identified driving intentions, wherein N is a positive integer. By applying the scheme, the intention of the driving user is identified, and the identification efficiency and the like can be improved.

Description

Driving intention identification method and device, electronic equipment and storage medium
Technical Field
The application relates to a computer application technology, in particular to a driving intention identification method, a driving intention identification device, electronic equipment and a storage medium in the field of Internet of vehicles.
Background
Driving Intention Recognition (Traffic intent Recognition), also referred to as driver driving Intention Recognition, refers to acquiring data inside and outside a vehicle by maximally utilizing software and hardware devices in the vehicle during the driving or getting on the vehicle, performing conditional operation based on acquired original parameters, recognizing a driving Intention, displaying marketing content according to the recognized driving Intention, and the like, such as pushing content of entertainment, advertisements and the like for the driver. However, the conditional operation involves a large amount of logic judgment, and is complex to implement and low in recognition efficiency.
Disclosure of Invention
In view of the above, the present application provides a driving intention identification method, an apparatus, an electronic device and a storage medium.
A driving intention recognition method includes:
acquiring original parameters reported by a vehicle;
converting the original parameters into a first character string consisting of 0 and 1;
aiming at any candidate driving intention, determining a matching degree score of the candidate driving intention according to a second character string and the first character string which are used for representing the candidate driving intention, wherein the second character string is composed of 0 and/or 1;
and sequencing the candidate driving intentions according to the sequence of the matching degree score from high to low, and taking the candidate driving intentions at the front N positions after sequencing as the identified driving intentions, wherein N is a positive integer.
A driving intention recognition device comprising: the system comprises an acquisition module, a conversion module, a grading module and an identification module;
the acquisition module is used for acquiring original parameters reported by the vehicles;
the conversion module is used for converting the original parameters into a first character string consisting of 0 and 1;
the scoring module is used for determining the matching degree score of the candidate driving intention according to a second character string and the first character string which are used for representing the candidate driving intention aiming at any candidate driving intention, wherein the second character string is composed of 0 and/or 1;
The identification module is used for sequencing the candidate driving intentions according to the sequence of the matching degree scores from high to low, and taking the candidate driving intentions at the front N positions after sequencing as the identified driving intentions, wherein N is a positive integer.
An electronic device, comprising:
at least one processor; and
a memory communicatively coupled to the at least one processor; wherein the content of the first and second substances,
the memory stores instructions executable by the at least one processor to enable the at least one processor to perform a method as described above.
A non-transitory computer readable storage medium having stored thereon computer instructions for causing the computer to perform the method as described above.
One embodiment in the above application can improve the identification efficiency of driving intention.
Drawings
The drawings are included to provide a better understanding of the present solution and are not intended to limit the present application. Wherein:
FIG. 1 is a flowchart illustrating a driving intent recognition method according to an embodiment of the present application;
FIG. 2 is a schematic diagram of an overall implementation process of the driving intention identification method according to the present application;
fig. 3 is a schematic structural diagram of an embodiment of a driving intention recognition device 30 according to the present application;
Fig. 4 is a block diagram of an electronic device according to the method of an embodiment of the present application.
Detailed Description
The following description of the exemplary embodiments of the present application, taken in conjunction with the accompanying drawings, includes various details of the embodiments of the application for the understanding of the same, which are to be considered exemplary only. Accordingly, those of ordinary skill in the art will recognize that various changes and modifications of the embodiments described herein can be made without departing from the scope and spirit of the present application. Also, descriptions of well-known functions and constructions are omitted in the following description for clarity and conciseness.
In addition, it should be understood that the term "and/or" herein is merely one type of association relationship that describes an associated object, meaning that three relationships may exist, e.g., a and/or B may mean: a exists alone, A and B exist simultaneously, and B exists alone. In addition, the character "/" herein generally indicates that the former and latter related objects are in an "or" relationship.
Fig. 1 is a flowchart of an embodiment of a driving intention identification method according to the present application. As shown in fig. 1, the following detailed implementation is included.
In 101, original parameters reported by a vehicle are obtained.
In 102, the obtained original parameters are converted into a first character string consisting of 0 and 1.
In 103, for any candidate driving intention, a matching degree score of the candidate driving intention is determined according to a second character string and a first character string which are used for representing the candidate driving intention, wherein the second character string is composed of 0 and/or 1.
And 104, sequencing the candidate driving intentions according to the sequence of the matching degree score from high to low, taking the candidate driving intentions at the front N positions after sequencing as the identified driving intentions, wherein N is a positive integer.
Preferably, the execution subject in the embodiment of the present application may be a cloud server.
According to the existing mode, a driver can maximally utilize software and hardware equipment in a vehicle to acquire data inside and outside the vehicle in the process of getting on or driving the vehicle, and the original parameters are obtained. The original parameters may include various parameters, such as time parameters, weather parameters, vehicle driving start points, destinations, and the like.
After the cloud server obtains the original parameters reported by the vehicle, the cloud server can firstly perform parameter scattering operation on the original parameters, namely, the original parameters are converted/disassembled into a logic parameter set suitable for logic operation through a cloud scattering service. The reported original parameters usually include various types of parameters, such as enumerated parameters, numerical parameters, boolean parameters, and the like.
Preferably, for any one of the original parameters, the parameter may be converted into a third string with a predetermined number of bits, each sign bit in the third string corresponds to an event with a different meaning, each sign bit in the third string takes a value of 0 or 1, which indicates that the corresponding event is negative or positive, and then the third strings corresponding to the various parameters may be spliced in a predetermined order, so as to obtain the first string.
The number of bits of the corresponding third string may be the same or different for different parameters. For example, for the parameter time, the bit number of the corresponding third string may be 24 bits, whether the event corresponding to the first sign bit is 1 point, whether the event corresponding to the second sign bit is 2 points, whether the event corresponding to the third sign bit is 3 points, and so on. For the parameter of the destination, the number of bits of the corresponding third string may be 6 bits, the event corresponding to the first sign bit is whether the destination is a company, the event corresponding to the second sign bit is whether the destination is a school, etc.
The number of bits of the third string corresponding to any parameter can be determined according to actual needs. For example, for the parameter of time, the number of bits of the corresponding third string may be 24 bits as described above, or may be 2 bits, and the corresponding events are whether the event is morning or afternoon, respectively.
Each sign bit takes a value of 0 or 1 to indicate that the corresponding event is negative or positive. For example, the time parameter reported by the vehicle is originally a specific timestamp numerical value type, the display time is 9 points, and if the bit number of the corresponding third string is 24 bits, the sign bit corresponding to "whether the third string is 9 points" may be set to 1, and the other sign bits may be set to 0.
For each parameter in the original parameters, after the corresponding third character strings are obtained respectively, the third character strings corresponding to each parameter can be spliced according to a predetermined sequence, so as to obtain the first character string, wherein the predetermined sequence can be determined according to actual needs. Assuming that the original parameters collectively include 5 parameters, and the digits of the third string corresponding to the 5 parameters are 24, 4, 8, and 2, respectively, the digits of the first string obtained after splicing may be: 24+4+8+8+ 2-46.
The driving intention is the purpose of the driver in the driving. The specific driving intentions can be determined according to actual needs and can be preset, and each preset driving intention can be used as a candidate driving intention.
Each driving intention can be represented by one character string, that is, the second character string described above, and the second character string is composed of 0 and/or 1, that is, the second character string may contain only 0, only 1, and both 0 and 1, that is, a free combination of 0 and 1 may be used to represent different driving intentions.
Similarly, each sign bit in the second string corresponds to an event with a different meaning, and each sign bit in the second string takes a value of 0 or 1, respectively, to indicate that the corresponding event is negative or positive.
For example, the second character string 1101 indicates a driving intention of "the current driver is sending a child to go to school", and the events corresponding to the sign bits are, in order from left to right: whether children and children carry schoolbag or not in the car, whether holidays are present or not and whether destinations are schools or not, the value of each sign bit respectively represents: children and children in the vehicle carry schoolbag, are not holidays today and are school in destination, and the conclusion that the current driver is sending the children to go to school can be obtained only by carrying out logic rule operation according to the 0 and 1 values of the logic parameters.
It can be seen that in the present embodiment, the original parameter and the driving intention can be represented by a character string composed of 0 and/or 1, respectively, each sign bit corresponds to an event with different meaning, and 0 or 1 represents that the corresponding event is negative or positive, respectively, the expression mode is simple, clear and accurate, and provides a good basis for subsequent processing.
The second string may be generated based on a configuration made by the user on the predetermined interface, which may include: the method comprises the steps of selecting events, the sequence of the selected events and the type corresponding to the selected events, wherein the type is negative or positive.
Each event can be displayed on the predetermined interface for the user to check, for example, if the bit number of the first character string is 46 bits, the number of events that can be checked can also be 46, and the events (including the sequence and the like) corresponding to each sign bit in the first character string are consistent. Taking the driving intention that a driver is sending a child to go to school at present as an example, a user can sequentially select events such as 'whether a child is in a vehicle', 'whether the child carries a schoolbag', 'whether a holiday today' and 'whether a destination is a school', and the types corresponding to the events are respectively: positive, negative, and positive, and accordingly, the second character string 1101 corresponding to the driving intention can be generated.
Through the interface, a user can conveniently configure, update and maintain the driving intention, and the like, and the user does not have professional technical requirements, so that the realization threshold is reduced, the update and maintenance efficiency is improved, and the like.
As described above, each driving intention can be regarded as a candidate driving intention. And for each candidate driving intention, determining the matching degree score of the candidate driving intention according to the second character string and the first character string which are used for expressing the candidate driving intention.
Preferably, for each sign bit in the second character string, values corresponding to the sign bit are extracted from the first character string, the corresponding sign bits represent that corresponding events are the same, the extracted values are spliced according to the sequence of the events corresponding to the sign bits in the second character string to obtain a fourth character string, and then the second character string and the fourth character string are compared, and a matching degree score is determined according to a comparison result.
Assuming that the candidate driving intention is "the current driver is sending the child to go to school", for each sign bit in the second string 1101, the value of the corresponding sign bit may be extracted from the first string. For example, if the event corresponding to the first 1 in the second character string 1101 is "whether there is a child in the car", the value of the sign bit in the first character string corresponding to the event "whether there is a child in the car" may be extracted, and assuming that 1, other values may be extracted in the same manner. Assuming that the fourth character string obtained by splicing the extracted 4 values is 1111, the second character string 1101 may be compared with the fourth character string 1111, and the matching degree score of the candidate driving intention that the current driver is sending a child to go to school is determined according to the comparison result.
When the second character string is compared with the fourth character string, and the matching degree score is determined according to the comparison result, whether the value of the sign bit is the same as the value of the corresponding sign bit in the fourth character string can be determined for each sign bit in the second character string, if so, a first weight can be given to the sign bit, otherwise, a second weight can be given to the sign bit, and the first weight is larger than the second weight, so that the weights of the sign bits in the second character string can be synthesized to determine the matching degree score.
For example, when comparing the second string 1101 with the fourth string 1111, it is found that the values of the other sign bits in the two strings are the same except for the third sign bit, and then a first weight may be assigned to the first sign bit, the second sign bit, and the fourth sign bit in the second string, and a second weight may be assigned to the third sign bit, where the first weight is greater than the second weight.
In practical applications, the first weights corresponding to different sign bits may be the same, and the second weights corresponding to different sign bits may also be the same. For example, the first weights corresponding to different symbols are all 100, and the second weights corresponding to different symbols are all 0, then for the second character string 1101, the weights corresponding to the sign bits therein will be: 100. 100, 0 and 100.
Or the first weights corresponding to different sign bits may be the same, and the corresponding second weights are respectively assigned to different sign bits according to the importance levels of the different sign bits, where the higher the importance level is, the lower the corresponding second weight is. Assuming that the second string is 1101 and the fourth string is 1110, for the second string 1101, the weights corresponding to the sign bits therein may be: 100. 100, 50 and 0, wherein the third sign bit and the fourth sign bit are both given a second weight, but the corresponding second weights are different, and assuming that the importance level of the third sign bit is lower than that of the fourth sign bit, the second weight (50) corresponding to the third sign bit may be greater than the second weight (0) corresponding to the fourth sign bit, that is, it is considered that the importance level of "whether the destination is school" is higher than that of "whether the destination is holiday today" for the conclusion that "the current driver is sending a child to learn", the higher the importance level is, the lower the value of the corresponding second weight is, and thus the matching degree score is lower.
The specific values of the first weight and the second weight can be determined according to actual needs.
After the weights of the sign bits in the second character string are obtained respectively, the weights of the sign bits can be further integrated to calculate a matching degree score. The specific calculation method is not limited, and can be determined according to the actual needs. For example, the weights of the sign bits may be added, and the sum divided by the number of sign bits, and the resulting quotient may be scored as the desired degree of match. The obtained score is used for measuring the matching degree between the driving intention of the current driver and the candidate driving intention.
In the above method for determining the matching degree score, weights can be respectively given to different sign bits according to the comparison result, the importance level and the like, and the matching degree score can be determined by integrating the weights of the sign bits, so that the accuracy of the obtained result is improved.
After the matching degree score of each candidate driving intention is obtained, the candidate driving intentions can be ranked according to the sequence of the matching degree score from high to low, the candidate driving intention at the front N positions after ranking is used as the identified driving intention, and N is a positive integer.
The value of N is usually 1, that is, the candidate driving intention with the highest matching degree score can be used as the identified driving intention, and of course, if necessary, the value of N may also be greater than 1, for example, the candidate driving intention at the first two positions after the ranking is used as the identified driving intention.
How to perform subsequent processing on the identified driving intention is the prior art.
Based on the above description, fig. 2 is a schematic diagram of an overall implementation process of the driving intention identification method according to the present application. As shown in fig. 2, as a possible implementation manner, a user may configure, update, maintain, and the like driving intentions based on a Customer Relationship Management (CRM) platform, where a cloud server may obtain original parameters reported by a vehicle, such as a vehicle client, and obtain a first character string after scattering the parameters, and may determine matching degree scores of the candidate driving intentions based on second character strings corresponding to the candidate driving intentions, respectively, and then may select a candidate driving intention with a highest matching degree score as the identified driving intention, where specific implementation please refer to the foregoing related description, and no further details are repeated.
It should be noted that the foregoing method embodiments are described as a series of acts or combinations for simplicity in explanation, but it should be understood by those skilled in the art that the present application is not limited by the order of acts described, as some steps may occur in other orders or concurrently depending on the application. Further, those skilled in the art should also appreciate that the embodiments described in the specification are preferred embodiments and that the acts and modules referred to are not necessarily required in this application.
In a word, by adopting the scheme of the embodiment of the application method, the matching degree score can be determined through comparison of the character strings, the trip car intention can be identified based on the matching degree score, and complex logic judgment is not needed, so that the implementation complexity is reduced, the identification efficiency is improved, and the like; the original parameters and the driving intention can be represented by character strings consisting of 0 and/or 1 respectively, each sign bit corresponds to an event with different meanings respectively, the corresponding event can be represented as negative or positive by 0 or 1 respectively, the expression mode is simple, clear and accurate, and a good basis is provided for subsequent processing; through the related interface, the user can conveniently configure, update and maintain the driving intention, and the like, so that the user does not have professional technical requirements, the realization threshold is reduced, the update and maintenance efficiency is improved, and the like; when the matching degree score is determined, weights can be respectively given to different sign bits according to the comparison result, the importance level and the like, and the matching degree score can be determined by combining the weights of the sign bits, so that the accuracy of the obtained result is improved; the driving intention identification mode can be applied to interaction between all networked vehicles and drivers, is not limited by a specific vehicle carrying system and the like, and has wide applicability as long as the vehicles have the networking capability of interacting with the cloud server.
The above is a description of method embodiments, and the embodiments of the present application are further described below by way of apparatus embodiments.
Fig. 3 is a schematic structural diagram of a driving intention recognition device 30 according to an embodiment of the present application. As shown in fig. 3, includes: an acquisition module 31, a conversion module 32, a scoring module 33, and an identification module 34.
The obtaining module 31 is configured to obtain an original parameter reported by a vehicle.
A conversion module 32, configured to convert the original parameter into a first character string composed of 0 and 1.
And the scoring module 33 is configured to determine, for any candidate driving intention, a matching degree score of the candidate driving intention according to a second character string and a first character string, which are used for representing the candidate driving intention, where the second character string is composed of 0 and/or 1.
The identification module 34 is configured to rank the candidate driving intentions according to the order of the matching degree score from high to low, and use the top N candidate driving intentions after ranking as the identified driving intentions, where N is a positive integer.
According to the existing mode, a driver can maximally utilize software and hardware equipment in a vehicle to acquire data inside and outside the vehicle in the process of getting on or driving the vehicle, and the original parameters are obtained. The original parameters may include various parameters, such as time parameters, weather parameters, vehicle driving start points, destinations, and the like.
For the original parameters reported by the vehicle, which are acquired by the acquisition module 31, the conversion module 32 may perform a parameter breaking operation on the original parameters, that is, convert the original parameters into a first character string consisting of 0 and 1.
As shown in fig. 3, the conversion module 32 may specifically include: a conversion unit 321 and a splicing unit 322. The converting unit 321 may convert any one of the original parameters into a third string with a predetermined number of bits, where each sign bit in the third string corresponds to an event with a different meaning, and each sign bit in the third string takes a value of 0 or 1, respectively, to indicate that the corresponding event is negative or positive. The splicing unit 322 may splice the third character strings corresponding to the various parameters according to a predetermined sequence, so as to obtain the first character string.
Similarly, each sign bit in the second string corresponds to an event with a different meaning, and each sign bit in the second string takes a value of 0 or 1, respectively, to indicate that the corresponding event is negative or positive.
Additionally, the second string may be generated based on a configuration made by the user on the predetermined interface, which may include: the method comprises the steps of selecting events, the sequence of the selected events and the type corresponding to the selected events, wherein the type is negative or positive.
For any candidate driving intention, the scoring module 33 may determine the matching degree score of the candidate driving intention according to the second character string and the first character string used for representing the candidate driving intention.
As shown in fig. 3, the scoring module 33 may specifically include: an extraction unit 331 and a comparison unit 332. The extracting unit 331 may extract, for each sign bit in the second string, a value corresponding to the sign bit from the first string, where the corresponding sign bit indicates that the corresponding events are the same, and concatenate the extracted values according to the sequence of the events corresponding to the sign bits in the second string, to obtain a fourth string. The comparing unit 332 may compare the second character string with the fourth character string, and determine a matching degree score according to the comparison result.
Specifically, the comparing unit 332 may respectively determine, for each sign bit in the second string, whether a value of the sign bit is the same as a value of a corresponding sign bit in the fourth string, if so, assign a first weight to the sign bit, otherwise, assign a second weight to the sign bit, where the first weight is greater than the second weight, and may combine weights of the sign bits in the second string to determine a matching degree score.
The first weights corresponding to different sign bits are the same, and the second weights corresponding to different sign bits are the same, or the first weights corresponding to different sign bits are the same, and the corresponding second weights are respectively given to different sign bits according to the importance levels of the different sign bits, wherein the higher the importance level is, the lower the corresponding second weight is.
Finally, the recognition module 34 may rank the candidate driving intentions according to the order of the matching degree score from high to low, and the top N candidate driving intentions after ranking are used as the recognized driving intentions, where the value of N is usually 1.
For a specific work flow of the apparatus embodiment shown in fig. 3, reference is made to the related description in the foregoing method embodiment, and details are not repeated.
In a word, by adopting the scheme of the embodiment of the application device, the matching degree score can be determined through comparison of the character strings, the trip car intention can be identified based on the matching degree score, and complex logic judgment is not needed, so that the implementation complexity is reduced, the identification efficiency is improved, and the like; the original parameters and the driving intention can be represented by character strings consisting of 0 and/or 1 respectively, each sign bit corresponds to an event with different meanings respectively, the corresponding event can be represented as negative or positive by 0 or 1 respectively, the expression mode is simple, clear and accurate, and a good basis is provided for subsequent processing; through the related interface, the user can conveniently configure, update and maintain the driving intention, and the like, so that the user does not have professional technical requirements, the realization threshold is reduced, the update and maintenance efficiency is improved, and the like; when the matching degree score is determined, weights can be respectively given to different sign bits according to the comparison result, the importance level and the like, and the matching degree score can be determined by combining the weights of the sign bits, so that the accuracy of the obtained result is improved; the driving intention identification mode can be applied to interaction between all networked vehicles and drivers, is not limited by a specific vehicle carrying system and the like, and has wide applicability as long as the vehicles have the networking capability of interacting with the cloud server.
According to an embodiment of the present application, an electronic device and a readable storage medium are also provided.
Fig. 4 is a block diagram of an electronic device according to the method of the embodiment of the present application. Electronic devices are intended to represent various forms of digital computers, such as laptops, desktops, workstations, personal digital assistants, servers, blade servers, mainframes, and other appropriate computers. The electronic device may also represent various forms of mobile devices, such as personal digital processing, cellular phones, smart phones, wearable devices, and other similar computing devices. The components shown herein, their connections and relationships, and their functions, are meant to be examples only, and are not meant to limit implementations of the present application that are described and/or claimed herein.
As shown in fig. 4, the electronic apparatus includes: one or more processors Y01, a memory Y02, and interfaces for connecting the various components, including a high speed interface and a low speed interface. The various components are interconnected using different buses and may be mounted on a common motherboard or in other manners as desired. The processor may process instructions for execution within the electronic device, including instructions stored in or on the memory to display graphical information for a graphical user interface on an external input/output device (such as a display device coupled to the interface). In other embodiments, multiple processors and/or multiple buses may be used, along with multiple memories and multiple memories, as desired. Also, multiple electronic devices may be connected, with each device providing portions of the necessary operations (e.g., as a server array, a group of blade servers, or a multi-processor system). In fig. 4, one processor Y01 is taken as an example.
Memory Y02 is a non-transitory computer readable storage medium as provided herein. Wherein the memory stores instructions executable by at least one processor to cause the at least one processor to perform the methods provided herein. The non-transitory computer readable storage medium of the present application stores computer instructions for causing a computer to perform the methods provided herein.
Memory Y02 is provided as a non-transitory computer readable storage medium that can be used to store non-transitory software programs, non-transitory computer executable programs, and modules, such as program instructions/modules corresponding to the methods of the embodiments of the present application. The processor Y01 executes various functional applications of the server and data processing, i.e., implements the method in the above-described method embodiments, by executing non-transitory software programs, instructions, and modules stored in the memory Y02.
The memory Y02 may include a storage program area and a storage data area, wherein the storage program area may store an operating system, an application program required for at least one function; the storage data area may store data created according to use of the electronic device, and the like. Additionally, the memory Y02 may include high speed random access memory, and may also include non-transitory memory, such as at least one magnetic disk storage device, flash memory device, or other non-transitory solid state storage device. In some embodiments, memory Y02 may optionally include memory located remotely from processor Y01, which may be connected to the electronic device via a network. Examples of such networks include, but are not limited to, the internet, intranets, blockchain networks, local area networks, mobile communication networks, and combinations thereof.
The electronic device may further include: an input device Y03 and an output device Y04. The processor Y01, the memory Y02, the input device Y03 and the output device Y04 may be connected by a bus or other means, and the bus connection is exemplified in fig. 4.
The input device Y03 may receive input numeric or character information and generate key signal inputs related to user settings and function control of the electronic device, such as a touch screen, keypad, mouse, track pad, touch pad, pointer, one or more mouse buttons, track ball, joystick, or other input device. The output device Y04 may include a display device, an auxiliary lighting device, a tactile feedback device (e.g., a vibration motor), and the like. The display device may include, but is not limited to, a liquid crystal display, a light emitting diode display, and a plasma display. In some implementations, the display device can be a touch screen.
Various implementations of the systems and techniques described here can be realized in digital electronic circuitry, integrated circuitry, application specific integrated circuits, computer hardware, firmware, software, and/or combinations thereof. These various embodiments may include: implemented in one or more computer programs that are executable and/or interpretable on a programmable system including at least one programmable processor, which may be special or general purpose, receiving data and instructions from, and transmitting data and instructions to, a storage system, at least one input device, and at least one output device.
These computer programs (also known as programs, software applications, or code) include machine instructions for a programmable processor, and may be implemented using high-level procedural and/or object-oriented programming languages, and/or assembly/machine languages. As used herein, the terms "machine-readable medium" and "computer-readable medium" refer to any computer program product, apparatus, and/or device (e.g., magnetic discs, optical disks, memory, programmable logic devices) used to provide machine instructions and/or data to a programmable processor, including a machine-readable medium that receives machine instructions as a machine-readable signal. The term "machine-readable signal" refers to any signal used to provide machine instructions and/or data to a programmable processor.
To provide for interaction with a user, the systems and techniques described here can be implemented on a computer having: a display device (e.g., a cathode ray tube or a liquid crystal display monitor) for displaying information to a user; and a keyboard and a pointing device (e.g., a mouse or a trackball) by which a user can provide input to the computer. Other kinds of devices may also be used to provide for interaction with a user; for example, feedback provided to the user can be any form of sensory feedback (e.g., visual feedback, auditory feedback, or tactile feedback); and input from the user may be received in any form, including acoustic, speech, or tactile input.
The systems and techniques described here can be implemented in a computing system that includes a back-end component (e.g., as a data server), or that includes a middleware component (e.g., an application server), or that includes a front-end component (e.g., a user computer having a graphical user interface or a web browser through which a user can interact with an implementation of the systems and techniques described here), or any combination of such back-end, middleware, or front-end components. The components of the system can be interconnected by any form or medium of digital data communication (e.g., a communication network). Examples of communication networks include: local area networks, wide area networks, blockchain networks, and the internet.
The computer system may include clients and servers. A client and server are generally remote from each other and typically interact through a communication network. The relationship of client and server arises by virtue of computer programs running on the respective computers and having a client-server relationship to each other.
It should be understood that various forms of the flows shown above may be used, with steps reordered, added, or deleted. For example, the steps described in the present application may be executed in parallel, sequentially, or in different orders, as long as the desired results of the technical solutions disclosed in the present application can be achieved, and the present invention is not limited herein.
The above-described embodiments should not be construed as limiting the scope of the present application. It should be understood by those skilled in the art that various modifications, combinations, sub-combinations and substitutions may be made in accordance with design requirements and other factors. Any modification, equivalent replacement, and improvement made within the spirit and principle of the present application shall be included in the protection scope of the present application.

Claims (14)

1. A driving intention recognition method is characterized by comprising the following steps:
acquiring original parameters reported by a vehicle;
converting the original parameters into a first character string consisting of 0 and 1;
aiming at any candidate driving intention, determining a matching degree score of the candidate driving intention according to a second character string and the first character string which are used for representing the candidate driving intention, wherein the second character string is composed of 0 and/or 1;
and sequencing the candidate driving intentions according to the sequence of the matching degree score from high to low, and taking the candidate driving intentions at the front N positions after sequencing as the identified driving intentions, wherein N is a positive integer.
2. The method of claim 1,
the converting the original parameters into a first character string consisting of 0 and 1 comprises:
For any one of the original parameters, respectively converting the parameter into a third character string with a predetermined number of bits, wherein each sign bit in the third character string corresponds to an event with different meanings, and each sign bit in the third character string takes a value of 0 or 1 respectively to indicate that the corresponding event is negative or positive;
and splicing the third character strings corresponding to various parameters according to a preset sequence to obtain the first character string.
3. The method of claim 2,
each sign bit in the second character string corresponds to an event with different meanings, and each sign bit in the second character string takes a value of 0 or 1 respectively to indicate that the corresponding event is negative or positive;
the second character string is generated based on a configuration made by a user on a predetermined interface, the configuration including: the method comprises the steps of selecting events, the sequence of the selected events and the type corresponding to the selected events, wherein the type is negative or positive.
4. The method of claim 3,
the determining the matching degree score of the candidate driving intention comprises:
extracting values of corresponding sign bits from the first character string aiming at each sign bit in the second character string, wherein the corresponding sign bits represent that corresponding events are the same, and splicing the extracted values according to the sequence of the events corresponding to the sign bits in the second character string to obtain a fourth character string;
And comparing the second character string with the fourth character string, and determining the matching degree score according to the comparison result.
5. The method of claim 4,
the comparing the second character string with the fourth character string, and determining the matching degree score according to the comparison result includes:
respectively determining whether the value of the sign bit is the same as the value of the corresponding sign bit in the fourth character string or not for each sign bit in the second character string, if so, giving a first weight to the sign bit, otherwise, giving a second weight to the sign bit, wherein the first weight is greater than the second weight;
and synthesizing the weights of all sign bits in the second character string to determine the matching degree score.
6. The method of claim 5,
the first weights corresponding to different sign bits are the same, and the second weights corresponding to different sign bits are the same;
or the first weights corresponding to different sign bits are the same, and corresponding second weights are respectively given to different sign bits according to the importance levels of the different sign bits, wherein the higher the importance level is, the lower the corresponding second weight is.
7. A travel intention recognition device, characterized by comprising: the system comprises an acquisition module, a conversion module, a grading module and an identification module;
the acquisition module is used for acquiring original parameters reported by the vehicles;
the conversion module is used for converting the original parameters into a first character string consisting of 0 and 1;
the scoring module is used for determining the matching degree score of the candidate driving intention according to a second character string and the first character string which are used for representing the candidate driving intention aiming at any candidate driving intention, wherein the second character string is composed of 0 and/or 1;
the identification module is used for sequencing the candidate driving intentions according to the sequence of the matching degree scores from high to low, and taking the candidate driving intentions at the front N positions after sequencing as the identified driving intentions, wherein N is a positive integer.
8. The apparatus of claim 7,
the conversion module comprises: a conversion unit and a splicing unit;
the conversion unit is used for converting any one of the original parameters into a third character string with a predetermined number of bits, wherein each sign bit in the third character string corresponds to an event with different meanings, and each sign bit in the third character string takes a value of 0 or 1 respectively to indicate that the corresponding event is negative or positive;
And the splicing unit is used for splicing the third character strings corresponding to various parameters according to a preset sequence to obtain the first character string.
9. The apparatus of claim 8,
each sign bit in the second character string corresponds to an event with different meanings, and each sign bit in the second character string takes a value of 0 or 1 respectively to indicate that the corresponding event is negative or positive;
the second character string is generated based on a configuration made by a user on a predetermined interface, the configuration including: the method comprises the steps of selecting events, the sequence of the selected events and the type corresponding to the selected events, wherein the type is negative or positive.
10. The apparatus of claim 9,
the scoring module comprises: an extraction unit and a comparison unit;
the extraction unit is configured to extract, for each sign bit in the second string, values of corresponding sign bits from the first string, where the corresponding sign bits indicate that corresponding events are the same, and splice the extracted values according to an order of the events corresponding to the sign bits in the second string to obtain a fourth string;
And the comparison unit is used for comparing the second character string with the fourth character string and determining the matching degree score according to the comparison result.
11. The apparatus of claim 10,
the comparison unit respectively determines whether the value of the sign bit is the same as the value of the corresponding sign bit in the fourth character string or not for each sign bit in the second character string, if so, the comparison unit gives a first weight to the sign bit, otherwise, the comparison unit gives a second weight to the sign bit, and the first weight is greater than the second weight, and combines the weights of the sign bits in the second character string to determine the matching degree score.
12. The apparatus of claim 11,
the first weights corresponding to different sign bits are the same, and the second weights corresponding to different sign bits are the same;
or the first weights corresponding to different sign bits are the same, and corresponding second weights are respectively given to different sign bits according to the importance levels of the different sign bits, wherein the higher the importance level is, the lower the corresponding second weight is.
13. An electronic device, comprising:
at least one processor; and
A memory communicatively coupled to the at least one processor; wherein the content of the first and second substances,
the memory stores instructions executable by the at least one processor to enable the at least one processor to perform the method of any one of claims 1-6.
14. A non-transitory computer readable storage medium having stored thereon computer instructions for causing the computer to perform the method of any one of claims 1-6.
CN202010494559.XA 2020-06-03 2020-06-03 Driving intention identification method and device, electronic equipment and storage medium Pending CN111859037A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202010494559.XA CN111859037A (en) 2020-06-03 2020-06-03 Driving intention identification method and device, electronic equipment and storage medium

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202010494559.XA CN111859037A (en) 2020-06-03 2020-06-03 Driving intention identification method and device, electronic equipment and storage medium

Publications (1)

Publication Number Publication Date
CN111859037A true CN111859037A (en) 2020-10-30

Family

ID=72985622

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202010494559.XA Pending CN111859037A (en) 2020-06-03 2020-06-03 Driving intention identification method and device, electronic equipment and storage medium

Country Status (1)

Country Link
CN (1) CN111859037A (en)

Citations (7)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20010035817A1 (en) * 2000-02-08 2001-11-01 Rika Mizuta Vehicle's communication apparatus
CN102298618A (en) * 2011-08-03 2011-12-28 百度在线网络技术(北京)有限公司 Method for obtaining matching degree to execute corresponding operations and device and equipment
CN104239343A (en) * 2013-06-20 2014-12-24 腾讯科技(深圳)有限公司 User input information processing method and device
US20180211663A1 (en) * 2017-01-23 2018-07-26 Hyundai Motor Company Dialogue system, vehicle having the same and dialogue processing method
CN108874917A (en) * 2018-05-30 2018-11-23 北京五八信息技术有限公司 Intension recognizing method, device, equipment and storage medium
CN109271793A (en) * 2018-08-29 2019-01-25 国家计算机网络与信息安全管理中心 Internet of Things cloud platform device class recognition methods and system
CN110400469A (en) * 2019-08-30 2019-11-01 公安部交通管理科学研究所 Standard based on people's vehicle association analysis, which is driven, is not inconsistent illegal activities method for early warning

Patent Citations (8)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20010035817A1 (en) * 2000-02-08 2001-11-01 Rika Mizuta Vehicle's communication apparatus
CN102298618A (en) * 2011-08-03 2011-12-28 百度在线网络技术(北京)有限公司 Method for obtaining matching degree to execute corresponding operations and device and equipment
CN104239343A (en) * 2013-06-20 2014-12-24 腾讯科技(深圳)有限公司 User input information processing method and device
US20140379738A1 (en) * 2013-06-20 2014-12-25 Tencent Technology (Shenzhen) Company Limited Processing method and device of the user input information
US20180211663A1 (en) * 2017-01-23 2018-07-26 Hyundai Motor Company Dialogue system, vehicle having the same and dialogue processing method
CN108874917A (en) * 2018-05-30 2018-11-23 北京五八信息技术有限公司 Intension recognizing method, device, equipment and storage medium
CN109271793A (en) * 2018-08-29 2019-01-25 国家计算机网络与信息安全管理中心 Internet of Things cloud platform device class recognition methods and system
CN110400469A (en) * 2019-08-30 2019-11-01 公安部交通管理科学研究所 Standard based on people's vehicle association analysis, which is driven, is not inconsistent illegal activities method for early warning

Similar Documents

Publication Publication Date Title
CN111122175A (en) Method and device for testing automatic driving system
CN110705800B (en) Mixed travel route determination method, device, equipment and storage medium
CN111694973A (en) Model training method and device for automatic driving scene and electronic equipment
CN112001180A (en) Multi-mode pre-training model acquisition method and device, electronic equipment and storage medium
CN112241764A (en) Image recognition method and device, electronic equipment and storage medium
CN110823237B (en) Starting point binding and prediction model obtaining method, device and storage medium
CN110543558B (en) Question matching method, device, equipment and medium
CN112270168B (en) Method and device for predicting emotion style of dialogue, electronic equipment and storage medium
US20210209160A1 (en) Method and apparatus for identifying map region words
CN111982144B (en) Navigation method, navigation device, electronic equipment and computer readable medium
CN111652153A (en) Scene automatic identification method and device, unmanned vehicle and storage medium
CN110796191B (en) Trajectory classification method and device
CN111666495A (en) Case recommendation method, device, equipment and storage medium
CN112380104A (en) User attribute identification method and device, electronic equipment and storage medium
CN111127191A (en) Risk assessment method and device
CN111090991A (en) Scene error correction method and device, electronic equipment and storage medium
CN114417194A (en) Recommendation system sorting method, parameter prediction model training method and device
CN111666771A (en) Semantic label extraction device, electronic equipment and readable storage medium of document
CN113160693A (en) Road intersection processing method, device, equipment and storage medium
CN112270169B (en) Method and device for predicting dialogue roles, electronic equipment and storage medium
CN112597288A (en) Man-machine interaction method, device, equipment and storage medium
CN111260656B (en) Method and device for analyzing navigation track
CN112529180A (en) Method and apparatus for model distillation
CN112650844A (en) Tracking method and device of conversation state, electronic equipment and storage medium
CN113157829A (en) Method and device for comparing interest point names, electronic equipment and storage medium

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
TA01 Transfer of patent application right

Effective date of registration: 20211019

Address after: 100176 101, floor 1, building 1, yard 7, Ruihe West 2nd Road, Beijing Economic and Technological Development Zone, Daxing District, Beijing

Applicant after: Apollo Zhilian (Beijing) Technology Co.,Ltd.

Address before: 2 / F, baidu building, 10 Shangdi 10th Street, Haidian District, Beijing 100085

Applicant before: BEIJING BAIDU NETCOM SCIENCE AND TECHNOLOGY Co.,Ltd.

TA01 Transfer of patent application right