Global Multi-Vehicle Decision-Making System for Connected and Autonomous Vehicles in Dynamic Environments

Abstract

Connected autonomous vehicles (CAVs) have the potential to improve safety in several complex traffic scenarios, increase road throughput, and optimize energy efficiency and energy emissions. This invention describes a mixed integer programming (MIP) optimization method for global multi-vehicle decision-making and motion planning of CAVs in highly dynamic environments consisting of multiple human-operated vehicles, i.e., conventional or manually operated vehicles, and multiple conflict zones such as junctions and intersections. The proposed approach ensures safety, high throughput, and energy efficiency by solving a global multi-vehicle constrained optimization problem. By utilizing the position, speed, and destination information of manually operated vehicles that cannot be directly controlled, the solution can provide a feasible and optimal time schedule for autonomous vehicles through road sections and conflict zones. Although MIP has combinatorial complexity, the proposed formulation is still feasible for real-time implementation in infrastructures such as MECs (Mobile Edge Computers).

Description

[Technical field]

[0001] The present disclosure relates generally to control through optimization, and more particularly to a method and apparatus for global multi-vehicle decision-making and motion planning through optimization for connected and autonomous vehicles in dynamic environments within transportation networks. [Background technology]

[0002] Automated transport systems, even semi-automated ones, lead to a reduction in road accidents and a more efficient use of road networks. CAVs (Connected and Automated Vehicles) therefore show great potential to improve safety and traffic flow and, as a consequence, reduce congestion, journey times, emissions and energy consumption. This has been known for decades, but most of the successful development has been achieved in recent years thanks to technological advances in sensing, computing, control and connectivity. While driving scenarios are often highly dynamic, i.e. the vehicular participants and their behavior change quickly and significantly, Vehicle-To-Vehicle (V2V) and Vehicle-To-Infrastructure (V2I) communication (also known as Vehicle-To-Everything (V2X) communication for short) enables advanced and efficient planning and decision-making by giving access to real-time information about all vehicles in a given planning area.

[0003] There have been significant developments in planning and control for autonomous driving, which would normally require a multi-layered guidance and control architecture to be onboard. At the top level, an intelligent navigation system finds a route through the traffic network from the current vehicle position to the requested destination. For example, using automata in combination with set reachability or formal languages ​​and optimization, a decision-making unit selects the appropriate driving behavior at any given time given the route plan, the current environmental conditions, and the behavior of other traffic participants. Given a target behavior, including lane following, lane changing, or stopping, a motion planning algorithm calculates a dynamically feasible and safe trajectory that the underlying feedback controller can track in real time. A popular approach uses a combination of sampling-based motion planners and MPC (Model Predictive Control) for reference tracking. For CAVs, the guidance and control architecture may appear similar to that of standard autonomous driving, but some of the modules are implemented in the infrastructure, e.g., MEC (Mobile Edge Computer), and may provide decisions to multiple vehicles in the area, while other modules are still implemented individually on each vehicle.

[0004] Coordination of cooperative agents allows reaching a socially optimal behavior for the traffic network. An example describes the First Come, First Serve (FCFS) policy for automatic traffic management at intersections. Recently, coordination methods have been proposed for controlling intersections using nonlinear optimization or MILP (mixed integer linear programming). The latter has been extended to a distributed MILP algorithm for scheduling grids of interconnected intersections. In addition to this, a MILP-based approach has been proposed for CAVs to merge into highway on-ramps. Alternative techniques for coordinating CAVs can be found in recent studies, which also point out that the intersection and merge control problems are very similar in nature. There is a need to develop advanced global multi-vehicle decision-making systems. Summary of the Invention

[0005] The present invention focuses on global multi-vehicle decision-making and motion planning for CAVs, which provides target and maneuver information to local motion planning and tracking systems implemented separately in each autonomous vehicle, even in the presence of conventional vehicles, i.e., manually operated vehicles (also called NCVs (non-controlled vehicles)). An embodiment of the present invention includes a MILP-based global multi-vehicle decision-making system for vehicles in an interconnected network consisting of generalized conflict zones including both intersections and merging areas. Unlike conventional techniques for coordinating fully autonomous vehicles, the present invention focuses on more realistic scenarios including mixed traffic of both CAVs and human-operated NCVs. For this purpose, physical traffic lights and / or standard priority rules are required for human-operated vehicles to cross intersections in mixed traffic scenarios. The proposed constrained optimization method directly incorporates people and goods movement, given a set of real-time vehicle routing information from a higher-level algorithm.

[0006] The embodiments of the present invention are based on a mixed integer optimization method for global multi-vehicle decision making and motion planning for CAVs (connected and autonomous vehicles) in an interconnected network consisting of generalized conflict zones including both intersections and merging zones, even in the presence of conventional vehicles, i.e. manually operated vehicles (also called NCVs (non-controlled vehicles)). The proposed approach computes a schedule consisting of target speeds and target entry and exit times for a road segment in a prediction window for each vehicle towards a desired destination, subject to the safety constraints of the conflict zones and the occupancy duration constraints of the road segment, while optimizing the overall time and energy efficiency across all controlled vehicles. In contrast to existing approaches in the prior art, the proposed system and method address the following: • A traffic network containing multiple conflict zones, i.e. one or more junctions and / or intersections. Mixed autonomous and human-driven traffic, where the position, speed, and heading of each vehicle are available through V2X communication, but only a portion of the vehicle fleet is controlled in localized areas consisting of multiple interconnected conflict zones. • Global multi-vehicle decision making and motion planning based on multiple objectives, e.g., optimization of travel time, latency, and energy efficiency. Coarse-grained, high-level motion planning for CAVs using future routing information for transporting people and goods.

[0007] Some embodiments of the present invention are based on a multi-layer guidance and control architecture, in which some modules are implemented on each CAV to take advantage of V2X connectivity, while other modules run centrally in the infrastructure, e.g., mobile edge computers. Specifically, in each CAV, a motion planning algorithm calculates a dynamically feasible and safe trajectory that the vehicle controller can follow in real time, given a target behavior that represents an action such as lane following, lane changing, or stopping. Some embodiments are based on a probabilistic sampling-based motion planner in each CAV, and an MPC algorithm for reference tracking.

[0008] Unlike fully autonomous vehicles, embodiments of the present invention are based on the recognition that for CAVs, the target behavior for the motion planning algorithm should not be calculated separately for each vehicle by an on-board decision-making algorithm, but rather should be calculated simultaneously for all vehicles in a global multi-vehicle decision-making module. Specifically, the global multi-vehicle decision-making module determines the target behavior for all CAVs in a local area simultaneously, given real-time information about the environment from the mapping and navigation module, e.g., real-time status and routing information for each CAV in the local area consisting of multiple interconnected conflict zones. Note that the routing information for each CAV may be calculated by a centralized mapping and navigation module or individually by the on-board mapping and navigation module for each local CAV.

[0009] An embodiment of the invention coordinates and schedules vehicles within a network of road segments, the network consisting of one or more road segments that are conflict zones and one or more road segments that are non-conflict zones. Examples of conflict zones are intersections and / or junctions that connect multiple lanes and / or road segments. Examples of non-conflict zones are standard road segments consisting of one or more lanes that allow either one-way traffic or multiple directions of traffic.

[0010] Embodiments of the present invention are based on the recognition that information for the global multi-vehicle decision-making module is available through data acquired by sensors on both the CAVs and NCVs, and possibly additional sensors on the infrastructure, communicated between the vehicles and the infrastructure, i.e., V2X communication. Specifically, input information from V2X communication to the global multi-vehicle decision-making system may include: • Mapping information of the traffic network, including lane information for each road segment and each conflict zone, i.e. junctions and / or intersections, taken into account by the global decision-making module. • The current status of vehicles, both CAVs and NCVs, in a local area of ​​the transport network, for each vehicle, including for example current location, heading and speed. For each NCV, a possibly short-term route prediction defined as the sequence of upcoming road segments starting from the road segment on which the NCV is currently located towards its desired destination. The length of the route in the route prediction, i.e. the number of road segments, may be fixed or may vary with time depending on the available information. A relatively long-term route plan for each CAV, determined as a sequence of future road segments starting from the road segment on which the CAV is currently located towards its desired destination. The length of the planned route, i.e. the number of road segments included in the future route plan, may be fixed or may vary over time, depending on the information available from the mapping and navigation module of each CAV. A set of planned stopping periods for each CAV and for each road section included in its future planned route, e.g. for transporting people and / or goods along that route.

[0011] Similarly, output information from the global multi-vehicle decision-making system may include: • For each CAV, a set of predicted average speeds for the road sections along its future planned route in the transport network. • For each CAV, a set of predicted entry times for road sections along its future planned route in the transport network. • For each CAV, a set of predicted exit times for road sections along its future planned route in the transport network.

[0012] Depending on the information available to the global multi-vehicle decision-making system, the length of the prediction window for all vehicles, i.e. the length of the route, may be determined to be a constant length, may be determined individually for each vehicle, may be determined to be a time-varying length, or may be determined to be different for each vehicle.

[0013] Embodiments of the present invention are based on the recognition that, depending on the infrastructure system, obtaining accurate predictions for each NCV's route may be a challenging task. For this reason, in some embodiments of the present invention, the global multi-vehicle decision-making module is implemented with a receding horizon approach based on recent information. Embodiments of the present invention are based on the recognition that approximate short-term route predictions of the NCVs are sufficient, for example, until the next conflict zone, and discrepancies in the predictions can be accommodated by an intrinsic feedback mechanism of the receding horizon approach. An update period of, for example, 1-2 seconds, allows real-time computation of the global multi-vehicle decision-making system while providing updates that are fast enough to account for erroneous predictions of the NCVs' behavior.

[0014] Some embodiments of the present invention are based on the recognition that the presence of other traffic participants, including, for example, bicycles and pedestrians, may be treated as obstacles by on-board modules in a multi-layer guidance and control architecture for each CAV, e.g., motion planning and / or vehicle control algorithms. With a computational cost relatively smaller than that of a global multi-vehicle decision-making system, the motion planning and vehicle control algorithms can operate at a relatively fast sampling rate in order to have a fast reaction time to unexpected changes in the behavior of other traffic participants, including, for example, bicycles and pedestrians. For example, vehicle control algorithms often run with an update period of 50-100 milliseconds.

