Constrained light deployment for reducing energy consumption in buildings

Huamei Tian; Kui Wu; Sue Whitesides; Cuiying Feng

doi:10.1007/978-3-319-48749-6_26

Constrained light deployment for reducing energy consumption in buildings

Huamei Tian
, Kui Wu^*
, Sue Whitesides
, Cuiying Feng

^*Corresponding author for this work

Research output: Chapters, Conference Papers, Creative and Literary Works › RGC 32 - Refereed conference paper (with host publication) › peer-review

Abstract

Lighting systems account for a major part of the energy consumed by large commercial buildings. This paper aims at reducing this energy consumption by defining the Contrained Light Deployment Problem. This new problem is related to the classical Art Gallery Problem (AGP) in computational geometry. In contrast to AGP, which asks for the minimum number of guards to monitor a polygonal area, our problem, CLDP, poses a new challenging requirement: not only must each point p have an unobstructed line-of-sight to a light source, but also, the combined illuminance at p from all light sources must exceed some given threshold value. We provide evidence that our new problem is NPhard, based on known results for AGP. Then we propose fast heuristics for floor plans shaped like orthogonal polygons, with and without holes. Our problem formulation allows lights to be placed internally, not only at vertices. Our algorithm, which combines ideas from computational geometry, clustering and binary search, computes a set of light placements that satisfies the illumination requirement. The algorithm seeks a light set of minimum size by an iterative binary search procedure that progressively tightens upper and lower bounds. © Springer International Publishing AG 2016.

Original language	English
Title of host publication	Combinatorial Optimization and Applications - 10th International Conference, COCOA 2016, Proceedings
Publisher	Springer Verlag
Pages	350-364
Volume	10043 LNCS
ISBN (Print)	9783319487489
DOIs	https://doi.org/10.1007/978-3-319-48749-6_26
Publication status	Published - 2016
Externally published	Yes
Event	10th Annual International Conference on Combinatorial Optimization and Applications (COCOA 2016) - , Hong Kong, China Duration: 16 Dec 2016 → 18 Dec 2016

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	10043 LNCS
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Conference

Conference	10th Annual International Conference on Combinatorial Optimization and Applications (COCOA 2016)
Place	Hong Kong, China
Period	16/12/16 → 18/12/16

Bibliographical note

Publication details (e.g. title, author(s), publication statuses and dates) are captured on an “AS IS” and “AS AVAILABLE” basis at the time of record harvesting from the data source. Suggestions for further amendments or supplementary information can be sent to [email protected].

Access Output

10.1007/978-3-319-48749-6_26

Other Access Options

Check CityUHK Library

Permanent Link

Right click to copy link

Cite this

Tian, H., Wu, K., Whitesides, S., & Feng, C. (2016). Constrained light deployment for reducing energy consumption in buildings. In Combinatorial Optimization and Applications - 10th International Conference, COCOA 2016, Proceedings (Vol. 10043 LNCS, pp. 350-364). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 10043 LNCS). Springer Verlag. https://doi.org/10.1007/978-3-319-48749-6_26

Tian, Huamei ; Wu, Kui ; Whitesides, Sue et al. / Constrained light deployment for reducing energy consumption in buildings. Combinatorial Optimization and Applications - 10th International Conference, COCOA 2016, Proceedings. Vol. 10043 LNCS Springer Verlag, 2016. pp. 350-364 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{3f40129b3a0c40f49f6c09e63f003a93,

title = "Constrained light deployment for reducing energy consumption in buildings",

abstract = "Lighting systems account for a major part of the energy consumed by large commercial buildings. This paper aims at reducing this energy consumption by defining the Contrained Light Deployment Problem. This new problem is related to the classical Art Gallery Problem (AGP) in computational geometry. In contrast to AGP, which asks for the minimum number of guards to monitor a polygonal area, our problem, CLDP, poses a new challenging requirement: not only must each point p have an unobstructed line-of-sight to a light source, but also, the combined illuminance at p from all light sources must exceed some given threshold value. We provide evidence that our new problem is NPhard, based on known results for AGP. Then we propose fast heuristics for floor plans shaped like orthogonal polygons, with and without holes. Our problem formulation allows lights to be placed internally, not only at vertices. Our algorithm, which combines ideas from computational geometry, clustering and binary search, computes a set of light placements that satisfies the illumination requirement. The algorithm seeks a light set of minimum size by an iterative binary search procedure that progressively tightens upper and lower bounds. {\textcopyright} Springer International Publishing AG 2016.",

author = "Huamei Tian and Kui Wu and Sue Whitesides and Cuiying Feng",

note = "Publication details (e.g. title, author(s), publication statuses and dates) are captured on an “AS IS” and “AS AVAILABLE” basis at the time of record harvesting from the data source. Suggestions for further amendments or supplementary information can be sent to [email protected].; 10th Annual International Conference on Combinatorial Optimization and<br/>Applications (COCOA 2016) ; Conference date: 16-12-2016 Through 18-12-2016",

year = "2016",

doi = "10.1007/978-3-319-48749-6\_26",

language = "English",

isbn = "9783319487489",

volume = "10043 LNCS",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Verlag",

pages = "350--364",

booktitle = "Combinatorial Optimization and Applications - 10th International Conference, COCOA 2016, Proceedings",

address = "Germany",

}

