Zobrazeno 1 - 10
of 146
pro vyhledávání: '"Kulich, Miroslav"'
Hybrid Filtering Heuristic for the Sensor-Placement Problem to Discretize 2D Continuous Environments
Autor:
Mikula, Jan, Kulich, Miroslav
This paper addresses the sensor-placement problem (SPP) within the context of discretizing large, complex continuous 2D environments into graphs for efficient task-oriented route planning. The SPP aims to minimize the number of sensors required to ac
Externí odkaz:
http://arxiv.org/abs/2410.08784
Visibility is a fundamental concept in computational geometry, with numerous applications in surveillance, robotics, and games. This software paper presents T\v{r}iVis, a C++ library developed by the authors for computing numerous visibility-related
Externí odkaz:
http://arxiv.org/abs/2410.08752
Publikováno v:
IEEE Robotics and Automation Letters (Volume: 9, Issue: 10, October 2024)
This paper explores a variation of the Traveling Salesperson Problem, where the agent places a circular obstacle next to each node once it visits it. Referred to as the Traveling Salesperson Problem with Circle Placement (TSP-CP), the aim is to maxim
Externí odkaz:
http://arxiv.org/abs/2410.08627
Publikováno v:
2019 IEEE Intelligent Transportation Systems Conference (ITSC), Auckland, New Zealand, 2019
The pebble-motion on graphs is a subcategory of multi-agent pathfinding problems dealing with moving multiple pebble-like objects from a node to a node in a graph with a constraint that only one pebble can occupy one node at a given time. Additionall
Externí odkaz:
http://arxiv.org/abs/2007.10107
Publikováno v:
Modelling and Simulation for Autonomous Systems. MESAS 2018. Lecture Notes in Computer Science
MoleMOD is a heterogeneous self-reconfigurable modular robotic system to be employed in architecture and civil engineering. In this paper we present two components of the MoleMOD infrastructure - a test environment and a planning algorithm. The test
Externí odkaz:
http://arxiv.org/abs/2007.10036
Publikováno v:
Sensors 2019, 19(6)
This paper deals with the problem of autonomous navigation of a mobile robot in an unknown 2D environment to fully explore the environment as efficiently as possible. We assume a terrestrial mobile robot equipped with a ranging sensor with a limited
Externí odkaz:
http://arxiv.org/abs/2007.10085
Publikováno v:
ICINCO 2018: Informatics in Control, Automation and Robotics
In this chapter, we propose a novel approach for solving the coordination of a fleet of mobile robots, which consists of finding a set of collision-free trajectories for individual robots in the fleet. This problem is studied for several decades, and
Externí odkaz:
http://arxiv.org/abs/2007.10020
Autor:
Petković, Tomislav, Hvězda, Jakub, Rybecký, Tomáš, Marković, Ivan, Kulich, Miroslav, Přeučil, Libor, Petrović, Ivan
With the substantial growth of logistics businesses the need for larger and more automated warehouses increases, thus giving rise to fully robotized shop-floors with mobile robots in charge of transporting and distributing goods. However, even in ful
Externí odkaz:
http://arxiv.org/abs/2005.11202
Publikováno v:
In Journal of Computational Science December 2023 74
An algorithm for robot formation path planning is presented in this paper. Given a map of the working environment, the algorithm finds a path for a formation taking into account possible split of the formation and its consecutive merge. The key part
Externí odkaz:
http://arxiv.org/abs/1901.08444