2012 American Control Conference (ACC) 2012
DOI: 10.1109/acc.2012.6315200
|View full text |Cite
|
Sign up to set email alerts
|

Extending Energy Management in Hybrid Electric Vehicles with explicit control of gear shifting and start-stop

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
6
0

Year Published

2013
2013
2023
2023

Publication Types

Select...
4
4
1

Relationship

0
9

Authors

Journals

citations
Cited by 16 publications
(6 citation statements)
references
References 8 publications
0
6
0
Order By: Relevance
“…Stop-Start Gear Selection [15] PMP PMP - [16] QP RB - [17] QP PMP RB [18] PMP DP DP [19] QP DP + cost DP + cost [20] MILP MILP + cost MILP + cost this work PMP DP + cost DP + cost By partitioning a large optimization problem into a set of smaller problems, as in a distributed control system [21], the computational efficiency and robustness are improved, albeit losing the guarantee of global optimality. The process of partitioning is not trivial and many different structures exist.…”
Section: Reference Power-splitmentioning
confidence: 99%
See 1 more Smart Citation
“…Stop-Start Gear Selection [15] PMP PMP - [16] QP RB - [17] QP PMP RB [18] PMP DP DP [19] QP DP + cost DP + cost [20] MILP MILP + cost MILP + cost this work PMP DP + cost DP + cost By partitioning a large optimization problem into a set of smaller problems, as in a distributed control system [21], the computational efficiency and robustness are improved, albeit losing the guarantee of global optimality. The process of partitioning is not trivial and many different structures exist.…”
Section: Reference Power-splitmentioning
confidence: 99%
“…In these approaches, the cost of stop-start and gear change events are not considered, which can result in unacceptable switching behaviour, like hunting oscillations. To overcome this problem, costs on switchings are included, solved using Dynamic Programming (DP) and Quadratic Programming (QP) [19] or as one Mixed Integer Linear Program (MILP) [20]. For real-time solving, the allowed model complexity is limiting and adding additional states to these EMSs is computationally prohibitive.…”
mentioning
confidence: 99%
“…Introducing engine switching and gear selection decisions into the optimization problem is a significant challenge, however, as both require integer decision variables. A range of approaches have been taken, including mixed integer programming [6], Pontryagin's Minimum Principle (PMP) [7], convex relaxation [8], and genetic algorithms [9]. In [10] it was shown in simulations that the globally optimal solution can be obtained by alternating between a convex problem to determine the optimal power split for a fixed engine switching sequence, and PMP for the optimal engine switching given a fixed power split, and that this is generally faster than dynamic programming.…”
Section: Introductionmentioning
confidence: 99%
“…Though DP can find the global optimum and handle non-convex nonlinear problems effectively, the optimality of its solution can be guaranteed only within the discretization accuracy of its states and controls. Other direct methods capable of solving MI problems to optimality are integer enumeration, branchand-bound, cutting planes, piecewise linear approximations, etc., [19]- [22]. All these methods are computationally too expensive due to the combinatorial nature of MI problems and suffer from large run-time variations.…”
Section: A Global Algorithms For Mixed-integer (Mi) Problemsmentioning
confidence: 99%