251 |
Distributed Ordering and Optimization for Intersection Management with Connected and Automated VehiclesVitale, Francesco, Roncoli, Claudio 23 June 2023 (has links)
Intelligent transport systems are preparing to welcome connected and automated vehicles (CAVs), although it is uncertain which algorithms should be employed for the effective and efficient management of CAV systems. Even though remarkable improvements in telecommunication technologies, such as vehicle-to-everything (V2X), enable communication and computation sharing among different agents, e.g. vehicles and infrastructures, within existing approaches, a significant part of the computation burden is still typically assigned to central units. Distributed algorithms, on the other hand, could alleviate traffic units from most, if not all, of the high dimensional calculation duties, while improving security and remaining effective. In this paper, we propose a formation-control-inspired distributed algorithm to rearrange vehicles’ passing time periods through an intersection and a novel formulation of the underlying trajectory optimization problem so that vehicles need to exchange and process only a limited amount of information. We include early simulation results to demonstrate the effectiveness of our approach.
|
252 |
A Stochastic Programming Method for OD Estimation Using LBSN Check-in DataLu, Qing-Long, Qurashi, Moeid, Antoniou, Constantinos 23 June 2023 (has links)
Dynamic OD estimators based on traffic measurements inevitably encounter the indeterminateness problem on the posterior OD flows as such systems structurally have more unknowns than constraints. To resolve this problem and take advantage of the emerging urban mobility data, the paper proposes a dynamic OD estimator based on location-based social networking (LBSN) data, leveraging the two-stage stochastic programming framework, under the assumption that similar check-in patterns are generated by the same OD pattern. The search space of the OD flows will be limited by integrating a batch of realizations/scenarios of the second-stage problem state (i.e. check-in pattern) in the model. The two-stage stochastic programming model decomposes in a master problem and a set of subproblems (one per scenario) via the Benders decomposition algorithm, which will be tackled alternately. The preliminary results from experiments conducted with the Foursquare data of Tokyo, Japan, show that the proposed OD estimator can effectively recurrent the check-in patterns and result in a good posterior OD estimate.
|
253 |
Jahresbericht ... / ASA-FF26 July 2023 (has links)
No description available.
|
254 |
Rechenschaftsbericht ... / ASA-FF: Rechenschaftsbericht des ASA-FF e.V. Vorstands für das Geschäftsjahr ...26 July 2023 (has links)
No description available.
|
255 |
Fachplan Seniorenarbeit und Altenhilfe der Landeshauptstadt Dresden02 November 2023 (has links)
No description available.
|
256 |
Fachplan Seniorenarbeit und Altenhilfe der Landeshauptstadt Dresden02 November 2023 (has links)
No description available.
|
257 |
Fachplan Seniorenarbeit und Altenhilfe der Landeshauptstadt Dresden02 November 2023 (has links)
No description available.
|
258 |
Fachplan Seniorenarbeit und Altenhilfe der Landeshauptstadt Dresden02 November 2023 (has links)
No description available.
|
259 |
Fachplan Seniorenarbeit und Altenhilfe der Landeshauptstadt Dresden02 November 2023 (has links)
No description available.
|
260 |
Fachplan Seniorenarbeit und Altenhilfe der Landeshauptstadt Dresden28 September 2023 (has links)
No description available.
|
Page generated in 0.0214 seconds