Informacja

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

English (EN)·Polski (PL)·Yкраїнський (UK)
Przejdź do strony domowej biblioteki Centralna Biblioteka Wojskowa Link otwiera się w nowym oknie Logo biblioteki Prolib Integro - strona głównaCentralna Biblioteka Wojskowa

Wyszukujesz frazę "path" wg kryterium: Temat

  Lista filtrów

Dostawca treści

Wyrównaj
Wyświetlanie 1-15 z 544
Tytuł:
Determination of Probability Distribution Function for Modelling Path Loss for Wireless Channels Applications over Micro-Cellular Environments of Ondo State, Southwestern Nigeria
Autorzy:
Abiodun, Chukwutem Isaac
Ojo, Joseph Sunday
Powiązania:
https://bibliotekanauki.pl/articles/1075736.pdf
Data publikacji:
2019
Wydawca:
Przedsiębiorstwo Wydawnictw Naukowych Darwin / Scientific Publishing House DARWIN
Tematy:
Path loss
normal distribution
probability distribution function
wet and dry season
Opis:
In this research, the most appropriate probability distribution function for modelling RF signal path loss values in both wet and dry season months over urban, suburban and rural environments of Ondo State are presented. The data used consist of a drive test measurement campaign carried out in a typical urban, suburban and rural areas of Ondo State, South-western Nigeria in both wet and dry season months. The received signal strength (RSS) values were collected and recorded in log files alongside other environmental parameters using TEMS investigation tools. Path loss values were deduced from the measured RSS values. Some selected probability distribution function namely: gamma, lognormal, extreme value, logistic, Weibull and normal distributions function were fitted to the measured path loss values and the best suited one determined using three different metric measures. Results obtained show that normal distribution presents the best probability distribution curve for modelling the RF signal path loss over different micro-cellular environments of Ondo State. A typical result of the rural environment indicates that in wet season months, the normal distribution has RMSE of 7.060 dB, Relative Error of 12.480 % and R2 of 0.988, in dry season months, the RMSE is 9.060 dB, Relative Error of 13.450 % and R2 of 0.985. When compared with other distribution models, the same trend could be seen in other environments, although with different values of RMSE, Relative error and R2. The mean and the standard deviation parameters for the normal distribution estimated, vary seasonal-wise and are environment dependent. However, the rural environment exhibited a wider seasonal variations when compared with the other environments. The results of this research is useful as a first-hand information in the planning of future wireless propagation channels in the studied environments.
Źródło:
World Scientific News; 2019, 118; 74-88
2392-2192
Pojawia się w:
World Scientific News
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Peak detection unit for Free-Space-Optics receiver
Autorzy:
Achtenberg, Krzysztof
Mikołajczyk, Janusz
Szabra, Dariusz
Prokopiuk, Artur
Bielecki, Zbigniew
Powiązania:
https://bibliotekanauki.pl/articles/221334.pdf
Data publikacji:
2019
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
peak detection
infrared receiver module for optical communications
open path laser communications
free space optics
quantum cascade laser
Opis:
The paper presents verification of a peak detection method cooperating with infrared radiation detector module applications. The work has been divided into parts including SPICE simulations and presentation of results obtained with the constructed prototype. The design of the peak detector dedicated to applications with very short pulses requires a different approach than that for standard solutions. It is mainly caused due to the ratio of pulse width and time period. In the described application this ratio is less than 10%. The paper shows testing of an analogue circuit which is capable to be inserted in these applications.
Źródło:
Metrology and Measurement Systems; 2019, 26, 2; 377-385
0860-8229
Pojawia się w:
Metrology and Measurement Systems
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Lazy shortest path computation in dynamic graphs
Autorzy:
Aioanei, D.
Powiązania:
https://bibliotekanauki.pl/articles/305443.pdf
Data publikacji:
2012
Wydawca:
Akademia Górniczo-Hutnicza im. Stanisława Staszica w Krakowie. Wydawnictwo AGH
Tematy:
single-source shortest path
dynamic graph
livewire
active snake
interactive image segmentation
Opis:
We address the problem of single-source shortest path computation in digraphs with non-negative edge weights subjected to frequent edge weight decreases such that only some shortest paths are requested in-between updates. We optimise a recent semidynamic algorithm for weight decreases previously reported to be the fastest one in various conditions, resulting in important time savings that we demonstrate for the problem of incremental path map construction in usersteered image segmentation. Moreover, we extend the idea of lazy shortest path computation to digraphs subjected to both edge weight increases and decreases, comparing favourably to the fastest recent state-of-the-art algorithm.
Źródło:
Computer Science; 2012, 13 (3); 113-137
1508-2806
2300-7036
Pojawia się w:
Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Regulating Pornocomic Sales to Juveniles in Japan: Cycles and Path-Dependence of a Social Problem
Autorzy:
Akagawa, Manabu
Powiązania:
https://bibliotekanauki.pl/articles/2107050.pdf
Data publikacji:
2015-04-30
Wydawca:
Uniwersytet Łódzki. Wydawnictwo Uniwersytetu Łódzkiego
Tematy:
Path-Dependence
Social Problems
Pornocomics
Youth Protection Ordinance
Tokyo
Opis:
The purpose of this paper is to develop a new constructionist perspective on path-dependence of a social problem by examining the process of constructing issues regarding the revisions of the Tokyo Youth Protection Ordinance from December 2008 to July 2010. I start with pointing out that a social problem has a cycle of concern and a unique past and background, in a word, path-dependence. Once a social problem process has started down a track, the costs of reversal are very high. Through investigating the revision process between pro-regulation and anti-regulation groups compared with the previous arguments, I found three characteristics of arguments: the limited use of statistics, shared grounds, and shared warrants. I interpret the features as an unintended consequence of path-dependence of the pornocomic problem. This context limits the course of claims-making activities and affects the following controversy. I conclude that the concept of path-dependence offers a better understanding of how and why claims-making activities sometimes lose their diversity and are lopsided over time.
Źródło:
Qualitative Sociology Review; 2015, 11, 2; 62-73
1733-8077
Pojawia się w:
Qualitative Sociology Review
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Characterization of Propagation Models in Wireless Communications for 4G Network
Autorzy:
Al-Aamri, Nawal
Nadir, Zia
Al-Lawati, Hassan
Suwailam, Mohammed Bait
Powiązania:
https://bibliotekanauki.pl/articles/2055256.pdf
Data publikacji:
2022
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
path loss model
prediction
4G
RMSE
Opis:
Estimating the pathloss and signal strength of the transmitted signal at specific distances is one of the main objectives of network designers. This paper aims to provide generalized pathloss models appropriate for urban areas in Muscat the capital city of the Sultanate of Oman environment. The research includes studying different models of pathloss for the 4G cellular network at Muttrah Business District (MBD) at Muscat. Different models (Free Space model, Okumura Hata, Extended Sakagami, Cost231 Hata, ECC-33 Hata – Okumura extended, Ericsson, Egli, and SUI) are used with 800MHz. The results of the prediction models are compared with real measured data by calculating RMSE. The generalized models are created by modified original models to get accepted RMSE values. Different cells at MBD are tested by modified models. The RMSE values are then calculated for verification purposes. To validate the modified pathloss models of 4G, they are also applied at different cells in a different city in the capital. It has approximately the same environment as MBD. The modified pathloss models provided accepted predictions in new locations.
Źródło:
International Journal of Electronics and Telecommunications; 2022, 68, 1; 137--143
2300-1933
Pojawia się w:
International Journal of Electronics and Telecommunications
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Automated UAV to Survey and Monitor Ionising Radiation Levels in a Closed Environment
Autorzy:
Anand, R.
Harshith, Kumar M. B.
Raghavan, Anirudh
Maddara, Roopak
Anand, Prajna
Powiązania:
https://bibliotekanauki.pl/articles/2175938.pdf
Data publikacji:
2022
Wydawca:
Politechnika Wrocławska. Oficyna Wydawnicza Politechniki Wrocławskiej
Tematy:
unmanned aerial vehicle
indoor SLAM
sensor data
disaster management robot
path planning
obstacle avoidance
Opis:
Since tragedies caused by nuclear disasters are always a concern, it is essential that nuclear power plants be monitored on a regular basis for any irregularities in ionising radiation levels. Irrespective of leakage proof measures being deployed in the plant, ensuring the safety of these measures is necessary. Given this scenario, the present study proposes the usage of unmanned aerial vehicles (UAVs) to ensure that radiation levels in nuclear plants remain within safe limits. The UAV deployed will map the entire environment following a unique path planning algorithm and monitor the environment with an onboard radiation sensor. If any irregularities are detected, the positional coordinates are flagged, and the A* algorithm is implemented to generate the shortest path between the starting point, and the flagged coordinates, which are considered as the destination coordinates. The UAV is made to traverse the shortest path together with maintaining stability of the system while traversing.
Źródło:
Power Electronics and Drives; 2022, 7, 42; 134--145
2451-0262
2543-4292
Pojawia się w:
Power Electronics and Drives
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Accuracy of the Kaufmann and Desbazeille algorithm for time-cost trade-off project problems
Dokładność algorytmu Kaufmanna i Desbazeille w problemach optymalizacji czasowo-kosztowej projektu
Autorzy:
Anholcer, Marcin
Gaspars-Wieloch, Helena
Powiązania:
https://bibliotekanauki.pl/articles/422868.pdf
Data publikacji:
2013
Wydawca:
Główny Urząd Statystyczny
Tematy:
time-cost tradeoff project analysis (TCTP-analysis)
network
critical path
accuracy of the algorithm
project compression time
time-cost curves
deadline problem
analiza czasowo-kosztowa projektów
sieć
ścieżka krytyczna
dokładność algorytmu
skracanie czasu realizacji projektu
krzywe czasowo-kosztowe
minimalizacja kosztu przy zadanym czasie dyrektywnym
Opis:
The time-cost tradeoff analysis is a very important issue in the project management. The Kaufmann-Desbazeille method is considered by numerous authors as an exact algorithm to solve that problem, but in some articles it has been proved that for specific network cases the procedure only leads to quasi-optimal solutions. In this paper we calculate the average accuracy of the algorithm for several deterministic and randomly generated networks. The accuracy of the KDA is the worst when: - the network is generated in a deterministic way (an even number of nodes, the network contains only arcs connecting neighbouring nodes, neighbouring even nodes and neighbouring odd nodes, thus it has many critical and subcritical paths with a lot of common arcs), - each type of activities in such a network has very specific time-cost characteristics. The structure of the network has the influence on the performance of KDA. It should be however analyzed together with the distribution of the shortening costs.
Analiza czasowo–kosztowa jest bardzo ważnym elementem zarządzania projektem. Algorytm Kaufmanna–Desbazeille dla tego problemu jest przez wielu autorów określany mianem dokładnego, lecz w kilku pracach wykazano, iż w niektórych przypadkach stosowanie tej procedury prowadzi jedynie do rozwiązań bliskich optimum. W artykule wyznaczamy średnią dokładność algorytmu dla pewnej liczby sieci o z góry ustalonej bądź losowo wygenerowanej strukturze. Dokładność procedury Kaufmanna i Desbazeille jest najniższa, gdy: - sieć jest generowana w sposób deterministyczny (parzysta liczba węzłów, sieć składa się z samych łuków łączących sąsiednie węzły, sąsiednie węzły parzyste i sąsiednie węzły nieparzyste, a więc posiada wiele ścieżek krytycznych i podkrytycznych ze wspólnymi łukami), - każdy typ czynności w tak skonstruowanej sieci ma bardzo specyficzne charakterystyki czasowo-kosztowe. Struktura sieci ma wpływ na wydajność algorytmu. Powinna być jednak analizowana łącznie z rozkładem jednostkowych kosztów skrócenia czynności.
Źródło:
Przegląd Statystyczny; 2013, 60, 3; 341-357
0033-2372
Pojawia się w:
Przegląd Statystyczny
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Optimal design of stationary flow problems by path-following interior-point methods
Autorzy:
Antil, H.
Hoppe, R. H.
Linsenmann, C.
Powiązania:
https://bibliotekanauki.pl/articles/970290.pdf
Data publikacji:
2008
Wydawca:
Polska Akademia Nauk. Instytut Badań Systemowych PAN
Tematy:
shape optimization
Stokes flow problems
path-following interior-point methods
Opis:
We consider the numerical solution of structural optimization problems in CFD where the state variables are supposed to satisfy a linear or nonlinear Stokes system and the design variables are subject to bilateral pointwise constraints. Within a primal-dual setting, we suggest an all-at-once approach based on interior-point methods. The discretization is taken care of by Taylor-Hood elements with respect to a simplicial triangulation of the computational domain. The efficient numerical solution of the discretized problem relies on path-following techniques, namely a continuation method with an adaptive choice of the continuation step size, a long-step path-following algorithm and a nonlinear version of Mehrotra's algorithm. The performance of the suggested methods is documented by several illustrative numerical examples.
Źródło:
Control and Cybernetics; 2008, 37, 4; 771-796
0324-8569
Pojawia się w:
Control and Cybernetics
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Wpływ niskich temperatur na szeregową transmisję danych w systemach pomiarowych z mikrokontrolerem ATmega16A
The influence of low temperatures on serial data transmission in measurement systems with ATmega16A microcontroller
Autorzy:
Arnold, K.
Powiązania:
https://bibliotekanauki.pl/articles/151597.pdf
Data publikacji:
2014
Wydawca:
Stowarzyszenie Inżynierów i Techników Mechaników Polskich
Tematy:
system pomiarowy
transmisja szeregowa
dryft temperaturowy
blok akwizycji danych
measurement system
serial transmission
temperature drift
DAQ path
Opis:
W pracy opisano problem cieplnych zmian szybkości transmisji szeregowej w bloku akwizycji danych systemu pomiarowego. Zaprezentowano wyniki badań oscylatora RC mikrokontrolera ATmega16A dla temperatur zmniejszanych do 77 K. Przedstawiono charakterystyki współczynnika dopasowania szybkości transmisji asynchronicznej oraz charakterystyki częstotliwości zegarowych i czasów transferu danych dla transmisji synchronicznej w systemach pomiarowych z układem ATmega16A, pracujących w zakresie niskich temperatur.
The paper presents a problem of the serial transmission between blocks of measurement system that works at different temperature ranges. There is also discussed the communication of system controller with ATmega16A device within data acquisition path (Fig. 1). In the paper the results of clock signal frequency tests conducted for internal RC oscillator of ATmega16A microcontroller at low temperatures with the lowest point at 77 K, are also presented (Fig. 2). Here are also considered conditions of effective asynchronous data transmission when USART module of ATmega16A microcontroller is used, because the USART internal baud rate clock depends on the temperature drift of internal RC oscillator. There are calculated characteristics of baud rate matching coefficient and achieved results are compared with total error and recommended receiver error defined for ATmega16A USART module (Fig. 3, 4). In the paper, the low-temperature characteristics of serial clock frequency (Fig. 5) and byte transmission time (Fig. 6) in SPI module of ATmega16A microcontroller are also presented. Moreover, there are shown the low-temperature characteristics of changes of serial clock frequency (Fig. 7) and data transmission time (Fig. 8) in TWI module of ATmega16A microcontroller. The author formulates conclusions concerning the clocking and the asynchronous and synchronous operational range of USART, SPI and TWI modules of ATmega16A microcontroller on measurement systems working at low temperatures.
Źródło:
Pomiary Automatyka Kontrola; 2014, R. 60, nr 11, 11; 1041-1043
0032-4140
Pojawia się w:
Pomiary Automatyka Kontrola
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Two graphs with a common edge
Autorzy:
Badura, Lidia
Powiązania:
https://bibliotekanauki.pl/articles/30148254.pdf
Data publikacji:
2014-08-01
Wydawca:
Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Tematy:
graph
adjacency matrix
determinant of graph
path
cycle
Opis:
Let $G = G_1 ∪ G_2$ be the sum of two simple graphs $G_1,G_2$ having a common edge or $G = G_1 ∪ e_1 ∪ e_2 ∪ G_2$ be the sum of two simple disjoint graphs $G_1,G_2$ connected by two edges $e_1$ and $e_2$ which form a cycle $C_4$ inside $G$. We give a method of computing the determinant $det A(G)$ of the adjacency matrix of $G$ by reducing the calculation of the determinant to certain subgraphs of $G_1$ and $G_2$. To show the scope and effectiveness of our method we give some examples.
Źródło:
Discussiones Mathematicae Graph Theory; 2014, 34, 3; 497-507
2083-5892
Pojawia się w:
Discussiones Mathematicae Graph Theory
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Simulation tests of a VCR engine as a propulsion unit in rail vehicles
Badania symulacyjne silnika VCR jako jednostki napędowej w pojazdach szynowych
Autorzy:
Bajerlein, Maciej
Urbański, Patryk
Daszkiewicz, Paweł
Powiązania:
https://bibliotekanauki.pl/articles/33352714.pdf
Data publikacji:
2020
Wydawca:
Sieć Badawcza Łukasiewicz - Poznański Instytut Technologiczny
Tematy:
VCR engine
simulation studies
power unit
rail vehicle
piston path
Top Dead Center
TDC
thermodynamic analysis
silnik VCR
badania symulacyjne
jednostka napędowa
pojazd szynowy
droga tłoka
Górne Martwe Położenie
GMP
analiza termodynamiczna
Opis:
The paper presents the possibility of using a VCR engine as a driving unit of a generating set in rail vehicles. Thermodynamic analyzes of the engine were also performed. For the purposes of the research, the piston path was generated in the dynamic simulation in Solidworks to study the processes occurring during the combustion process. This path was used to simulate the AVL Fire program for the same initial conditions. Different variants of the engine cam control with the same compression ratio were compared. The article analyzed the moment and the period of time that the piston remains in the Upper Dead Center (TDC).
W ramach pracy przedstawiono możliwość zastosowania silnika VCR jako jednostki napędowej zespołu prądotwórczego w pojazdach szynowych. Dokonano również analiz termodynamicznych silnika. Na potrzeby badań wygenerowano drogę tłoka w symulacji dynamicznej w programie Solidworks do badania procesów zachodzących podczas procesu spalania. Droga ta została wykorzystana do przeprowadzenia symulacji w programie AVL Fire dla jednakowych warunków początkowych. Porównane zostały różne warianty wysterowania krzywki silnika przy jednakowym stopniu sprężania. W rozpatrywanym artykule analizowano moment oraz okres czasu jaki tłok pozostaje w Górnym Martwym Położeniu (GMP).
Źródło:
Rail Vehicles/Pojazdy Szynowe; 2020, 4; 33-44
0138-0370
2719-9630
Pojawia się w:
Rail Vehicles/Pojazdy Szynowe
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
On the Path Sequence of a Graph
Autorzy:
Bakalarski, Sławomir
Zygadło, Jakub
Powiązania:
https://bibliotekanauki.pl/articles/1373669.pdf
Data publikacji:
2015
Wydawca:
Uniwersytet Jagielloński. Wydawnictwo Uniwersytetu Jagiellońskiego
Tematy:
$k$-path vertex cover
path sequence
list for small graphs
Opis:
A subset S of vertices of a graph $G = (V, E)$ is called a $k$-path vertex cover if every path on $k$ vertices in $G$ contains at least one vertex from $S$. Denote by $psi_k(G)$ the minimum cardinality of a $k$-path vertex cover in $G$ and form a sequence $\psi(G) = (\psi_1 (G), \psi_2 (G), . . . , \psi_{|V|} (G))$, called the path sequence of $G$. In this paper we prove necessary and sufficient conditions for two integers to appear on fixed positions in $\psi(G)$. A complete list of all possible path sequences (with multiplicities) for small connected graphs is also given.
Źródło:
Schedae Informaticae; 2015, 24; 239-251
0860-0295
2083-8476
Pojawia się w:
Schedae Informaticae
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Explicit “ballistic M-model”: a refinement of the implicit “modified point mass trajectory model”
Autorzy:
Baranowski, L.
Gadomski, B.
Majewski, P.
Szymonik, J.
Powiązania:
https://bibliotekanauki.pl/articles/202089.pdf
Data publikacji:
2016
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
ballistics
equations of motion
projectile path
modified point mass trajectory model
MPMTM
projectile deflection
balistyka
równania ruchu
lot pocisku
Opis:
Various models of a projectile in a resisting medium are used. Some are very simple, like the “point mass trajectory model”, others, like the “rigid body trajectory model”, are complex and hard to use, especially in Fire Control Systems due to the fact of numeric complexity and an excess of less important corrections. There exist intermediate ones - e.g. the “modified point mass trajectory model”, which unfortunately is given by an implicitly defined differential equation as Sec. 1 discusses. The main objective of this paper is to present a way to reformulate the model obtaining an easy to solve explicit system having a reasonable complexity yet not being parameter-overloaded. The final form of the M-model, after being carefully derived in Sec. 2, is presented in Subsec. 2.5.
Źródło:
Bulletin of the Polish Academy of Sciences. Technical Sciences; 2016, 64, 1; 81-89
0239-7528
Pojawia się w:
Bulletin of the Polish Academy of Sciences. Technical Sciences
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Explicit form of the “modified point mass trajectory model” for the use in Fire Control Systems
Autorzy:
Baranowski, L.
Majewski, P.
Szymonik, J.
Powiązania:
https://bibliotekanauki.pl/articles/200333.pdf
Data publikacji:
2020
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
ballistics
equations of motion
projectile path
modified point mass trajectory model
MPMTM
projectile deflection
Opis:
The main objective of this article is to obtain equations of motion of the spin–stabilized projectile in the presence of non–constant wind. Introducing models allowing utilization of inhomogeneous wind is dictated by new possibilities created by the use of e.g. lidars in the Fire Control Systems (FCS). Constant feed of wind data can replace meteorological messages, increasing the FCS effectiveness. Article contains results of projectile flight simulations which indicate the positive effect that the derived explicit form of the model has when considering software development for modern Fire Control Systems.
Źródło:
Bulletin of the Polish Academy of Sciences. Technical Sciences; 2020, 68, 5; 1167-1175
0239-7528
Pojawia się w:
Bulletin of the Polish Academy of Sciences. Technical Sciences
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
An offline path planning method for autonomous vehicles
Autorzy:
Barsi, Á.
Nyerges, Á.
Potó, V.
Tihanyi, V.
Powiązania:
https://bibliotekanauki.pl/articles/111781.pdf
Data publikacji:
2018
Wydawca:
Stowarzyszenie Menedżerów Jakości i Produkcji
Tematy:
connected and automated vehicles
autonomous driving
self-driving vehicles
trajectory planning
path planning
sterowanie pojazdem
zautomatyzowany pojazd
pojazdy samojezdne
planowanie trajektorii
planowanie ścieżki
planowanie trasy
pojazd autonomiczny
Opis:
Driving a road vehicle is a very complex task in terms of controlling it, substituting a human driver with a computer is a real challenge also from the technical side. An important step in vehicle controlling is when the vehicle plans its own trajectory. The input of the trajectory planning are the purpose of the passengers and the environment of the vehicle. The trajectory planning process has several parts, for instance, the geometry of the path-curve or the speed during the way. Furthermore, a traffic situation can also determine many other parameters in the planning process. This paper presents a basic approach for trajectory design. To reach the aim a map will be given as a binary 2204 x 1294 size matrix where the roads will be defined by ones, the obstacles will be defined by zeros. The aim is to make an algorithm which can find the shortest and a suitable way for vehicles between the start and the target point. The vehicle speed will be slow enough to ignore the dynamical properties of the vehicle. The research is one of the first steps to realize automated parking features in a self-drive car.
Źródło:
Production Engineering Archives; 2018, 19; 37-42
2353-5156
2353-7779
Pojawia się w:
Production Engineering Archives
Dostawca treści:
Biblioteka Nauki
Artykuł
Wyświetlanie 1-15 z 544

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