Solving motion planning problems
This work considers a family of motion planning problems with movable blocks. Such problem is de ned by a maze grid occupied by immovable blocks (<i>walls</i>) and free squares. There are <i>k</i> movable blocks (<i>stones</i>) and <i>k</i> fixed goal...
Guardado en:
| Autores principales: | , , |
|---|---|
| Formato: | Objeto de conferencia |
| Lenguaje: | Inglés |
| Publicado: |
2014
|
| Materias: | |
| Acceso en línea: | http://sedici.unlp.edu.ar/handle/10915/41835 http://43jaiio.sadio.org.ar/proceedings/IJCAI/1-2.pdf |
| Aporte de: |
| Sumario: | This work considers a family of motion planning problems with movable blocks. Such problem is de ned by a maze grid occupied by immovable blocks (<i>walls</i>) and free squares. There are <i>k</i> movable blocks (<i>stones</i>) and <i>k</i> fixed goal squares. The <i>man</i> is a movable block that can traverse free squares and move stones between them. The problem goal is to move the stones from their initial positions to the goal squares with the minimum number of stone moves.
<i>(Párrafo extraído del texto a modo de resumen)</i> |
|---|