Shortest Paths
Mostrando 1-8 de 8 artigos, teses e dissertações.
-
1. SHORTEST PATHS ON DYNAMIC GRAPHS: A SURVEY
ABSTRACT This paper provides an overview of the state-of-the art and the current research trends concerning shortest paths problem on dynamic graphs. The discussion is divided in two main topics: reoptimization and time-dependent shortest paths. Reoptimization consists in the solution of a sequence of shortest path problems in which each instance slightly di
Pesqui. Oper.. Publicado em: 2017-09
-
2. Path Planning for Unmanned Underwater Vehicle in 3D Space with Obstacles Using Spline-Imperialist Competitive Algorithm and Optimal Interval Type-2 Fuzzy Logic Controller
Abstract In this research, generation of a short and smooth path in three-dimensional space with obstacles for guiding an Unmanned Underwater Vehicle (UUV) without collision is investigated. This is done by utilizing spline technique, in which the spline control points positions are determined by Imperialist Competitive Algorithm (ICA) in three-dimensional s
Lat. Am. j. solids struct.. Publicado em: 2016-06
-
3. A note on the NP-hardness of the separation problem on some valid inequalities for the elementary shortest path problem
In this paper, we investigate the separation problem on some valid inequalities for the s - t elementary shortest path problem in digraphs containing negative directed cycles. As we will see, these inequalities depend to a given parameter k ∈ ℕ. To show the NP-hardness of the separation problem of these valid inequalities, considering the parameter k ∈
Pesqui. Oper.. Publicado em: 2014-04
-
4. k-shortest paths / K-menores caminhos
Tratamos da generalização do problema da geração de caminho mínimo, no qual não apenas um, mas vários caminhos de menores custos devem ser produzidos. O problema dos k-menores caminhos consiste em listar os k caminhos de menores custos conectando um par de vértices. Esta dissertação trata de algoritmos para geração de k-menores caminhos em grafos
Publicado em: 2009
-
5. Zona de empate : o elo entre transformadas de watershed e conexidade nebulosa / Tie-zone : the bridge between watershed transforms and fuzzy connectedness
This thesis introduces the new concept of tie-zone transform that unifies the multiple solutions of a watershed transform, by conserving only the common parts among them such that the differing parts constitute the tie zone. The tie zone applied to the watershed via image-foresting transform (TZ-IFTWT) proves to be a link between watershed transforms based o
Publicado em: 2007
-
6. Problemas de proximidade e de caminhos minimos em superficies poliedricas
Shortest Path Planning is the field of Computational Geometry that concerns the determination of feasible shortest paths from a point to another in a given environment. We deal with a directed shortest path problem (DFGP) that minimizes the total work spent to move a body on a polyhedral surface with constant friction coefficient and constant slope in each f
Publicado em: 1998
-
7. Determinação automatica de trajetorias otimas para um manipulador na presença deobstaculos
A method for automatically planning a path for a two link manipulator in the presence of fixed and known obstacles is presented. The transformation of the Cartesian workspace into the manipulator joint coordinates (configuration maps) simplify the colision detection. 80 the find-path problem is solved finding the shortest line which connects starting and fin
Publicado em: 1990
-
8. Computing geodesic paths on manifolds
The Fast Marching Method is a numerical algorithm for solving the Eikonal equation on a rectangular orthogonal mesh in O(M log M) steps, where M is the total number of grid points. In this paper we extend the Fast Marching Method to triangulated domains with the same computational complexity. As an application, we provide an optimal time algorithm for comput
The National Academy of Sciences.