[0015] The proposed global multi-vehicle decision-making module is targeted at small to medium-sized traffic networks, e.g., local areas consisting of multiple interconnected conflict zones with potential congestion. Some embodiments of the invention include transport tasks of people and / or goods, e.g., groceries or parcels, performed by CAVs, utilizing a potentially variable number of CAVs operating in the same environment with potentially many non-controlled traffic participants. Task assignment, i.e., the objectives that each CAV must achieve, can be performed by a separate task assignment module, e.g., based on the solution of a constrained optimization problem. Based on the assigned tasks, the navigation module determines the route of the CAVs, either centrally or locally at each CAV, and the route information can be updated in real time. Considering the computational tractability, including receding horizon calculations, and the effectiveness in practical applications, embodiments of the invention can address at least 1-10 CAVs and 0-30 NCVs in a local traffic network consisting of up to 10 conflict zones and several interconnected road sections.

[0016] The embodiments of the present invention are based on the recognition that the global multi-vehicle decision-making module may be implemented by solving a constrained optimization problem to compute a coarse-grained motion plan for each CAV given input information from V2X communications. In some embodiments of the present invention, the constrained optimization problem may be a MIP (mixed integer programming) problem, for example a MILP (mixed integer linear programming) or a MIQP (mixed integer quadratic programming) problem. In some embodiments of the present invention, the MIP problem at each sampling time of the global multi-vehicle decision-making system may be solved by a global optimization algorithm, including, for example, branch and bound, branch and cut, and branch and price. In other embodiments of the present invention, heuristic techniques may be used to compute a feasible but sub-optimal solution to the MIP, including, for example, rounding methods, feasibility pumping, approximate optimization algorithms, or using machine learning.

[0017] Further, according to some embodiments of the present invention, a global multi-vehicle decision-making system may be implemented to provide real-time motion planning and coordination for one or more connected autonomous and / or semi-autonomous vehicles (CAVs) in an interconnected traffic network including one or more uncontrolled vehicles (NCVs), one or more conflict zones, and one or more non-conflicting road segments. In this case, the global multi-vehicle decision-making system may include a receiver configured to acquire infrastructure sensing signals via roadside units (RSUs), acquire type-1 feedback signals about the status and planned future routing information of the connected autonomous vehicles (CAVs) toward one or more desired destinations, and acquire type-2 feedback signals about the status and predicted future routing information of the uncontrolled vehicles (NCVs), at least one memory configured to store mapping information and a computer executable program including a global multi-vehicle decision-making program, and at least one processor coupled to the at least one memory and configured to execute steps, the steps including: determining whether the infrastructure sensing signals, the type-1 feedback signals, the type-2 feedback signals, the type-3 feedback signals, the type-4 feedback signals, the type-5 feedback signals, the type-6 feedback signals, the type-7 feedback signals, the type-8 feedback signals, the type-9 feedback signals, the type-1 feedback signals, the type-2 feedback signals, the type-1 feedback signals, the type-2 feedback signals, the type-3 feedback signals, the type-4 feedback signals, the type-5 feedback signals, the type-6 feedback signals, the type-7 feedback signals, the type-8 feedback signals, the type-9 feedback signals, the type-1 ...8 feedback signals, the type-9 feedback signals, The global multi-vehicle decision-making system includes the steps of: formulating a global mixed-integer programming (MIP) problem based on the feedback signals, and the mapping information; calculating a motion plan for each CAV and each NCV in the interconnected transportation network by solving the global MIP problem; calculating a set of optimal entry and exit times and a set of average speeds for each CAV and each NCV for each road section along a planned or predicted future route in the transportation network; and calculating a speed distribution and / or one or more planned stops for each CAV over a predicted time range, and the global multi-vehicle decision-making system further comprises a transmitting unit configured to transmit, to each of the CAVs, the speed distribution and / or the one or more planned stops to a multi-layer guidance and control architecture of each CAV in the interconnected transportation network.

[0018] In some embodiments of the global multi-vehicle decision-making system, the optimization problem includes optimizing one or more objectives, enforcing one or more equality and / or inequality constraints for safety and efficiency of all vehicles in the transportation network. For example, the constraints may include vehicle motion models, speed constraints, timing constraints for route planning or route prediction, safety constraints in conflict zones, and occupancy duration constraints for non-conflicting road segments. These objectives may include minimizing the travel time to reach the end of each leg in the route planning or route prediction, minimizing waiting time per vehicle, maximizing average speed, and minimizing acceleration for energy efficiency.

[0019] The presently disclosed embodiments will be further described with reference to the accompanying drawings, in which the drawings are not necessarily to scale, with emphasis instead generally being placed upon illustrating the principles of the presently disclosed embodiments. [Brief description of the drawings]

[0020] [Figure 1] FIG. 1 illustrates an example traffic scenario in a local area consisting of multiple interconnected conflict zones and the need for global multi-vehicle decision-making of controlled and uncontrolled vehicles, according to some embodiments. [Figure 2A] FIG. 1 illustrates an exemplary schematic diagram of controlling traffic in a local area of ​​multiple interconnected conflict zones based on vehicle section traversal time and average speed, according to some embodiments. [Figure 2B] FIG. 1 illustrates a traffic scenario in a local area of ​​interconnected conflict zones and routing information for multiple connected and autonomous vehicles, for example for transporting people and goods, according to some embodiments. [Diagram 3]1 illustrates a schematic diagram of possible interactions between a global multi-vehicle decision-making system and a mapping and navigation system, one or more controlled and uncontrolled vehicles, one or more roadside units, one or more passengers, and one or more mobile edge computers in accordance with some embodiments of the present invention. [Figure 4A] FIG. 1 shows a schematic diagram of a feedback loop for a global multi-vehicle decision-making system based on infrastructure sensing for each individual controlled vehicle, centralized mapping and navigation, and a multi-layer guidance and control architecture according to some embodiments of the present invention. [Figure 4B] FIG. 2 shows a similar schematic diagram of a feedback loop of a global multi-vehicle decision-making system utilizing individual navigation systems of one or more controlled vehicles, according to some embodiments of the present invention. [Figure 5A] FIG. 1 shows a block diagram of a global multi-vehicle decision-making system based on communication with infrastructure and / or connected vehicles by solving a mixed integer optimization problem according to an embodiment of the invention. [Figure 5B] FIG. 2 shows a schematic diagram of inputs and outputs of a global multi-vehicle decision-making system according to an embodiment of the present invention. [Figure 6A] FIG. 1 illustrates an example of a traffic network (within a local area) composed of multiple non-conflicting road segments interconnected via three-way intersections, each of which is composed of one or more travel lanes. [Figure 6B] FIG. 6B shows examples of possible routes for each of two vehicles in the interconnected transportation network shown in FIG. 6A. [Figure 6C] FIG. 6C illustrates an example of a motion plan that a global multi-vehicle decision-making system may compute for the vehicles depicted in the transportation network of FIG. 6B in accordance with an embodiment of the present invention. [Figure 7] FIG. 1 is a block diagram of a global multi-vehicle decision-making system by solving a MIP (Mixed Integer Programming) optimization problem according to an embodiment of the present invention. [Figure 8A] FIG. 2 illustrates examples of equality and / or inequality constraints that may be observed by a MIP problem solved by a global multi-vehicle decision-making system, according to an embodiment of the present invention. [Figure 8B] FIG. 2 illustrates an exemplary formulation of safety constraints for each of the conflict zones that may be utilized in a MIP problem solved by a global multi-vehicle decision-making system, according to an embodiment of the present invention. [Figure 8C] FIG. 2 illustrates an exemplary formulation of per road segment occupancy duration constraints that may be utilized in a MIP problem solved by a global multi-vehicle decision-making system, in accordance with an embodiment of the present invention. [Figure 8D] FIG. 2 illustrates example objectives that may be used in a weighted multi-objective minimization of a MIP problem solved by a global multi-vehicle decision-making system, according to an embodiment of the present invention. [Figure 9A] FIG. 2 is a schematic diagram of an example integer optimization variable search tree, representing a nested tree of search spaces for integer feasible optimal solutions of global multi-vehicle decision-making, according to some embodiments of the present invention. [Figure 9B] FIG. 2 is a block diagram of a branch-and-bound mixed integer optimization algorithm for searching integer feasible optimal decision solutions based on a nested tree of search spaces and corresponding upper / lower bounds, according to some embodiments of the present invention. [Figure 10] FIG. 1 illustrates a block diagram of a global multi-vehicle decision-making system for computing motion plans for one or more controlled vehicles in a transportation network consisting of one or more interconnected conflict zones, according to some embodiments of the present invention. [Figure 11A] FIG. 1 illustrates a schematic diagram of a vehicle with a multi-layer guidance and control architecture employing principles of some embodiments. [Figure 11B] FIG. 2 illustrates a schematic diagram of a multi-layer guidance and control architecture and its interaction with other controllers in a vehicle, according to some embodiments of the present invention. [Figure 12A]FIG. 2 illustrates an overview of the interaction between a shipping yard management system and a global multi-vehicle decision-making system, according to some embodiments of the present invention. [Figure 12B] FIG. 1 illustrates an example of a shipping yard management system that is composed of one or more components according to some embodiments of the present invention. DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENTS

[0021] Some embodiments of the present disclosure provide systems and methods for controlling one or more connected autonomous vehicles in a traffic network comprised of one or more interconnected conflict zones, the traffic network potentially including a dynamic environment, such as one or more uncontrolled vehicles, traffic participants, or dynamic obstacles.

[0022] FIG. 1 illustrates an example traffic scenario 100 illustrating the need for global multi-vehicle decision-making of controlled and uncontrolled vehicles within a local area of ​​multiple interconnected conflict zones, e.g., at interconnected intersections of road sections, according to some embodiments. The interconnected conflict zones include physically interconnected conflict zones and communicatively interconnected conflict zones. An example of physically interconnected conflict zones is an intersection or junction where vehicles may proceed from one conflict zone to another. An example of communicatively interconnected conflict zones is an intersection or junction that shares traffic information from one conflict zone to another conflict zone via a communication channel.

