Minimizing running buffers for tabletop object rearrangement: Complexity, fast algorithms, and applications.
Kai GaoSi Wei FengBaichuan HuangJingjin YuPublished in: Int. J. Robotics Res. (2023)
Keyphrases
- computational complexity
- computationally efficient
- worst case
- times faster
- benchmark datasets
- lower complexity
- computational efficiency
- computational cost
- combinatorial optimization
- space complexity
- high computational complexity
- learning algorithm
- significant improvement
- neural network
- data model
- image sequences
- data objects
- memory requirements