dc.creatorPereira, André Grahl
dc.creatorRitt, Marcus
dc.creatorBuriol, Luciana S.
dc.date2014-09
dc.date2014
dc.date2014-10-23T18:17:06Z
dc.identifierhttp://sedici.unlp.edu.ar/handle/10915/41835
dc.identifierhttp://43jaiio.sadio.org.ar/proceedings/IJCAI/1-2.pdf
dc.identifierissn:2362-5120
dc.descriptionThis 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>
dc.descriptionSociedad Argentina de Informática e Investigación Operativa (SADIO)
dc.formatapplication/pdf
dc.format1-2
dc.languageen
dc.rightshttp://creativecommons.org/licenses/by/3.0/
dc.rightsCreative Commons Attribution 3.0 Unported (CC BY 3.0)
dc.subjectCiencias Informáticas
dc.subjectProblem Solving, Control Methods, and Search
dc.titleSolving motion planning problems
dc.typeObjeto de conferencia
dc.typeObjeto de conferencia


Este ítem pertenece a la siguiente institución