[0023] The example traffic scenario 100 shows an intersection 102 and another intersection 104 that are physically interconnected with each other via road section 105, with the traffic network including additional road sections 106, 108, 110, 112, 114, and 116. An embodiment of the invention describes a system and method for global multi-vehicle decision-making for vehicles in such a network of road sections, with one or more road sections being conflict zones and one or more road sections being conflict-free zones. Examples of conflict zones can be intersections 102-104 and / or junctions, connecting multiple lanes and / or multiple road sections. Examples of conflict-free zones are standard road sections 105-116, consisting of one or more lanes that allow traffic in either one or multiple directions.

[0024] FIG. 1 further illustrates a number of vehicles 126, 128, 130, 132, 134, 136, 138, 140, 142, 144, 146 and / or other traffic participants within a local area consisting of a number of interconnected conflict zones 102-104 and a number of interconnected non-conflict road sections 105-116. The vehicles in the traffic network, for example, the vehicles 126-146, may each be either an autonomous vehicle, a semi-autonomous vehicle, or a human-operated vehicle. Hereinafter, the autonomous vehicles and / or semi-autonomous vehicles will be referred to as CAVs (connected autonomous vehicles) or simply as controlled vehicles, and the human-operated vehicles or other traffic participants will be referred to as non-controlled vehicles (NCVs). Some examples of the vehicles 126-146 include two-wheeled vehicles such as motorcycles, four-wheeled vehicles such as cars, or vehicles with five or more wheels such as trucks.

[0025] A traffic network including one or more interconnected conflict zones and one or more interconnected non-conflict road segments may further include one or more RSUs (Road Side Units) for infrastructure-based real-time sensing of the status of vehicles and other traffic participants in the surrounding local area. Figure 1 illustrates one RSU 122 and another RSU 124, a core network 120, and a cloud network 118 for establishing an Internet of Vehicles (IoV) environment including Vehicle-To-Vehicle (V2V) and Vehicle-To-Infrastructure (V2I) communications, also known as Vehicle-To-Everything (V2X) communications, according to some embodiments of the present invention.

[0026] In some embodiments, the traffic scenario 100 corresponds to a public metropolitan area where road segments 105-116 form multiple (many) intersections, such as intersections 102 and 104. In a metropolitan area, the traffic conditions at the intersections 102 and 104 determine the traffic flow because congestion usually originates from a conflict zone, such as intersection 104, and propagates further to non-conflicting road segments, e.g., road segments 105-116. The traffic conditions in the interconnected conflict zones 102 and 104 are interdependent such that the amount of change in one conflict zone, e.g., intersection 104, propagates further to other interconnected conflict zones, such as intersection 102 (referred to as the neighboring intersections 102 of intersection 104).

[0027] In other embodiments, the traffic scenario 100 may correspond to a privately owned traffic network, for example, including one or more parking lots and interconnected road segments for a valet parking system. Other examples of similar traffic scenarios including traffic networks with multiple interconnected conflict zones and road segments are smart distribution centers and / or shipping yards. Types of CAVs include personal vehicles (e.g., for a valet parking system), trucks (e.g., for a yard management system), or shuttles for picking up or dropping off passengers.

[0028] Some embodiments are based on the realization that to establish communication between various vehicles (e.g., a set of vehicles 126-146) in a traffic network, communication between the cloud network 118 and the vehicle 126 on the road section 105 needs to propagate in a manner that establishes multi-hop communication between the RSUs 122 or 124 and the core network 120. In some embodiments of the invention, the secure mobility of the vehicles 126-146 is controlled by a global multi-vehicle decision-making system that utilizes a cloud-based network and / or an edge-based network (i.e., that utilizes the cloud network 118 and / or the core network 120). In some embodiments of the invention, the global multi-vehicle decision-making system is implemented using one or more MECs (Mobile Edge Computers). The one or more MECs may be incorporated as part of one or more RSUs or may be separate devices connected to the RSUs 122-124, the cloud network 118, and / or the core network 120. An embodiment of the present invention may include the solution of a constrained optimization problem for global multi-vehicle decision-making for vehicles in a transportation network, where the computation of the solution may be performed in the cloud or in one or more MECs.

[0029] The embodiment of the present invention is based on the recognition that an on-board control device of a vehicle such as vehicle 146 cannot obtain information about nearby vehicles (such as vehicle 142), pedestrians, and environmental conditions that are outside of the visual range. For example, vehicle 146 traveling on road 114 intends to cross intersection 102 after vehicle 144 (larger than vehicle 142) has crossed intersection 102, and vehicle 142 (i.e., a small vehicle) is also entering intersection 102. In such a scenario, the view of vehicle 142 is blocked by vehicle 144 shown in FIG. 1. If the communication link between vehicle 142 and vehicle 146 is affected or if vehicle 142 and vehicle 146 utilize different communication protocols, vehicle 144 will prevent vehicle 142 from being noticed by vehicle 146. As a result, vehicle 142 and vehicle 146 may collide.

[0030] In addition, some embodiments of the present invention are based on the recognition that multi-hop communication between the cloud network 118 and the vehicle 126 may result in long communication delays that are unacceptable in real-time scenarios of cloud-based vehicle control.

[0031] Some embodiments recognize that various communication technologies are available to support vehicular communications, such as the IEEE Dedicated Short-Range Communications / Wireless Access in Vehicular Environments (DSRC / WAVE) family of standards for in-vehicle networks, 3GPP Cellular-Vehicle-to-Anything (C-V2X), etc. However, due to high costs, it is not feasible for vehicles (e.g., vehicles 126-146) to support more than one short-range communication technology, leading to compatibility issues between vehicles communicating with each other. Thus, vehicles equipped with IEEE DSRC / WAVE cannot communicate with other vehicles equipped with 3GPP C-V2X, and vehicles equipped with 3GPP C-V2X cannot communicate with other vehicles equipped with IEEE DSRC / WAVE. As a result, the impact on the accuracy rate of real-time control decisions by the in-vehicle multi-layer guidance and control architecture in each vehicle is significant, since these real-time decisions are based on incomplete information of the traffic scenario 100. Instead, embodiments of the present invention use a global multi-vehicle decision-making module based on real-time information from each vehicle in the traffic network to ensure safety, time and energy efficiency.

[0032] Some embodiments are based on the recognition that edge infrastructure devices (e.g., RSU 122 and RSU 124) have advantages in controlling multi-vehicle traffic over only using cloud networks and / or only using on-board devices (including multi-layer guidance and control architectures). For example, edge infrastructure devices can be installed at intersections or junctions and can directly communicate with vehicles (e.g., vehicles 126-146) approaching the intersection or junction. In addition, the edge infrastructure devices can be equipped with multiple communication technologies to be able to communicate with all connected vehicles. Some embodiments of the present invention are based on the recognition that edge infrastructure devices are stationary, which allows them to provide reliable communication with vehicles and collect relatively high quality environmental data.

[0033] The embodiments of the present invention are based on the recognition that edge infrastructure devices can continuously monitor multi-vehicle traffic and environment for accurate decision making. In some embodiments of the present invention, the edge infrastructure devices utilize additional sensors, such as range finders, radar, lidar, and cameras, and sensor fusion techniques, to accurately detect the state and dynamic environment of vehicles, including both connected and non-connected vehicles, autonomous vehicles, semi-autonomous vehicles, and human-operated vehicles, as well as other traffic participants such as bicycles and pedestrians. Therefore, it is appropriate to utilize edge infrastructure devices for global multi-vehicle decision making and motion planning.

[0034] 2A illustrates an example of a traffic network including multiple interconnected conflict zones, i.e., multiple interconnected intersections 200, 202a, 202b, 204a, and 204b. The overall safety, time efficiency, and energy efficiency of traffic flow in this traffic network can be controlled by a global multi-vehicle decision-making system according to embodiments of the present invention. In some embodiments of the present invention, the global multi-vehicle decision-making system calculates a coarse-grained motion plan for each CAV in the traffic network along its route from the CAV's current location to the CAV's desired destination. The coarse-grained motion plan may include a set of entry and exit times and a set of average speed values ​​for the CAV in each of the conflict zones and non-conflict road segments along the route from each CAV's current location to its desired destination (possibly including one or more planned stops along the CAV's route).

[0035] In some embodiments of the invention, inputs to the global multi-vehicle decision-making system may include signals from communication with one or more CAVs and / or one or more NCVs, and may include signals from communication with one or more edge infrastructure devices, e.g., RSUs with additional sensors and sensor fusion capabilities. For example, in FIG. 2A, intersections 200, 202a, 202b, 204a, and 204b are each equipped with RSUs 206, 208, 210, 212, and 214. Some embodiments of the invention include a solution of a constrained optimization problem for global multi-vehicle decision-making of vehicles in a traffic network. The computation of the solution may be performed in the cloud or in one or more MECs, which may be incorporated as part of one or more RSUs 206, 208, 210, 212, and 214, or may be separate devices connected to one or more RSUs 206-214.

[0036] In the example scenario shown in FIG. 2A, north-south traffic at intersections 202a and 202b is much more congested than east-west traffic at intersections 204a and 204b. The global multi-vehicle decision-making system controls the planned future timing and speed trajectory of a vehicle (e.g., vehicle 216) that plans to cross intersection 200 and travel toward the north-south direction of highly congested intersection 202a. To improve the overall safety, time efficiency, and energy efficiency of traffic flow in the transportation network, the global multi-vehicle decision-making system may determine that vehicle 216 should reduce its speed before and / or after crossing intersection 200 so that vehicle 216 is predicted to arrive at intersection 202a later in order to alleviate congestion at intersection 202a and reduce the total waiting time of one or more of the vehicles in the transportation network.

