Approximate optimal periodic scheduling of multiple sensors with constraints

A constrained periodic multiple-sensor scheduling problem is considered in this paper. For each sensor, constraints on dwell time and activation times are imposed. At each time instant, only one sensor can update its measurement with the estimator; and the objective is to minimize the average state...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	Automatica (Oxford) Jg. 49; H. 4; S. 993 - 1000
Hauptverfasser:	Shi, Dawei, Chen, Tongwen
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Kidlington Elsevier Ltd 01.04.2013 Elsevier
Schlagworte:	Activation Algorithmics. Computability. Computer arithmetics Algorithms Applied sciences Approximation Computer science; control theory; systems Control theory. Systems Dynamic programming Exact sciences and technology Kalman filters Mathematical analysis Mathematical programming Modelling and identification Operational research and scientific management Operational research. Management science Optimization Riccati equations Schedules Scheduling Scheduling, sequencing Sensors Theoretical computing Traveling salesman problem Wireless sensor networks Wireless sensor networks Traveling salesman problem Dynamic programming Kalman filters Riccati equations Error estimation Kalman filter Periodic scheduling Travelling salesman problem Updating Observer Switching time System identification State estimation Estimation error Multisensor Stopping time Bounded error Measurement sensor Computational complexity Polynomial complexity Upper bound Approximation error Wireless network Objective function Riccati equation Sensor array
ISSN:	0005-1098, 1873-2836
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!