Minimizing Running Buffers for Tabletop Object Rearrangement: Complexity, Fast Algorithms, and Applications.
Kai GaoSi Wei FengBaichuan HuangJingjin YuPublished in: CoRR (2023)
Keyphrases
- computational complexity
- worst case
- theoretical analysis
- space complexity
- learning algorithm
- computationally efficient
- benchmark datasets
- computational cost
- computational efficiency
- simulated annealing
- orders of magnitude
- complex objects
- memory requirements
- high computational complexity
- optimization criteria
- computationally complex