Pith. sign in

REVIEW 1 cited by

Strong Formulations for Hybrid System Control

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2412.11541 v1 pith:HLQ4IERZ submitted 2024-12-16 math.OC

classification math.OC
keywords hybridproblemcontrolformulationscomputationalconvexcutsinstances
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
abstract

We study the mixed-integer quadratic programming formulation of an $n$-period hybrid control problem with a convex quadratic cost function and linear dynamics. We first give the convex hull description of the single-period, two-mode problem in the original variable space through two new classes of valid cuts. These cuts are then generalized to the single-period, multi-mode, multi-dimensional case and applied to solve the general $n$-period hybrid control problem. Computational experiments demonstrate the effectiveness of the proposed strong formulations derived through the cut generation process in the original variable space. These formulations yield a substantial reduction in computational effort for synthetic test instances and instances from the energy management problem of a power-split hybrid electric vehicle.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Mixed Discrete and Continuous Planning using Shortest Walks in Graphs of Convex Sets

    cs.RO 2025-07 conditional novelty 6.0 of 10

    Shortest walks in graphs of convex sets, guided by SDP-computed cost-to-go lower bounds, provide a unified approximate planner for robot motion, skill chaining, and hybrid control.

Pith tools