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ę "route planning" wg kryterium: Wszystkie pola

  Lista filtrów
Wyrównaj
Wyświetlanie 1-15 z 65
Tytuł:
Integrated problem of ship route planning
Autorzy:
Wiśniewski, B.
Medyna, P.
Chomski, J.
Mąka, M.
Powiązania:
https://bibliotekanauki.pl/articles/393824.pdf
Data publikacji:
2011
Wydawca:
Polskie Stowarzyszenie Telematyki Transportu
Tematy:
planowanie trasy statku
ograniczenia
procedury
ship route planning
limitations
procedures
Opis:
Planning and realization of ship route is a complex problem, which consists of elements from different disciplines. It is necessary to take into account: the formal requirements, the organization of traffic in restricted areas, exploitation limitations of the ship; economic issues relating to the costs of fuel and the costs associated with the possible unscheduled reaching the ship at the port of destination and waiting for unloading. It is important to maintain safety conditions related to extreme weather conditions. As the sailing is done on the changing weather conditions, considerable issue is the problem associated with the acquisition, processing and integration of weather data. Issues connected directly with the procedures of route computation are also important - the choice of optimization algorithm, matching the speed characteristics, the state of load. Increasingly being taken into account as restriction of navigation has to be the threat of piracy and terrorism. In the planning and realization of a ship voyage important issue is so called human factor and thus the experience of the master, which will include a decision as to the extent of detail of route planning, taking into account the restrictions importance and eventual adoption or not the proposed route
Źródło:
Archives of Transport System Telematics; 2011, 4, 4; 58-64
1899-8208
Pojawia się w:
Archives of Transport System Telematics
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
User habits and multimodal route planning
Autorzy:
Katona, G.
Juhasz, J.
Powiązania:
https://bibliotekanauki.pl/articles/112017.pdf
Data publikacji:
2017
Wydawca:
Stowarzyszenie Menedżerów Jakości i Produkcji
Tematy:
user habits
multimodal route planning
Ant Colony algorithm
planowanie trasy
algorytm mrówkowy
nawyki komunikacyjne
wymagania użytkowników
Opis:
The results of route planning researches are monitored by logistic and automotive industries. The economic aspects of the cost saving are in the focus of the attention. An optimal route could cause time or fuel savings. An effective driving or an optimal route is a good basis to achieve an economical aim. Moreover the spread of new automotive solutions especially in case of electric cars the optimisation has particular significance regarding the limited battery storage. Additionally the autonomous car development could not be neglected. As a result the society could expect safer roads, better space usage and effective resource management. Nevertheless the requirements of users are extremely diverse, which is not negligible. Supporting these aims, in this paper the connection between the multimodal route planning and the user requirements are investigated. The examination is focused to a sensitivity analysis and a survey to evaluate the data and support the settings of a user habit effect to the final route.
Źródło:
Production Engineering Archives; 2017, 16; 22-27
2353-5156
2353-7779
Pojawia się w:
Production Engineering Archives
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Vessels Route Planning Problem with Uncertain Data
Autorzy:
Neumann, T.
Powiązania:
https://bibliotekanauki.pl/articles/115957.pdf
Data publikacji:
2016
Wydawca:
Uniwersytet Morski w Gdyni. Wydział Nawigacyjny
Tematy:
maritime-related data
route planning
dempster-shafer theory (DST)
vessels route planning
Dijkstra's algorithm
decision rules
mathematical theory of evidence
uncertain data
Opis:
The purpose of this paper is to find a solution for route planning in a transport networks, where the costs of tracks, factor of safety and travel time are ambiguous. This approach is based on the Dempster-Shafer theory and well known Dijkstra's algorithm. In this approach important are the influencing factors of the mentioned coefficients using uncertain possibilities presented by probability intervals. Based on these intervals the quality intervals of each route can be determined. Applied decision rules can be described by the end user.
Źródło:
TransNav : International Journal on Marine Navigation and Safety of Sea Transportation; 2016, 10, 3; 459-464
2083-6473
2083-6481
Pojawia się w:
TransNav : International Journal on Marine Navigation and Safety of Sea Transportation
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Bi-directional search in route planning in navigation
Autorzy:
Dramski, M.
Powiązania:
https://bibliotekanauki.pl/articles/360091.pdf
Data publikacji:
2014
Wydawca:
Akademia Morska w Szczecinie. Wydawnictwo AMSz
Tematy:
shortest path
safe route
restricted area
bi-directional search
Dijkstra algorithm
Opis:
The shortest path problem is one of the most significant ones in the field of maritime navigation. One of the most efficient algorithms was proposed by E. Dijkstra in 1959. Taking into account the development of computer technology was offered another interesting approach to the issue. The main idea is to execute the shortest path algorithm simultaneously forward from the source and backward from the target. The results are presented and discussed.
Źródło:
Zeszyty Naukowe Akademii Morskiej w Szczecinie; 2014, 39 (111); 57-62
1733-8670
2392-0378
Pojawia się w:
Zeszyty Naukowe Akademii Morskiej w Szczecinie
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Sailing route planning method considering various user categories
Autorzy:
Życzkowski, Marcin
Powiązania:
https://bibliotekanauki.pl/articles/1573877.pdf
Data publikacji:
2020
Wydawca:
Politechnika Gdańska. Wydział Inżynierii Mechanicznej i Okrętownictwa
Tematy:
sailing vessel
weather routing
multi-criteria
navigation
comfort
Opis:
The article describes the methodology related to determining the multi-criteria routes for sailing ships. Details of sea area discretisation and discretisation of the description of the sailing vessel properties and manoeuvring principles are shown. User requirements were specified (for five different categories of users) and on this basis the criteria for selecting the most suitable shipping route were formulated. The presented algorithm recommends a route for a given user category by means of defined restrictions and configuration parameters. The applied multi-criteria approach proves the universality and usability of the sailing ship route planning method.
Źródło:
Polish Maritime Research; 2020, 3; 149-158
1233-2585
Pojawia się w:
Polish Maritime Research
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Bi-objective maritime route planning in pirate-infested waters
Autorzy:
Vaňek, O.
Hrstka, O.
Kopřiva, Š.
Faigl, J.
Pěchouček, M.
Powiązania:
https://bibliotekanauki.pl/articles/906066.pdf
Data publikacji:
2015
Wydawca:
Akademia Morska w Szczecinie. Wydawnictwo AMSz
Tematy:
maritime piracy
risk-aware planning
optimization
risk analysis
modeling
FTA
Opis:
Contemporary maritime shipping is subject to a large number of constraints given by tight shipping schedules and very low margins. Additionally, problematic areas with increased security needs dynamically changing in time, combined with seasonal oceanographic and meteorological conditions pose a challenging voyage planning problem. In this work we present a risk-aware voyage planner taking into account spatio-temporal environmental conditions. The planner is based on a graph-based search algorithm A* . We discretize the required area into a graph, we store various layers of information into the edges of the graph (such as risk and weather conditions) in a form of numeric weights and we define a bi-objective planning problem with a tradeoff between security and duration of the voyage. The nature of the algorithm guarantees a complete and optimal solution in a form of an optimized voyage with respect to the criterion function composed of the two weighted components, i.e, duration and security of the voyage. We demonstrate the approach on our area of interest: Indian Ocean. We use NATO piracy activity risk surface as the risk layer and we compute all transit voyages between relevant routing points in the area. Finally, thanks to the discretization of the problem, we are able to integrate corridors imposed by the shipping authorities and evaluate additional what-if scenarios with extended corridor systems. The resulting planner is exposed to the public using a web service with an easy interface requiring start time of the voyage and the origin and the destination point of voyage. Combined with an expressive visualization, this tool demonstrates the capabilities of the proposed solution.
Źródło:
Zeszyty Naukowe Akademii Morskiej w Szczecinie; 2015, 43 (115); 115-124
1733-8670
2392-0378
Pojawia się w:
Zeszyty Naukowe Akademii Morskiej w Szczecinie
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Ship route planning using historical trajectories derived from AIS Data
Autorzy:
He, Y. K.
Zhang, D.
Zhang, J. F.
Zhang, M. Y.
Li, T. W.
Powiązania:
https://bibliotekanauki.pl/articles/116536.pdf
Data publikacji:
2019
Wydawca:
Uniwersytet Morski w Gdyni. Wydział Nawigacyjny
Tematy:
AIS Data
Automatic Identification System (AIS)
route planning
historical trajectories
AIS messages
marine traffic
Dijkstra algorithm
ant colony algorithm
Opis:
Ship route planning is one of the key issues in enhancing traffic safety and efficiency. Many route planning methods have been developed, but most of them are based on the information from charts. This paper proposes a method to generate shipping routes based on historical ship tracks. The ship's historical route information was obtained by processing the AIS data. From which the ship turning point was extracted and clustered as nodes. The ant colony algorithm was used to generate the optimize route. The ship AIS data of the Three Gorges dam area was selected as a case study. The ships’ optimized route was generated, and further compared with the actual ship's navigation trajectory. The results indicate that there is space of improvement for some of the trajectories, especially near the turning areas.
Źródło:
TransNav : International Journal on Marine Navigation and Safety of Sea Transportation; 2019, 13, 1; 69-76
2083-6473
2083-6481
Pojawia się w:
TransNav : International Journal on Marine Navigation and Safety of Sea Transportation
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Green last-mile route planning for efficient e-commerce distribution
Autorzy:
Kunnapapdeelert, Siwaporn
Johnson, James Vincent
Phalitnonkiat, Passarin
Powiązania:
https://bibliotekanauki.pl/articles/2105317.pdf
Data publikacji:
2022
Wydawca:
Politechnika Białostocka. Oficyna Wydawnicza Politechniki Białostockiej
Tematy:
last mile
routing
green
particle swarm optimisation
e-commerce
ostatnia mila
wytyczanie
zielony
optymalizacja cząsteczki
Opis:
This study aims to design vehicle routes based on cost minimisation and the minimisation of greenhouse gasses (GHG) emissions to help companies solve the vehicle routing problem with pickup and delivery (VRPPD) via particle swarm optimisation (PSO). An effective metaheuristics search technique called particle swarm optimisation (PSO) was applied to design the optimal route for these problems. Simulated data from Li and Lim (2001) were used to evaluate the PSO performance for solving green vehicle routing problems with pickup and delivery (Green VRPPD). The findings suggest that green vehicle routing problems with pickup and delivery should be used when distributing products to customers living in a specific area called a cluster. However, the design of vehicle routes by Green VRPPD costs more when used to distribute products to customers living randomly in a coverage service area. When logistics providers decide to use Green VRPPD instead of VRPPD, they need to be concerned about possible higher costs if an increase in the number of vehicles is needed. PSO has been confirmed for solving VRPPD effectively. The study compared the results based on the use of two different objective functions with fuel consumption from diesel and liquefied petroleum gas (LPG). It indicates that solving VRPPD by considering the emissions of direct greenhouse gases as an objective function provides cleaner routes, rather than considering total cost as the objective function for all test cases. However, as Green VRPPD requires more vehicles and longer travel distances, this requires a greater total cost than considering the total cost as the objective function. Considering the types of fuels used, it is obvious that LPG is more environmentally friendly than diesel by up to 53.61 %. This paper should be of interest to a broad readership, including those concerned with vehicle routing problems, transportation, logistics, and environmental management. The findings suggest that green vehicle routing problems with pickup and delivery should be used when distributing products to a cluster. However, the design of vehicle routes by Green VRPPD costs more when used to distribute products to customers living randomly in a coverage service area. When logistics providers decide to use Green VRPPD instead of VRPPD, they need to be concerned about possible higher costs if an increase in the number of vehicles is needed.
Źródło:
Engineering Management in Production and Services; 2022, 14, 1; 1--12
2543-6597
2543-912X
Pojawia się w:
Engineering Management in Production and Services
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Military route planning in battlefield simulation: effectiveness problems and potential solutions
Autorzy:
Tarapata, Z.
Powiązania:
https://bibliotekanauki.pl/articles/309343.pdf
Data publikacji:
2003
Wydawca:
Instytut Łączności - Państwowy Instytut Badawczy
Tematy:
battlefield simulation
route planning
shortest paths
effectiveness problems
computational complexity
Opis:
Path searching is challenging problem in many domains such as simulation war games, robotics, military mission planning, computer generated forces (CGF), etc. Effectiveness problems in military route planning are related both with terrain modelling and path planning algorithms. These problems may be considered from the point of view of many criterions. It seems that two criterions are the most important: quality of terrain reflection in the terrain model and computational complexity of the on(off)-line path planning algorithm. The paper deals with two above indicated problems of route planning effectiveness. Comparison of approaches used in route planning is presented. The hybrid, terrain merging-based and partial path planning, approach for route planning in dynamically changed environment during simulation is described. It significantly increase effectiveness of route planning process. The computational complexity of the method is given and some discussion for using the method in the battlefield simulation is conducted. In order to estimate how many times faster we can compute problem for finding shortest path in network with n big squares (b-nodes) with relation to problem for finding shortest path in the network with V small squares (s-nodes) acceleration function is defined and optimized.
Źródło:
Journal of Telecommunications and Information Technology; 2003, 4; 47-56
1509-4553
1899-8852
Pojawia się w:
Journal of Telecommunications and Information Technology
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Analysis of Graph Searching Algorithms for Route Planning in Inland Navigation
Autorzy:
Kazimierski, W.
Sawczak, A.
Wawrzyniak, N.
Powiązania:
https://bibliotekanauki.pl/articles/117106.pdf
Data publikacji:
2015
Wydawca:
Uniwersytet Morski w Gdyni. Wydział Nawigacyjny
Tematy:
Inland Navigation
route planning
Graph Searching Algorithms
Inland Waters
Nautical Spatial Data
Raster Data
vector data
Dijkstra’s Algorithm
Opis:
Route planning is one of the core functionalities of modern navigational systems also in inland waters. There is a possibility of at least partial automation of this process with the use of graph searching algorithms. Main problem here is to create a graph based on nautical spatial data. The paper presents research on examining dif-ferent graph searching methods for inland waters. The concept of using combined approach for vector and ras-ter data is given, followed by research results for raster data.
Źródło:
TransNav : International Journal on Marine Navigation and Safety of Sea Transportation; 2015, 9, 2; 281-286
2083-6473
2083-6481
Pojawia się w:
TransNav : International Journal on Marine Navigation and Safety of Sea Transportation
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Generalized route planning approach for hazardous materials transportation with equity consideration
Autorzy:
Chai, H.
He, R.-C.
Jia, X.-yan
Ma, Ch.-x
Dai, C.-jie
Powiązania:
https://bibliotekanauki.pl/articles/223759.pdf
Data publikacji:
2018
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
hazardous materials transportation
transportation
route optimization
risk equity
multi-objective optimization
NSGA-II algorithm
genetic algorithm
transport materiałów niebezpiecznych
materiały niebezpieczne
optymalizacja trasy
kapitał własny
optymalizacja wielokryterialna
algorytm NSGA-II
algorytm genetyczny
Opis:
Hazardous materials transportation should consider risk equity and transportation risk and cost. In the hazardous materials transportation process, we consider risk equity as an important condition in optimizing vehicle routing for the long-term transport of hazardous materials between single or multiple origin-destination pairs (O-D) to reduce the distribution difference of hazardous materials transportation risk over populated areas. First, a risk equity evaluation scheme is proposed to reflect the risk difference among the areas. The evaluation scheme uses standard deviation to measure the risk differences among populated areas. Second, a risk distribution equity model is proposed to decrease the risk difference among populated areas by adjusting the path frequency between O-D pairs for hazardous materials transportation. The model is converted into two sub models to facilitate decision-making, and an algorithm is provided for each sub model. Finally, we design a numerical example to verify the accuracy and rationality of the model and algorithm. The numerical example shows that the proposed model is essential and feasible for reducing the complexity and increasing the portability of the transportation process.
Źródło:
Archives of Transport; 2018, 46, 2; 33-46
0866-9546
2300-8830
Pojawia się w:
Archives of Transport
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Principles of vessel route planning in Ice on the Northern Sea Route
Autorzy:
Pastusiak, T.
Powiązania:
https://bibliotekanauki.pl/articles/117236.pdf
Data publikacji:
2016
Wydawca:
Uniwersytet Morski w Gdyni. Wydział Nawigacyjny
Tematy:
ice navigation
route planning
vessel route planning
Northern Sea Route (NSR)
arctic area
human factor
Safety at Sea
polar navigation
Opis:
A complex of ice cover characteristics and the season of the year were considered in relation to vessel route planning in ice-covered areas on the NSR. The criteria for navigation in ice - both year-round and seasonal were analyzed. The analysis of the experts knowledge, dissipated in the literature, allowed to identify some rules of route planning in ice-covered areas. The most important processes from the navigation point of view are the development and disintegration of ice, the formation and disintegration of fast ice and behavior of the ice massifs and polynyas. The optimal route is selected on basis of available analysis and forecast maps of ice conditions and ice class, draught and seaworthiness of the vessel. The boundary of the ice indicates areas accessible to vessels without ice class. Areas with a concentration of ice from 0 to 6/10 are used for navigation of vessels of different ice classes. Areas of concentration of ice from 7/10 up are eligible for navigation for icebreakers and vessels with a high ice class with the assistance of icebreakers. These rules were collected in the decision tree. Following such developed decision-making model the master of the vessel may take decision independently by accepting grading criteria of priorities resulting from his knowledge, experience and the circumstances of navigation. Formalized form of decision making model reduces risk of the "human factor" in the decision and thereby help improve the safety of maritime transport.
Źródło:
TransNav : International Journal on Marine Navigation and Safety of Sea Transportation; 2016, 10, 4; 587-592
2083-6473
2083-6481
Pojawia się w:
TransNav : International Journal on Marine Navigation and Safety of Sea Transportation
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
The idea of using the A* algorithm for route planning an unmanned vehicle “Edredon”
Autorzy:
Naus, K.
Wąż, M.
Powiązania:
https://bibliotekanauki.pl/articles/359690.pdf
Data publikacji:
2013
Wydawca:
Akademia Morska w Szczecinie. Wydawnictwo AMSz
Tematy:
A* algorithm
navigation system
route planning
electronic chart
vehicle „Edredon”
Opis:
This article presents the concept of algorithm A* functioning in a navigation system equipped with electronic navigational chart for autonomous planning the shortest and safest route crossing an offshore unmanned vehicle “Edredon”. The first part describes the general technical architecture and functionality of the vehicle's navigation system. In the second part shows in detail the modules of the system responsible for the planning of the road and how to implement them in the A* algorithm. The third part describes the proper operation of testing whether the A* algorithm in the navigation system, while the task of planning the route of the autonomous vehicle. Final part is a discussion of the results obtained from tests carried out in order to evaluate the applicability of the A* algorithm for route planning in autonomous navigation systems.
Źródło:
Zeszyty Naukowe Akademii Morskiej w Szczecinie; 2013, 36 (108) z. 2; 143-147
1733-8670
2392-0378
Pojawia się w:
Zeszyty Naukowe Akademii Morskiej w Szczecinie
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Analysis of vehicle stability loss due to strong crosswind gusts using web services in the route planning process
Autorzy:
Betkier, Igor
Mitkow, Szymon
Kijek, Magdalena
Powiązania:
https://bibliotekanauki.pl/articles/223957.pdf
Data publikacji:
2019
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
crosswind
transportation planning
vehicle stability
web applications
route planning
Źródło:
Archives of Transport; 2019, 52, 4; 47-56
0866-9546
2300-8830
Pojawia się w:
Archives of Transport
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
An airspace model aplicable for automatic flight route planning inside free route airspace
Model przestrzeni powietrznej umożliwiający automatyczne planowanie lotu we free route airspace
Autorzy:
Drupka, G.
Majka, A.
Rogalski, T.
Trela, L.
Powiązania:
https://bibliotekanauki.pl/articles/195838.pdf
Data publikacji:
2018
Wydawca:
Politechnika Rzeszowska im. Ignacego Łukasiewicza. Oficyna Wydawnicza
Tematy:
transport
navigation
air transport
flight planning
flight safety
nawigacja
transport lotniczy
planowanie lotu
bezpieczeństwo lotnicze
Opis:
The article is strongly related to the Single European Sky ATM Research (SESAR) project. The project’s objective is the improvement of air transport above Europe 0. Since Air Traffic Management (ATM) is involved to obtain more effective approach to air traffic flow managing activities, the concept of Flexible Use Airspace (FUA) has arisen in result. ATM is a quite developed aviation’s subdomain, therefore currently existing airspace state has been described briefly in the article, referring to the presented solution concept. The notion of Free Route Airspace (FRA) airspace model defined in this article relies on mathematical description. The selected approach clarifies airspace as a set of squares or cubes that have volumes with appointed values due to certain conditions in the considered time (i.e. traffic flow or weather). The model has to ensure facilitation of flight route planning and warrant aircrafts separation towards flight safety assurance. The concept assumes that this airspace model will provide assistance for airspace user to select essential flight plan criteria, such as economy, time, etc. The path will be appointed according to personal preferences, based on the model from which further elaborated algorithm will evaluate situation. The presented solution is a response to air traffic growth. Therefore it supports the SESAR project through research and development activities. The description proves that airspace model would create enhancement in flight planning for airspace users.
Artykuł przedstawia koncepcję zamodelowanej przestrzeni powietrznej w sposób umożliwiający automatyczne planowanie lotu w Przestrzeni Lotów Swobodnych (Free Route Airspace – FRA). Zaprezentowany model usprawnia czynności składania planu lotu przez użytkownika, jednocześnie gwarantując bezpieczną separację statków powietrznych. Tematyka artykułu jest związana z badaniami do projektu Jednolitej Europejskiej Przestrzeni Powietrznej (Single European ATM Research – SESAR), której podstawowe założenie stanowi poprawa efektywności i bezpieczeństwa operacji w transporcie lotniczym. Efektywniejsze Zarządzanie Ruchem Lotniczym (Air Traffic Management – ATM) jest możliwe przez wprowadzenie koncepcji Elastycznego Zarządzania Przestrzenią Powietrzną (Flexible Use of Airspace – FUA). Elastyczne Zarządzanie Przestrzenią Powietrzną pozwala na monitorowanie dostępności przestrzeni w różnych odstępach czasowych, w sposób umożliwiający uwzględnienie planowanego natężenia ruchu wobec innych warunków, np. atmosferycznych. Przedstawiony w artykule opis przestrzeni powietrznej opiera się na opisie matematycznym. Przyjęte zostało założenie, że cała przestrzeń powietrzna składa się z jednakowej wielkości kwadratów (lub sześcianów w przypadku przestrzeni 3D). Każdy kwadrat lub sześcian ma przydzieloną pojemność wraz z wartościami określającymi dostępność w ustalonym czasie. Dostępność jest uwarunkowana przez wiele czynników, np. zagęszczenie ruchu lotniczego. Wykonane badania wskazują, że zamodelowana w ten sposób przestrzeń powietrzna stwarza potencjał do planowania lotu. W konsekwencji wprowadzenia przez użytkownika dwóch punktów lotu – początkowego i końcowego, przeszukana w następstwie przestrzeń pozwala na przeanalizowanie i zaproponowanie przez system trasy według przyjętego kryterium.
Źródło:
Zeszyty Naukowe Politechniki Rzeszowskiej. Mechanika; 2018, z. 90 [298], 1; 5-18
0209-2689
2300-5211
Pojawia się w:
Zeszyty Naukowe Politechniki Rzeszowskiej. Mechanika
Dostawca treści:
Biblioteka Nauki
Artykuł
Wyświetlanie 1-15 z 65

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