2026-04-13T01:48:56Zhttps://recercat.cat/oai/requestoai:recercat.cat:10256/116762024-06-18T12:15:53Zcom_2072_452955com_2072_2054col_2072_453069
RECERCAT
author
Castro Villegas, Francesc
author
Acebo Peña, Esteve del
author
Sbert, Mateu
2024-06-18T12:15:53Z
2024-06-18T12:15:53Z
info:eu-repo/date/embargoEnd/2026-01-01info:eu-repo/date/embargoEnd/2026-01-012012
http://hdl.handle.net/10256/11676
A new definition is given to the problem of light positioning in a closed environment, aiming at obtaining, for a global illumination radiosity solution, the position and emission power for a given number of lights that provide a desired illumination at a minimum total emission power. Such a desired illumination is expressed using minimum and/or maximum values of irradiance allowed, resulting in a combinatory optimization problem. A pre-process computes and stores irradiances for a pre-established set of light positions by means of a radiosity random walk. The reuse of photon paths makes this pre-process reasonably cheap. Different heuristic search algorithms, combined to linear programming, are discussed and compared, from the simplest hill climbing strategies to the more sophisticated population-based and hybrid approaches. The paper shows how the presented approaches make it possible to obtain a good solution to the problem at a reasonable costThis project has been funded in part with grant number TIN2010-21089-C03-01 from Spanish Government, and with grant number 2009 SGR 643 from Catalan Government
Tots els drets reservats info:eu-repo/semantics/embargoedAccess
Programació heurística
Heuristic programming
Intel·ligència artificial
Artificial intelligence
Algorismes genètics
Computer algorithms
Energy-saving light positioning using heuristic search
info:eu-repo/semantics/article info:eu-repo/semantics/publishedVersion