Vincent Aguiléra

An advanced driver speed assistance in curves: risk function, cooperation modes, system architecture and experimental validation

This paper presents the development of the ARCOS driver speed assistance in curves (ADSAC). It illustrates how this development integrated into the ARCOS project framework. A strong emphasis is put on the definition of the ADSAC risk function, which is the fundamental building block on which several interaction modes with the driver have been implemented. Also, the study of experimental data confirms the validity of the hypothesis made while defining of the ADSAC risk function.

DATA REQUIREMENTS FOR ENHANCED DIGITAL MAPS IN AN ADVANCED CURVE-SPEED WARNING SYSTEM

The development of map database specifications that will enable or improve driver safety assistance systems is a topic of active research. In this context, data requirements are proposed for an advanced curvespeed warning system. Both the content of the database and the accuracy of the needed road-geometry data are addressed. First, some possible drawbacks of previous proposals in this field are sketched. Then, a model is presented to compute the highest safe speed of a road section, given three distinct submodels: vehicle dynamic, infrastructure characteristics, and driver behavior. A case study illustrates how this model may greatly improve driver suitability of curve-speed warning—control driver assistance. A sensitivity analysis formally demonstrates that the requirements concerning road-geometry data are compatible with existing low-cost measurement devices. Finally, some critiques and additions to previous works concerning map database enhancements are formulated.

Large Problems of Dynamic Network Assignment and Traffic Equilibrium: Computational Principles and Application to Paris Road Network

The paper reports on the algorithmic treatment and computer implementation of a macroscopic dynamic traffic assignment model called LADTA. The modeling assumptions and the mathematical analysis founding the model are first explained. Detailed descriptions of the main algorithms are given, together with the principles of the computer implementation. How the design of the software architecture allows for distributed computation of a traffic assignment is shown. The practical ability of this implementation to tackle large networks is illustrated by an application to the Paris road network, which comprises about 1,300 zones and 39,000 links.

Generic First-Order Car-Following Models with Stop-and-Go Waves and Exclusion

A new Optimal Velocity (OV) car-following model is defined and explored. The model is solely based on an optimal speed function and a reaction time, and, oppositely to classical OV models, is intrinsically collision-free. If the model has uniform solutions, kink-antikink and soliton stop-and-go patterns can be described with a linear bounded optimal velocity function when the reaction time is high enough.