arXiv (All)
open access
Sequential Object Placement Optimization with Convex Decomposition
Robotic object packing has been a core challenge for robotic deployment in logistics, industry, etc., due to the curse of dimensionality in combinatorial search and the difficulty of dealing with dynamic collision constraints for irregularly shaped objects. Current heuristic and learning-based metho
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Robust Robot Placement and Tool Geometry Optimization for Continuous Cutting and Welding Trajectories Under Positioning Uncertainty#395479
- TRACS: A Geometry-Aware Framework for Scalable Multi-Agent Path Finding in Warehouses#1048883
- The pickup and delivery problem with cooperative robots#468372
- Training-Free Diffusion Planning with Analytical Local Scores#1161058
- Training-Free Diffusion Planning with Analytical Local Scores#1157230
Record · ID 1156453
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive