uu.seUppsala University Publications
Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Optimal Scheduling of Multiple Sensors with Packet Length Constraint
Hong Kong Univ Sci & Technol, Dept Elect & Comp Engn, Hong Kong, Hong Kong, Peoples R China..
Hong Kong Univ Sci & Technol, Dept Elect & Comp Engn, Hong Kong, Hong Kong, Peoples R China..
Uppsala University, Disciplinary Domain of Science and Technology, Technology, Department of Engineering Sciences, Signals and Systems Group.ORCID iD: 0000-0003-0762-5743
Hong Kong Univ Sci & Technol, Dept Elect & Comp Engn, Hong Kong, Hong Kong, Peoples R China..
2017 (English)In: IFAC - PapersOnLine, Elsevier, 2017, Vol. 50, no 1, p. 14430-14435Conference paper, Published paper (Refereed)
Abstract [en]

This paper considers the problem of sensory data scheduling of multiple processes. There are n independent linear time-invariant processes and a remote estimator monitoring all the processes. Each process is measured by a sensor, which sends its local state estimate to the remote estimator. The sizes of the packets are different due to different dimensions of each process, and thus it may take different lengths of time steps for the sensors to send their data. Because of bandwidth limitation, only a portion of all the sensors are allowed to transmit in each time step. Our goal is to minimize the average of estimation error covariance of the whole system at the remote estimator. The problem is formulated as a Markov decision process (MDP) with average cost over an infinite time horizon. We prove the existence of a deterministic and stationary policy for the problem. We also find that the optimal policy has a consistent behavior and threshold type structure. A numerical example is provided to illustrate our main results. (C) 2017, IFAC (International Federation of Automatic Control) Hosting by Elsevier Ltd. All rights reserved.

Place, publisher, year, edition, pages
Elsevier, 2017. Vol. 50, no 1, p. 14430-14435
Keywords [en]
Sensor scheduling, Markov decision process, packet length, threshold policy
National Category
Control Engineering
Identifiers
URN: urn:nbn:se:uu:diva-350665DOI: 10.1016/j.ifacol.2017.08.2283ISI: 000423965200393OAI: oai:DiVA.org:uu-350665DiVA, id: diva2:1205881
Conference
20th World Congress of the International-Federation-of-Automatic-Control (IFAC), JUL 09-14, 2017, Toulouse, FRANCE
Available from: 2018-05-15 Created: 2018-05-15 Last updated: 2018-05-15Bibliographically approved

Open Access in DiVA

No full text in DiVA

Other links

Publisher's full text

Authority records BETA

Dey, Subhrakanti

Search in DiVA

By author/editor
Dey, Subhrakanti
By organisation
Signals and Systems Group
Control Engineering

Search outside of DiVA

GoogleGoogle Scholar

doi
urn-nbn

Altmetric score

doi
urn-nbn
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf