Research Article
A Two-Stage Path Planning Method for the Rearrangement Problem in Modular Puzzle-Based Storage System
| | Input: order Q, current state | | | Output: optimal matched group . | | (1) | Initialize, , | | (2) | whiledo | | (3) | get , | | (4) | foreachdo | | (5) | foreachdo | | (6) | if check = true then | | (7) | | | (8) | end if | | (9) | end foreach | | (10) | end foreach | | (11) | | | (12) | end while | | (13) | = | | (14) | return |
|
