Pith. sign in

REVIEW

Co-design of Safe and Efficient Networked Control Systems in Factory Automation with State-dependent Wireless Fading Channels

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 1708.06468 v1 pith:TCZGJF7J submitted 2017-08-22 math.OC

Co-design of Safe and Efficient Networked Control Systems in Factory Automation with State-dependent Wireless Fading Channels

classification math.OC
keywords safetywirelesschannelco-designefficiencyfadingphysicalstate-dependent
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
read the original abstract

In factory automation, heterogeneous manufacturing processes need to be coordinated over wireless networks to achieve safety and efficiency. These wireless networks, however, are inherently unreliable due to shadow fading induced by the physical motion of the machinery. To assure both safety and efficiency, this paper proposes a state-dependent channel model that captures the interaction between the physical and communication systems. By adopting this channel model, sufficient conditions on the maximum allowable transmission interval are then derived to ensure stochastic safety for a nonlinear physical system controlled over a state-dependent wireless fading channel. Under these sufficient conditions, the safety and efficiency co-design problem is formulated as a constrained cooperative game, whose equilibria represent optimal control and transmission power policies that minimize a discounted joint-cost in an infinite horizon. This paper shows that the equilibria of the constrained game are solutions to a non-convex generalized geometric program, which are approximated by solving two convex programs. The optimality gap is quantified as a function of the size of the approximation region in convex programs, and asymptotically converges to zero by adopting a branch-bound algorithm. Simulation results of a networked robotic arm and a forklift truck are presented to verify the proposed co-design method.

discussion (0)

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