All

What are you looking for?

All
Projects
Results
Organizations

Quick search

  • Projects supported by TA ČR
  • Excellent projects
  • Projects with the highest public support
  • Current projects

Smart search

  • That is how I find a specific +word
  • That is how I leave the -word out of the results
  • “That is how I can find the whole phrase”

Candidate Path Selection Heuristics for Multi-Agent Path Finding: A Novel Compilation-Based Method

The result's identifiers

  • Result code in IS VaVaI

    <a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21240%2F23%3A00371968" target="_blank" >RIV/68407700:21240/23:00371968 - isvavai.cz</a>

  • Result on the web

    <a href="https://doi.org/10.5220/0011693900003393" target="_blank" >https://doi.org/10.5220/0011693900003393</a>

  • DOI - Digital Object Identifier

    <a href="http://dx.doi.org/10.5220/0011693900003393" target="_blank" >10.5220/0011693900003393</a>

Alternative languages

  • Result language

    angličtina

  • Original language name

    Candidate Path Selection Heuristics for Multi-Agent Path Finding: A Novel Compilation-Based Method

  • Original language description

    Multi-Agent path finding (MAPF) is a task of finding non-conflicting paths connecting agents’ specified initial and goal positions in a shared environment. We focus on compilation-based solvers in which the MAPF problem is expressed in a different well established formalism such as mixed-integer linear programming (MILP), Boolean satisfiability (SAT), or constraint programming (CP). As the target solvers for these formalisms act as black-boxes it is challenging to integrate MAPF specific heuristics in the MAPF compilation-based solvers. We show in this work how the build a MAPF encoding for the target SAT solver in which domain specific heuristic knowledge is reflected.

  • Czech name

  • Czech description

Classification

  • Type

    D - Article in proceedings

  • CEP classification

  • OECD FORD branch

    10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)

Result continuities

  • Project

    <a href="/en/project/GA22-31346S" target="_blank" >GA22-31346S: logicMOVE: Logic Reasoning in Motion Planning for Multiple Robotic Agents</a><br>

  • Continuities

    P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Others

  • Publication year

    2023

  • Confidentiality

    S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Data specific for result type

  • Article name in the collection

    Proceedings of the 15th International Conference on Agents and Artificial Intelligence

  • ISBN

    978-989-758-623-1

  • ISSN

    2184-3589

  • e-ISSN

    2184-433X

  • Number of pages

    8

  • Pages from-to

    517-524

  • Publisher name

    SCITEPRESS – Science and Technology Publications, Lda

  • Place of publication

    Lisboa

  • Event location

    Lisbon

  • Event date

    Feb 22, 2023

  • Type of event by nationality

    WRD - Celosvětová akce

  • UT code for WoS article