Busque entre los 156238 recursos disponibles en el repositorio
Mostrar el registro sencillo del ítem
dc.date.accessioned | 2014-10-23T18:17:06Z | |
dc.date.available | 2014-10-23T18:17:06Z | |
dc.date.issued | 2014 | |
dc.identifier.uri | http://sedici.unlp.edu.ar/handle/10915/41835 | |
dc.description.abstract | 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 (walls) and free squares. There are k movable blocks (stones) and k fixed goal squares. The man 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. (Párrafo extraído del texto a modo de resumen) | en |
dc.format.extent | 1-2 | es |
dc.language | en | es |
dc.subject | Problem Solving, Control Methods, and Search | es |
dc.title | Solving motion planning problems | en |
dc.type | Objeto de conferencia | es |
sedici.identifier.uri | http://43jaiio.sadio.org.ar/proceedings/IJCAI/1-2.pdf | es |
sedici.identifier.issn | 2362-5120 | es |
sedici.creator.person | Pereira, André Grahl | es |
sedici.creator.person | Ritt, Marcus | es |
sedici.creator.person | Buriol, Luciana S. | es |
sedici.subject.materias | Ciencias Informáticas | es |
sedici.description.fulltext | true | es |
mods.originInfo.place | Sociedad Argentina de Informática e Investigación Operativa (SADIO) | es |
sedici.subtype | Objeto de conferencia | es |
sedici.rights.license | Creative Commons Attribution 3.0 Unported (CC BY 3.0) | |
sedici.rights.uri | http://creativecommons.org/licenses/by/3.0/ | |
sedici.date.exposure | 2014-09 | |
sedici.relation.event | XLIII Jornadas Argentinas de Informática e Investigación Operativa (43JAIIO)-Doctoral Consortium (IJCAI) (Buenos Aires, 2014) | es |
sedici.description.peerReview | peer-review | es |