[0037] FIG. 2B illustrates an exemplary traffic scene of a global multi-vehicle decision-making system according to some embodiments of the present invention in a traffic network consisting of multiple interconnected intersections and junctions. FIG. 2B illustrates a scenario with one or more controlled vehicles, e.g., 231, 232, 233, and 234, referred to as CAVs, and includes one or more uncontrolled traffic participants, such as NCVs 235, 236, 237, and 238. The traffic network itself may consist of multiple interconnected intersections, such as 251 (I1), 252 (I2), and 253 (I3), and multiple interconnected junctions, such as 255 (M1), 256 (M2), and 257 (M3). In the description of the embodiments of the present invention, both intersections and junctions are referred to as conflict zones. The conflict zones are interconnected by multiple non-conflict road sections. The non-conflicting road segments may each consist of one or more lanes, e.g., 265 (L6), 266 (L47), and 267 (L36). In addition, Figure 2B displays stop lines, e.g., 261 (S1), 262 (S2), and 263 (S3), that in some cases indicate locations for vehicles to wait for a particular period of time before entering the intersection.

[0038] FIG. 2B further illustrates routing information that may be provided by a routing or navigation module for each CAV, e.g., vehicle 231. For vehicle 231 at a current location 240 and with a desired destination 249, the routing or navigation module provides a series of roads and turns indicated by arrows 241-248 for vehicle 231. Similarly, the same centralized or different individual routing or navigation modules may provide a series of roads and turns from the current locations of other vehicles, e.g., CAVs 232, 233, and 234, to their desired destinations. Note, however, that the series of roads and turns 241-248 in and of itself does not yet specify a motion plan or path for vehicle 231. There are numerous discrete decisions to be made, such as which lane the vehicle should travel in, whether the vehicle should change lanes or stay in its current lane, whether the vehicle should begin to slow down to stop at a stop line, whether the vehicle may cross an intersection, etc. Furthermore, there are numerous continuous decisions to be made, such as a series of timed positions and orientations the vehicle should achieve on its journey from its initial point to its destination. These decisions are highly dependent on the current traffic at the time the vehicle reaches the corresponding location, which is largely unknown to the routing module due to the uncertainty of traffic behavior and the uncertainty of when the vehicle will arrive at the location.

[0039] In some embodiments of the present disclosure, a motion plan including a sequence of one or more of the aforementioned discrete and / or continuous decisions along a route from a current location of one or more CAVs, e.g., 231-234, to a desired destination may be computed by a global multi-vehicle decision-making system. In some embodiments of the present invention, the global multi-vehicle decision-making system relies on real-time communication to enable coordination between vehicles (V2V) and / or communication between a smart infrastructure system and vehicles (V2X). In some embodiments of the present invention, the global multi-vehicle decision-making system computes the motion plan for each CAV by solving one or more constrained optimization problems, e.g., a constrained mixed integer programming problem.

[0040] According to some embodiments, the target of the global multi-vehicle decision-making module is a small to medium-sized traffic network, e.g., a local (public or private) area consisting of multiple interconnected conflict zones. Some embodiments of the present invention include the transportation of people and / or goods performed by CAVs, e.g., picking up and dropping off passengers, groceries or other parcels, utilizing a potentially variable number of CAVs operating in the same environment with potentially many non-controlled traffic participants. Task assignment, i.e., the objectives that each CAV must achieve, may be performed by a separate task assignment module, e.g., based on the solution of a potentially large constrained (mixed integer) optimization problem. Based on the assigned tasks, the navigation module determines routes for each CAV, either centrally or locally at each CAV, and the route information may be updated in real time. Considering the computational tractability, including receding horizon calculations, and the effectiveness in practical applications, embodiments of the present invention can address at least 1-10 CAVs and 0-30 NCVs in a local traffic network consisting of up to 10 conflict zones and several interconnected road sections.

[0041] 3 is a schematic diagram of possible interactions between a global multi-vehicle decision-making system 300 and a mapping and navigation system 310, one or more controlled vehicles (CAVs) 330 and uncontrolled vehicles (NCVs) 340, one or more RSUs (roadside units) 350, one or more human machine interfaces (HMIs) 360, and / or one or more mobile edge computers (MECs) 320. According to some embodiments of the invention, the mapping and navigation system calculates real-time routing information from a current location of each CAV to a desired destination or set of desired destinations in a centralized or distributed manner (e.g., on a device integrated as part of the CAV). This routing information may be transmitted from the mapping and navigation module to the global multi-vehicle decision-making system 311 and / or to the individual CAVs 331. Similarly, the mapping and navigation system may receive updates from either the global multi-vehicle decision-making system 311 and / or the individual CAVs 331.

[0042] According to some embodiments of the present invention, the global multi-vehicle decision-making system calculates a coarse-grained motion plan for each CAV in the traffic network along a route from the CAV's current location to the CAV's desired destination, or a set of desired destinations. This motion plan is then transmitted directly 332 from the global multi-vehicle decision-making system to each of the control vehicles (CAVs), or alternatively indirectly by communication with one or more MECs 301 that provide the CAVs 330 with up-to-date information from the global multi-vehicle decision-making system. Similarly, according to embodiments of the present invention, the global multi-vehicle decision-making system relies on real-time information that may be transmitted directly from the CAVs 330, NCVs 340, RSUs 350, and HMIs 360, or indirectly from the MECs 320 via 301. In some embodiments of the present invention, the MECs may collect real-time information about the status of traffic participants and dynamic environmental conditions in a local area of ​​the traffic network by communicating with the CAVs 330, NCVs 341, RSUs 351, and human passengers 361 currently present in the local area of ​​the traffic network.

[0043] Some embodiments of the present invention are based on the recognition that the number of MECs 320, CAVs 330, NCVs 340, RSUs 350, and HMIs 360 may be different at each control time step of the global multi-vehicle decision-making system 300. Most importantly, the number of NCVs and HMIs may change significantly as traffic participants and potential passengers enter and exit the traffic network in which the global multi-vehicle decision-making system operates.

[0044]

number

[0045] Some embodiments of the present invention are based on the recognition that planning and control for (semi-)automated driving can be effectively implemented using a multi-layer guidance and control architecture (which would normally be implemented on each vehicle) that includes one or more layers of algorithms and techniques for decision-making, motion planning, vehicle control and / or estimation. For example, using optimization for automaton and vehicle decision-making combined with set reachability or formal languages, the decision-making layer 411 of the CAV vehicle 410 selects an appropriate driving behavior at every instant in time, given the motion plan from the global decision-making unit 300, the current environmental situation, and the behavior of other traffic participants. Given the target behavior from the decision-making layer 411, which may include either lane following, lane changing, or stopping, the motion planning algorithm 412 aims to calculate a dynamically feasible and safe movement trajectory that can be tracked in real time by a relatively low-level (predictive) vehicle controller 413. Real-time sensor fusion and estimation using on-board and infrastructure sensing information can be performed on each vehicle, e.g., 414, to provide feedback to higher-level algorithms for decision-making, motion planning, and control. Similar, but possibly different, multi-layer guidance and control architectures may be utilized for (semi-)automated operation of other CAVs, such as 421-424 of the second vehicle 420 or 431-434 of the Nth vehicle 430.

[0046] A popular approach for (semi)automated driving uses a combination of FSM (Finite State Machine) for decision making at 411, 421, and 431, sampling-based motion planning algorithms at 412, 422, and 432, and MPC (Model Predictive Control) algorithms for reference trajectory tracking at 413, 423, and 433. An example of an algorithm for sampling-based motion planning uses a stochastic particle filter to sample the input space and adds an additional correction term based on one or more driving requirements. An example of a predictive algorithm for vehicle control uses one or more iterations of SQP (Sequential Quadratic Programming) method to solve a linear time-varying or non-linear MPC problem in real time. Some embodiments of the present invention are based on the recognition that using predictive algorithms for motion planning and reference tracking control for (semi)automated driving can more effectively benefit from predictive information in the motion plan calculated by the global multi-vehicle decision-making system 300. Examples of algorithms for sensor fusion and estimation are based on Moving Horizon Estimation (MHE), Extended Kalman Filter or Linear Regression Kalman Filter, or Particle Filter.

[0047] In some embodiments of the present invention, various components of the multi-layer guidance and control architecture 411-414 are implemented on each control vehicle 410 to provide decision and / or feedback information to multiple connected vehicles in a transportation network, and some or all of the other modules such as the global multi-vehicle decision-making system 300, the mapping and navigation system 405, and the sensor fusion techniques for infrastructure sensing 401 may be implemented in the infrastructure, e.g., in the cloud and / or in one or more MECs (Mobile Edge Computers).

[0048] In some embodiments of the present invention, infrastructure sensing 401 supports one or more RSUs (Road Side Units) equipped with one or more sensors, such as range finders, radar, lidar, and cameras, as well as sensor fusion techniques, to accurately detect vehicle states and dynamic environments in a transportation network, including both connected and non-connected vehicles, autonomous, semi-autonomous, and human-operated vehicles, and other transportation participants such as bicycles and pedestrians.

[0049] Some embodiments of the present invention are based on the recognition that safety constraints for other dynamic traffic participants (i.e., not vehicles), including, for example, bicycles and pedestrians, may be handled by obstacle avoidance techniques in an on-board module of a multi-layer guidance and control architecture for each CAV, for example, by motion planning and / or vehicle control algorithms. Because of the relatively smaller computational cost than that of a global multi-vehicle decision-making system, in some embodiments of the present invention, the motion planning and vehicle control algorithms can operate at a relatively fast sampling rate, for example, to have a fast reaction time to unexpected changes in the dynamic behavior of other vehicles and / or the dynamic behavior of other traffic participants. For example, real-time vehicle control algorithms are typically run with an update period of 50-100 milliseconds.

[0050] Some embodiments of the present invention are based on the recognition that different vehicle motion models having different modeling accuracy and / or different computational complexity may be used by one or more of the components of the architecture shown in Figure 4A. For example, the motion of each vehicle in the global multi-vehicle decision-making system 300 may be described using a one-dimensional kinematic model as follows:

number

[0051] Some embodiments of the present invention are based on the recognition that a vehicle motion model with higher modeling accuracy and possibly higher computational complexity may be used by the lower components of the multi-layer guidance and control architecture shown in Figure 4A. For example, a one-dimensional kinematic model may be used in the global multi-vehicle decision-making system 300 and / or the navigation module 405, and a higher-order (non-linear) kinematic model may be used in the decision-making units 411, 421, 431, motion planners 412, 422, 432, vehicle controllers 413, 423, 433, and / or estimation algorithms 414, 424, 434 of the vehicles 410, 420, and 430, respectively, to describe the vehicle motion. Alternatively, one or more of the lower components of the multi-layer guidance and control architecture may use a higher-order (non-linear) dynamic model to describe the vehicle motion, for example based on a balance of forces and torques in the (non-linear) MPC-based vehicle controllers 413, 423, 433.

