Fully Automatic Trunk Packing with Free Placements
Ernst Althaus, Peter Hachenberger

TL;DR
This paper introduces a new algorithm that accurately computes trunk volume based on SAE standards, utilizing advanced computational geometry and optimization techniques to outperform previous methods for small trunks.
Contribution
The paper presents a novel algorithm combining computational geometry and combinatorial optimization for trunk volume calculation, improving accuracy over prior approaches for small trunks.
Findings
Better solutions for small trunk volumes
Utilizes state-of-the-art computational methods
Outperforms previous approaches
Abstract
We present a new algorithm to compute the volume of a trunk according to the SAE J1100 standard. Our new algorithm uses state-of-the-art methods from computational geometry and from combinatorial optimization. It finds better solutions than previous approaches for small trunks.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsComputational Geometry and Mesh Generation · Optimization and Packing Problems · Robotic Path Planning Algorithms
