Home > Research > Publications & Outputs > D-Optimal Design for Nested Sensor Placement

Electronic data

  • 2024SudelldPhd

    Final published version, 1.38 MB, PDF document

    Available under license: CC BY-NC: Creative Commons Attribution-NonCommercial 4.0 International License

Text available via DOI:

View graph of relations

D-Optimal Design for Nested Sensor Placement

Research output: ThesisDoctoral Thesis

Published

Standard

D-Optimal Design for Nested Sensor Placement. / Sudell, David.
Lancaster University, 2024. 104 p.

Research output: ThesisDoctoral Thesis

Harvard

APA

Sudell, D. (2024). D-Optimal Design for Nested Sensor Placement. [Doctoral Thesis, Lancaster University]. Lancaster University. https://doi.org/10.17635/lancaster/thesis/2571

Vancouver

Sudell D. D-Optimal Design for Nested Sensor Placement. Lancaster University, 2024. 104 p. doi: 10.17635/lancaster/thesis/2571

Author

Sudell, David. / D-Optimal Design for Nested Sensor Placement. Lancaster University, 2024. 104 p.

Bibtex

@phdthesis{c869b0571ecf4b85825e6d2ad4386033,
title = "D-Optimal Design for Nested Sensor Placement",
abstract = "This thesis introduces a new method for the construction of D-optimal designs with a nesting restriction on the choice of design points. It is motivated by an industrial problem in sensor placement for flood monitoring, although the applications to experiment design are not restricted to this field. The nesting structure has two levels. Design points occupy the lower level, and each design point is required to be associated with precisely one member of the higher level. An adaptation of an existing pairwise swap algorithm, sometimes called the Fedorov algorithm, is made to suit this nesting requirement for static linear models. The adaptation features swap operations at the higher level of the nesting structure as well as at the lower level. The performance of this method is demonstrated using simulated and application datasets. Further adaptations are then made to allow for Poisson models, employing a Gaussian quadrature method to effect a Bayesian design. Changes in design points over time are also made possible using applications of the algorithm for the linear model case. The primary motivation across all of the new methodology and its applications is the use of remote sensors in the natural environment as part of the Internet of Things.",
author = "David Sudell",
year = "2024",
month = nov,
day = "23",
doi = "10.17635/lancaster/thesis/2571",
language = "English",
publisher = "Lancaster University",
school = "Lancaster University",

}

RIS

TY - BOOK

T1 - D-Optimal Design for Nested Sensor Placement

AU - Sudell, David

PY - 2024/11/23

Y1 - 2024/11/23

N2 - This thesis introduces a new method for the construction of D-optimal designs with a nesting restriction on the choice of design points. It is motivated by an industrial problem in sensor placement for flood monitoring, although the applications to experiment design are not restricted to this field. The nesting structure has two levels. Design points occupy the lower level, and each design point is required to be associated with precisely one member of the higher level. An adaptation of an existing pairwise swap algorithm, sometimes called the Fedorov algorithm, is made to suit this nesting requirement for static linear models. The adaptation features swap operations at the higher level of the nesting structure as well as at the lower level. The performance of this method is demonstrated using simulated and application datasets. Further adaptations are then made to allow for Poisson models, employing a Gaussian quadrature method to effect a Bayesian design. Changes in design points over time are also made possible using applications of the algorithm for the linear model case. The primary motivation across all of the new methodology and its applications is the use of remote sensors in the natural environment as part of the Internet of Things.

AB - This thesis introduces a new method for the construction of D-optimal designs with a nesting restriction on the choice of design points. It is motivated by an industrial problem in sensor placement for flood monitoring, although the applications to experiment design are not restricted to this field. The nesting structure has two levels. Design points occupy the lower level, and each design point is required to be associated with precisely one member of the higher level. An adaptation of an existing pairwise swap algorithm, sometimes called the Fedorov algorithm, is made to suit this nesting requirement for static linear models. The adaptation features swap operations at the higher level of the nesting structure as well as at the lower level. The performance of this method is demonstrated using simulated and application datasets. Further adaptations are then made to allow for Poisson models, employing a Gaussian quadrature method to effect a Bayesian design. Changes in design points over time are also made possible using applications of the algorithm for the linear model case. The primary motivation across all of the new methodology and its applications is the use of remote sensors in the natural environment as part of the Internet of Things.

U2 - 10.17635/lancaster/thesis/2571

DO - 10.17635/lancaster/thesis/2571

M3 - Doctoral Thesis

PB - Lancaster University

ER -