[0052] For example, in some embodiments of the present invention, a single track nonlinear vehicle model may be used in the MPC-based vehicle controller 413, 423, 433. The state of the MPC-based vehicle controller 413, 423, 433 is described by the vehicle's two-dimensional position, longitudinal and lateral velocities, yaw angle, and yaw rate. The single track vehicle model aligns the left and right wheels on each axle. In some embodiments of the present invention, a vehicle model with higher modeling accuracy and computational complexity may be used based on the double track vehicle model, for example, to accurately model the longitudinal and lateral load transfer between the four wheels of the vehicle. In some embodiments of the present invention, the Paseica magic formula may be used to model the nonlinear relationship between longitudinal and lateral tire friction forces, slip ratio, and lateral slip angle. This represents the normal saturation behavior of tire forces. Under combined slip conditions, the coupling of longitudinal and lateral tire forces may be modeled using, for example, a friction circle or a weighting function.

[0053] 4B is a similar schematic diagram of a feedback loop in the global multi-vehicle decision-making system 300 that does not include a centralized navigation module 405, but instead may have individual navigation systems 441, 442, and 443 that calculate a route from its current location to a desired destination, or to a set of desired destinations, for each of the CAVs 410, 420, and 430. In some embodiments of the invention, an individual navigation system (e.g., 441) executes on a corresponding control vehicle 410, and future planned routing information from each of the individual navigation modules 441-443 may be transmitted to the global multi-vehicle decision-making system 300.

[0054] FIG. 5A is a block diagram of a global multi-vehicle decision-making system 300 based on communication with infrastructure and / or connected vehicles (V2X) by solving a mixed integer optimal control optimization problem 510 to calculate a motion plan for global multi-vehicle decision-making of connected (semi-)autonomous vehicles in a transportation network. Inputs to the global multi-vehicle decision-making system 300 may include mapping information 501, i.e., position data (e.g., GPS data) of non-conflicting road segments, conflict zones, and driving lanes in each road segment. In addition to this, inputs to the global multi-vehicle decision-making system 300 may include feedback signals on the CAVs' states and planned routing information 505 and feedback signals on the NCVs' states and predicted routing information 506. In some embodiments of the invention, the latter feedback signals are obtained directly or indirectly from a sensing infrastructure (e.g., RSUs) and / or connected vehicles (which may be either autonomous vehicles, semi-autonomous vehicles, and / or human-operated vehicles). Feedback signals about the CAV status and planned routing information 505 may be referred to as Type 1 feedback signals. Feedback signals about the NCV status and predicted routing information 506 may be referred to as Type 2 feedback signals.

[0055] In some embodiments of the invention, the solution 510 to the mixed integer optimal control optimization problem can be used to calculate 515 an optimal set of entry and exit times and an optimal set of average speeds for each CAV and NCV for each road segment in the transportation network along the future planned route for each CAV and the future forecast route for each NCV. In some embodiments of the invention, the optimal set of times and optimal set of speeds 515 can then be used to calculate 520 a speed distribution and / or one or more planned stops over a forecast horizon for each CAV. The latter information is sent 520 to a multi-layer guidance and control architecture for each (semi-)automated CAV in the interconnected transportation network.

[0056] A traffic network may include one or more fully autonomous CAVs and / or one or more semi-autonomous CAVs. In some embodiments of the present invention, the speed distribution of the fully autonomous CAVs may be controlled by the global multi-vehicle decision-making system 300 to control the entry and exit times of the CAVs at each road segment to improve the overall safety, time efficiency, and energy efficiency of traffic flow in the traffic network. According to some embodiments of the present invention, the global multi-vehicle decision-making system 300 may control whether and when the semi-autonomous CAV is allowed to enter one or more conflict zones along a future planned route in the traffic network, but the speed distribution of the semi-autonomous CAVs cannot be directly controlled by the global multi-vehicle decision-making system 300. For example, at a particular time step, the global multi-vehicle decision-making system 300 can instruct one or more semi-autonomous CAVs to stop at a traffic intersection (using the speed distribution that each semi-autonomous CAV can determine on its own) and with additional information from the global multi-vehicle decision-making system 300 about when to safely enter the traffic intersection, but cannot directly control the speed distribution of one or more semi-autonomous CAVs on a road section of the transportation network.

[0057] Some embodiments of the invention use long-term future route planning 505 for each CAV in the global multi-vehicle decision-making system, as illustrated in FIG. 5A. Some embodiments of the invention are based on the recognition that depending on the infrastructure system, obtaining accurate future predictions for each NCV's route may prove difficult. For this reason, some embodiments of the invention implement the global multi-vehicle decision-making system 300 with a receding horizon approach based on immediate information from the sensing infrastructure (e.g., RSUs) and / or connected vehicles. Some embodiments of the invention are based on the recognition that approximate short-term future route predictions 506 are sufficient for the NCVs, which can usually be obtained relatively easily, for example, between each NCV's current location and the next conflict zone, and discrepancies in the predictions can be accommodated by the receding horizon approach's intrinsic feedback mechanism. An update period of, for example, 1-2 seconds, allows real-time computation of the global multi-vehicle decision-making system 300 while updating the multi-layer guidance and control architecture for each CAV fast enough to account for erroneous predictions of the NCV's behavior (520).

[0058] Some embodiments of the present invention are based on the recognition that the global multi-vehicle decision-making system 300 may be implemented by solving 510 a constrained optimization problem to compute a motion plan for each CAV given input information from V2X communications. In some embodiments of the present invention, the constrained optimization problem may be a MIP (mixed integer programming) problem, e.g., a MILP (mixed integer linear programming) or a MIQP (mixed integer quadratic programming) problem. In some embodiments of the present invention, the MIP problem at each sampling time of the global multi-vehicle decision-making system 300 may be solved 510 by a global optimization algorithm, e.g., including branch and bound, branch and cut, and branch and price methods. In other embodiments of the present invention, heuristic techniques may be used to compute a feasible but sub-optimal solution to the MIP, e.g., including rounding methods, feasibility pumping methods, approximate optimization algorithms, or the use of (deep) machine learning.

[0059] In some embodiments of the global multi-vehicle decision-making system 300, the constrained optimization problem 510 includes optimizing (minimizing) one or more objectives, enforcing one or more equality and / or inequality constraints for safety and efficiency of all vehicles in the transportation network. For example, the constraints may include vehicle motion models, speed limit constraints, timing constraints for future route planning or route prediction, safety constraints in conflict zones, and occupancy duration constraints on non-conflicting road segments. These objectives may include minimizing the travel time to reach the end of each segment in the future route planning or route prediction, minimizing waiting time per vehicle, maximizing average speed, and minimizing acceleration for energy efficiency.

[0060] In some embodiments of the present invention, the global multi-vehicle decision-making mixed integer optimization (minimization) problem 510 can be solved using a branch and bound (B&B) optimization method that searches for a globally optimal solution in a search space to generate optimal control signals, where B&B optimization iteratively divides the search space into a nested tree of regions to find a solution with a globally optimal (minimum) objective function value. The B&B method iteratively solves a convex relaxation to calculate lower bounds on the objective function values ​​that are within a particular region of the nested tree of regions. One or more regions may be pruned if the corresponding lower bound is greater than the currently known upper bound on the globally optimal objective function value. The upper bound on the globally optimal objective function value may be updated if an integer feasible solution is found with an objective function value that is less than the currently known upper bound on the globally optimal objective function value.

[0061]

number

[0062]

number

[0063]

number

[0064]

number

[0065]

number

[0066]

number

[0067]

number

[0068]

number

[0069] Some embodiments of the present invention are based on the recognition that there is a trade-off between minimizing the total travel time (e.g., for each vehicle on each road segment along the route) and minimizing the total waiting time of CAVs in the traffic network (e.g., for each vehicle at the end of a road segment before entering a subsequent road segment along the route). Specifically, according to some embodiments of the present invention, the global multi-vehicle decision-making system may instruct the CAVs to travel as fast as possible on each road segment along the route while still respecting all safety constraints and speed limits. This would require relatively less travel time, but would also result in relatively more waiting time. Alternatively, according to some embodiments of the present invention, to reduce the total waiting time, the global multi-vehicle decision-making system may instruct one or more CAVs to travel slower (immediately or in the future) if it predicts that the CAV will need to wait at the end of a road segment before it can safely enter a subsequent road segment along the route. Some embodiments of the present invention are based on the recognition that a motion plan may be calculated for each CAV in a transportation network using a global multi-vehicle decision-making system with different or additional objectives, such as, for example, minimizing the overall amount of acceleration and / or deceleration for each vehicle along the route, in order to optimize overall energy efficiency.

[0070] 7 shows a block diagram of a global multi-vehicle decision-making system 300 based on communication with infrastructure and / or connected vehicles (V2X) by solving 720 a MIP (mixed integer programming) problem, e.g., computing a motion plan consisting of time and speed schedules 730 for each controlled and / or semi-controlled vehicle in the traffic network. Inputs to the global multi-vehicle decision-making system 300 may include mapping information 501, i.e., position data (e.g., GPS data) of non-conflicting road segments, conflict zones, and driving lanes within each road segment. In addition to this, inputs to the global multi-vehicle decision-making system 300 may include feedback signals about sensing and (planned or predicted) routing information 705 of controlled, non-controlled, and / or semi-controlled vehicles in the traffic network. As shown in FIG. 7, according to some embodiments of the present invention, inputs to the global multi-vehicle decision-making system 300 may be used to create matrices and vectors with mixed integer programming (MIP) data to define objectives, equality constraints, and inequality constraints (710) in order to create and solve the resulting MIP problem (720).

[0071]

number

