A graph-theoretic approach to constrained floor plan estimation from radar measurements

Authors:
Granger Hickman;Jeffrey L. Krolik
Affiliations:
Department of Electrical and Computer Engineering, Duke University, Durham, NC;Department of Electrical and Computer Engineering, Duke University, Durham, NC
Venue:
IEEE Transactions on Signal Processing
Year:
2009

Citing 5
Cited 0

The mathematics of nonlinear programming

The mathematics of nonlinear programming
Data structures and algorithms with object-oriented design patterns in C++

Data structures and algorithms with object-oriented design patterns in C++
An algorithm for exhaustive generation of building floor plans

Communications of the ACM
An algorithm for finding a rectangular dual of a planar graph for use in area planning for VLSI integrated circuits.

DAC '84 Proceedings of the 21st Design Automation Conference
An approach to computerized space planning using graph theory

DAC '71 Proceedings of the 8th Design Automation Workshop

Quantified Score

Hi-index	35.68

Visualization

Abstract

This paper proposes an approach to deducing the floor plan of a building using only a set of noisy room dimension measurements that have been obtained indirectly through radar probes. It is not assumed that the set of measurements is complete. The key featurt of this approach is a method of relating, via a graph-theoretical construction, a given floor plan topology to a model that depends linearly on a minimal set of parameters. Given a list of floor-plan topologies and a system of realizability constraints, it is possible to formulate this problem as a constrained least-squares optimization problem. An algorithm for generating all floor plan topologies with a specified number of rooms is presented, as well as an algorithm for deciding if two floor plan representations are isomorphic. The techniques in this paper are intended to serve as an exploration into the theoretical performance bounds on the floor plan estimation problem.