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”

Tackling Train Routing via Multi-agent Pathfinding and Constraint-based Scheduling

The result's identifiers

  • Result code in IS VaVaI

    <a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F22%3A10455468" target="_blank" >RIV/00216208:11320/22:10455468 - isvavai.cz</a>

  • Result on the web

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

  • DOI - Digital Object Identifier

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

Alternative languages

  • Result language

    angličtina

  • Original language name

    Tackling Train Routing via Multi-agent Pathfinding and Constraint-based Scheduling

  • Original language description

    The train routing problem deals with allocating railway tracks to trains so that the trains follow their timetables and there are no collisions among the trains (all safety rules are followed). This paper studies the train routing problem from the multi-agent pathfinding (MAPF) perspective, which proved very efficient for collision-free path planning of multiple agents in a shared environment. Specifically, we modify a reduction-based MAPF model to cover the peculiarities of the train routing problem (various train lengths, in particular), and we also propose a new constraint-based scheduling model with optional activities. We compare the two models both theoretically and empirically.

  • 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/LTAUSA19072" target="_blank" >LTAUSA19072: Lifelong Planning for a Smart Swarm</a><br>

  • Continuities

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

Others

  • Publication year

    2022

  • 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

    ICAART: PROCEEDINGS OF THE 14TH INTERNATIONAL CONFERENCE ON AGENTS AND ARTIFICIAL INTELLIGENCE - VOL 1

  • ISBN

    978-989-758-547-0

  • ISSN

    2184-433X

  • e-ISSN

  • Number of pages

    8

  • Pages from-to

    306-313

  • Publisher name

    SCITEPRESS

  • Place of publication

    SETUBAL

  • Event location

    online

  • Event date

    Feb 3, 2022

  • Type of event by nationality

    WRD - Celosvětová akce

  • UT code for WoS article

    000774749000032