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”

Where to Place a Pile?

The result's identifiers

  • Result code in IS VaVaI

    <a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21230%2F23%3A00370896" target="_blank" >RIV/68407700:21230/23:00370896 - isvavai.cz</a>

  • Alternative codes found

    RIV/68407700:21730/23:00370896

  • Result on the web

    <a href="https://doi.org/10.1109/ECMR59166.2023.10256330" target="_blank" >https://doi.org/10.1109/ECMR59166.2023.10256330</a>

  • DOI - Digital Object Identifier

    <a href="http://dx.doi.org/10.1109/ECMR59166.2023.10256330" target="_blank" >10.1109/ECMR59166.2023.10256330</a>

Alternative languages

  • Result language

    angličtina

  • Original language name

    Where to Place a Pile?

  • Original language description

    When planning missions for autonomous machines in real-world scenarios, such as open-pit mining, painting, or harvesting, it is important to consider how the machines will alter the working environment during their operations. Traditional planning methods treat such changes, like piles built during drilling, as constraints given to the planner that depend on the machine's trajectory. The goal is to find a trajectory that satisfies these constraints. However, our approach formulates the planning problem as finding optimal positions for changes, such as piles, along the machine's trajectory. We propose a heuristic solver and provide extensive experimental evaluations.

  • 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/GA23-05104S" target="_blank" >GA23-05104S: Multi-Robotic Path Planning and Execution</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 11th European Conference on Mobile Robots

  • ISBN

    979-8-3503-0704-7

  • ISSN

    2639-7919

  • e-ISSN

  • Number of pages

    7

  • Pages from-to

    312-318

  • Publisher name

    Institute of Electrical and Electronics Engineers

  • Place of publication

    Brighton

  • Event location

    Coimbra

  • Event date

    Sep 4, 2023

  • Type of event by nationality

    WRD - Celosvětová akce

  • UT code for WoS article

    001082260500046