US12208817B2 - Method, server, and computer program for creating road network map to design driving plan for autonomous driving vehicle - Google Patents
Method, server, and computer program for creating road network map to design driving plan for autonomous driving vehicle Download PDFInfo
- Publication number
- US12208817B2 US12208817B2 US17/825,578 US202217825578A US12208817B2 US 12208817 B2 US12208817 B2 US 12208817B2 US 202217825578 A US202217825578 A US 202217825578A US 12208817 B2 US12208817 B2 US 12208817B2
- Authority
- US
- United States
- Prior art keywords
- road
- lattice
- generated
- road network
- generating
- 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.)
- Active, expires
Links
Images
Classifications
-
- G—PHYSICS
- G01—MEASURING; TESTING
- G01C—MEASURING DISTANCES, LEVELS OR BEARINGS; SURVEYING; NAVIGATION; GYROSCOPIC INSTRUMENTS; PHOTOGRAMMETRY OR VIDEOGRAMMETRY
- G01C21/00—Navigation; Navigational instruments not provided for in groups G01C1/00 - G01C19/00
- G01C21/26—Navigation; Navigational instruments not provided for in groups G01C1/00 - G01C19/00 specially adapted for navigation in a road network
- G01C21/34—Route searching; Route guidance
- G01C21/3407—Route searching; Route guidance specially adapted for specific applications
- G01C21/343—Calculating itineraries
-
- G—PHYSICS
- G01—MEASURING; TESTING
- G01C—MEASURING DISTANCES, LEVELS OR BEARINGS; SURVEYING; NAVIGATION; GYROSCOPIC INSTRUMENTS; PHOTOGRAMMETRY OR VIDEOGRAMMETRY
- G01C21/00—Navigation; Navigational instruments not provided for in groups G01C1/00 - G01C19/00
- G01C21/26—Navigation; Navigational instruments not provided for in groups G01C1/00 - G01C19/00 specially adapted for navigation in a road network
- G01C21/34—Route searching; Route guidance
- G01C21/3446—Details of route searching algorithms, e.g. Dijkstra, A*, arc-flags or using precalculated routes
-
- 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
-
- G—PHYSICS
- G01—MEASURING; TESTING
- G01C—MEASURING DISTANCES, LEVELS OR BEARINGS; SURVEYING; NAVIGATION; GYROSCOPIC INSTRUMENTS; PHOTOGRAMMETRY OR VIDEOGRAMMETRY
- G01C21/00—Navigation; Navigational instruments not provided for in groups G01C1/00 - G01C19/00
- G01C21/26—Navigation; Navigational instruments not provided for in groups G01C1/00 - G01C19/00 specially adapted for navigation in a road network
- G01C21/34—Route searching; Route guidance
- G01C21/3453—Special cost functions, i.e. other than distance or default speed limit of road segments
-
- G—PHYSICS
- G01—MEASURING; TESTING
- G01C—MEASURING DISTANCES, LEVELS OR BEARINGS; SURVEYING; NAVIGATION; GYROSCOPIC INSTRUMENTS; PHOTOGRAMMETRY OR VIDEOGRAMMETRY
- G01C21/00—Navigation; Navigational instruments not provided for in groups G01C1/00 - G01C19/00
- G01C21/26—Navigation; Navigational instruments not provided for in groups G01C1/00 - G01C19/00 specially adapted for navigation in a road network
- G01C21/34—Route searching; Route guidance
- G01C21/3453—Special cost functions, i.e. other than distance or default speed limit of road segments
- G01C21/3492—Special cost functions, i.e. other than distance or default speed limit of road segments employing speed data or traffic data, e.g. real-time or historical
-
- G—PHYSICS
- G01—MEASURING; TESTING
- G01C—MEASURING DISTANCES, LEVELS OR BEARINGS; SURVEYING; NAVIGATION; GYROSCOPIC INSTRUMENTS; PHOTOGRAMMETRY OR VIDEOGRAMMETRY
- G01C21/00—Navigation; Navigational instruments not provided for in groups G01C1/00 - G01C19/00
- G01C21/38—Electronic maps specially adapted for navigation; Updating thereof
- G01C21/3804—Creation or updating of map data
- G01C21/3807—Creation or updating of map data characterised by the type of data
- G01C21/3815—Road data
-
- G—PHYSICS
- G01—MEASURING; TESTING
- G01C—MEASURING DISTANCES, LEVELS OR BEARINGS; SURVEYING; NAVIGATION; GYROSCOPIC INSTRUMENTS; PHOTOGRAMMETRY OR VIDEOGRAMMETRY
- G01C21/00—Navigation; Navigational instruments not provided for in groups G01C1/00 - G01C19/00
- G01C21/38—Electronic maps specially adapted for navigation; Updating thereof
- G01C21/3804—Creation or updating of map data
- G01C21/3833—Creation or updating of map data characterised by the source of data
- G01C21/3848—Data obtained from both position sensors and additional sensors
-
- G—PHYSICS
- G01—MEASURING; TESTING
- G01C—MEASURING DISTANCES, LEVELS OR BEARINGS; SURVEYING; NAVIGATION; GYROSCOPIC INSTRUMENTS; PHOTOGRAMMETRY OR VIDEOGRAMMETRY
- G01C21/00—Navigation; Navigational instruments not provided for in groups G01C1/00 - G01C19/00
- G01C21/38—Electronic maps specially adapted for navigation; Updating thereof
- G01C21/3863—Structures of map data
-
- G—PHYSICS
- G01—MEASURING; TESTING
- G01C—MEASURING DISTANCES, LEVELS OR BEARINGS; SURVEYING; NAVIGATION; GYROSCOPIC INSTRUMENTS; PHOTOGRAMMETRY OR VIDEOGRAMMETRY
- G01C21/00—Navigation; Navigational instruments not provided for in groups G01C1/00 - G01C19/00
- G01C21/38—Electronic maps specially adapted for navigation; Updating thereof
- G01C21/3885—Transmission of map data to client devices; Reception of map data by client devices
-
- G—PHYSICS
- G06—COMPUTING OR CALCULATING; COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q50/00—Information and communication technology [ICT] specially adapted for implementation of business processes of specific business sectors, e.g. utilities or tourism
- G06Q50/40—Business processes related to the transportation industry
-
- 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
- B60W2552/00—Input parameters relating to infrastructure
- B60W2552/10—Number of lanes
-
- 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
Definitions
- Various embodiments of the present invention relate to a method, a server, and a computer program for creating a road network map to design a driving plan for an autonomous driving vehicle, and more particularly, to a method of creating a road network map to design short-term and long-term driving plans for an autonomous driving vehicle.
- ADAS advanced driver assistance system
- the autonomous driving system is a vehicle that recognizes the surrounding environment without driver intervention and automatically drives to a given destination by itself according to the recognized surrounding environment.
- road network data including information on lanes is essential data in that the road network data is prior information usable in various modules included in the autonomous driving system, a process of generating the road network data is essential.
- the present invention is directed to providing a method, a server, and a computer program for creating a road network map to design a driving plan for an autonomous driving vehicle capable of building road network maps to design a short-term driving plan and a long-term driving plan for the autonomous driving vehicle by collecting various types of information on roads located in an area to generate road network data, and using the generated road network data to automatically generate lattice road network data and a crossable dipole graph.
- a method of creating a road network map to design a driving plan for an autonomous driving vehicle which is performed by a computing device, including: generating road network data for an area; generating lattice road network data for a short-term driving plan for an autonomous driving vehicle using the generated road network data; and generating a crossable dipole graph for a long-term driving plan for the autonomous driving vehicle using the generated lattice road network data.
- the generating of the road network data may include: generating a first road network indicating a connection relationship between a first road located in the area and a second road connected to the first road; and generating a second road network representing a connection relationship between a plurality of first lanes included in the first road and a plurality of second lanes included in the second road using the generated first road network.
- the generating of the first road network may include: generating a first road graph and a second road graph by graphing the first road and the second road, respectively, the generated first road graph and the generated second road graph including shape information, direction information, and semantic information on the first road and the second road, respectively; and generating the first road network by connecting the generated first road graph and the generated second road graph.
- the generating of the first road network may include: dividing each of the first road and the second road according to a preset criterion to generate one or more independent roads and one or more dependent roads; and generating the first road network by connecting the generated one or more independent roads and the generated one or more dependent roads, and intersecting and connecting one independent road and one dependent road.
- the generating of the second road network may include: generating a first lane graph indicating relative positions of each of the plurality of first lanes by graphing each of the plurality of first lanes and the plurality of second lanes, and a second lane graph indicating the relative positions of each of the plurality of second lanes generating a graph, the generated first lane graph and the generated second lane graph including semantic information on the plurality of first lanes and the plurality of second lanes, respectively; and generating the second road network by connecting the generated first road graph and the generated second road graph.
- the generating of the lattice road network data may include: generating one or more lattice roads using the generated road network data; generating connection information between the generated one or more lattice roads; and generating the lattice road network connecting the generated one or more lattice roads according to the generated connection information.
- the generating of the one or more lattice roads may include generating one or more lattice roads by grouping one or more lanes satisfying a preset condition among a plurality of lanes located in the area based on the generated road network data, the preset condition having the same property and being physically and legally movable.
- the generating of the one or more lattice roads may include: setting a plurality of points on the generated one or more lattice roads in a lattice form; and matching and storing geometric information and semantic information on the lattice road where each of the plurality of set points is located at each of the set points.
- the generating of the connection information includes determining whether the generated one or more lattice roads intersect, and generating connection information indicating a connection relationship between the generated one or more lattice roads based on the determined intersection, the form of the generated connection information being determined based on a length of an intersection section between the generated one or more lattice roads.
- the generating of the crossable dipole graph may include: determining whether movement is possible between one or more lanes included in a first lattice road and one or more lanes included in a second lattice road based on the generated lattice road network data; and generating the crossable dipole graph connecting one or more lanes included in the first lattice road and one or more lanes included in the second lattice road based on the determined movement possibility.
- a server for creating a road network map to design a driving plan for an autonomous driving vehicle including: a processor; a network interface; a memory; and a computer program loaded into the memory and executed by the processor, in which computer program includes an instruction to generate road network data for an area; an instruction to generate lattice road network data for a short-term driving plan for an autonomous driving vehicle using the generated road network data; and an instruction to generate a crossable dipole graph for a long-term driving plan for the autonomous driving vehicle using the generated lattice road network data.
- a computer program recorded on a computer-readable recording medium, wherein the computer program is coupled to a computing device and stored in the computer-readable recording medium in order to execute the following steps: generating road network data for an area; generating lattice road network data for a short-term driving plan for an autonomous driving vehicle using the generated road network data; and generating a crossable dipole graph for a long-term driving plan for the autonomous driving vehicle using the generated lattice road network data.
- FIG. 1 is a diagram illustrating a system for creating a road network map to design a driving plan for an autonomous driving vehicle according to an embodiment of the present invention
- FIG. 2 is a hardware configuration diagram of a server for creating a road network map to design a driving plan for an autonomous driving vehicle according to another embodiment of the present invention
- FIG. 3 is a flowchart of a method of creating a road network map to design a driving plan for an autonomous driving vehicle according to another embodiment of the present invention
- FIG. 4 is a flowchart of a method of generating road network data in various embodiments
- FIG. 5 is a diagram exemplarily illustrating a form of a road network generated according to the method of generating network data in various embodiments
- FIG. 6 is a diagram exemplarily illustrating a road graph applicable to various embodiments.
- FIGS. 7 and 8 are diagrams exemplarily illustrating a lane graph applicable to various embodiments.
- FIGS. 9 A and 9 B are diagrams exemplarily illustrating a form of connecting a first road graph, a second road graph, a first lane graph, and a second lane graph in various embodiments;
- FIG. 10 is a diagram illustrating a process of connecting an independent road and a dependent road in various embodiments
- FIGS. 11 A to 11 C show diagrams exemplarily illustrating a form in which a driving plan is set in an area outside a road on a road graph in various embodiments;
- FIG. 12 is a flowchart of a method of generating lattice road network data in various embodiments
- FIGS. 13 A to 13 C show diagrams exemplarily illustrating a form of a lattice road network generated according to a method of generating lattice road network data in various embodiments;
- FIG. 14 is a diagram illustrating a process of setting a plurality of points on one or more lattice roads in various embodiments
- FIGS. 15 A to 15 C show diagrams illustrating a process of generating a crossable dipole graph using lattice road network data in various embodiments.
- FIGS. 16 A to 16 C show diagrams illustrating a process of designing a driving plan for an autonomous driving vehicle using lattice road network data and a crossable dipole graph in various embodiments.
- the term “unit” or “module” used herein means a hardware component such as software, FPGA, or ASIC and performs predetermined functions.
- the term “unit” or “module” is not limited to software or hardware.
- the “unit” or “module” may be configured to be stored in a storage medium that can be addressed or may be configured to regenerate one or more processors.
- the “unit” or “module” includes components such as software components, object-oriented software components, class components, and task components, processors, functions, attributes, procedures, subroutines, segments of a program code, drivers, firmware, a microcode, a circuit, data, a database, data structures, tables, arrays, and variables. Functions provided in components, and the “units” or “modules” may be combined into fewer components, and “units” or “modules” may be further separated into additional components.
- spatially relative terms “below,” “beneath,” “lower,” “above,” “upper,” and the like may be used to easily describe the correlation between one component and other components as illustrated in the drawings.
- the spatially relative terms should be understood as terms including different directions of components during use or operation in addition to the directions illustrated in the drawings. For example, when a component illustrated in the drawings is turned, a component described as “below” or “beneath” another component may be placed “above” the other component. Therefore, the illustrative term “below” may include both downward and upward directions.
- the components can also be aligned in different directions, and therefore the spatially relative terms can be interpreted according to the alignment.
- the computer is any kind of hardware device including at least one processor, and may be understood as including a software configuration which is operated in the corresponding hardware device according to the embodiment.
- the computer may be understood to be any of a smart phone, a tablet personal computer (PC), a desktop, a notebook, or a user client or application running on each device, but is not limited thereto.
- this specification relates to an autonomous driving vehicle, and describes the method of creating a road network map as prior data for designing short-term and long-term driving plans for an autonomous driving vehicle, but is not limited thereto, and may be applied to semi-autonomous driving vehicles or general vehicles that do not use autonomous driving functions.
- FIG. 1 is a diagram illustrating a system for creating a road network map to design a driving plan for an autonomous driving vehicle according to an embodiment of the present invention.
- the system for creating a road network map to design a driving plan for an autonomous driving vehicle includes a server 100 for creating a road network map, a user terminal 200 , and an external server 300 .
- the system for creating a road network map to design a driving plan for an autonomous driving vehicle illustrated in FIG. 1 is based on an embodiment, and components thereof are not limited to the embodiment illustrated in FIG. 1 , and may be added, changed, or deleted as necessary.
- the server 100 for generating a road network map may create a road network map for a driving plan for the autonomous driving vehicle 10 .
- the server 100 for creating a road network map may generate road network data by collecting all information on roads (e.g., information on road structures, etc.) located in an area, generate lattice road network data for a short-term driving plan for the autonomous driving vehicle 10 using the generated road network data, and generate a crossable dipole graph for a long-term driving plan for the autonomous driving vehicle 10 using the generated lattice road network data.
- the server 100 for creating a road network map may be connected to a user terminal 200 or a vehicle (e.g., autonomous driving vehicle 10 ) passing through the area through a network 400 , may collect sensor data for the area from the user terminal 200 or the vehicle, and generate the road network data for the area using the collected sensor data.
- a vehicle e.g., autonomous driving vehicle 10
- the server 100 for creating a road network map may be connected to an external server 300 (e.g., a server of the Ministry of Land, Infrastructure and Transport) through the network 400 , and generate the road network data by collecting various types of information on roads located in the area through the external server 300 .
- an external server 300 e.g., a server of the Ministry of Land, Infrastructure and Transport
- the server 100 for creating a road network map may automatically generate the lattice road network data in response to the generation of the road network data for the area, and automatically generate the crossable dipole graph again in response to the generation of the lattice road network data.
- the present invention is not limited thereto.
- the user terminal 200 is a wireless communication apparatus in which portability and mobility are guaranteed, and examples thereof may include all types of handheld-based wireless communication devices such as a navigation system, a personal communication system (PCS), a global system for mobile communication (GSM), a personal digital cellular (PDC), a personal handyphone system (PHS), a personal digital assistant (PDA), international mobile telecommunication (IMT)-2000, code division multiple access (CDMA)-2000, W-code division multiple access (W-CDMA), a wireless broadband Internet (WiBro) terminal, a smart phone, a smart pad, a tablet PC, and the like, but are not limited thereto.
- a navigation system such as a navigation system, a personal communication system (PCS), a global system for mobile communication (GSM), a personal digital cellular (PDC), a personal handyphone system (PHS), a personal digital assistant (PDA), international mobile telecommunication (IMT)-2000, code division multiple access (CDMA)-2000, W-code division multiple access (
- the network 400 may be a connection structure capable of exchanging information between respective nodes such as a plurality of terminals and servers.
- the network 400 includes a local area network (LAN), a wide area network (WAN), the Internet (world wide web (WWW)), a wired/wireless data communication network, a telephone network, a wired/wireless television communication network, and the like.
- the wireless data communication network includes 3G, 4G, 5G, 3rd Generation Partnership Project (3GPP), 5th Generation Partnership Project (5GPP), Long Term Evolution (LTE), World Interoperability for Microwave Access (WiMAX), wireless fidelity (Wi-Fi), the Internet, a local area network (LAN), a wireless local area network (Wireless LAN), a wide area network (WAN), a personal area network (PAN), radio frequency (RF), a Bluetooth network, a near-field communication (NFC) network, a satellite broadcast network, an analog broadcast network, a digital multimedia broadcasting (DMB) network, and the like, but is not limited thereto.
- 3GPP 3rd Generation Partnership Project
- 5GPP 5th Generation Partnership Project
- LTE Long Term Evolution
- WiMAX wireless fidelity
- Wi-Fi wireless fidelity
- the Internet a local area network (LAN), a wireless local area network (Wireless LAN), a wide area network (WAN), a personal area network (PAN), radio frequency (RF
- the server 100 for creating a road network map may generate a driving plan for controlling the autonomous driving vehicle 10 using the lattice road network data and the crossable dipole graph.
- the driving plan may be not only a plan for generating a driving path from a current location of the autonomous driving vehicle 10 to a destination and controlling the autonomous driving vehicle 10 to move based on the generated driving path, but also a plan for various controls such as a traveling lane, a lane change location, speed or acceleration control, and steering angle control.
- the external server 300 may be connected to the server 100 for creating a road network map through the network 400 , and the server 100 for creating a road network map may provide various types of information (e.g., road network map creation rules) necessary to perform the road network map creation process for a driving plan for the autonomous driving vehicle 10 , or receive and store data (e.g., road network data, lattice road network data, a crossable dipole graph, etc.) generated by performing a process of creating a road network map for a driving plan for the autonomous driving vehicle 10 .
- the external server 300 may be a storage server provided separately outside of the server 100 for creating a road network map, but is not limited thereto.
- a hardware configuration of the server 100 for creating a road network map that performs the process of creating a road network map for a driving plan for an autonomous driving vehicle will be described with reference to FIG. 2 .
- FIG. 2 is a hardware configuration diagram of a server for creating a road network map to design a driving plan for an autonomous driving vehicle according to another embodiment of the present invention.
- the server 100 for creating a road network map may include one or more processors 110 , a memory 120 into which a computer program 151 executed by the processor 110 is loaded, a bus 130 , a communication interface 140 , and a storage 150 for storing the computer program 151 .
- processors 110 may include one or more processors 110 , a memory 120 into which a computer program 151 executed by the processor 110 is loaded, a bus 130 , a communication interface 140 , and a storage 150 for storing the computer program 151 .
- FIG. 2 only the components related to the embodiment of the present invention are illustrated in FIG. 2 . Accordingly, one of ordinary skill in the art to which the present invention pertains may understand that general-purpose components other than the components illustrated in FIG. 2 may be further included.
- the processor 110 controls an overall operation of each configuration of the server 100 .
- the processor 110 may be configured to include a central processing unit (CPU), a microprocessor unit (MPU), a micro controller unit (MCU), a graphics processing unit (GPU), or any type of processor well known in the technical field of the present invention.
- CPU central processing unit
- MPU microprocessor unit
- MCU micro controller unit
- GPU graphics processing unit
- the processor 110 may perform an operation for at least one application or program for executing the method according to the embodiments of the present invention
- the server 100 may include one or more processors.
- the processor 110 may further include a random access memory (RAM) (not illustrated) and a read-only memory (ROM) for temporarily and/or permanently storing signals (or data) processed in the processor 110 .
- the processor 110 may be implemented in the form of a system-on-chip (SoC) including at least one of the graphics processing unit, the RAM, and the ROM.
- SoC system-on-chip
- the memory 120 stores various types of data, commands and/or information.
- the memory 120 may load the computer program 151 from the storage 150 to execute methods/operations according to various embodiments of the present invention.
- the processor 110 may perform the methods/operations by executing one or more instructions constituting the computer program 151 .
- the memory 120 may be implemented as a volatile memory such as RAM, but the technical scope of the present disclosure is not limited thereto.
- the bus 130 provides a communication function between components of the server 100 .
- the bus 130 may be implemented as any of various types of buses, such as an address bus, a data bus, and a control bus.
- the communication interface 140 supports wired/wireless Internet communication of the server 100 .
- the communication interface 140 may support various communication methods other than Internet communication.
- the communication interface 140 may be configured to include a communication module well known in the art.
- the communication interface 140 may be omitted.
- the storage 150 may non-temporarily store the computer program 151 .
- the storage 150 stores various types of information necessary to provide the process of creating a road network map for a driving plan for an autonomous driving vehicle.
- the storage 150 may be configured to include a nonvolatile memory, such as a ROM, an EPROM, an EEPROM, or a flash memory, a hard disk, a removable disk, or any well-known computer-readable recording medium in the art to which the present invention belongs.
- a nonvolatile memory such as a ROM, an EPROM, an EEPROM, or a flash memory
- a hard disk such as a hard disk, a removable disk, or any well-known computer-readable recording medium in the art to which the present invention belongs.
- the computer program 151 may include one or more instructions to, when loaded into the memory 120 , cause the processor 110 to perform the methods/operations according to various embodiments of the present invention. That is, the processor 110 may perform the methods/operations according to various embodiments of the present invention by executing the one or more instructions.
- the computer program 151 may include one or more instructions to perform a method of creating a road network map to design a driving plan for an autonomous driving vehicle including generating road network data for an area, generating lattice road network data for a short-term driving plan for an autonomous driving vehicle using the generated road network data, and generating a crossable dipole graph for a long-term driving plan for the autonomous driving vehicle using the generated lattice road network data.
- Operations of the method or algorithm described with reference to the embodiment of the present invention may be directly implemented in hardware, in software modules executed by hardware, or in a combination thereof.
- the software module may reside in a RAM, a ROM, an EPROM, an EEPROM, a flash memory, a hard disk, a removable disk, a CD-ROM, or in any form of computer readable recording medium known in the art to which the invention pertains.
- the components of the present invention may be embodied as a program (or application) and stored in a medium for execution in combination with a computer which is hardware.
- the components of the present invention may be executed in software programming or software elements, and similarly, embodiments may be in programming or scripting language such as C, C++, Java, or assembler, including various algorithms implemented in a combination of data structures, processes, routines, or other programming constructions. Functional aspects may be implemented with algorithms executed on one or more processors.
- the method of creating a road network map to design a driving plan for an autonomous driving vehicle performed by the server 100 will be described with reference to FIGS. 3 to 16 C .
- FIG. 3 is a flowchart of the method of creating a road network map to design a driving plan for an autonomous driving vehicle according to another embodiment of the present invention.
- the server 100 may generate road network data for an area.
- the server 100 may be connected to the user terminal 200 or a vehicle (e.g., an autonomous driving vehicle 10 ) passing through the area through a network 400 , may collect sensor data for the area from the user terminal 200 or the vehicle, and generate the road network data for the area using the collected sensor data.
- a vehicle e.g., an autonomous driving vehicle 10
- the sensor data may refer to all information related to a structure of a road located in the area, image data generated by photographing an area through a camera sensor, LiDAR sensor data collected through a LiDAR sensor, a radar sensor data collected through a radar sensor, and location data collected through a GPS sensor.
- the server 100 for creating a road network map may be connected to an external server 300 (e.g., a server of the Ministry of Land, Infrastructure and Transport) through the network 400 , and generate the road network data by collecting various types of information on roads located in the area through the external server 300 .
- an external server 300 e.g., a server of the Ministry of Land, Infrastructure and Transport
- the road network data may refer to data used to design a driving plan for an autonomous driving vehicle, and data including essential information about a road structure.
- the road network data may include information (e.g., road structure, shape, direction, geometric information, attribute information (semantic information), etc.) for automatically generating lattice road network data and a crossable dipole graph through operations S 120 and S 130 , which will be described below, and may be stored in a structure that is easy for users to edit directly.
- information e.g., road structure, shape, direction, geometric information, attribute information (semantic information), etc.
- the server 100 may generate a road network (e.g., FIG. 5 ) that indicates a connection relationship between a first road located in an area and a second road connected to the first road, and a connection relationship between lanes included in the first road and the second road.
- a road network e.g., FIG. 5
- FIGS. 4 to 11 C this will be described with reference to FIGS. 4 to 11 C .
- FIG. 4 is a flowchart of a method of generating road network data in various embodiments.
- the server 100 may generate a first road network indicating the connection relationship between the first road located in the area and the second road connected to the first road.
- the server 100 may generate a first road graph and a second road graph by graphing each of the first road and the second road. For example, as illustrated in FIG. 6 , the server 100 may generate the first road graph and the second road graph by graphing each of the first road and the second road using a first graph generation model.
- the first graph generation model may be a spline curvature path (SCP) model that estimates an N th -order polynomial function for a road using a partial polynomial and graphs the estimated N th -order polynomial function as a graph of an S-D domain.
- SCP spline curvature path
- the server 100 may generate a first road graph and a second road graph for each of the first road and the second road by estimating the N th -order polynomial function for each of the first and second roads based on shape information on the first and second roads to be graphed and substituting various data values (e.g., coordinate values (X and Y) and boundary conditions for start and finish points of the first road and the second road, and continuity conditions for curvatures of the first road and the second road, etc.) into the estimated N th -order polynomial function to determine the N th -order polynomial function.
- various data values e.g., coordinate values (X and Y) and boundary conditions for start and finish points of the first road and the second road, and continuity conditions for curvatures of the first road and the second road, etc.
- the present invention is not limited thereto, and various methods of graphing the first road and the second road may be applied.
- the first road graph and the second road graph may include geometric information on the first road and the second road, respectively.
- the first road graph and the second road graph may include shape information on the first road and the second road, respectively.
- the shape information on the road may be expressed with one representative line.
- the first road graph and the second road graph may include direction information on the first road and the second road, respectively.
- first road graph and the second road graph may include attribute information on the first road and the second road, respectively.
- first road graph and the second road graph may include explicitness (example: explicit road: road where road markings are explicitly marked, implicit road: road where road markings such as a U-turn section or an intersection are not explicitly marked) of the first road and the second road, respectively, and information on whether or not there is a protection area (e.g., disabled protection area, child protection area, elderly protection area, etc.)
- the server 100 may generate the first road network by connecting the first road graph and the second road graph.
- the first road network may be represented in the form of directly connecting the first road graph and the second road graph, but is not limited thereto, and as illustrated in FIG. 5 , may be expressed in the form of connecting an indicator indicating the first road and a second road network and an indicator indicating the second road, and thus may be implemented in a form that makes it easy for users to directly modify and edit the road network.
- the server 100 may generate one or more independent roads and one or more dependent roads by dividing each of the first road and the second road according to a preset criterion, and generate the first road network by connecting one or more independent roads and one or more dependent roads, but intersect and connect one independent road and one dependent road.
- the server 100 may generate a plurality of unit roads by dividing each of the first road and the second road according to a preset criterion (e.g., whether it is possible to move to another road), and classify the plurality of generated unit roads as independent roads or dependent roads according to attributes of each of the plurality of unit roads.
- a preset criterion e.g., whether it is possible to move to another road
- the independent road may be a unit road that may be selected from two or more unit roads located in different directions and connected, or connected by selecting two or more unit roads located in different directions
- the dependent road may be a unit road that may be selected from one unit road and connected or connected only by selecting one unit road.
- the server 100 may generate a plurality of unit roads by dividing each of the first road and the second road, and when each of the plurality of unit roads is classified as an independent road or a dependent road according to attributes, but two or more consecutive unit roads are classified as independent roads or two or more consecutive unit roads are classified as dependent roads, may integrate two or more consecutive unit roads into one unit road so that one independent road and one dependent road may be arranged to be intersected.
- the server 100 connects each of the plurality of independent roads and the plurality of dependent roads generated according to the above method, but may alternately connect one independent road and one dependent road.
- the server 100 first arranges unit roads classified as independent roads among a plurality of unit roads, and then arranges dependent roads between the arranged independent roads so that one independent road and one dependent road may be alternately connected.
- the server 100 may provide a user interface (UI) (e.g., a graphical user interface (GUI)) for the generation of the road network data to the user terminal 200 , and may first arrange independent roads according to a first user input obtained from the user through the UI. Thereafter, the server 100 may arrange dependent roads between independent roads according to a second user input obtained from a user through the UI, but by arranging the dependent road and automatically connecting the independent road and the dependent road, may alternately connect one independent road and one dependent road.
- UI user interface
- GUI graphical user interface
- the server 100 may edit a specific independent road according to the user input upon obtaining a user input for editing a specific independent road from a user through the UI, and may also edit a specific independent road to automatically edit a dependent road connected to the specific independent road (automatically edit the independent roads according to the locations of the independent roads that are connected to both sides of the dependent road).
- the method of creating a road network map to design a driving plan for an autonomous driving vehicle does not simply connect the entire first road and the second road, but subdivides and connects the first road and the second road, so that it is possible to facilitate maintenance and editing processing for the road network.
- the server 100 may generate the second road network representing the connection relationship between the plurality of first lanes included in the first road and the plurality of second lanes included in the second road using the first road network.
- the server 100 graphs each of the plurality of first lanes and the plurality of second lanes to generate a first lane graph indicating relative positions of each of the first lane graph and a second lane graph indicating relative positions of each of the plurality of first lanes. For example, as illustrated in FIG. 7 , the server 100 may generate the first lane graph and the second lane graph for each of the plurality of first lanes and the plurality of second lanes using a second graph generation model.
- the second graph generation model may be a spline path (SP) model that is graphed by a graph in an S-L domain indicating the relative positions of the plurality of first lanes and the plurality of second lanes by using the first road graph and the second road graph graph graphed in the S-D domain.
- each of the first lane graph and the second lane graph may include geometric information on the relative positions of the plurality of first lanes and the plurality of second lanes, respectively.
- the first lane graph and the second lane graph may include the attribute information on each of the plurality of first lanes and the plurality of second lanes.
- the first lane graph and the second lane graph include information such as type information (e.g., solid line, dotted line, double line (double solid line, solid line and dotted line, or dotted line and solid line)) on each of the plurality of first lanes and the plurality of second lanes and color information (e.g., white, yellow, blue).
- the server 100 may generate the second road network by connecting the first road graph and the second road graph.
- the server 100 may not only connect a feature point for the first lane graph and a feature point (e.g., a center point) for the second lane graph, but may also connect all points located at a point where the plurality of first lanes and the plurality of second lanes intersect in the form of a smooth curve.
- FIGS. 9 A and 9 B when a first road 20 including a plurality of first lanes and a second road 30 including a plurality of second lanes are connected (e.g., FIG. 9 A ), all points where the plurality of first lanes and the plurality of second lanes intersect may be connected with a smooth curve (e.g., a straight line).
- a smooth curve e.g., a straight line
- the first lanes and the second lanes are arranged at the same position on the S-L coordinates, so that, by connecting the first lane graph and the second lane graph with a straight line as illustrated in FIGS. 9 A and 9 B , it is possible to generate a straight graph in one S-L domain (e.g., FIG. 9 B ).
- the first road 20 since a path continuously traveling on the first road 20 without moving to another road (second road 30 ) and a driving path moving from the first road 20 to the second road 30 , that is, two driving paths, may be generated, the first road 20 may be divided into two unit roads 20 - 1 and 20 - 2 based on an intersection of the first road 20 and the second road 30 , and as illustrated in FIG. 9 B , two second road networks may be generated in consideration of each driving path.
- one or more lanes included in each of the first road and the second road may be expressed by interpolation of two lane graphs adjacent to each other as illustrated in FIG. 8 . That is, the server 100 does not separately generate a road network connecting the lanes included in each of the first road and the second road, but may express the connection state between one or more lanes included in each of the first road and the second road on the second road network generated by connecting the first lane graph and the second lane graph.
- one or more lanes are expressed by interpolation of two lane graphs adjacent to each other, and an interval between two lanes adjacent to each other is set (e.g., 1) according to the relative positions regardless of an actual distance, and therefore does not include information on an actual width of a lane.
- lanes located on each of the first road and the second road included in the second road network may include the attribute information on the road.
- lanes located on each of the first road and the second road include direction indication information (e.g., go straight, none, left turn, right turn, straight right turn, straight left turn, no going straight, U-turn, etc.), type information (e.g., general lanes, bus-only lanes (all-day, peak-hour, etc.) and speed information (e.g., prescribed speed, minimum prescribed speed, maximum prescribed speed, standard driving path, etc.).
- direction indication information e.g., go straight, none, left turn, right turn, straight right turn, straight left turn, no going straight, U-turn, etc.
- type information e.g., general lanes, bus-only lanes (all-day, peak-hour, etc.
- speed information e.g., prescribed speed, minimum prescribed speed, maximum prescribed speed, standard driving path, etc.
- each of the lanes included in each of the first road and the second road
- the autonomous driving vehicle 10 in generating a driving plan for the autonomous driving vehicle 10 , there may be a case in which the autonomous driving vehicle 10 inevitably needs to drive out of a designated lane as an emergency situation occurs (for example, when a vehicle in front of the autonomous driving vehicle 10 that is driving according to a driving plan stops suddenly, the autonomous driving vehicle 10 evades to a shoulder to avoid the sudden stop of the vehicle, or a case in which, when an obstacle is located in a lane on which the autonomous driving vehicle 10 is driving in a round-trip two-lane section, the autonomous driving vehicle 10 inevitably needs to drive in reverse in a lane in an opposite direction, etc.
- an emergency situation for example, when a vehicle in front of the autonomous driving vehicle 10 that is driving according to a driving plan stops suddenly, the autonomous driving vehicle 10 evades to a shoulder to avoid the sudden stop of the vehicle, or a case in which, when an obstacle is located in a lane on which the autonomous driving vehicle 10 is driving in a round-trip two-lane section, the autonomous driving vehicle
- the server 100 generates the second road network according to the above method, but, as illustrated in FIGS. 11 A to 11 C , in the first and second lane graphs, the server 100 expands and generates an area for an upper part (considering reverse driving in an opposite direction) of an uppermost lane and an area for a lower part (considering driving on a shoulder) of a lowermost lane, and thus may enable a driving plan to deviate from a designated lane as changes occur during driving as described above.
- the server 100 may generate lattice road network data using the road network data generated in operation S 110 .
- the lattice road network data may be data used for a short-term driving plan for the autonomous driving vehicle 10 .
- the server 100 may set one or more lattice roads for an area using the road network data, and define a connection relationship between the one or more set lattice roads, thereby creating the lattice road network.
- this will be described with reference to FIGS. 12 to 14 .
- FIG. 12 is a flowchart of a method of generating lattice road network data in various embodiments.
- the server 100 may generate one or more lattice roads (e.g., lattice road (LR), and LR_A, LR_B, LR_C, LR_D, LR_E, and LR_F in FIG. 13 A ) using the road network data.
- the server 100 may generate one or more lattice roads by grouping one or more lanes satisfying preset conditions (for example, having the same attribute and moving physically or legally) among a plurality of lanes located in an area based on the road network data.
- the server 100 may set a plurality of points on one or more lattice roads in a lattice form, and match and store geometrical information and attribute information on a lattice road in which each of a plurality of points is located in each of a plurality of set points. For example, as illustrated in FIG.
- the server 100 may set a plurality of points to have a lattice shape of a first distance (e.g., 1 m) unit to an S axis and a second distance (e.g., 0.25 m) unit to an L axis on a graph (S-L graph) for each of one or more lattice roads, and match and store geometric information (e.g., direction information, shape information, etc.) and attribute information (e.g., explicitness, whether there is a protection area, etc.) on a road on which each point is located for a plurality of set points.
- geometric information e.g., direction information, shape information, etc.
- attribute information e.g., explicitness, whether there is a protection area, etc.
- the first distance to the S-axis and the second distance to the L-axis, at which a plurality of points are set are merely examples and are not limiting but may be adjusted within a predetermined range.
- the server 100 may further include geometric information (e.g., relative position information, etc.) and attribute information (e.g., type, color information) on a lane, with respect to one or more points located in a lane of one or more lattice roads among a plurality of points.
- geometric information e.g., relative position information, etc.
- attribute information e.g., type, color information
- the server 100 may match and store geometric information and attribute information (e.g., direction indication information, type, speed information, etc.) for each lane, with respect to one or more points located in a lane included in each of one or more lattice roads among a plurality of points.
- geometric information and attribute information e.g., direction indication information, type, speed information, etc.
- the server 100 may generate connection information (lattice road edge (LRE), and LRE1, LRE2, LRE3, LRE4, LRE5, and LRE6 of FIGS. 13 B and 13 C ) between one or more lattice roads.
- LRE lattic road edge
- the server 100 may determine whether one or more lattice roads intersect, and may generate connection information indicating a connection relationship between the one or more lattice roads generated based on the determination on whether the one or more lattice roads intersect.
- the server 100 may determine the type of connection information based on a length of an intersection section between one or more lattice roads. For example, as illustrated in FIGS. 13 A to 13 C , the server 100 intersects a first lattice road (LR_A) and a second lattice road (LR_B), but when the length of the intersection section is 0, may generate connection information (e.g., XPoint3, XPoint4, XPoint5, and XPoint6) in a point form.
- connection information e.g., XPoint3, XPoint4, XPoint5, and XPoint6
- the server 100 may generate connection information (e.g., XSeg1 and XSeg2) in the form of a line having a predetermined length.
- connection information e.g., XSeg1 and XSeg2
- the server 100 may generate the lattice road network connecting one or more lattice roads generated through operation S 310 according to the connection information generated through operation S 320 (e.g., FIGS. 13 B and 13 C ).
- the server 100 may be used to generate the short-term driving plan (e.g., a driving path from the first lattice included in one lattice road to the second lattice) for the autonomous driving vehicle 10 by generating the lattice road network data according to the above method.
- the short-term driving plan e.g., a driving path from the first lattice included in one lattice road to the second lattice
- the server 100 may generate a crossable dipole graph using lattice road network data generated through operation S 120 .
- the crossable dipole graph may be data used for the long-term driving plan for the autonomous driving vehicle 10 .
- the server 100 may generate a crossable dipole graph connecting one or more different lattice roads using the lattice road network data.
- the server 100 may determine whether movement is possible between one or more lanes included in a first lattice road and one or more lanes included in a second lattice road based on the lattice road network data.
- the server 100 may determine whether movement is possible between lanes included in each of the first lattice road and the second lattice road, with respect to each of the interconnected first lattice road and second lattice road, and generate a crossable dipole graph that connects one or more lanes included in the first lattice road and one or more lanes included in the second lattice road based on the determination of whether movement is possible between lanes.
- the method of determining whether movement is possible between one or more lanes included in the first lattice road and one or more lanes included in the second lattice road may be made based on a distance between one or more lanes included in the first lattice road and one or more lanes included in the second lattice road and a change cycle (e.g., 30 m for general road, 100 m for expressway) for each lane according to attributes of a road under a length of an intersection section set between the first lattice road and the second lattice road, but is not limited thereto.
- a change cycle e.g. 30 m for general road, 100 m for expressway
- the server 100 may generate the driving plan (short-term driving plan and long-term driving plan) for the autonomous driving vehicle 10 using the lattice road network data and the crossable dipole graph generated according to the above method.
- the server 100 may establish a long-term driving plan from a user's current location to the destination by using positional information of a user (or positional information of the autonomous driving vehicle 10 in which a user is riding), positional information on a destination that a user inputs, and a crossable dipole graph. For example, the server 100 may select one or more roads for driving from the user's current location to the destination using the crossable dipole graph, and generate the long-term driving plan connecting the selected one or more roads.
- the server 100 may establish a short-term driving plan from the current location of the user to the destination using the lattice road network data. For example, the server 100 may generate a short-term driving plan for one or more roads selected using the crossable dipole graph by connecting a plurality of lattices set for each of one or more roads selected using the crossable dipole graph.
- a method of creating a road network map to design a driving plan for an autonomous driving vehicle has been described above with reference to the flowchart illustrated in the drawings.
- the method of creating a road network map to design a driving plan for an autonomous driving vehicle has been described by showing a series of blocks, but the present invention is not limited to the order of the blocks, and some blocks may be performed in an order different from that shown and performed herein, or may be performed at the same time.
- new blocks not described in the present specification and drawings may be added, or some blocks may be deleted or changed.
- a road network map by collecting various types of information on roads located in an area to generate road network data, and using the generated road network data to automatically generate lattice road network data and a crossable dipole graph, and to more accurately design a short-term driving plan and a long-term driving plan for an autonomous driving vehicle using the built road network map.
Landscapes
- Engineering & Computer Science (AREA)
- Remote Sensing (AREA)
- Radar, Positioning & Navigation (AREA)
- Automation & Control Theory (AREA)
- Physics & Mathematics (AREA)
- General Physics & Mathematics (AREA)
- Human Computer Interaction (AREA)
- Mechanical Engineering (AREA)
- Transportation (AREA)
- Business, Economics & Management (AREA)
- Tourism & Hospitality (AREA)
- Theoretical Computer Science (AREA)
- Economics (AREA)
- Strategic Management (AREA)
- Marketing (AREA)
- General Business, Economics & Management (AREA)
- Human Resources & Organizations (AREA)
- General Health & Medical Sciences (AREA)
- Primary Health Care (AREA)
- Health & Medical Sciences (AREA)
- Traffic Control Systems (AREA)
- Navigation (AREA)
- Instructional Devices (AREA)
- Aviation & Aerospace Engineering (AREA)
- Operations Research (AREA)
Abstract
Description
Claims (10)
Applications Claiming Priority (2)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| KR10-2021-0068260 | 2021-05-27 | ||
| KR1020210068260A KR102317430B1 (en) | 2021-05-27 | 2021-05-27 | Method, server and computer program for creating road network map to design a driving plan for automatic driving vehicle |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| US20220379912A1 US20220379912A1 (en) | 2022-12-01 |
| US12208817B2 true US12208817B2 (en) | 2025-01-28 |
Family
ID=78268519
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| US17/825,578 Active 2042-11-20 US12208817B2 (en) | 2021-05-27 | 2022-05-26 | Method, server, and computer program for creating road network map to design driving plan for autonomous driving vehicle |
Country Status (5)
| Country | Link |
|---|---|
| US (1) | US12208817B2 (en) |
| EP (1) | EP4095489B1 (en) |
| JP (1) | JP7475711B2 (en) |
| KR (2) | KR102317430B1 (en) |
| CN (1) | CN115406455B (en) |
Families Citing this family (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN114906165B (en) * | 2022-03-31 | 2025-06-27 | 江汉大学 | Automatic driving vehicle running speed control method, device, electronic equipment and medium |
| CN115171371B (en) * | 2022-06-16 | 2024-03-19 | 海信集团控股股份有限公司 | Cooperative road intersection passing method and device |
Citations (23)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JP2006154967A (en) | 2004-11-25 | 2006-06-15 | Nissan Motor Co Ltd | Risk minimum trajectory generation device and danger situation warning device using the same |
| JP2007199575A (en) | 2006-01-30 | 2007-08-09 | Alpine Electronics Inc | Map data creation method, and route search method and device |
| JP2008215861A (en) | 2007-02-28 | 2008-09-18 | Xanavi Informatics Corp | Navigation device, navigation system, and route display method |
| KR20140117836A (en) | 2013-03-27 | 2014-10-08 | 국방과학연구소 | Apparatus for path planning of unmanned vehicle, and its control method |
| KR20140126500A (en) | 2013-04-23 | 2014-10-31 | 메티스정보주식회사 | Road network data generation method and apparatus performing the same |
| US20150345959A1 (en) * | 2014-05-30 | 2015-12-03 | Nissan North America, Inc. | Vehicle trajectory optimization for autonomous vehicles |
| KR20160057756A (en) | 2014-11-14 | 2016-05-24 | 한국전자통신연구원 | System for autonomous driving, method for driving car using the same |
| US20160200317A1 (en) * | 2013-08-20 | 2016-07-14 | Audi Ag | Device and method for controlling a motor vehicle |
| US20180129214A1 (en) * | 2015-05-12 | 2018-05-10 | Volkswagen Aktiengesellschaft | Determining a trajectory for a vehicle |
| US20180129203A1 (en) * | 2016-11-09 | 2018-05-10 | GM Global Technology Operations LLC | Processor-implemented systems and methods for automated driving |
| JP2018087764A (en) | 2016-11-29 | 2018-06-07 | アルパイン株式会社 | Guide route setting device and guide route setting method |
| JP2018173511A (en) | 2017-03-31 | 2018-11-08 | パイオニア株式会社 | Lane information generation device, lane information generation method, and lane information generation program |
| US20180356819A1 (en) * | 2017-06-13 | 2018-12-13 | GM Global Technology Operations LLC | Autonomous vehicle driving systems and methods for critical conditions |
| US20190079523A1 (en) * | 2017-09-11 | 2019-03-14 | Baidu Usa Llc | Dp and qp based decision and planning for autonomous driving vehicles |
| US20190250000A1 (en) | 2018-02-13 | 2019-08-15 | Baidu Usa Llc | Determining driving paths for autonomous driving vehicles based on offset points |
| US20190317505A1 (en) * | 2018-04-12 | 2019-10-17 | Baidu Usa Llc | Determining driving paths for autonomous driving vehicles based on map data |
| US20190359205A1 (en) * | 2018-05-24 | 2019-11-28 | Baidu Usa Llc | Determining driving paths for autonomous driving that avoid moving obstacles |
| US20190391585A1 (en) * | 2018-06-26 | 2019-12-26 | Baidu Usa Llc | Determining driving paths for autonomous driving using parallel processing |
| JP2020066428A (en) | 2018-10-23 | 2020-04-30 | バイドゥ ユーエスエイ エルエルシーBaidu USA LLC | Two-step reference line smoothing method for mimicking human driving behavior for autonomous driving cars |
| JP2020163974A (en) | 2019-03-29 | 2020-10-08 | マツダ株式会社 | Vehicle drive assisting system |
| US20200385024A1 (en) * | 2019-06-04 | 2020-12-10 | Aptiv Technologies Limited | Autonomous vehicle operation using linear temporal logic |
| KR20210048450A (en) | 2019-10-23 | 2021-05-03 | 주식회사 라이드플럭스 | Method, apparatus and computer program for generating map including driving route of vehicle |
| KR20210057579A (en) | 2019-11-12 | 2021-05-21 | 엘지전자 주식회사 | Path providing device and path providing method thereof |
Family Cites Families (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US9008961B2 (en) * | 2012-11-30 | 2015-04-14 | Google Inc. | Determining and displaying auto drive lanes in an autonomous vehicle |
| CN109752009B (en) | 2017-11-03 | 2023-01-06 | 华为技术有限公司 | Method and device for generating road network data in intersection area |
| KR102483716B1 (en) * | 2019-05-15 | 2023-01-02 | 주식회사 라이드플럭스 | Method and apparatus for controlling a vehicle’s driving operation using advance information |
| CN110555266B (en) * | 2019-08-30 | 2022-04-12 | 武汉中海庭数据技术有限公司 | Simulation road network data random generation method and system for simulation test |
-
2021
- 2021-05-27 KR KR1020210068260A patent/KR102317430B1/en active Active
- 2021-10-20 KR KR1020210139919A patent/KR20220160456A/en not_active Withdrawn
-
2022
- 2022-05-26 JP JP2022086370A patent/JP7475711B2/en active Active
- 2022-05-26 US US17/825,578 patent/US12208817B2/en active Active
- 2022-05-27 CN CN202210594070.9A patent/CN115406455B/en active Active
- 2022-05-27 EP EP22175830.3A patent/EP4095489B1/en active Active
Patent Citations (23)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JP2006154967A (en) | 2004-11-25 | 2006-06-15 | Nissan Motor Co Ltd | Risk minimum trajectory generation device and danger situation warning device using the same |
| JP2007199575A (en) | 2006-01-30 | 2007-08-09 | Alpine Electronics Inc | Map data creation method, and route search method and device |
| JP2008215861A (en) | 2007-02-28 | 2008-09-18 | Xanavi Informatics Corp | Navigation device, navigation system, and route display method |
| KR20140117836A (en) | 2013-03-27 | 2014-10-08 | 국방과학연구소 | Apparatus for path planning of unmanned vehicle, and its control method |
| KR20140126500A (en) | 2013-04-23 | 2014-10-31 | 메티스정보주식회사 | Road network data generation method and apparatus performing the same |
| US20160200317A1 (en) * | 2013-08-20 | 2016-07-14 | Audi Ag | Device and method for controlling a motor vehicle |
| US20150345959A1 (en) * | 2014-05-30 | 2015-12-03 | Nissan North America, Inc. | Vehicle trajectory optimization for autonomous vehicles |
| KR20160057756A (en) | 2014-11-14 | 2016-05-24 | 한국전자통신연구원 | System for autonomous driving, method for driving car using the same |
| US20180129214A1 (en) * | 2015-05-12 | 2018-05-10 | Volkswagen Aktiengesellschaft | Determining a trajectory for a vehicle |
| US20180129203A1 (en) * | 2016-11-09 | 2018-05-10 | GM Global Technology Operations LLC | Processor-implemented systems and methods for automated driving |
| JP2018087764A (en) | 2016-11-29 | 2018-06-07 | アルパイン株式会社 | Guide route setting device and guide route setting method |
| JP2018173511A (en) | 2017-03-31 | 2018-11-08 | パイオニア株式会社 | Lane information generation device, lane information generation method, and lane information generation program |
| US20180356819A1 (en) * | 2017-06-13 | 2018-12-13 | GM Global Technology Operations LLC | Autonomous vehicle driving systems and methods for critical conditions |
| US20190079523A1 (en) * | 2017-09-11 | 2019-03-14 | Baidu Usa Llc | Dp and qp based decision and planning for autonomous driving vehicles |
| US20190250000A1 (en) | 2018-02-13 | 2019-08-15 | Baidu Usa Llc | Determining driving paths for autonomous driving vehicles based on offset points |
| US20190317505A1 (en) * | 2018-04-12 | 2019-10-17 | Baidu Usa Llc | Determining driving paths for autonomous driving vehicles based on map data |
| US20190359205A1 (en) * | 2018-05-24 | 2019-11-28 | Baidu Usa Llc | Determining driving paths for autonomous driving that avoid moving obstacles |
| US20190391585A1 (en) * | 2018-06-26 | 2019-12-26 | Baidu Usa Llc | Determining driving paths for autonomous driving using parallel processing |
| JP2020066428A (en) | 2018-10-23 | 2020-04-30 | バイドゥ ユーエスエイ エルエルシーBaidu USA LLC | Two-step reference line smoothing method for mimicking human driving behavior for autonomous driving cars |
| JP2020163974A (en) | 2019-03-29 | 2020-10-08 | マツダ株式会社 | Vehicle drive assisting system |
| US20200385024A1 (en) * | 2019-06-04 | 2020-12-10 | Aptiv Technologies Limited | Autonomous vehicle operation using linear temporal logic |
| KR20210048450A (en) | 2019-10-23 | 2021-05-03 | 주식회사 라이드플럭스 | Method, apparatus and computer program for generating map including driving route of vehicle |
| KR20210057579A (en) | 2019-11-12 | 2021-05-21 | 엘지전자 주식회사 | Path providing device and path providing method thereof |
Non-Patent Citations (4)
| Title |
|---|
| An Office Action mailed by the Japanese Patent Office on May 9, 2023, which corresponds to Japanese Patent Application No. 2022-086370 and is related to U.S. Appl. No. 17/825,578; with English language translation. |
| An Office Action mailed by the Korean Intellectual Property Office on Oct. 12, 2021 , which corresponds to Korean Patent Application No. 10-2021-0068260 and is related to U.S. Appl. No. 17/825,578. |
| An Office Action; "Notice of Reasons for Refusal," mailed by the Japanese Patent Office on Nov. 28, 2023, which corresponds to Japanese Patent Application No. 2022-086370 and is related to U.S. Appl. No. 17/825,578; with English language translation. |
| The extended European search report issued by the European Patent Office on Oct. 17, 2022, which corresponds to European Patent Application No. 17/825,578-1009 and is related to U.S. Appl. No. 17/825,578. |
Also Published As
| Publication number | Publication date |
|---|---|
| JP2022183123A (en) | 2022-12-08 |
| US20220379912A1 (en) | 2022-12-01 |
| KR102317430B9 (en) | 2022-01-17 |
| EP4095489A1 (en) | 2022-11-30 |
| JP7475711B2 (en) | 2024-04-30 |
| KR102317430B1 (en) | 2021-10-26 |
| KR20220160456A (en) | 2022-12-06 |
| CN115406455A (en) | 2022-11-29 |
| EP4095489B1 (en) | 2024-07-31 |
| CN115406455B (en) | 2025-07-11 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US10816990B2 (en) | Non-blocking boundary for autonomous vehicle planning | |
| US10515321B2 (en) | Cost based path planning for autonomous driving vehicles | |
| US10754339B2 (en) | Dynamic programming and quadratic programming based decision and planning for autonomous driving vehicles | |
| US10816985B2 (en) | Method on moving obstacle representation for trajectory planning | |
| CN113066298B (en) | Vehicle travel control method, device, vehicle, server, and storage medium | |
| US20230358554A1 (en) | Routing graph management in autonomous vehicle routing | |
| US20190001986A1 (en) | Surrounding environment recognition device and computer program product | |
| EP3786586B1 (en) | Path planning for autonomous and semi-autonomous vehicles | |
| US20160178381A1 (en) | Method and apparatus for providing a steering reliability map based on driven curvatures and geometry curvature | |
| US12208817B2 (en) | Method, server, and computer program for creating road network map to design driving plan for autonomous driving vehicle | |
| KR102507804B1 (en) | Method, apparatus and computer program for generating driving route of autonomous vehicle | |
| EP3786587B1 (en) | Path planning for autonomous and semi-autonomous vehicles | |
| US9778052B2 (en) | Routing with data version stitching | |
| JP7376992B2 (en) | Information processing device, information processing method, and program | |
| US20210188308A1 (en) | A qp spline path and spiral path based reference line smoothing method for autonomous driving | |
| US20210356965A1 (en) | Vehicle routing using third party vehicle capabilities | |
| US12437557B2 (en) | Method, apparatus, and computer program for extracting traffic signal information through image data analysis including traffic light | |
| KR102606632B1 (en) | Method, apparatus and computer program for modifying driving route of autonomous vehicle based on artificial intelligence | |
| US20220032949A1 (en) | Routing feature flags | |
| KR102523146B1 (en) | Method, apparatus and computer program for modeling driving route for automatic driving of vehicle | |
| KR102643539B1 (en) | Method, computing device and computer program for controlling autonomous vehicle speed capable of responding to uncomfortable region | |
| CN114323044B (en) | A path planning method, device, equipment and storage medium | |
| US20250242808A1 (en) | Method of generating speed profile for speed control of autonomous vehicle, computing device, and recording medium | |
| KR102806626B1 (en) | Method, apparatus and computer program for providing user interface for driving guide of autonomous vehicle | |
| KR102643540B1 (en) | Method, computing device and computer program for preventing collision of an autonomous vehicle |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| AS | Assignment |
Owner name: RIDEFLUX INC., KOREA, REPUBLIC OF Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNORS:KIM, JIWOONG;CHO, HIMCHAN;YUN, HO;REEL/FRAME:060029/0262 Effective date: 20220526 |
|
| FEPP | Fee payment procedure |
Free format text: ENTITY STATUS SET TO UNDISCOUNTED (ORIGINAL EVENT CODE: BIG.); ENTITY STATUS OF PATENT OWNER: SMALL ENTITY |
|
| FEPP | Fee payment procedure |
Free format text: ENTITY STATUS SET TO SMALL (ORIGINAL EVENT CODE: SMAL); ENTITY STATUS OF PATENT OWNER: SMALL ENTITY |
|
| STPP | Information on status: patent application and granting procedure in general |
Free format text: DOCKETED NEW CASE - READY FOR EXAMINATION |
|
| STPP | Information on status: patent application and granting procedure in general |
Free format text: NON FINAL ACTION MAILED |
|
| STPP | Information on status: patent application and granting procedure in general |
Free format text: RESPONSE TO NON-FINAL OFFICE ACTION ENTERED AND FORWARDED TO EXAMINER |
|
| STPP | Information on status: patent application and granting procedure in general |
Free format text: FINAL REJECTION MAILED |
|
| STPP | Information on status: patent application and granting procedure in general |
Free format text: RESPONSE AFTER FINAL ACTION FORWARDED TO EXAMINER |
|
| STPP | Information on status: patent application and granting procedure in general |
Free format text: NOTICE OF ALLOWANCE MAILED -- APPLICATION RECEIVED IN OFFICE OF PUBLICATIONS |
|
| STPP | Information on status: patent application and granting procedure in general |
Free format text: PUBLICATIONS -- ISSUE FEE PAYMENT VERIFIED |
|
| STCF | Information on status: patent grant |
Free format text: PATENTED CASE |