Skip to main content

Distributed Coordination and Centralized Scheduling for Automobiles at Intersections

  • Chapter
  • First Online:
Machine Learning and Optimization Techniques for Automotive Cyber-Physical Systems
  • 417 Accesses

Abstract

Intersections are one of the most common conflicting scenarios, where vehicles intend to pass through them at the same time. As the technology advances, connected and autonomous vehicles (CAVs) provide a revolutionary solution at intersections. In this chapter, we consider connected and autonomous vehicles at intersections and introduce distributed and centralized approaches solving the problem of intersection management. The approaches provide feasibility, safety (collision-freeness), liveness (deadlock-freeness), stability, efficiency, and real-time decision.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

eBook
USD 16.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Hardcover Book
USD 119.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Notes

  1. 1.

    Note that this is different from the strategies discussed in [4], which only considers the arrival time at the intersection.

  2. 2.

    As there is dependency between vehicles, the vertex entering time of each vertex cannot be given as an input.

  3. 3.

    We do not consider overtaking in this section; otherwise, we can relax the constraint to potentially change Type-2 edges.

  4. 4.

    This is the reason that we need the item 2 in the problem formulation.

  5. 5.

    To demonstrate the examples concisely, the examples in Fig. 9 are not associated with any intersection modeling in Fig. 7.

  6. 6.

    If all of the conditions are false, then Δi can move from Ξj to \(\Xi _{j^{\prime }}\). A similar claim is not true for G′, so having no cycle in G′ cannot guarantee deadlock-freeness.

  7. 7.

    Though it may not go back to (i, j, j′).

  8. 8.

    It is believed that an intersection manager has much better computational capability than a current vehicle.

References

  1. Liu, C., Tomizuka, M.: Enabling safe freeway driving for automated vehicles. In: 2016 American Control Conference, pp. 3461–3467. IEEE, Piscataway (2016)

    Google Scholar 

  2. Liu, C., Chen, J., Nguyen, T.-D., Tomizuka, M.: The robustly-safe automated driving system for enhanced active safety. Technical report, SAE Technical Paper (2017)

    Google Scholar 

  3. Dresner, K., Stone, P.: Multiagent traffic management: an improved intersection control mechanism. In: Proceedings of the Fourth International Joint Conference on Autonomous Agents and Multiagent Systems, pp. 471–477. ACM, New York (2005)

    Google Scholar 

  4. Azimi, S., Bhatia, G., Rajkumar, R., Mudalige, P.: Reliable intersection protocols using vehicular networks. In: Proceedings of the ACM/IEEE 4th International Conference on Cyber-Physical Systems (ICCPS’13), pp. 1–10. ACM, New York (2013). https://doi.org/10.1145/2502524.2502526

  5. Pandit, K., Ghosal, D., Zhang, H.M., Chuah, C.-N.: Adaptive traffic signal control with vehicular ad hoc networks. IEEE Trans. Veh. Technol. 62(4), 1459–1471 (2013)

    Article  Google Scholar 

  6. Liu, C., Zhan, W., Tomizuka, M.: Speed profile planning in dynamic environments via temporal optimization. In: 2017 IEEE Intelligent Vehicles Symposium (IV), pp. 154–159. IEEE, Piscataway (2017)

    Google Scholar 

  7. Liu, C., Lin, C.-W., Shiraishi, S., Tomizuka, M.: Distributed conflict resolution for connected autonomous vehicles. IEEE Trans. Intell. Veh. 3(1), 18–29 (2017)

    Article  Google Scholar 

  8. Zhou, H., Liu, C.: Distributed motion coordination using convex feasible set based model predictive control. In: International Conference on Robotics and Automation (ICRA 2021) (2021)

    Google Scholar 

  9. An, J., Giordano, G., Liu, C.: Flexible MPC-based conflict resolution using online adaptive ADMM. In: European Control Conference (ECC 2021) (2021)

    Google Scholar 

  10. Peterson, J.L.: Petri nets. ACM Comput. Surv. 9(3), 223–252 (1977)

    Article  MathSciNet  MATH  Google Scholar 

  11. Kleinberg, J., Tardos, E.: Algorithm Design. Pearson, Addison Wesley, London (2006)

    Google Scholar 

  12. Karp, R.M.: Reducibility among combinatorial problems. In: Complexity of Computer Computations. The IBM Research Symposia Series, pp. 85–103 (1972)

    Google Scholar 

  13. Kann, V.: On the approximability of np-complete optimization problems. Ph.D. Thesis, Department of Numerical Analysis and Computing Science, Royal Institute of Technology, Stockholm (1992)

    Google Scholar 

  14. Kruskal, J.B.: On the shortest spanning subtree of a graph and the traveling salesman problem. Am. Math. Soc. 7(1), 48–50 (1956)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Chung-Wei Lin .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2023 The Author(s), under exclusive license to Springer Nature Switzerland AG

About this chapter

Check for updates. Verify currency and authenticity via CrossMark

Cite this chapter

Lin, YT., Lin, CW., Jiang, I.HR., Liu, C. (2023). Distributed Coordination and Centralized Scheduling for Automobiles at Intersections. In: Kukkala, V.K., Pasricha, S. (eds) Machine Learning and Optimization Techniques for Automotive Cyber-Physical Systems. Springer, Cham. https://doi.org/10.1007/978-3-031-28016-0_3

Download citation

  • DOI: https://doi.org/10.1007/978-3-031-28016-0_3

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-031-28015-3

  • Online ISBN: 978-3-031-28016-0

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics