Search
Filters
total: 3483
-
Catalog
- Publications 3309 available results
- Journals 3 available results
- Conferences 1 available results
- People 29 available results
- Inventions 2 available results
- Projects 1 available results
- Laboratories 1 available results
- e-Learning Courses 56 available results
- Events 6 available results
- Open Research Data 75 available results
displaying 1000 best results Help
Search results for: SHORTEST PATH PROBLEM
-
Optimization of The Shortest-Path Routing with Equal-Cost Multi-Path Load Balancing
Publication -
Selection Pressure in the Evolutionary Path Planning Problem
PublicationThis article compares an impact of using various post-selection methods on the selection pressure and the quality of the solution for the problem of planning the path for a moving object using the evolutionary method. The concept of selection pressure and different methods of post-selection are presented. Article analyses behaviour of post-selection for four options of evolutionary algorithms. Based on the results achieved, waveform...
-
Moving objects in the problem of path planning by evolutionary computation
Publication...
-
Sylwester Kaczmarek dr hab. inż.
PeopleSylwester Kaczmarek received his M.Sc in electronics engineering, Ph.D. and D.Sc. in switching and teletraffic science from the Gdansk University of Technology, Gdansk, Poland, in 1972, 1981 and 1994, respectively. His research interests include: IP QoS and GMPLS and SDN networks, switching, QoS routing, teletraffic, multimedia services and quality of services. Currently, his research is focused on developing and applicability...
-
Exploiting multi-interface networks: Connectivity and Cheapest Paths
PublicationLet G = (V,E) be a graph which models a set of wireless devices (nodes V) that can communicate by means of multiple radio interfaces, according to proximity and common interfaces (edges E). The problem of switching on (activating) the minimum cost set of interfaces at the nodes in order to guarantee the coverage of G was recently studied. A connection is covered (activated) when the endpoints of the corresponding edge share at...
-
Generating optimal paths in dynamic environments using RiverFormation Dynamics algorithm
PublicationThe paper presents a comparison of four optimisation algorithms implemented for the purpose of finding the shortest path in static and dynamic environments with obstacles. Two classical graph algorithms –the Dijkstra complete algorithm and A* heuristic algorithm – were compared with metaheuristic River Formation Dynamics swarm algorithm and its newly introduced modified version. Moreover, another swarm algorithm has been compared...
-
Autonomous port management based AGV path planning and optimization via an ensemble reinforcement learning framework
PublicationThe rapid development of shipping trade pushes automated container terminals toward the direction of intelligence, safety and efficiency. In particular, the formulation of AGV scheduling tasks and the safety and stability of transportation path is an important part of port operation and management, and it is one of the basic tasks to build an intelligent port. Existing research mainly focuses on collaborative operation between...
-
An Efficient Noisy Binary Search in Graphs via Median Approximation
PublicationConsider a generalization of the classical binary search problem in linearly sorted data to the graph-theoretic setting. The goal is to design an adaptive query algorithm, called a strategy, that identifies an initially unknown target vertex in a graph by asking queries. Each query is conducted as follows: the strategy selects a vertex q and receives a reply v: if q is the target, then =, and if q is not the target, then v is a...
-
A Framework for Searching in Graphs in the Presence of Errors
PublicationWe consider a problem of searching for an unknown target vertex t in a (possibly edge-weighted) graph. Each vertex-query points to a vertex v and the response either admits that v is the target or provides any neighbor s of v that lies on a shortest path from v to t. This model has been introduced for trees by Onak and Parys [FOCS 2006] and for general graphs by Emamjomeh-Zadeh et al. [STOC 2016]. In the latter, the authors provide...
-
Fundamental Schemes to Determine Disjoint Paths for Multiple Failure Scenarios
PublicationDisjoint path routing approaches can be used to cope with multiple failure scenarios. This can be achieved using a set of k (k> 2) link- (or node-) disjoint path pairs (in single-cost and multi-cost networks). Alternatively, if Shared Risk Link Groups (SRLGs) information is available, the calculation of an SRLG-disjoint path pair (or of a set of such paths) can protect a connection against the joint failure of the set of links...
-
Routing decisions independent of queuing delays in broadband leo networks
PublicationThis paper presents an analysis of queuing and propagation delays of Inter-Satellite Links (ISLs) in broadband Low-Earth Orbit (LEO) satellite networks. It is shown that queuing delays are negligible in all reasonable working conditions of the broadband ISL network. This fact makes it possible to simplify the routing protocols in such networks and permits using already known multi-commodity flow solutions for routing. The performance...
-
Using River Formation Dynamics Algorithm in Mobile Robot Navigation
PublicationRiver Formation Dynamics is a heuristic optimization algorithm based on the manner, in which drops of water form the river bed. The idea is to imitate the movement of drops on the edges between given nodes thus performing a search based on their height, which is modified through the mechanism of soil erosion and sediment deposition. In this way decreasing gradients are constructed, and these are followed by subsequent drops to...
-
The convex domination subdivision number of a graph
PublicationLet G = (V;E) be a simple graph. A set D\subset V is a dominating set of G if every vertex in V - D has at least one neighbor in D. The distance d_G(u, v) between two vertices u and v is the length of a shortest (u, v)-path in G. An (u, v)-path of length d_G(u; v) is called an (u, v)-geodesic. A set X\subset V is convex in G if vertices from all (a, b)-geodesics belong to X for any two vertices a, b \in X. A set X is a convex dominating...
-
Weakly convex and convex domination numbers of some products of graphs
PublicationIf $G=(V,E)$ is a simple connected graph and $a,b\in V$, then a shortest $(a-b)$ path is called a $(u-v)$-{\it geodesic}. A set $X\subseteq V$ is called {\it weakly convex} in $G$ if for every two vertices $a,b\in X$ exists $(a-b)$- geodesic whose all vertices belong to $X$. A set $X$ is {\it convex} in $G$ if for every $a,b\in X$ all vertices from every $(a-b)$-geodesic belong to $X$. The {\it weakly convex domination number}...
-
Dynamic unattended measurement based routing algorithm for diffServ architecture
PublicationDynamic routing is very important in terms of assuring QoS in today's packet networks especially for streaming and elastic services. Existing solutions dedicated to dynamic routing are often too complicated and seem to be not usable in real time traffic scenarios where transferred traffic may vary significantly. This was the main reason for research and new routing mechanism proposal which should apply to today's packet networks....
-
Simulation model for evaluation of QoS routing algorithm in large packet networks
PublicationThe variety of traffic transferred via current telecommunication networks includes also voice, which should meet quality requirements. One of mechanisms, which can support QoS in current packet networks, is routing. There exist many routing proposals which should introduce the QoS into the network but practically they don't. Following paper presents the realization of simulation model for evaluation of a new routing algorithm DUMBRA...
-
Detection of the First Component of the Received LTE Signal in the OTDoA Method
PublicationIn a modern world there is a growing demand for localization services of various kinds. Position estimation can be realized via cellular networks, especially in the currently widely deployed LTE (Long Term Evolution) networks. However, it is not an easy task in harsh propagation conditions which often occur in dense urban environments. Recently, time-methods of terminal localization within the network have been the focus of attention,...
-
The maximum edge-disjoint paths problem in complete graphs
PublicationRozważono problem ścieżek krawędziowo rozłącznych w grafach pełnych. Zaproponowano wielomianowe algorytmy: 3.75-przybliżony (off-line) oraz 6.47-przybliżony (on-line), poprawiając tym samym wyniki wcześniej znane z literatury [P. Carmi, T. Erlebach, Y. Okamoto, Greedy edge-disjoint paths in complete graphs, in: Proc. 29th Workshop on Graph Theoretic Concepts in Computer Science, in: LNCS, vol. 2880, 2003, pp. 143-155]. Ponadto...
-
Data Mining Path
e-Learning CoursesWithin this path, various issues regarding data mining and their practical application in various systems are discussed. 4 semestr specjalności ISI i ZAD
-
Degree of entaglement as a physically ill-posted problem: The case of entaglement with vacuum
PublicationAnalizujemy przypadek fotonu w superpozycji różnych modów i zadajemy pytanie o stopień ich splątania z próżnią. Problem okazuje się być źle postawiony, gdyż nie wiemy którą reprezentację algebry CCR wybrać dla kwantowania pola. Gdy dokonamy wyboru jednoznacznie możemy rozwiązać zagadnienie splątania. Tak więc trudność nie leży w matematyce lecz w fizyce problemu.
-
Basics of Data Warehouses Path
e-Learning CoursesWithin this path the basic aspects of data warehouses (architecture, star schema, etc.) are discussed. The course is intended for students of the 1st degree of Informatics Field (semester 5) - Kurs planowany dla studentów I stopnia kierunku informatyka (semestr 5) - przedmiot Hurtownie danych oraz dla studentów II stopnia kierunku informatyka, specjalność ZAD.
-
The complexity of minimum-length path decompositions
PublicationWe consider a bi-criteria generalization of the pathwidth problem, where, for given integers k, l and a graph G, we ask whether there exists a path decomposition P of G such that the width of P is at most k and the number of bags in P, i.e., the length of P, is at most l. We provide a complete complexity classification of the problem in terms of k and l for general graphs. Contrary to the original pathwidth problem, which is fixed-parameter...
-
Termination functions for evolutionary path planning algorithm
PublicationIn this paper a study of termination functions (stop criterion) for evolutionary path planning algorithm is presented. Tested algorithm is used to determine close to optimal ship paths in collision avoidance situation. For this purpose a path planning problem is defined. A specific structure of the individual path and fitness function is presented. For the simulation purposes a close to real tested environment is created. Five...
-
The Niching Mechanism in the Evolutionary Method of Path Planning
PublicationThis paper presents the concept of the niching mechanism in the evolutionary method of path planning. The problem is considered based on the example of a ship path planning. In this method the diversity of individuals is tested in respect to their physical distance, not the fitness function value. The researches show that such an approach increases effectiveness of solution space exploration, what results in a final solution with...
-
Comparison of Selection Schemes in Evolutionary Method of Path Planning
PublicationThis article compares an impact of using various selection schemes on the quality of the solution for the problem of planning the path for a moving object using the evolutionary method. In study case problem of avoiding collisions at sea is analyzed. The modelled environment includes static constraints (lands, canals, etc.) and dynamic objects (moving ships). Article analyses behaviour of selection schemes in two similar environments...
-
Impact of Initial Population on Evolutionary Path Planning Algorithm
PublicationIn this paper an impact of initial population on evolutionary path planning algorithm is presented. Tested algorithm is used to determine close to optimal shippaths in collision avoidance situation. For this purpose a path planning problem is defined. A specific structure of the individual path and fitness function is presented. For the simulation purposes a close to real tested environment is created. Four tests are performed....
-
Impact of Initial Population on Evolutionary Path Planning Algorithm
PublicationIn this paper an impact of initial population on evolutionary path planning algorithm is presented. Tested algorithm is used to determine close to optimal ship paths in collision avoidance situation. For this purpose a path planning problem is defined. A specific structure of the individual path and fitness function is presented. For the simulation purposes a close to real tested environment is created. Four tests are performed....
-
Koncepcja logistycznego usprawnienia magazynu cross-dockowego przedsiębiorstwa X
PublicationCelem artykułu jest przedstawienie koncepcji logistycznego usprawnienia magazynu cross- -dockowego przedsiębiorstwa X. W oparciu o informacje dotyczące stanu faktycznego maga- zynu zostały przeprowadzone badania procesów magazynowych. Po przeprowadzeniu identyfikacji problemów zostały zaproponowane usprawnienia wybranego procesu magazynowego, które polegały na propozycji zmiany sposobu zagospodarowania magazynu. Do tego...
-
Experimental Study of the Influence of Noise Level on the Uncertainty Value in a Measurement System Containing an Analog-to-Digital Converter
Open Research DataFor newly developed measuring systems it is easy to estimate type B uncertainties based on the technical data of the measuring modules applied. However, it is difficult to estimate A type un-certainties due to the unknown type and level of interferences infiltrating into the measuring sys-tem. This is a particularly important problem for measurements...
-
Distributed Evolutionary Algorithm for Path Planning in Navigation Situation
PublicationThis article presents the use of a multi-population distributed evolutionary algorithm for path planning in navigation situation. The algorithm used is with partially exchanged population and migration between independently evolving populations. In this paper a comparison between a multi-population and a classic single-population algorithm takes place. The impact on the ultimate solution has been researched. It was shown that using...
-
Path planning algorithm for ship collisions avoidance in environment with changing strategy of dynamic obstacles
PublicationIn this paper a path planning algorithm for the ship collision avoidance is presented. Tested algorithm is used to determine close to optimal ship paths taking into account changing strategy of dynamic obstacles. For this purpose a path planning problem is defined. A specific structure of the individual path and fitness function is presented. Principle of operation of evolutionary algorithm and based on it dedicated application...
-
Bifurcation in von Karman problem for rectangular, thin, elastic plate resting on elastic foundation of Winkler type
PublicationPraca poświęcona jest utracie stateczności prostokątnej, cienkiej płyty sprężystej spoczywającej na podłożu liniowo sprężystym typu Winklera. Płyta jest ściskana równomiernie rozłożonymi obciążeniami na dwóch równoległych brzegach. Wyznaczono obciążenia krytyczne, formy utraty stateczności płyty oraz początkowe zachowanie pokrytyczne. Analizę prowadzono za pomocą analizy funkcjonalnej przy zachowaniu precyzyjnego matematycznego...
-
Measurement of Latency in the Android Audio Path
PublicationThis paper provides a description of experimental investigations concerning comparison between the audio path characteristics of various Android versions. First, information about the changes in each system version in the context of latency caused by them is presented. Then, a measurement procedure employing available applications to measure latency is described comparing to results contained in the Internet. Finally, a comparison...
-
Path dependence, modularity and the offshoring of (some) physician services
PublicationThis paper integrates ideas from modularity and path dependency to explain the potential for and limitations of the offshoring of high value added physician services. While not all medical services are amenable to offshoring, a growing number of physician activities can be viewed as modular components which, at least technically, could be performed remotely. As a result, the presumption that concerns for efficiency dictate how...
-
Propagation Path Loss Modeling in Container Terminal Environment
PublicationThis paper describes novel method of path loss modeling for radio communication channels in container port area. Multi-variate empirical model is presented, based on multidimensional regression analysis of real path loss measurements from container terminal environment. The measurement instruments used in propagation studies in port area are also described.
-
Evaluation of Path Based Methods for Conceptual Representation of the Text
PublicationTypical text clustering methods use the bag of words (BoW) representation to describe content of documents. However, this method is known to have several limitations. Employing Wikipedia as the lexical knowledge base has shown an improvement of the text representation for data-mining purposes. Promising extensions of that trend employ hierarchical organization of Wikipedia category system. In this paper we propose three path-based...
-
Path Loss Analysis in Off-Body Channels in Indoor Environment
PublicationThis temporary document describes an analysis of path loss in off-body channels in an indoor environment. The influence of body orientation and on-body antenna placement on path loss in off-body communications as well as of different bodies has been investigated. Five static scenarios, six distances between body and antenna and eight body orientations were analysed; moreover, two dynamic scenarios were investigated. The smallest...
-
Path Loss Modelling in the Untypical Outdoor Propagation Environments
PublicationIn the paper three ways of path loss modelling in the untypical outdoor environments are presented. The exemplary untypical outdoor environment is analyzed. The investigated environment is characterized, and the measurement campaign are shortly described. The following models have been analyzed: the COST231 Walfisch-Ikegami model, the modified COST231Walfisch-Ikegami model tuned on the basis of empirical data, and the empirical...
-
Comparison of Single and Multi-Population Evolutionary Algorithm for Path Planning in Navigation Situation
PublicationIn this paper a comparison of single and multi-population evolutionary algorithm is presented. Tested algorithms are used to determine close to optimal ship paths in collision avoidance situation. For this purpose a path planning problem is defined. A specific structure of the individual path and fitness function is presented. Principle of operation of single-population and multi-population evolutionary algorithm is described....
-
Measurements of Path Loss in Off-Body Channels in Indoor Environments
PublicationThis paper presents a measurements of the path loss for validation of a statistical model for off-body radio channels in an indoor multipath environment, which considers the distance dependent mean path loss, and describes body shadowing and fast fading components in a statistical way. The measurement equipment and propagation indoor environment have been presented. Two different bodies and five static and two walking scenarios...
-
New First - Path Detector for LTE Positioning Reference Signals
PublicationIn today's world, where positioning applications reached a huge popularity and became virtually ubiquitous, there is a strong need for determining a device location as accurately as possible. A particularly important role in positioning play cellular networks, such as Long Term Evolution (LTE). In the LTE Observed Time Difference of Arrival (OTDOA) positioning method, precision of device location estimation depends on accuracy...
-
Experimental research on evolutionary path planning algorithm with fitness function scaling for collision scenarios
PublicationThis article presents typical ship collision scenarios, simulated using the evolutionary path planning system and analyses the impact of the fitness function scaling on the quality of the solution. The function scaling decreases the selective pressure, which facilitates leaving the local optimum in the calculation process and further exploration of the solution space. The performed investigations have proved that the use of scaling...
-
Finding small-width connected path decompositions in polynomial time
PublicationA connected path decomposition of a simple graph $G$ is a path decomposition $(X_1,\ldots,X_l)$ such that the subgraph of $G$ induced by $X_1\cup\cdots\cup X_i$ is connected for each $i\in\{1,\ldots,l\}$. The connected pathwidth of $G$ is then the minimum width over all connected path decompositions of $G$. We prove that for each fixed $k$, the connected pathwidth of any input graph can be computed in polynomial-time. This answers...
-
Path Loss Modelling for Location Service Applications
PublicationThe aim of this paper is the path loss modeling for the radiolocation services in radiocommunication networks, particularly in cellular networks. The main results of the measurements obtained in the physical layer of the UMTS are introduced. A new method for the utilization of the multipath propagation phenomenon to improve the estimation of the distance between the mobile station (MS) and the base station (BS) is outlined. This...
-
Path Loss Measurements in Wideband Radio Link Designed for Maritime Environment
PublicationIn the article, the research and analysis of path loss in designed and evaluated digital radio link for high-speed data transmission in maritime environment is presented. Collected samples of received signal were used to determine the mean path loss and its standard deviation. Measuring campaign was carried out in a real maritime conditions. The mean value of path loss reached 126 dB on a distance of 11.16 km.
-
Journal of Problem Solving
Journals -
Measurements of Path Loss in Off-Body Channels in Indoor Environments
PublicationThe main goal of the paper is to investigate the influence of body orientation and on-body antenna placement on the path loss in off-body communications. In addition, the influence of different bodies is analysed.
-
Density functional approaches to the many-body problem
e-Learning Courses -
An Approach to Mean Path Loss Model Estimation for Off-Body Channels
PublicationThis paper presents an approach to estimation of the mean path loss model parameters in off-body Body Area Networks channels. In this approach, the path loss exponent is constrained to a value obtained for the line-of-sight (LoS) propagation in the co-polarised channel, considering a generalised static scenario. The comparison of the goodness of fit between the proposed approach and other approaches, for a set of measurements obtained...
-
Path-based methods on categorical structures for conceptual representation of wikipedia articles
PublicationMachine learning algorithms applied to text categorization mostly employ the Bag of Words (BoW) representation to describe the content of the documents. This method has been successfully used in many applications, but it is known to have several limitations. One way of improving text representation is usage of Wikipedia as the lexical knowledge base – an approach that has already shown promising results in many research studies....