Lawrence Mandow
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Lawrence Mandow has a total of 30 co-authors. Here are the top co-authors by number of shared publications:
- José-Luis Pérez-De-La-Cruz
Universidad de Málaga
13 shared publications Enrique Machuca
Univ. Malaga
3 shared publicationsJavier Boned
3 shared publicationsManuela Ruiz-Montiel
3 shared publicationsE. Machuca
2 shared publications- Eva Millán
University of Malaga
2 shared publications
Latest Publications
- Open Access
- 2 November 2021
- Published by Springer Nature in Journal of Global Optimization
- Vol. 82 (3) , 595-614
Multi-objective dynamic programming with limited precision
This paper addresses the problem of approximating the set of all solutions for Multi-objective Markov Decision Processes. We show that in the vast majority of interesting cases, the number of solutions is exponential or even infinite. In order to overcome this difficulty we propose to approximate the set of all solutions by means of a limited precision approach based on White’s multi-objective value-iteration dynamic programming algorithm. We prove that the number of calculated solutions is tractable and show experimentally that the solutions obtained are a good approximation of the true Pareto front.
- 2 November 2021
- Published by Springer Nature in Journal of Global Optimization
- Vol. 82 (3) , 595-614
Open AccessMulti-objective dynamic programming with limited precision
This paper addresses the problem of approximating the set of all solutions for Multi-objective Markov Decision Processes. We show that in the vast majority of interesting cases, the number of solutions is exponential or even infinite. In order to overcome this difficulty we propose to approximate the set of all solutions by means of a limited precision approach based on White’s multi-objective value-iteration dynamic programming algorithm. We prove that the number of calculated solutions is tractable and show experimentally that the solutions obtained are a good approximation of the true Pareto front.
- 16 January 2017
- Published by SAGE Publications in Journal of Ambient Intelligence and Smart Environments
- Vol. 9 (1) , 129-144
A mobile and interactive multiobjective urban tourist route planning system
Tourism is an emerging target area for interactive mobile device applications. This paper evaluates the performance of a multiobjective interactive urban route planner that calculates walking routes for tourists in urban areas. The system allows tour
- 16 January 2017
- Published by SAGE Publications in Journal of Ambient Intelligence and Smart Environments
- Vol. 9 (1) , 129-144
A mobile and interactive multiobjective urban tourist route planning system
Tourism is an emerging target area for interactive mobile device applications. This paper evaluates the performance of a multiobjective interactive urban route planner that calculates walking routes for tourists in urban areas. The system allows tour
- 18 December 2015
- Published by Springer Nature in Progress in Artificial Intelligence
- Vol. 5 (1) , 47-53
Fuzzy shape grammars
- 18 December 2015
- Published by Springer Nature in Progress in Artificial Intelligence
- Vol. 5 (1) , 47-53
Fuzzy shape grammars
- 24 June 2015
- Published by Springer Nature in Journal of Global Optimization
- Vol. 64 (1) , 63-77
Lower bound sets for biobjective shortest path problems
- 24 June 2015
- Published by Springer Nature in Journal of Global Optimization
- Vol. 64 (1) , 63-77
Lower bound sets for biobjective shortest path problems
- 1 November 2014
- Published by Elsevier in Computer-Aided Design
- Vol. 56, 104-119
Layered shape grammars
- 1 November 2014
- Published by Elsevier in Computer-Aided Design
- Vol. 56, 104-119
Layered shape grammars
- 1 November 2014
- Published by Elsevier in European Journal of Operational Research
- Vol. 239 (1) , 89-101
Multiobjective shortest path problems with lexicographic goal-based preferences
- 1 November 2014
- Published by Elsevier in European Journal of Operational Research
- Vol. 239 (1) , 89-101
Multiobjective shortest path problems with lexicographic goal-based preferences
- 1 July 2014
- Published by Elsevier in Design Studies
- Vol. 35 (4) , 392-411
Randomness and control in design processes: An empirical study with architecture students
- 1 July 2014
- Published by Elsevier in Design Studies
- Vol. 35 (4) , 392-411
Randomness and control in design processes: An empirical study with architecture students
- 1 May 2013
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 15302075,p. 215-224
Parallel Label-Setting Multi-objective Shortest Path Search
We present a parallel algorithm for finding all Pareto optimal paths from a specified source in a graph. The algorithm is label-setting, i.e., it only performs work on distance labels that are optimal. The main result is that the added complexity when going from one to multiple objectives is completely parallelizable. The algorithm is based on a multiobjective generalization of a priority queue. Such a Pareto queue can be efficiently implemented for two dimensions. Surprisingly, the parallel biobjective approach yields an algorithm performing asymptotically less work than the previous sequential algorithms. We also discuss generalizations for d ≥ 3 objective functions and for single target search.
- 1 May 2013
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 15302075,p. 215-224
Parallel Label-Setting Multi-objective Shortest Path Search
We present a parallel algorithm for finding all Pareto optimal paths from a specified source in a graph. The algorithm is label-setting, i.e., it only performs work on distance labels that are optimal. The main result is that the added complexity when going from one to multiple objectives is completely parallelizable. The algorithm is based on a multiobjective generalization of a priority queue. Such a Pareto queue can be efficiently implemented for two dimensions. Surprisingly, the parallel biobjective approach yields an algorithm performing asymptotically less work than the previous sequential algorithms. We also discuss generalizations for d ≥ 3 objective functions and for single target search.
- 1 April 2013
- Published by Elsevier in Advanced Engineering Informatics
- Vol. 27 (2) , 230-245
Design with shape grammars and reinforcement learning
- 1 April 2013
- Published by Elsevier in Advanced Engineering Informatics
- Vol. 27 (2) , 230-245
Design with shape grammars and reinforcement learning
- 1 January 2013
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 1-11
An Evaluation of Best Compromise Search in Graphs
- 1 January 2013
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 1-11
An Evaluation of Best Compromise Search in Graphs