A Perception-Driven Autonomous Urban Vehicle

DOI: 10.1007/978-3-642-03991-1_5

ABSTRACT This paper describes the architecture and implementation of an autonomous passenger vehicle designed to navigate using locally
perceived information in preference to potentially inaccurate or incomplete map data. The vehicle architecture was designed
to handle the original DARPA Urban Challenge requirements of perceiving and navigating a road network with segments defined
by sparse waypoints. The vehicle implementation includes many heterogeneous sensors with significant communications and computation
bandwidth to capture and process high-resolution, high-rate sensor data. The output of the comprehensive environmental sensing
subsystem is fed into a kino-dynamic motion planning algorithm to generate all vehicle motion. The requirements of driving
in lanes, three-point turns, parking, and maneuvering through obstacle fields are all generated with a unified planner. A
key aspect of the planner is its use of closed-loop simulation in a Rapidly-exploring Randomized Trees (RRT) algorithm, which
can randomly explore the space while efficiently generating smooth trajectories in a dynamic and uncertain environment. The
overall system was realized through the creation of a powerful new suite of software tools for message-passing, logging, and
visualization. These innovations provide a strong platform for future research in autonomous driving in GPS-denied and highly
dynamic environments with poor a priori information.

  • [Show abstract] [Hide abstract]
    ABSTRACT: The computationally efficient search for robust feasible paths for unmanned aerial vehicles (UAVs) in the presence of uncertainty is a challenging and interesting area of research. In uncertain environments, a “conservative” planner may be required but then there may be no feasible solution. In this paper, we use a chance constraint to limit the probability of constraint violation and extend this framework to handle uncertain dynamic obstacles. The approach requires the satisfaction of probabilistic constraints at each time step in order to guarantee probabilistic feasibility. The rapidly-exploring random tree (RRT) algorithm, which enjoys the computational benefits of a sampling-based algorithm, is used to develop a real-time probabilistically robust path planner. It incorporates the chance constraint framework to account for uncertainty within the formulation and includes a number of heuristics to improve the algorithm’s performance. Simulation results demonstrate that the proposed algorithm can be used for efficient identification and execution of probabilistically safe paths in real-time.
    Journal of Intelligent and Robotic Systems 08/2013; 71(2). · 0.83 Impact Factor
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: This paper describes a system for detecting and estimating the properties of multiple travel lanes in an urban road network from calibrated video imagery and laser range data acquired by a moving vehicle. The system operates in real-time in several stages on multiple processors, fusing detected road markings, obstacles, and curbs into a stable non-parametric estimate of nearby travel lanes. The system incorporates elements of a provided piecewise-linear road network as a weak prior. Our method is notable in several respects: it detects and estimates multiple travel lanes; it fuses asynchronous, heterogeneous sensor streams; it handles high-curvature roads; and it makes no assumption about the position or orientation of the vehicle with respect to the road. We analyze the system’s performance in the context of the 2007 DARPA Urban Challenge. With five cameras and thirteen lidars, our method was incorporated into a closed-loop controller to successfully guide an autonomous vehicle through a 90 km urban course at speeds up to 40 km/h amidst moving traffic. United States. Defense Advanced Research Projects Agency
    Autonomous Robots 01/2009; · 1.91 Impact Factor
  • [Show abstract] [Hide abstract]
    ABSTRACT: Planning is one of the key problems for autonomous vehicles operating in road scenarios. Present planning algorithms operate with the assumption that traffic is organised in predefined speed lanes, which makes it impossible to allow autonomous vehicles in countries with unorganised traffic. Unorganised traffic is though capable of higher traffic bandwidths when constituting vehicles vary in their speed capabilities and sizes. Diverse vehicles in an unorganised exhibit unique driving behaviours which are analysed in this paper by a simulation study. The aim of the work reported here is to create a planning algorithm for mixed traffic consisting of both autonomous and non-autonomous vehicles without any inter-vehicle communication. The awareness (e.g. vision) of every vehicle is restricted to nearby vehicles only and a straight infinite road is assumed for decision making regarding navigation in the presence of multiple vehicles. Exhibited behaviours include obstacle avoidance, overtaking, giving way for vehicles to overtake from behind, vehicle following, adjusting the lateral lane position and so on. A conflict of plans is a major issue which will almost certainly arise in the absence of inter-vehicle communication. Hence each vehicle needs to continuously track other vehicles and rectify plans whenever a collision seems likely. Further it is observed here that driver aggression plays a vital role in overall traffic dynamics, hence this has also been factored in accordingly. This work is hence a step forward towards achieving autonomous vehicles in unorganised traffic, while similar effort would be required for planning problems such as intersections, mergers, diversions and other modules like localisation.
    Engineering Applications of Artificial Intelligence 01/2013; 26(s 5–6):1588–1601. · 1.96 Impact Factor

Full-text (2 Sources)

Available from
May 31, 2014