Filters
Smoothed Hex grid Trajectory Planning Using Helicopter Dynamics
Considering Unmanned Autonomous Vehicles (UAVs) the planning tasks mainly consist of finding paths between given waypoints with respect to given constraints. In this paper we developed a path planning system for flying UAVs...
JC - Počítačový hardware a software
- 2011 •
- D •
- Link
Rok uplatnění
D - Stať ve sborníku
Výsledek na webu
Accelerated A* Trajectory Planning: Grid based Path Planning Comparison
of path planning in grids with blocked and unblocked cells. The Accelerated A* algorithm has been compared against the Theta* path planner, Rapid-Exploring Random any-angle paths. Experiments have shown that Accel...
JC - Počítačový hardware a software
- 2009 •
- D
Rok uplatnění
D - Stať ve sborníku
Nonholonomic Mobile Robot Path Planning by Means of Case-Based Reasoning.
The purpose of the robot path planning is to find a path from a robot start of already used paths. Graph searching algorithms for the case graph and the grid such criteria as length, difficulty and risk of...
JD - Využití počítačů, robotika a její aplikace
- 2006 •
- C
Rok uplatnění
C - Kapitola v odborné knize
Multi-Agent Path Finding on Ozobots
Multi-agent path finding (MAPF) is the problem to find collision-free paths for a set of agents (mobile robots) moving on a graph. There exists several abstract models describing the problem with various types of c...
Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)
- 2019 •
- D
Rok uplatnění
D - Stať ve sborníku
Multi-Agent Path Finding on Real Robots
Multi-agent path finding (MAPF) deals with the problem of finding a collision-free path for a set of agents in a graph. It is an abstract version of the problem to coordinate movement for a set of mobile robots. Th...
Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)
- 2019 •
- D
Rok uplatnění
D - Stať ve sborníku
Using Case-Based Reasoning and Genetic Algorithms for Mobile Robot Path Planning.
and risk of the path. A two-dimensional grid with known static obstacles models the robot environment. When planning a path, the most similar cases (already used paths algorithm is used to find the missin...
JD - Využití počítačů, robotika a její aplikace
- 2004 •
- D
Rok uplatnění
D - Stať ve sborníku
Using Case-Based Reasoning and Genetic Algorithms for Mobile Robot Path Planning
and risk of the path. A two-dimensional grid with known static obstacles models the robot environment. When planning a path, the most similar cases (already used paths algorithm is used to find the missin...
JD - Využití počítačů, robotika a její aplikace
- 2004 •
- Jx
Rok uplatnění
Jx - Nezařazeno - Článek v odborném periodiku (Jimp, Jsc a Jost)
Multi-Agent Path Finding on Real Robots
Multi-agent path finding (MAPF) deals with the problem of finding a collision-free path for a set of agents in a graph. It is an abstract version of the problem to coordinate movement for a set of mobile robots. Th...
Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)
- 2019 •
- D
Rok uplatnění
D - Stať ve sborníku
System for Robot Path Planning by Case-Based Reasoning
together a case graph. The case graph is used with a new request for finding a path to find a usable path, the system uses other path planning methods (local search of autonomous robot navigation. The mai...
JD - Využití počítačů, robotika a její aplikace
- 2005 •
- D
Rok uplatnění
D - Stať ve sborníku
Mobile Robot Path Planning by Means of Case Graph and Genetic Algorithms
and risk of the path. A two-dimensional grid with known static obstacles models the robot environment. When planning a path, the most similar cases (already used pathsThe aim of the robot path planning is...
JD - Využití počítačů, robotika a její aplikace
- 2005 •
- D
Rok uplatnění
D - Stať ve sborníku
- 1 - 10 out of 89 066