Co-scheduling of Communication and Control of Multi-Hop Control Networks
Summary :
We consider a multi-hop control network where a wireless network is used for transmissions of input and output data between a plant and a computing system. We formulate a co-scheduling problem of sampling of the plant's outputs, execution of control tasks, and the routing of data transmissions in the network. Several constraints on control tasks and data transmission are described by logical formulae. By using a SAT solver, we obtain a scheduling satisfying the constraints. Through simulation, we investigate the relationship between the computation time in the SAT solver and the number of nodes in the network.
- Publication
- IEICE TRANSACTIONS on Fundamentals Vol.E96-A No.5 pp.878-885
- Publication Date
- 2013/05/01
- Publicized
- Online ISSN
- 1745-1337
- DOI
- 10.1587/transfun.E96.A.878
- Type of Manuscript
- Special Section PAPER (Special Section on Networked Control Systems: Theories & Applications)
- Category
Authors
Keyword
Latest Issue
Copyrights notice of machine-translated contents
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Cite this
Copy
Yasuki NANAMORI, Toshimitsu USHIO, "Co-scheduling of Communication and Control of Multi-Hop Control Networks" in IEICE TRANSACTIONS on Fundamentals,
vol. E96-A, no. 5, pp. 878-885, May 2013, doi: 10.1587/transfun.E96.A.878.
Abstract: We consider a multi-hop control network where a wireless network is used for transmissions of input and output data between a plant and a computing system. We formulate a co-scheduling problem of sampling of the plant's outputs, execution of control tasks, and the routing of data transmissions in the network. Several constraints on control tasks and data transmission are described by logical formulae. By using a SAT solver, we obtain a scheduling satisfying the constraints. Through simulation, we investigate the relationship between the computation time in the SAT solver and the number of nodes in the network.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/transfun.E96.A.878/_p
Copy
@ARTICLE{e96-a_5_878,
author={Yasuki NANAMORI, Toshimitsu USHIO, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={Co-scheduling of Communication and Control of Multi-Hop Control Networks},
year={2013},
volume={E96-A},
number={5},
pages={878-885},
abstract={We consider a multi-hop control network where a wireless network is used for transmissions of input and output data between a plant and a computing system. We formulate a co-scheduling problem of sampling of the plant's outputs, execution of control tasks, and the routing of data transmissions in the network. Several constraints on control tasks and data transmission are described by logical formulae. By using a SAT solver, we obtain a scheduling satisfying the constraints. Through simulation, we investigate the relationship between the computation time in the SAT solver and the number of nodes in the network.},
keywords={},
doi={10.1587/transfun.E96.A.878},
ISSN={1745-1337},
month={May},}
Copy
TY - JOUR
TI - Co-scheduling of Communication and Control of Multi-Hop Control Networks
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 878
EP - 885
AU - Yasuki NANAMORI
AU - Toshimitsu USHIO
PY - 2013
DO - 10.1587/transfun.E96.A.878
JO - IEICE TRANSACTIONS on Fundamentals
SN - 1745-1337
VL - E96-A
IS - 5
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - May 2013
AB - We consider a multi-hop control network where a wireless network is used for transmissions of input and output data between a plant and a computing system. We formulate a co-scheduling problem of sampling of the plant's outputs, execution of control tasks, and the routing of data transmissions in the network. Several constraints on control tasks and data transmission are described by logical formulae. By using a SAT solver, we obtain a scheduling satisfying the constraints. Through simulation, we investigate the relationship between the computation time in the SAT solver and the number of nodes in the network.
ER -
English
