2023
Solving Rearrangement Puzzles Using Path Defragmentation in Factored State Spaces
RA-L 2023
Rearrangement puzzles are variations of rearrangement problems in which the elements of a problem are potentially logically linked together. To efficiently solve such puzzles, we develop a motion planning approach based on a new state space that is logically <italic xmlns:mml="http://www.w3.org/1998