Tian, H, Wu, K, Whitesides, S & Feng, C 2016, Constrained light deployment for reducing energy consumption in buildings. in Combinatorial Optimization and Applications - 10th International Conference, COCOA 2016, Proceedings. vol. 10043 LNCS, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 10043 LNCS, Springer Verlag, pp. 350-364, 10th Annual International Conference on Combinatorial Optimization and
Applications (COCOA 2016), Hong Kong, China, 16/12/16. https://doi.org/10.1007/978-3-319-48749-6_26

Constrained light deployment for reducing energy consumption in buildings. / Tian, Huamei; Wu, Kui; Whitesides, Sue et al.
Combinatorial Optimization and Applications - 10th International Conference, COCOA 2016, Proceedings. Vol. 10043 LNCS Springer Verlag, 2016. p. 350-364 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 10043 LNCS).

Research output: Chapters, Conference Papers, Creative and Literary Works › RGC 32 - Refereed conference paper (with host publication) › peer-review

TY - GEN

T1 - Constrained light deployment for reducing energy consumption in buildings

AU - Tian, Huamei

AU - Wu, Kui

AU - Whitesides, Sue

AU - Feng, Cuiying

N1 - Publication details (e.g. title, author(s), publication statuses and dates) are captured on an “AS IS” and “AS AVAILABLE” basis at the time of record harvesting from the data source. Suggestions for further amendments or supplementary information can be sent to [email protected].

PY - 2016

Y1 - 2016

N2 - Lighting systems account for a major part of the energy consumed by large commercial buildings. This paper aims at reducing this energy consumption by defining the Contrained Light Deployment Problem. This new problem is related to the classical Art Gallery Problem (AGP) in computational geometry. In contrast to AGP, which asks for the minimum number of guards to monitor a polygonal area, our problem, CLDP, poses a new challenging requirement: not only must each point p have an unobstructed line-of-sight to a light source, but also, the combined illuminance at p from all light sources must exceed some given threshold value. We provide evidence that our new problem is NPhard, based on known results for AGP. Then we propose fast heuristics for floor plans shaped like orthogonal polygons, with and without holes. Our problem formulation allows lights to be placed internally, not only at vertices. Our algorithm, which combines ideas from computational geometry, clustering and binary search, computes a set of light placements that satisfies the illumination requirement. The algorithm seeks a light set of minimum size by an iterative binary search procedure that progressively tightens upper and lower bounds. © Springer International Publishing AG 2016.

AB - Lighting systems account for a major part of the energy consumed by large commercial buildings. This paper aims at reducing this energy consumption by defining the Contrained Light Deployment Problem. This new problem is related to the classical Art Gallery Problem (AGP) in computational geometry. In contrast to AGP, which asks for the minimum number of guards to monitor a polygonal area, our problem, CLDP, poses a new challenging requirement: not only must each point p have an unobstructed line-of-sight to a light source, but also, the combined illuminance at p from all light sources must exceed some given threshold value. We provide evidence that our new problem is NPhard, based on known results for AGP. Then we propose fast heuristics for floor plans shaped like orthogonal polygons, with and without holes. Our problem formulation allows lights to be placed internally, not only at vertices. Our algorithm, which combines ideas from computational geometry, clustering and binary search, computes a set of light placements that satisfies the illumination requirement. The algorithm seeks a light set of minimum size by an iterative binary search procedure that progressively tightens upper and lower bounds. © Springer International Publishing AG 2016.

UR - https://www.scopus.com/pages/publications/85007246336

UR - https://www.scopus.com/pages/publications/85007246336#tab=impact

U2 - 10.1007/978-3-319-48749-6_26

DO - 10.1007/978-3-319-48749-6_26

M3 - RGC 32 - Refereed conference paper (with host publication)

SN - 9783319487489

VL - 10043 LNCS

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 350

EP - 364

BT - Combinatorial Optimization and Applications - 10th International Conference, COCOA 2016, Proceedings

PB - Springer Verlag

T2 - 10th Annual International Conference on Combinatorial Optimization and<br/>Applications (COCOA 2016)

Y2 - 16 December 2016 through 18 December 2016

ER -

Tian H, Wu K, Whitesides S, Feng C. Constrained light deployment for reducing energy consumption in buildings. In Combinatorial Optimization and Applications - 10th International Conference, COCOA 2016, Proceedings. Vol. 10043 LNCS. Springer Verlag. 2016. p. 350-364. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/978-3-319-48749-6_26

Constrained light deployment for reducing energy consumption in buildings

Abstract

Publication series

Conference

Bibliographical note

Access Output

Other Access Options

Permanent Link

Other Files and Links

Fingerprint

Cite this