Discrete Optimal View Path Planning

Sebastian Haner, Anders Heyden

2015

Abstract

This paper presents a discrete model of a sensor path planning problem, with a long-term planning horizon. The goal is to minimize the covariance of the reconstructed structures while meeting constraints on the length of the traversed path of the sensor. The sensor is restricted to move on a graph representing a discrete set of configurations, and additional constraints can be incorporated by altering the graph connectivity. This combinatorial problem is formulated as an integer semi-definite program, the relaxation of which provides both a lower bound on the objective cost and input to a proposed genetic algorithm for solving the original problem. An evaluation on synthetic data indicates good performance.

Paper Citation

in Harvard Style

Haner S. and Heyden A. (2015). Discrete Optimal View Path Planning . In Proceedings of the 10th International Conference on Computer Vision Theory and Applications - Volume 3: VISAPP, (VISIGRAPP 2015) ISBN 978-989-758-091-8, pages 411-419. DOI: 10.5220/0005252104110419

in Bibtex Style

@conference{visapp15,
author={Sebastian Haner and Anders Heyden},
title={Discrete Optimal View Path Planning},
booktitle={Proceedings of the 10th International Conference on Computer Vision Theory and Applications - Volume 3: VISAPP, (VISIGRAPP 2015)},
year={2015},
pages={411-419},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0005252104110419},
isbn={978-989-758-091-8},
}

in EndNote Style

TY - CONF
JO - Proceedings of the 10th International Conference on Computer Vision Theory and Applications - Volume 3: VISAPP, (VISIGRAPP 2015)
TI - Discrete Optimal View Path Planning
SN - 978-989-758-091-8
AU - Haner S.
AU - Heyden A.
PY - 2015
SP - 411
EP - 419
DO - 10.5220/0005252104110419