Concept

Carrefour giratoire

Publications associées (56)

A WIM-Based Assessment of Multiple Vehicle Presence Effects on Fatigue Damage of Highway Bridges

Alain Nussbaumer, Scott Walbridge, Matthew James Sjaarda

The fatigue provisions for bridge design in North America and Europe are highly simplified for the sake of practical implementation, in comparison with the state of the art in understanding of the true fatigue behavior. Historically, one significant simpli ...

2024

Worst-Case Delay Analysis of Time-Sensitive Networks with Network Calculus

Seyed Mohammadhossein Tabatabaee

Time-sensitive networks, as in the context of IEEE Time-Sensitive Networking (TSN) and IETF Deterministic Networking (DetNet), offer deterministic services with guaranteed bounded latency in order to support safety-critical applications. In this thesis, we ...

EPFL2023

Mobile eye tracking applied as a tool for customer experience research in a crowded train station

Andrea Regula Schneider

Train stations have increasingly become crowded, necessitating stringent requirements in the design of stations and commuter navigation through these stations. In this study, we explored the use of mobile eye tracking in combination with observation and a ...

2023

Pedestrian typologies - a sociological look on urban walkways

Vincent Kaufmann, Renate Albrecher

Representations of the pedestrian as a sole and healthy individual do not correspond to the reality and diversity of walking practices. The majority of urban pedestrians has to deal with constraints to their degrees of freedom in walking. We propose a typo ...

2022

Deficit Round-Robin: A Second Network Calculus Analysis

Jean-Yves Le Boudec, Seyed Mohammadhossein Tabatabaee

Deficit Round-Robin (DRR) is a widespread scheduling algorithm that provides fair queueing with variable-length packets. Bounds on worst-case delays obtained with DRR were found by Boyer et al. They used a rigorous network calculus approach and characteriz ...

2021

Recalibration of damage equivalence factor for fatigue verification on road bridge

Colin Vaccari

The current works of revision of the Eurocodes (CEN250 project 2nd Eurocode generation), is an opportunity to update the simplified method (lambda factor method) for fatigue verification for road bridges. Especially as this method is based on old traffic m ...

2021

Stabilization of city-scale road traffic networks via macroscopic fundamental diagram-based model predictive perimeter control

Nikolaos Geroliminis, Isik Ilber Sirmatel

Traffic control for large-scale urban road networks remains a challenging problem. Aggregated dynamical models of city-scale traffic, based on the macroscopic fundamental diagram (MFD), enable development of model-based perimeter control methods. Involving ...

2021

Perimeter Control and Route Guidance of Multi-Region MFD Systems With Boundary Queues Using Colored Petri Nets

Nikolaos Geroliminis, Anastasios Kouvelas, Hui Fu

Perimeter control based on Macroscopic Fundamental Diagram (MFD) aims to meter the number of transferring vehicles at the periphery of the protected urban region in order to obtain the desired number of vehicles in that region. The advantage of perimeter c ...

IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC2021

Dynamic control strategies for managing pedestrian flows

Nicholas Alan Molyneaux

Pedestrians, like drivers, generally dislike congestion. This is true for most pedestrian environments: trains stations, airports, or shopping malls. Furthermore, pedestrian congestion also influences the attractiveness of public transportation networks. T ...

EPFL2021

Motion planning for CAVs in mixed traffic, a study on roundabouts

Ezequiel González Debada

Driving is a very challenging task to automatize despite how naturally and efficiently it may come to experienced human drivers. The complexity stems from the need to (i) understand the surrounding context and forecast how it is likely to evolve, (ii) plan ...

EPFL2020

Graph Chatbot

Chattez avec Graph Search

Posez n’importe quelle question sur les cours, conférences, exercices, recherches, actualités, etc. de l’EPFL ou essayez les exemples de questions ci-dessous.

AVERTISSEMENT : Le chatbot Graph n'est pas programmé pour fournir des réponses explicites ou catégoriques à vos questions. Il transforme plutôt vos questions en demandes API qui sont distribuées aux différents services informatiques officiellement administrés par l'EPFL. Son but est uniquement de collecter et de recommander des références pertinentes à des contenus que vous pouvez explorer pour vous aider à répondre à vos questions.

Connectez-vous pour utiliser Chat avec Graph Search