During the flight, aircraft produces several pollutant emissions and the amount is deeply related to the atmospheric conditions (especially pressure, humidity, temperature, air density and wind), the aircraft performance and the phase of flight. In this paper an approach, based on Dijkstra algorithm, to calculate optimized trajectory in terms of several emission reduction (multi-objective traje...

Path planning is a fundamental optimization problem that is crucial for the navigation of a mobile robot. Among the vast array of optimization approaches, we focus in this paper on Ant Colony Optimization (ACO) and Genetic Algorithms (GA) for solving the global path planning problem in a static environment, considering their effectiveness in solving such a problem. Our objective is to design an...

We define a -causal discretization of static convex Hamilton-Jacobi Partial Differential Equations (HJ PDEs) such that the solution value at a grid node is dependent only on solution values that are smaller by at least . We develop a Monotone Acceptance Ordered Upwind Method (MAOUM) that first determines a consistent, -causal stencil for each grid node and then solves the discrete equation in a...

Dijkstra and Scholten have formulated a theorem stating that all disjunctivity properties of a predicate transformer are preserved by the construction of least preex points. An alternative proof of their theorem is presented based on two fundamental xed point theorems, the abstraction theorem and the fusion theorem, and the fact that suprema in a lattice are deened by a Galois connection. The a...

Suppose we have a graphG in which the number of vertices distance d away from any given vertex is roughly b (in other words, our graph has a branching factor of b). An example of a graph like this is the Rubik’s cube state graph. If we have n total vertices in this graph, then we can roughly estimate the diameter of the graph to be logb n if we assume that the last layer outwards dominates the ...

Many researchers have been attracted on the new research area i.e. flying adhoc network ( FANET) after the lot of research done on the mobile adhoc network(MANET). MANET and VANET cannot tackle all the situations so it can be done by the new introduced concept FANET. FANET is the adhoc network which is formed by the multi UAVs instead of using one large UAV. Due to rapid topology change and hig...

(We will use this subroutine later on in the lecture for another algorithm, which is why we are defining it as a separate procedure). Informally, we think of d[v] as our current estimate for the shortest path from s to v. The algorithm begins by initializing each d[v] ← ∞, except for our source vertex s, which we initialize so that d[s] = 0 (trivially, the shortest path from s to s is length 0)...

We give a distributed algorithm to compute shortest paths in a network with changing topology. It does not suffer from the routing table looping behavior associated with the Ford-Bellman tdistributed shortest path algorithm although it uses truly distributed processing. Its time and message complexities are evaluated. Pierre Humblet is with the Laboratory for Information and Decision Systems, M...

The single source shortest path (SSSP) problem lacks parallel solutions which are fast and simultaneously work-eecient. We propose simple criteria which divide Dijkstra's sequential SSSP algorithm into a number of phases, such that the operations within a phase can be done in parallel. We give a PRAM algorithm based on these criteria and analyze its performance on random digraphs with random ed...

Distributed multimedia applications usually require multiple QoS performance guarantees. However, in general, searching such a route in the network, to support multimedia applications, is known to be NP-complete. In this paper, we propose a new heuristic QoS routing algorithm, called “QoSRDKS”, for supporting multimedia applications in high-speed networks. QoSRDKS is a modification of rule-base...