# Beyond Manual Planning: Seating Allocation for Large Organizations

arXiv: https://arxiv.org/abs/2602.05875 · HTML: https://mlsanity.com/paper/2602.05875/

## Key facts

- No citing papers in the map yet (data through 14 Oct 2026).
- Builds on 3 of its 21 references that are in the map.
- First posted on arXiv 5 Feb 2026.

## Builds on (most cited first, 3 of 3)

- [The FastMap Algorithm for Shortest Path Computations](https://mlsanity.com/paper/1706.02792/) (2017)
- [Optimal Seat Allocation Under Social Distancing Constraints](https://mlsanity.com/paper/2105.05017/) (2021)
- [Multi-Target Search in Euclidean Space with Ray Shooting (Full Version)](https://mlsanity.com/paper/2207.02436/) (2022)

## Abstract (arXiv)

We introduce the Hierarchical Seating Allocation Problem (HSAP) which addresses the optimal assignment of hierarchically structured organizational teams to physical seating arrangements on a floor plan. This problem is driven by the necessity for large organizations with large hierarchies to ensure that teams with close hierarchical relationships are seated in proximity to one another, such as ensuring a research group occupies a contiguous area. Currently, this problem is managed manually leading to infrequent and suboptimal replanning efforts. To alleviate this manual process, we propose an end-to-end framework to solve the HSAP. A scalable approach to calculate the distance between any pair of seats using a probabilistic road map (PRM) and rapidly-exploring random trees (RRT) which is combined with heuristic search and dynamic programming approach to solve the HSAP using integer programming. We demonstrate our approach under different sized instances by evaluating the PRM framework and subsequent allocations both quantitatively and qualitatively.