[0072] 8A illustrates examples of equality and / or inequality constraints 800 that may be observed by the MIP problem 720 solved by the global multi-vehicle decision-making system 300. In some embodiments of the invention, the MIP problem 720 may include vehicle dynamic equality constraints 801, vehicle routing inequality constraints 802, controlled and / or semi-controlled vehicle (CAV) speed limit constraints 803, NCV (uncontrolled vehicle) speed limit constraints 804, safety constraints 805 for each conflict zone, and occupancy duration constraints 806 for each road segment (conflicting and / or non-conflicting) in the transportation network.

[0073] In some embodiments of the invention, the global multi-vehicle decision-making system is based on the solution to MIP 720, which includes inverse velocities among the optimization variables, such that, for example, a one-dimensional kinematic motion model for each CAV and each NCV is defined by the linear vehicle dynamic equality constraints 801 below:

number

[0074]

number

[0075]

number

[0076]

number

[0077]

number

[0078] In some embodiments of the invention, the global multi-vehicle decision-making system is based on a solution to a MIP 720 that includes one or more speed limit constraints 803 for controlled or semi-controlled vehicles (CAVs). Some embodiments of the invention constrain the speed of each CAV to remain positive, except for parking maneuvers, where the speed alternates between positive and negative values, and the speed may be constrained to remain below a maximum allowed speed limit, which may vary for each road segment in the traffic network. For example, focusing on the inverse speed variable, the CAV speed limit constraint 803 may be expressed in the MIP 720 in an equation as follows:

number

[0079] In some embodiments of the present invention, the global multi-vehicle decision-making system is based on a solution to the MIP 720 that includes one or more speed limit constraints 804 for NCVs (uncontrolled vehicles). Some embodiments of the present invention are based on the recognition that the speed of NCVs cannot be directly controlled, and as a result, the global multi-vehicle decision-making system is not free to select a set of speed values ​​for each NCV along its predicted route. Instead, some embodiments of the present invention aim to constrain the predicted speed for each NCV to remain relatively close to the current speed values ​​provided by the state estimation and sensing module (e.g., by an RSU in the sensing infrastructure).

[0080] In some embodiments of the invention, the inverse speed variables for the NCVs correspond to predictions of the inverse average speed of each NCV on each road segment along the forecast route, for example, based on the current speed and / or acceleration values ​​of the NCVs. For example, some embodiments of the invention include the following speed limit constraints 804 for the NCVs:

number

[0081]

number

[0082]

number

[0083]

number

[0084]

number

[0085] 8D is a diagram illustrating example objectives that may be included in a weighted multi-objective minimization 850 for a MIP problem 720 solved by the global multi-vehicle decision-making system 300, according to an embodiment of the present invention. For example, the weighted multi-objective minimization function 850 for the MIP problem 720 can be interpreted as follows:

number

[0086] In some embodiments of the invention, minimizing travel time 851 in the MIP problem 720 is implemented as a sum of minimizing the entry and / or exit times for each vehicle in the transportation network. In some embodiments of the invention, minimizing travel time 851 in the MIP problem 720 is implemented as minimizing a weighted sum of the time it takes each vehicle to reach its desired destination in the transportation network. For example, in some embodiments of the invention, minimizing travel time 851 in the MIP problem 720 is interpreted as follows:

number

[0087]

number

[0088] In some embodiments of the invention, the weighted multi-objective minimization 850 of the MIP problem 720 includes, for example, minimizing the speed tracking penalty 853 of an NCV (uncontrolled vehicle) to constrain the speed for each NCV to remain relatively close to a predicted average speed of the NCV on each road segment along a future route in the transportation network. For example, in some embodiments of the invention, the MIP objective 850 includes minimizing the sum of the inverse speed variables for each NCV on each of the road segments of the transportation network.

number

[0089]

number

[0090]

number

[0091] Some embodiments of the present invention are based on the recognition that redundant optimization variables can be automatically removed by a pre-solve routine in the numerical optimization algorithm used to solve the MIP problem 720 in the global multi-vehicle decision-making system 300. In some embodiments of the present invention, one or more redundant optimization variables can be explicitly fixed to specific values ​​by adjusting corresponding simple upper and lower bounds for each redundant optimization variable of the MIP problem 720.

[0092] For example, in some embodiments of the present invention, redundant optimization variables may be fixed or removed according to simple rules such as, for example:

number

[0093]

number

[0094]

number

[0095] FIG. 9A is a schematic diagram of an example binary decision variable search tree representing a nested tree of search regions for integer feasible solutions of the MIP problem 720 in the global multi-vehicle decision-making system 300 according to some embodiments. FIG. 9A illustrates a schematic diagram of the branch-and-bound method by showing a binary search tree 900 in a particular iteration of a mixed integer optimization algorithm. The branch-and-bound method may be used to implement the global multi-vehicle decision-making system in some embodiments. The main idea of ​​the branch-and-bound method is to sequentially create partitions of the original MIP problem 720 and then try to solve these partitions, where each partition corresponds to a particular region of the discrete optimization variable search space. In some embodiments of the present invention, the branch-and-bound method selects a partition or node and selects discrete optimization variables for branching the partition into smaller partitions or search regions, resulting in a nested tree of partitions or search regions.

[0096]

number

[0097]

number

[0098] FIG. 9B illustrates a block diagram of a branch-and-bound mixed integer optimization algorithm for searching an integer feasible optimal solution based on a nested tree of search spaces and corresponding upper / lower bounds, according to some embodiments. In some embodiments, the block diagram of the branch-and-bound mixed integer optimization algorithm illustrated in FIG. 9B may be used to implement a global multi-vehicle decision-making system. The branch-and-bound method initializes the branch-and-search tree information of a MIP (mixed integer program) in a current time step 910 of the global multi-vehicle decision-making system based on the MIP data 710, which consists of matrices and vectors. In order to initialize the current time step 910 with a warm start, the initialization may further use the branch-and-search tree information and the MIP solution information of a previous time step 912. The main goal of the optimization algorithm is to make lower and upper bounds on the objective function value of the mixed integer solution. In step 911, if the difference between the lower bound and the upper bound is less than a certain tolerance value, the mixed integer optimal solution is found (955).

[0099] As long as the difference between the lower and upper bounds in step 911 is greater than a particular tolerance value and the maximum run time for the optimization algorithm has not yet been reached, the branch and bound method continues to iteratively search for a mixed integer optimal solution (955). Each iteration of the branch and bound method begins by selecting the next node in the tree, corresponding to the next region or partition of the integer variable search space, possibly fixing the variables based on a pre-solve branching technique (915). After the node is selected, the corresponding integer relaxation problem is solved, possibly fixing the variables based on a post-solve branching technique (920).

[0100] If the integer relaxation problem has a feasible solution, the resulting relaxation solution can obtain a lower bound on the objective function value for that particular region or partition of the integer variable search space. If, in step 921, it is determined that the objective is greater than the currently known upper bound on the objective function value of the optimal mixed integer solution, then the selected node is pruned or removed from the branching tree (940). However, if, in step 921, it is determined that the objective is lower than the currently known upper bound and the relaxation solution is integer feasible (925), then the currently known upper bound and the corresponding mixed integer solution estimate are updated in step 930.

[0101] If the integer relaxation problem has a feasible solution and the objective is less than the currently known upper bound (921), but the solution to the relaxation is not yet integer feasible, then the global lower bound of the objective may be updated (935) to be the minimum of the objective function values ​​of the remaining leaf nodes in the branching tree, and the selected node is pruned (940) from the tree. Additionally, discrete variables with fractional values ​​are selected for branching according to a particular branching strategy 945, starting from the current node, to create and add (950) resulting subproblems corresponding to regions and partitions of the discrete search space as children of that node in the branching tree.

[0102]

number

[0103] Some embodiments are based on a branch-and-bound method using a depth-first node selection method that can be implemented using a last-in-first-out (LIFO) buffer. The next node to be solved is selected as one of the children of the current node, and this process is repeated until the node is pruned, i.e., it is either infeasible, optimal, or determined by a currently known upper bound. This is followed by a back-tracing method. Instead, some embodiments are based on a branch-and-bound method. The branch-and-bound method uses a best-first method that selects the node that currently has the lowest local lower bound. Some embodiments employ a combined depth-first and best-first node selection method, where the depth-first node selection method is used until an integer feasible solution is found, and then the best-first node selection method is used in subsequent iterations of the branch-and-bound based optimization algorithm. The latter implementation is motivated by the goal of finding integer feasible solutions early in the branch-and-bound procedure (depth-first) to allow early pruning, and then performing a greedy search to find better feasible solutions (best-first).

[0104] The branch-and-bound method continues iterating until one or more of the following conditions are met: ● The maximum execution time of the processor is reached. • All nodes in the branch search tree are pruned so that no more new nodes can be selected for solving or branching the convex relaxation. The optimality gap between the global lower and upper bounds of the mixed integer solution objective is less than acceptable.

[0105] FIG. 10 shows a block diagram of a global multi-vehicle decision-making system 1000 for calculating a motion plan of one or more controlled vehicles in a traffic network consisting of one or more interconnected conflict zones according to some embodiments of the present invention. The global multi-vehicle decision-making system 1000 runs in the cloud or on one or more MECs (Mobile Edge Computers). The system would further require one or more edge devices (e.g., RSUs for infrastructure-based sensing) consisting of a set of sensors or one or more edge devices functionally connected to the set of sensors to collect traffic information near one or more interconnected conflict zones of the traffic network. In some embodiments of the present invention, the global multi-vehicle decision-making system is designed to send a set of optimal entry and exit times and average speed 1022 and / or speed distribution, and a set of planned stops 1024 to each of the CAVs (Connected Autonomous Vehicles) along the upcoming planned route in the traffic network.

[0106] The global multi-vehicle decision-making system 1000 comprises a number of interfaces connecting the decision-making system 1000 with other systems and devices. For example, the decision-making system 1000 comprises a NIC (Network Interface Controller) 1002 adapted to connect the decision-making system 1000 through a bus 1004 to a network 1006 connecting the decision-making system 1000 to one or more devices 1008, including but not limited to vehicles, traffic lights, traffic sensors, RSUs (Roadside Units), MECs (Mobile Edge Computers), and passengers' mobile devices. The decision-making system 1000 further comprises a transmission interface 1010. The transmission interface 1010 is configured to transmit, by means of the transmitter 1012 and / or one or more of the devices 1008, to each of the CAVs (Connected and Autonomous Vehicles) along the upcoming planned route in the transportation network, the optimal set of entry and exit times and average speed 1022 and / or speed distribution, and the set of planned stops 1024 determined by the one or more processors 1014. To improve the overall safety, time efficiency and energy efficiency of traffic flow in the transportation network, commands received from the global multi-vehicle decision-making system can be used to control vehicle movements by a multi-layer guidance and control architecture in each of the CAVs.

[0107] Through the network 1006, the global multi-vehicle decision-making system 1000 receives real-time traffic data 1032 using a receiving interface 1028 connected to a receiving unit 1030. The decision-making system 1000 may receive traffic information for one or more of the interconnected conflict zones and road segments in the traffic network. The traffic data 1032 may include vehicle state (e.g., acceleration, position, heading, speed) information and planned and / or predicted future route (e.g., set of future road segments, travel lanes, desired destination, waiting time) information for each vehicle in the traffic network. Additionally or alternatively, the decision-making system 1000 may include a control interface 1034 configured to send commands to one or more devices 1008 to change their respective acceleration, speed, etc. conditions. The control interface 1034 may use the transmitting unit 1012 and / or other communication means to send the commands.

[0108] In some embodiments of the present invention, a human machine interface (HMI) 1040 connects the decision-making system 1000 to a keyboard 1036 and a pointing device 1038, which may include, among others, a mouse, a trackball, a touchpad, a joystick, a pointing stick, a stylus, or a touch screen. The decision-making system 1000 may also be linked through the bus 1004 to a display interface adapted to connect the decision-making system 1000 to a display device, such as, among others, a computer monitor, a camera, a television, a projector, or a mobile device. The decision-making system 1000 may also be connected to an application interface adapted to connect the decision-making system 1000 to one or more devices for performing various power allocation tasks.

[0109] The decision-making system 1000 may include one or more processors 1014 configured to execute stored instructions and a memory (at least one memory) 1016 that stores instructions executable by the processor (at least one processor) 1014. The processor (s) 1014 may be a single-core processor, a multi-core processor, a computer cluster, a network of multiple connected processors, or any number of other configurations. The memory 1016 may include a RAM (random access memory), a ROM (read only memory), a flash memory, or other suitable memory system. The processor (s) 1014 may be connected to one or more input and output devices through a bus 1004. These instructions implement a method for global multi-vehicle decision-making in local areas in interconnected conflict zones. In some embodiments of the present invention, the decision-making system 1000 includes a mapping configuration 1018. For example, the mapping configuration 1018 may include location data (eg, GPS data) of non-conflict road segments, conflict zones, and travel lanes within each road segment of the transportation network.

[0110] The decision-making system 1000 includes constraints and objectives 1020 of a MIP (mixed integer programming) problem 720 that is solved at each time step of the global multi-vehicle decision-making system, for example as described in Figures 8A-8D. For example, the MIP constraints and objectives 1020 may be configured to respect physical limitations, vehicle speed limits, and / or safety constraints, and to minimize a weighted combination of travel time, waiting time, and / or energy consumption for each vehicle in the traffic network. In some embodiments of the invention, the MIP constraints and objectives 1020 lead to the solution of a MILP (mixed integer linear programming) or MIQP (mixed integer quadratic programming) problem. Based on the MIP solution, for each CAV (connected and autonomous vehicle), an optimal set of entry and exit times and average speed 1022 and / or speed distribution and set of planned stops 1024 along its future planned or predicted route in the traffic network may be determined by one or more processors 1014.

[0111] FIG. 11A is a schematic diagram of a vehicle 1101 with a multi-layer guidance and control architecture 1102 according to some embodiments of the present invention. The multi-layer guidance and control architecture 1102 controls the movement of the vehicle based on a future route plan of the traffic network and a corresponding motion plan, which may be calculated by a global multi-vehicle decision-making system. As used herein, the vehicle 1101 may be any type of wheeled vehicle, such as a car, truck, shuttle, bus, or rover. The vehicle 1101 may also be an autonomous vehicle or a semi-autonomous vehicle. For example, some embodiments control the movement of the vehicle 1101 based on a motion plan, which may be calculated by the global multi-vehicle decision-making system. The movement may include a lateral movement of the vehicle, which is controlled by a steering system 1103 of the vehicle 1101. In some embodiments of the present invention, the steering system 1103 is controlled by the multi-layer guidance and control architecture 1102. Additionally or alternatively, the steering system 1103 may be controlled by a (human) driver of the vehicle 1101.

[0112] The vehicle may also include an engine 1106. The engine 1106 may be directly controlled by the multi-layer guidance and control architecture 1102 or may be controlled by other components of the vehicle 1101. The vehicle may also include one or more on-board sensors 1104 to sense the surrounding environment. The sensors 1104 may include range finders, radar, lidar, and cameras. The vehicle 1101 may also include one or more on-board sensors 1105 to sense its current operating quantities and internal conditions. The sensors 1105 may include a global positioning system (GPS), an accelerometer, an inertial measurement unit, a gyroscope, a shaft rotation sensor, a torque sensor, a deflection sensor, a pressure sensor, and a flow sensor. The on-board sensors provide information to the multi-layer guidance and control architecture 1102. For example, the vehicle 1101 may be equipped with a transceiver 1106 that enables communication capabilities of the multi-layer guidance and control architecture 1102 through a wired or wireless communication channel so that the vehicle 1101 can communicate with a global multi-vehicle decision-making system according to some embodiments of the present invention.

[0113] 11B is a diagram illustrating an overview of the interaction of the multi-layer guidance and control architecture 1102 (i.e., layers of algorithms and techniques for decision-making, motion planning, vehicle control and / or estimation) with other controllers 1120 of the vehicle 1101, according to some embodiments of the present invention. For example, in some embodiments, the controllers 1120 of the vehicle 1101 are a steering controller 1125 and a brake / throttle controller 1130 that control the rotation and acceleration of the vehicle 1120, respectively. In such a case, the multi-layer guidance and control architecture 1102 outputs manipulated inputs to the controllers 1125 and 1130 for controlling the state of the vehicle 1101. The controller 1120 may also include a higher-level controller, e.g., a lane-keep assist controller 1135, that further processes the manipulated inputs of the multi-layer guidance and control architecture 1102. In either case, to control the movement of the vehicle 1101, the controller 1120 utilizes the output of the multi-layer guidance and control architecture 1102 to control at least one actuator of the vehicle 1101, such as the steering and / or brakes of the vehicle 1101. In some embodiments of the invention, the vehicle 1101 is one of multiple CAVs in a transportation network, and the multi-layer guidance and control architecture 1102 determines the inputs to the vehicle 1101 based on a motion plan calculated by a global multi-vehicle decision-making system, where the inputs to the vehicle 1101 may include one or a combination of the following: acceleration of the vehicle 1101, engine torque, braking torque, and steering angle of the vehicle 1101.

[0114] 12A is a diagram illustrating an overview of the interaction between the global multi-vehicle decision-making system 300 and the shipping yard management system 1200. The global multi-vehicle decision-making system 300 and the shipping yard management system 1200 may be used in combination with each other for efficient job scheduling, motion planning, and decision-making for controlled and uncontrolled vehicles in a shipping yard. In some embodiments of the present invention, the shipping yard management system calculates task assignments and planned routes for one or more trucks and / or spotters to perform one or more of the following tasks: • A route plan to one or more docks for loading or unloading one or more trailers by one or more dock workers. ●Route planning for moving one or more trailers from one location to another in a shipping yard. • Route planning to specific sections of the parking lot for picking up or dropping off one or more trailers. • Route planning for entering and exiting the interconnected transportation network of the shipping yard area.

[0115] In some embodiments of the present invention, the shipping yard management system may include one or more of reservation schedule management 1205, security gate management 1210, dock management 1215, and traffic marshal schedule management 1220, among other components. The reservation schedule management 1205 system ensures a reservation for each truck scheduled to arrive at the shipping yard to load or unload cargo. The security gate management 1210 system, possibly combined with a security or verification process, checks in each truck with or without the driver present. The security gate management system ensures that both the shipping yard management system 1200 and the global multi-vehicle decision-making system 300 are aware of all trucks and drivers currently present in the shipping yard area. The dock management 1215 system is based on a task assignment or job schedule management system that determines which specific docks can be used for loading or unloading cargo from a particular trailer by one or more dock workers. The traffic marshal schedule management 1220 system determines whether a particular traffic marshal should be instructed to pick up and move the trailer to a particular parking lot or a particular dock in the shipping yard.

[0116] In some embodiments of the present invention, the task allocation, job schedule management, mapping, and / or navigation of the shipping yard management system may be implemented by solving a mixed integer programming (MIP) problem. For example, the MIP of task allocation or job schedule management may be solved separately or jointly from the MIP of motion planning in the global multi-vehicle decision-making system using one or more mobile edge computers. In other embodiments of the present invention, the task allocation or job schedule management of the shipping yard management system is implemented based on heuristic search techniques to calculate a feasible but potentially suboptimal schedule at a significantly lower shipping yard management computational cost.

[0117] FIG. 12B is a schematic diagram of a shipping yard management system 1250 that includes an interconnected traffic network 1255 for one or more vehicles to travel between security gates 1265, one or more parking lots 1260, and one or more docks 1270 within a shipping yard area. The shipping yard management system is intended to coordinate the movement of trucks within a work area of ​​a manufacturing plant, warehouse, or distribution center. In some embodiments of the invention, each of the vehicles may be an autonomous vehicle, a semi-autonomous vehicle (CAV), or a non-controlled vehicle (NCV), and each of the vehicles may be either a truck 1261 (with or without a trailer 1262), a traffic marshal 1263, or a yard jockey. The shipping yard management system 1250 assigns tasks to one or more of the trucks 1261, trailers 1262, traffic marshals 1263, or dock workers 1264, and one or more of the parking lots 1260 or docks 1270, respectively. The results of the task assignment may be transmitted to one or more of the dock workers 1264 and one or more of the trucks 1261 and traffic directors 1263 and / or one or more drivers of the trucks 1261 and traffic directors 1263. For example, vehicle-to-everything (V2X) communication devices and techniques may be used in combination with electronic communications between mobile devices or computers that may be carried by one or more of the dock workers and / or drivers and the shipping yard management system. The global multi-vehicle decision-making system then calculates a coarse-grained motion plan within the interconnected traffic network for each of the CAVs and NCVs along a planned or predicted route to perform tasks within the shipping yard.

