Example of
using classical search technique
This movie shows the plans generated using a classical A* search
algorithm. Each letter was planned individually. The approximate
planning time for each letter
was 20 seconds.
Example 35 modules
This movie shows the plan generated using our approach for 35 modules.
The planning time was approximately 280 miliseconds
Example of with 245
modules
This movie shows the plan generated using our approach for 245 modules.
The planning time was approximately 400 miliseconds
Example of
hierarchical planner with 1715 modules
This movie shows the plan generated using our approach for 1715
modules. The planning time was approximately 6 seconds
Example of
hierarchical planner with 12005 modules
This movie shows the plan generated using our approach for 12005
modules. The planning time was approximately 2 minutes.