Pith. sign in

REVIEW

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 2001.04906 v1 pith:HPNR3DDR submitted 2020-01-14 math.OC cs.SYeess.SY

A unified analytical framework for a class of optimal control problems on networked systems

classification math.OC cs.SYeess.SY
keywords problemscontroloptimalclassnetworksacrossanalysisanalytical
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
read the original abstract

We consider a class of optimal control problems on networks that generically permits a reduction to a universal set of reference problems without differential constraints that may be solved analytically. The derivation shows that input homogeneity across the network results in universally constant optimal control inputs. These predictions are validated using numerical analysis of problems of synchronization of coupled phase oscillators and spreading dynamics on time-varying networks.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.