The Space Planning algorithm family is a technology that derives optimal placement methods to efficiently load boxes of various sizes into constrained 3D spaces (containers, pallets, boxes, etc.). It ensures center-of-gravity stability, preventing cargo from collapsing by appropriately distributing the load. It can also be configured to control constraints such as horizontal/vertical rotation restrictions and location margins for individual cargo items. Based on the cargo size and quantity data provided by the user, it offers various strategies and presents the step-by-step movement sequence at each point in time so the calculated layout can be implemented in reality.

The Space Planning Dynamic algorithm is a technique that selects stable placement policies to handle sequential inputs in situations where the arrival order of items is unknown. Based on the specifications and ratio data of individual items, it provides layouts using various policies aimed at minimizing the probability of placement failure for future incoming cargo, or optimizing the average volume utilization rate.

The Space Planning Static algorithm is used when the types and quantities of items to be placed are determined in advance. By approaching the problem with minimized constraints—such as ignoring the strict arrival order of the cargo—it aims to achieve a figure close to the theoretical maximum loading rate.