[0118] Some embodiments of the present invention are based on the recognition that a hierarchy of priorities may exist among the vehicles due to the specific tasks assigned to each of the vehicles by the shipping yard management system. In some embodiments of the present invention, the global multi-vehicle decision-making system calculates a motion plan that prioritizes one or more vehicles with higher priorities as determined by the shipping yard management system based on a solution to a MIP problem based on weighted multi-objective minimization. For example, the weighted values ​​of the travel time and / or waiting time of one or more vehicles with higher priorities may be determined to be relatively large values ​​in the weighted multi-objective minimization of the MIP problem in the global multi-vehicle decision-making system.

[0119] The embodiments of the invention described above may be implemented in any of numerous ways. For example, the embodiments may be implemented using hardware, software, or a combination thereof. If implemented in software, the software code may be executed on any suitable processor or collection of processors, whether located on one computer or distributed across multiple computers. Such a processor may be implemented as an integrated circuit including one or more processors on a single integrated circuit component. However, a processor may be implemented using circuitry in any suitable format.

[0120] Also, the various methods or steps outlined herein may be coded as software executable on one or more processors employing any one of a variety of operating systems or platforms. Additionally, such software may be written using any of a number of suitable programming languages ​​and / or programming or scripting tools, or may be compiled as executable machine language code or intermediate code that runs on a framework or virtual machine. Typically, the functionality of the program modules may be combined or distributed as desired in various embodiments.

[0121] Additionally, embodiments of the invention may be implemented as described methods, and the operations performed as part of the method may be ordered as appropriate. As such, embodiments may be constructed that perform operations in an order different from that illustrated, and may include performing some operations simultaneously even though the illustrated embodiments show operations as sequential.

[0122] Although the invention has been described by way of examples of preferred embodiments, it should be understood that various other adaptations and modifications may be made within the spirit and scope of the invention, and therefore, it is the object of the appended claims to cover all such variations and modifications which come within the spirit and scope of the invention.

Claims

1. 1. A global multi-vehicle decision-making system for providing real-time motion planning and coordination for one or more connected autonomous and / or semi-autonomous vehicles (CAVs) in an interconnected transportation network including one or more uncontrolled vehicles (NCVs), one or more conflict zones, and one or more non-conflict road segments, the system comprising: a receiver configured to receive infrastructure sensing signals via a roadside unit (RSU), receive type 1 feedback signals about status and planned future routing information for connected and autonomous vehicles (CAVs) heading towards one or more desired destinations, and receive type 2 feedback signals about status and predicted future routing information for uncontrolled vehicles (NCVs); the receiving unit is configured to be in data communication with a shipping yard management system, the shipping yard management system including a centralized task assignment, job scheduling, mapping and navigation system connected to the global multi-vehicle decision-making system to provide mapping information, long-term planned future routing information for one or more CAVs, and / or short-term predicted future routing information for one or more NCVs; at least one memory configured to store the mapping information and a computer executable program including a global multi-vehicle decision-making program; and at least one processor coupled to the at least one memory and configured to perform processing steps, the processing steps including: formulating a global mixed integer programming (MIP) problem based on the infrastructure sensing signal, the type 1 feedback signal, the type 2 feedback signal, and the mapping information; the MIP problem performs a weighted multi-objective minimization that ensures a hierarchy of priorities among each of the vehicles performing tasks within the interconnected traffic network of shipping yards by selecting relatively large weight values ​​for the travel time and / or waiting time of one or more vehicles with higher priority; The processing step further comprises: computing a motion plan for each CAV and each NCV in an interconnected transportation network by solving the MIP problem; the motion plan is calculated for one or more trucks, one or more traffic directors, or one or more yard jockeys, each of which is either a controlled or uncontrolled vehicle along a route within a shipping yard for efficiently loading or unloading cargo; The processing step further comprises: calculating a set of optimal entry and exit times and a set of average speeds for each CAV and each NCV on each road segment along a planned or predicted future route in the transportation network; and calculating a speed distribution and / or one or more planned outages for each CAV over a forecast time range; The global multi-vehicle decision-making system further comprises a transmitter in each of the CAVs configured to transmit the speed distribution and / or the one or more planned stops to a multi-layer guidance and control architecture of each CAV in the interconnected transportation network.

2. The global multi-vehicle decision-making system of claim 1 , wherein the uncontrolled vehicles (NCVs) may include one or more human-driven vehicles and / or one or more (semi-) autonomous vehicles that the global multi-vehicle decision-making system cannot control.

3. 2. The global multi-vehicle decision-making system of claim 1, wherein the conflict zone may include one or more merging sections and / or one or more traffic intersections that may physically connect multiple lanes on multiple road sections of the interconnected transportation network.

4. The global multi-vehicle decision-making system of claim 1 , wherein the receiver acquires the Type 1 feedback signals from one or more CAVs and / or one or more RSUs using Vehicle-To-Everything (V2X) communication.

5. 2. The global multi-vehicle decision-making system of claim 1, wherein the receiver utilizes vehicle-to-everything (V2X) communication to obtain the Type 2 feedback signals from one or more NCVs and / or one or more RSUs.

6. The global multi-vehicle decision-making system of claim 1 , wherein the global multi-vehicle decision-making program is executed in a receding horizon implementation by one or more processors included in one or more MECs (Mobile Edge Computers).

7. The global multi-vehicle decision-making system of claim 1 , wherein the global multi-vehicle decision-making program is executed in a receding horizon implementation by one or more processors comprised in a cloud-based computing system.

8. 2. The global multi-vehicle decision-making system of claim 1, wherein a centralized task assignment, mapping and navigation system is connected to the global multi-vehicle decision-making system to provide the mapping information, the long-term planned future routing information for one or more CAVs, and / or the short-term predicted future routing information for one or more NCVs.

9. The global multi-vehicle decision-making system of claim 1 , wherein safety constraints for dynamic traffic participants, including bicycles and pedestrians, are respected by an on-board module for motion planning and / or vehicle control in the multi-layer guidance and control architecture for each CAV.

10. The global multi-vehicle decision-making system of claim 1 , wherein the infrastructure sensing signals may include signals from one or more sensors including, for example, a range finder, a radar, a lidar, and a camera.

11. 2. The global multi-vehicle decision-making system of claim 1, wherein the state information included in the Type 1 feedback signal of a CAV and the state information included in the Type 2 feedback signal of an NCV may include a current location, a current yaw angle, and / or a current speed of each vehicle.

12. 2. The global multi-vehicle decision-making system of claim 1, wherein the mapping information includes location data of non-conflict road segments, location data of conflict zones including one or more merging sections and / or one or more traffic intersections, and location data of one or more travel lanes within each of the road segments and each of the conflict zones of the traffic network.

13. 13. The global multi-vehicle decision-making system of claim 12, wherein the planned future routing information or the predicted future routing information included in the Type 1 feedback signal and the Type 2 feedback signal includes, for each vehicle, a set of future road segments and future driving lanes within those road segments toward a desired destination, starting from the road segment and driving lane in which the vehicle is currently located.

14. 2. The global multi-vehicle decision-making system of claim 1, wherein the MIP problem is a MILP (mixed integer linear programming) or MIQP (mixed integer quadratic programming) problem, and the optimization variables include entry and exit time variables, inverse average speed variables, and one or more binary optimization variables for each of the CAVs and each of the NCVs in each of the road sections and conflict zones of the transportation network.

15. The global multi-vehicle decision-making system of claim 14 , wherein the MIP problem includes vehicle dynamic equality constraints and one or more speed limit constraints for each of the CAVs and / or NCVs.

16. 15. The global multi-vehicle decision-making system of claim 14, wherein the MIP problem includes vehicle routing inequality constraints for enforcing an order of exiting and entering a subsequent road segment on the planned or forecasted future route for each of the CAVs and each of the NCVs.

17. 15. The global multi-vehicle decision-making system of claim 14, wherein the MIP problem includes one or more safety constraints for each of the conflict zones of the transportation network to avoid potential collisions in the motion plan by enforcing that pairs of vehicles are prohibited from traveling in conflicting driving lanes of the same conflict zone at the same time.

18. 18. The global multi-vehicle decision-making system of claim 17, wherein the safety constraints are enforced using one binary optimization variable for each pair of vehicles in the transportation network and each of the conflict zones, for example based on a Big-M formulation of the MIP problem with a set of mixed-integer linear inequality constraints.

19. 15. The global multi-vehicle decision-making system of claim 14, wherein the MIP problem includes one or more occupancy duration constraints for each of the road segments in the transportation network to enforce a fixed ordering between any pair of vehicles that are planned or predicted to travel in the same travel lane within the same road segment.

20. 20. The global multi-vehicle decision-making system of claim 19, wherein the occupancy duration constraints are enforced using one binary optimization variable for each pair of vehicles in the transportation network and each of the road segments, for example based on a Big-M formulation of the MIP problem with a set of mixed-integer linear inequality constraints.

21. The global multi-vehicle decision-making system of claim 14 , wherein the MIP problem performs a weighted multi-objective minimization including a weighted sum of one or more objective terms, for example to minimize a weighted combination of travel time, waiting time, and / or energy consumption of each of the vehicles in the transportation network.

22. The global multi-vehicle decision-making system of claim 1 , wherein the MIP problem can be solved using a branch-and-bound, branch-and-cut, or branch-and-price optimization algorithm.

23. The global multi-vehicle decision-making system of claim 1 , wherein the motion plan is calculated using a heuristic optimization algorithm to calculate a feasible but sub-optimal solution to the MIP problem, for example based on the use of integer rounding, feasibility pumping, approximate optimization algorithms, or machine learning techniques.

Images