On the Complexity of an Unregulated Traffic Crossing

DOI10.1007/978-3-319-21840-3_19zbMath1444.90036arXiv1505.00874OpenAlexW1843966007MaRDI QIDQ3449819

David M. Mount, Philip Dasler

Publication date: 30 October 2015

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1505.00874

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Applications of mathematical programming (90C90) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Traffic problems in operations research (90B20)

Related Items (5)

Collision-free routing problem with restricted L-path ⋮ Constant delay lattice train schedules ⋮ Scheduling Autonomous Vehicle Platoons Through an Unregulated Intersection ⋮ Problems on One Way Road Networks ⋮ Modular circulation and applications to traffic management

Cites Work

• PSPACE-completeness of sliding-block puzzles and other problems through the nondeterministic constraint logic model of computation
• The Truck Dispatching Problem
• Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints
• A traveller's problem
• Vehicle Dynamics and Control
• Maximum thick paths in static and dynamic environments

This page was built for publication: On the Complexity of an Unregulated Traffic Crossing