: minimize the expected arrival time of the last vehicle
passing the intersection in a given time window.
: minimize the difference between the assigned and desired access time for
all vehicles.- Constraints:
- vehicle i's access time is greater than the access time if it use maximum speed and acceleration.
- vehicles of same movement have enough headway.
- vehicles of different movements have enough gap.
- Uses big-M method to convert the constraint into an AND-combination in a way if one equation holds true then the others are always redundant.
- Very similar to our constraints except they are using time, we are using states.
- Conversion of discontinuity of
- sort all vehicles, replace the max with
.
- sort all vehicles, replace the max with
- Conversion of discontinuity of
- using two inequality to replace the absolute operator.
- A control algorithm that anticipate vehicle arrivals and guides them into fast moving platoons
- I didn't see too much on platoon side
- Reducing the vehicle intersection coordination problem into a mixed-integer programming program
- Developing a customized microsimulation test environment in which simulated vehicles are guided by MILP-based controller.
- No turns are allowed in the paper to simplify the presentation of ideas
- In section II paragraph 2, vehicles are sorted by distances to the intersection, what if some vehicles are a bit further but have a higher speed?
- In II 3,
is estimated stopping distance using average speed, then
vehicle with the maximum speed will not be able to stop. - Used access area which increases the intersection area. No conflicting vehicles can exist inside the access area at the same time.
- No consideration of communication uncertainty.
- No explanation on optimizing weights
and 
. - Used number of stopped cars and travel time as the performance.
- SUMO + ns3 cannot simulate the influence on communication from buildings.