Abstract
A <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">co-charging</i> parking system is a charging system in which the chargers are automated, i.e., they can automatically connect to or disconnect from vehicles presented in the parking. This system makes it possible to have less chargers than the number of parking places. This paper studies an optimal scheduling problem aiming at charging all vehicles to required battery level while minimizing the total charging cost. We formulate this scheduling problem as a non-linear optimal control problem with mixed integer constraints and mixed discrete and continuous time. The problem is solved using a Branch and Bound Strategy coupled with Pontryagin Maximum Principle (PMP) and Interior Point Methods (IPMs) for optimal control. The presented method is tested on numerous configurations and shows promising results both in term of precision and in term of convergence rate.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
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.