Cover Image

Platoon Forming Algorithms for Intelligent Street Intersections

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Timmerman, R. W., Boon, M. A. A.
Format:	Preprint
Published:	2019
Subjects:	Data Structures and Algorithms Systems and Control Probability
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Dynamic Resource Allocation: Algorithmic Design Principles and Spectrum of Achievable Performances
by: Besbes, Omar, et al.
Published: (2022)

Asymptotics of solutions to the linear search problem
by: Heinonen, Robin A.
Published: (2026)

Trajectories and Platoon-forming Algorithm for Intersections with Heterogeneous Autonomous Traffic
by: Joshi, P. C., et al.
Published: (2023)

Online Stochastic Packing with General Correlations
by: Cetin, Sabri, et al.
Published: (2025)

Availability is all you need: achieving optimal regret with minimal information for dynamic matching
by: Kerimov, Süleyman, et al.
Published: (2025)

A Performance Bound for the Greedy Algorithm in a Generalized Class of String Optimization Problems
by: Van Over, Brandon, et al.
Published: (2024)

On Algorithmic Robustness of Corrupted Markov Chains
by: Gaitonde, Jason, et al.
Published: (2025)

Discrete Optimal Transport: Rapid Convergence of Simulated Annealing Algorithms
by: He, Yuchen, et al.
Published: (2026)

Adaptive control of dynamic networks
by: Pan, Chunyu, et al.
Published: (2023)

On Bounds for Greedy Schemes in String Optimization based on Greedy Curvatures
by: Li, Bowen, et al.
Published: (2024)

Computational Complexity Analysis of Interval Methods in Solving Uncertain Nonlinear Systems
by: Prakash, Rudra, et al.
Published: (2026)

The Mixed Birth-death/death-Birth Moran Process
by: Brewster, David A., et al.
Published: (2025)

On Smale's 17th problem over the reals
by: Montanari, Andrea, et al.
Published: (2024)

Active Learning for Non-Parametric Choice Models
by: Susan, Fransisca, et al.
Published: (2022)

Best of Both Worlds Guarantees for Smoothed Online Quadratic Optimization
by: Bhuyan, Neelkamal, et al.
Published: (2023)

SCaLE: Switching Cost aware Learning and Exploration
by: Bhuyan, Neelkamal, et al.
Published: (2026)

Beyond Non-Degeneracy: Revisiting Certainty Equivalent Heuristic for Online Linear Programming
by: Chen, Yilun, et al.
Published: (2025)

Analysis of a Random Local Search Algorithm for Dominating Set
by: Higl, Hendrik
Published: (2026)

Sampling from the Sherrington-Kirkpatrick Gibbs measure via algorithmic stochastic localization
by: Alaoui, Ahmed El, et al.
Published: (2022)

Polynomial time algorithm for optimal stopping with fixed accuracy
by: Goldberg, David A., et al.
Published: (2018)

A uniformity principle for spatial matching
by: Ameen, Taha, et al.
Published: (2026)

Spectral Alignment of Correlated Gaussian matrices
by: Ganassali, Luca, et al.
Published: (2019)

Distance Estimation for High-Dimensional Discrete Distributions
by: Kumar, Gunjan, et al.
Published: (2023)

Mixing of general biased adjacent transposition chains
by: Gheissari, Reza, et al.
Published: (2025)

Robust recovery for stochastic block models, simplified and generalized
by: Mohanty, Sidhanth, et al.
Published: (2024)

Reconstruction of geometric random graphs with the Simple algorithm
by: Stegehuis, Clara, et al.
Published: (2024)

On Sampling from Ising Models with Spectral Constraints
by: Galanis, Andreas, et al.
Published: (2024)

Locally Stationary Distributions: A Framework for Analyzing Slow-Mixing Markov Chains
by: Liu, Kuikui, et al.
Published: (2024)

Rapid Mixing on Random Regular Graphs beyond Uniqueness
by: Chen, Xiaoyu, et al.
Published: (2025)

Planted clique recovery in random geometric graphs
by: Avrachenkov, Konstantin, et al.
Published: (2025)

Sampling Sphere Packings with Continuum Glauber Dynamics
by: Kuchukova, Aiya, et al.
Published: (2026)

Subquadratic Counting via Perfect Marginal Sampling
by: Chen, Xiaoyu, et al.
Published: (2026)

Power laws and power-of-two-choices
by: Redlich, Amanda
Published: (2026)

Convergence Properties of the Asynchronous Maximum Model
by: Larkin, John
Published: (2024)

Mean-field Potts and random-cluster dynamics from high-entropy initializations
by: Blanca, Antonio, et al.
Published: (2024)

The Probability to Hit Every Bin with a Linear Number of Balls
by: Walzer, Stefan
Published: (2024)

A Bicriterion Concentration Inequality and Prophet Inequalities for $k$-Fold Matroid Unions
by: Alon, Noga, et al.
Published: (2024)

Parallelising Glauber dynamics
by: Lee, Holden
Published: (2023)

Simple parallel estimation of the partition ratio for Gibbs distributions
by: Harris, David G., et al.
Published: (2025)

Intermittent Cauchy walks enable optimal 3D search across target shapes and sizes
by: Stromieri, Matteo, et al.
Published: (2026)