Optimal Longitudinal Control Planning with Moving Obstacles.
Jeff Johnson and Kris Hauser. Appearing In Intelligent Vehicles Symposium 2013
Abstract. At intersections and in merging traffic, intelligent road vehicles must solve challenging optimal control problems in real-time to navigate reliably around moving obstacles. We present a complete planner that computes collision-free, optimal longitudinal control sequences (acceleration and braking) using a novel visibility graph approach that analytically computes the reachable subset of path-velocity-time space. We demonstrate that our method plans over an order of magnitude faster than previous approaches, which makes it scalable and fast enough (tenths of a second on a PC) to be called repeatedly on-line. We demonstrate applications to autonomous driving and vehicle collision warning systems with up to 20 moving obstacles.
Download PDF 
Download Supplemental Video (MP4, 4.7MB): 
Download Planner (C++, 671KB): PVTPlanner (beta)
(original version available here)
Other Media
Planner-generated Trajectories in Simulated Scenarios
We model a car traveling along on Kirkwood Avenue in Bloomington, Indiana on stretch of road with many restaurants and pubs. Bicyclists often share the road lane and pedestrian traffic is heavy, both at and away from crosswalks. The problem is decomposed into two stages: 1) reaching the first stop sign, then 2) reaching a second stop sign. Acceleration bounds are [-10, 8]m/s2 and velocity bounds are [0, 13.4]m/s.
MP4, 338KB
A complex scenario with 20 vehicles merging onto/off of the driver's path. The planner find the globally time-optimal control sequence that allows the car to traverse the path collision free.
MP4, 287KB
Visibility Graph Construction
Visibility graph construction for the complex scenario above. Here the vehicles also share portions of the driver's path, leading to diagonal PT Obstacles.
MP4, 78KB
Simulated PT Obstacle Construction
Example of PT obstacle construction for a square driver model and square world obstacle moving diagonally over the driver's path. The forbidden regions are computed as the world obstacle moves over the driver's path, and are then collected into the PT obstacle.
MP4, 1MB
Example of PT obstacle construction for a triangular driver model and square world obstacle moving diagonally over the driver's path. The forbidden regions are computed as the world obstacle moves over the driver's path, and are then collected into the PT obstacle.
MP4, 1MB
