Abstract

This paper proposes analytical approaches to extend the capacity of existing networks of electric vehicles (EVs) by placement of additional charging stations (CSs) as well as determining the sizes of existing and new CSs in order to handle future expansions of EVs. The EV flow at CSs is modeled by a graph where nodes are potential locations for CSs and edges are uncertain parameters representing the variable EV flow at CSs. The required extra CS locations are explored by transforming the CS placement problem into a controllability framework addressed by maximum matching principle (MMP). To find the sizes of each CS, the graph of CS network is partitioned featuring only one CS in each subgraph. The size of CS in each subgraph is then determined by transforming the problem into the problem of robust stability of a system with uncertain parameters where each parameter is associated with an edge of subgraph. The zero exclusion principle is then tested for the related Kharitonov rectangles and polygonal polynomials of closed loop system with selected feedback gain as CS capacity. The proposed analytical approach is tested on the existing Tesla CS Network of Sydney. The locations of extra required CSs as well as the sizes of existing and new CSs are determined to maintain the waiting times at all stations below the threshold level.

Highlights

  • A esponse to the greenhouse gases emissions, the internal combustion vehicles have been replacing rapidly by electrically powered vehicles

  • This study proposes novel graph theoretic solutions from the lens of control theories to address the charging stations (CSs) placement and sizing in electric vehicles (EVs) networks with dynamic traffic flow

  • The new CS placement approach considers the placement of required extra CSs for an expanding EV network with existing stations

Read more

Summary

INTRODUCTION

A esponse to the greenhouse gases emissions, the internal combustion vehicles have been replacing rapidly by electrically powered vehicles. The proposed approach transforms the placement and sizing problems to controllability and feedback gain design problems where the system states are the waiting times at CSs and control inputs are the charging capacity supplied via driver nodes acting as CSs. A model of underlying EV network is constructed using a graph where nodes are the potential locations of CSs and edges link two nearby nodes where the weights of edges represent the number of EVs in the area. Ss the modeling of the CS network based on graph theory is explained followed by a new approach for the placement and sizing of existing and new CSs that considers the variable traffic flows of the EV network

GRAPH-THEORETIC MODELING OF EV NETWORK
6: Investigate the zero exclusion condition of
Findings
CONCLUSION

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.