About: Simple Direct Propositional Encoding of Cooperative Path Finding Simplified Yet More     Goto   Sponge   NotDistinct   Permalink

An Entity of Type : http://linked.opendata.cz/ontology/domain/vavai/Vysledek, within Data Space : linked.opendata.cz associated with source document(s)

AttributesValues
rdf:type
Description
  • This paper addresses makespan optimal solving of cooperative path-finding problem (CPF) by translating it to propositional satisfiability (SAT). The task in CPF is to relocate a set of agents to given goal locations so that they do not collide with each other. Recent findings indicate that a simple direct en-coding outperforms the more elaborate encodings based on binary encodings of multi-value state variables. The direct encoding is further improved by a hierar-chical build-up that uses auxiliary variables to reduce its size in this work. The conducted experimental evaluation shown that the simple design of the encod-ing together with new improvements which reduced its size significantly are key enablers for faster solving of the encoded CPFs than with existing encod-ings. It has been also shown that the SAT based methods dominates over A* based methods in environments with high occupancy by agents.
  • This paper addresses makespan optimal solving of cooperative path-finding problem (CPF) by translating it to propositional satisfiability (SAT). The task in CPF is to relocate a set of agents to given goal locations so that they do not collide with each other. Recent findings indicate that a simple direct en-coding outperforms the more elaborate encodings based on binary encodings of multi-value state variables. The direct encoding is further improved by a hierar-chical build-up that uses auxiliary variables to reduce its size in this work. The conducted experimental evaluation shown that the simple design of the encod-ing together with new improvements which reduced its size significantly are key enablers for faster solving of the encoded CPFs than with existing encod-ings. It has been also shown that the SAT based methods dominates over A* based methods in environments with high occupancy by agents. (en)
Title
  • Simple Direct Propositional Encoding of Cooperative Path Finding Simplified Yet More
  • Simple Direct Propositional Encoding of Cooperative Path Finding Simplified Yet More (en)
skos:prefLabel
  • Simple Direct Propositional Encoding of Cooperative Path Finding Simplified Yet More
  • Simple Direct Propositional Encoding of Cooperative Path Finding Simplified Yet More (en)
skos:notation
  • RIV/00216208:11320/14:10287455!RIV15-MSM-11320___
http://linked.open...avai/riv/aktivita
http://linked.open...avai/riv/aktivity
  • I, P(GAP103/10/1287)
http://linked.open...vai/riv/dodaniDat
http://linked.open...aciTvurceVysledku
http://linked.open.../riv/druhVysledku
http://linked.open...iv/duvernostUdaju
http://linked.open...titaPredkladatele
http://linked.open...dnocenehoVysledku
  • 44887
http://linked.open...ai/riv/idVysledku
  • RIV/00216208:11320/14:10287455
http://linked.open...riv/jazykVysledku
http://linked.open.../riv/klicovaSlova
  • A*; SAT encodings; propositional satisfiability (SAT); cooperative path-finding (CPF) (en)
http://linked.open.../riv/klicoveSlovo
http://linked.open...ontrolniKodProRIV
  • [2905CD4C348D]
http://linked.open...v/mistoKonaniAkce
  • Mexico
http://linked.open...i/riv/mistoVydani
  • Mexico
http://linked.open...i/riv/nazevZdroje
  • Proceedings of the 13th Mexican International Conference on Artificial Intelligence
http://linked.open...in/vavai/riv/obor
http://linked.open...ichTvurcuVysledku
http://linked.open...cetTvurcuVysledku
http://linked.open...vavai/riv/projekt
http://linked.open...UplatneniVysledku
http://linked.open...iv/tvurceVysledku
  • Surynek, Pavel
http://linked.open...vavai/riv/typAkce
http://linked.open.../riv/zahajeniAkce
number of pages
http://purl.org/ne...btex#hasPublisher
  • Springer-Verlag
https://schema.org/isbn
  • 978-3-319-13649-3
http://localhost/t...ganizacniJednotka
  • 11320
Faceted Search & Find service v1.16.118 as of Jun 21 2024


Alternative Linked Data Documents: ODE     Content Formats:   [cxml] [csv]     RDF   [text] [turtle] [ld+json] [rdf+json] [rdf+xml]     ODATA   [atom+xml] [odata+json]     Microdata   [microdata+json] [html]    About   
This material is Open Knowledge   W3C Semantic Web Technology [RDF Data] Valid XHTML + RDFa
OpenLink Virtuoso version 07.20.3240 as of Jun 21 2024, on Linux (x86_64-pc-linux-gnu), Single-Server Edition (126 GB total memory, 112 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software