Informacja

Drogi użytkowniku, aplikacja do prawidłowego działania wymaga obsługi JavaScript. Proszę włącz obsługę JavaScript w Twojej przeglądarce.

Wyszukujesz frazę "planowanie ruchu" wg kryterium: Temat


Wyświetlanie 1-5 z 5
Tytuł:
Control of a Team of Mobile Robots Based on Non-cooperative Equilibria with Partial Coordination
Autorzy:
Skrzypczyk, K.
Powiązania:
https://bibliotekanauki.pl/articles/908483.pdf
Data publikacji:
2005
Wydawca:
Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:
system wielorobotowy
planowanie ruchu
teoria gier
multi-robot systems
motion planning
game theory
Opis:
In this work we present an application of the concept of non-cooperative game equilibria to the design of a collision free movement of a team of mobile robots in a dynamic environment. We propose the solution to the problem of feasible control synthesis, based on a partially centralized sensory system. The control strategy based on the concept of non-cooperative game equilibria is well known in the literature. It is highly efficient through phases where the solution is unique. However, even in simple navigation problems, it happens that multiple equilibria occur, which incurs a problem for control synthesis and may lead to erroneous results. In this paper we present a solution to this problem based on the partial centralization idea. The coordinator module is incorporated into the system and becomes active when multiple equilibria are detected. The coordination method includes a ``fair arbiter'' for the selection of an appropriate equilibrium solution. Simulation studies of the proposed methodology were carried out for 2, 3 and 5 robots, and their results are presented.
Źródło:
International Journal of Applied Mathematics and Computer Science; 2005, 15, 1; 89-97
1641-876X
2083-8492
Pojawia się w:
International Journal of Applied Mathematics and Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Multiquery motion planning in uncertain spaces: Incremental adaptive randomized roadmaps
Autorzy:
Khaksar, Weria
Uddin, Md Zia
Torresen, Jim
Powiązania:
https://bibliotekanauki.pl/articles/329773.pdf
Data publikacji:
2019
Wydawca:
Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:
motion planning
roadmap
sampling based planner
obstacle avoidance
planowanie ruchu
mapa drogowa
unikanie przeszkód
Opis:
Sampling-based motion planning is a powerful tool in solving the motion planning problem for a variety of different robotic platforms. As its application domains grow, more complicated planning problems arise that challenge the functionality of these planners. One of the main challenges in the implementation of a sampling-based planner is its weak performance when reacting to uncertainty in robot motion, obstacles motion, and sensing noise. In this paper, a multi-query sampling-based planner is presented based on the optimal probabilistic roadmaps algorithm that employs a hybrid sample classification and graph adjustment strategy to handle diverse types of planning uncertainty such as sensing noise, unknown static and dynamic obstacles and an inaccurate environment map in a discrete-time system. The proposed method starts by storing the collision-free generated samples in a matrix-grid structure. Using the resulting grid structure makes it computationally cheap to search and find samples in a specific region. As soon as the robot senses an obstacle during the execution of the initial plan, the occupied grid cells are detected, relevant samples are selected, and in-collision vertices are removed within the vision range of the robot. Furthermore, a second layer of nodes connected to the current direct neighbors are checked against collision, which gives the planner more time to react to uncertainty before getting too close to an obstacle. The simulation results for problems with various sources of uncertainty show a significant improvement compared with similar algorithms in terms of the failure rate, the processing time and the minimum distance from obstacles. The planner is also successfully implemented and tested on a TurtleBot in four different scenarios with uncertainty.
Źródło:
International Journal of Applied Mathematics and Computer Science; 2019, 29, 4; 641-654
1641-876X
2083-8492
Pojawia się w:
International Journal of Applied Mathematics and Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Iterative methods for efficient sampling-based optimal motion planning of nonlinear systems
Autorzy:
Ha, J. S.
Choi, H. L.
Jeon, J. H.
Powiązania:
https://bibliotekanauki.pl/articles/330028.pdf
Data publikacji:
2018
Wydawca:
Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:
optimal motion planning
sampling based algorithm
nonlinear dynamics
planowanie ruchu
algorytm próbkowania
dynamika nieliniowa
Opis:
This paper extends the RRT* algorithm, a recently developed but widely used sampling based optimal motion planner, in order to effectively handle nonlinear kinodynamic constraints. Nonlinearity in kinodynamic differential constraints often leads to difficulties in choosing an appropriate distance metric and in computing optimized trajectory segments in tree construction. To tackle these two difficulties, this work adopts the affine quadratic regulator-based pseudo-metric as the distance measure and utilizes iterative two-point boundary value problem solvers to compute the optimized segments. The proposed extension then preserves the inherent asymptotic optimality of the RRT* framework, while efficiently handling a variety of kinodynamic constraints. Three numerical case studies validate the applicability of the proposed method.
Źródło:
International Journal of Applied Mathematics and Computer Science; 2018, 28, 1; 155-168
1641-876X
2083-8492
Pojawia się w:
International Journal of Applied Mathematics and Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
An optimal path planning problem for heterogeneous multi-vehicle systems
Autorzy:
Klaučo, M.
Blažek, S.
Kvasnica, M.
Powiązania:
https://bibliotekanauki.pl/articles/330754.pdf
Data publikacji:
2016
Wydawca:
Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:
path planning
multi vehicle system
mixed-integer programming
planowanie ruchu
system wielopojazdowy
programowanie całkowitoliczbowe
Opis:
A path planning problem for a heterogeneous vehicle is considered. Such a vehicle consists of two parts which have the ability to move individually, but one of them has a shorter range and is therefore required to keep in a close distance to the main vehicle. The objective is to devise an optimal path of minimal length under the condition that at least one part of the heterogeneous system visits all desired waypoints exactly once. Two versions of the problem are considered. One assumes that the order in which the waypoints are visited is known a priori. In such a case we show that the optimal path can be found by solving a mixed-integer second-order cone problem. The second version assumes that the order in which the waypoints are visited is not known a priori, but can be optimized so as to shorten the length of the path. Two approaches to solve this problem are presented and evaluated with respect to computational complexity.
Źródło:
International Journal of Applied Mathematics and Computer Science; 2016, 26, 2; 297-308
1641-876X
2083-8492
Pojawia się w:
International Journal of Applied Mathematics and Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Motion planning and feedback control for a unicycle in a way point following task: The VFO approach
Autorzy:
Michałek, M.
Kozłowski, K.
Powiązania:
https://bibliotekanauki.pl/articles/929993.pdf
Data publikacji:
2009
Wydawca:
Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:
planowanie ruchu
sterowanie zamknięte
pole wektorowe
unicycle
way point following
motion planning
feedback control
vector fields
Opis:
This paper is devoted to the way point following motion task of a unicycle where the motion planning and the closed-loop motion realization stage are considered. The way point following task is determined by the user-defined sequence of way-points which have to be passed by the unicycle with the assumed finite precision. This sequence will take the vehicle from the initial state to the target state in finite time. The motion planning strategy proposed in the paper does not involve any interpolation of way-points leading to simplified task description and its subsequent realization. The motion planning as well as the motion realization stage are based on the Vector-Field-Orientation (VFO) approach applied here to a new task. The unique features of the resultant VFO control system, namely, predictable vehicle transients, fast error convergence, vehicle directing effect together with very simple controller parametric synthesis, may prove to be useful in practically motivated motion tasks.
Źródło:
International Journal of Applied Mathematics and Computer Science; 2009, 19, 4; 533-545
1641-876X
2083-8492
Pojawia się w:
International Journal of Applied Mathematics and Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
    Wyświetlanie 1-5 z 5

    Ta witryna wykorzystuje pliki cookies do przechowywania informacji na Twoim komputerze. Pliki cookies stosujemy w celu świadczenia usług na najwyższym poziomie, w tym w sposób dostosowany do indywidualnych potrzeb. Korzystanie z witryny bez zmiany ustawień dotyczących cookies oznacza, że będą one zamieszczane w Twoim komputerze. W każdym momencie możesz dokonać zmiany ustawień dotyczących cookies