loading
Simulation & Implementation of Shortest Path Algorithm with a Mobile Robot Using Configuration Space Approach
2009 Edition, January 1, 2009 - IEEE - Institute of Electrical and Electronics Engineers, Inc.

A simulation & implementation of a shortest path from the source to the destination in the amidst of obstacles using configuration space approach both with translations & rotations is presented in this paper....

Some shortest path algorithms with decentralized information and communication requirements
1982 Edition, Volume 27, June 1, 1982 - IEEE - Institute of Electrical and Electronics Engineers, Inc.

This paper presents several decentralized algorithms for finding all shortest paths in a network. Both static and dynamic networks are discussed. Each algorithm has localized information and communication requirements, operates asynchronously, and converges to the...

Time-varying shortest path algorithm with transit time tuning for parking lot navigation
2015 Edition, November 1, 2015 - IEEE - Institute of Electrical and Electronics Engineers, Inc.

This paper presents a new system for intelligent navigation inside a parking lot. After modeling the parking lot with a time-varying graph, the proposed system applies a time-varying shortest path algorithm and dynamically tunes arc transit...

Integration of a robust shortest path algorithm with a time dependent vehicle routing model and applications
2003 Edition, January 1, 2003 - IEEE - Institute of Electrical and Electronics Engineers, Inc.

This paper describes a way of combining two techniques, in order to define a framework that can deal with the following problem: find an optimized set of routes when the customers set is a proper subset of an entire network, and variable traffic...

Shortest path algorithm with pre-calculated single link failure recovery for non-negative weighted undirected graphs
2010 Edition, June 1, 2010 - IEEE - Institute of Electrical and Electronics Engineers, Inc.

Shortest path and related problems have been a very hot topic for researchers since Dijekstra devised his first shortest path algorithm. In transportation and communication routing, during the execution of system, failure of any link needs...

An improved Thorup shortest paths algorithm with a modified component tree
2013 Edition, July 1, 2013 - IEEE - Institute of Electrical and Electronics Engineers, Inc.

This paper provides an improved Thorup algorithm which modified the component tree of the original Thorup algorithm to make it able to maintain the tentative distance of each vertex without the unvisited structure. According to the experimental result, our...

An all pairs shortest path algorithm with expected running time O(n 2logn)
1985 Edition, October 1, 1985 - IEEE - Institute of Electrical and Electronics Engineers, Inc.

An algorithm is described that solves the all pairs shortest path problem for a nonnegatively weighted graph. The algorithm has an average requirement on quite general classes of random graphs of O(n2logn) time, where n is the number of...

An optimal chip compaction method based on shortest path algorithm with automatic jog insertion
1992 Edition, January 1, 1992 - IEEE - Institute of Electrical and Electronics Engineers, Inc.

A one-dimensional compaction method for layout patterns including rectilinear macrocells on any number of layers is presented. The algorithm is based on the shortest path search on a constraint graph. It generates an optimal layout pattern in the smallest...

A Delaunay triangulation-based shortest path algorithm with O(n log n) time in the Euclidean plane
2012 Edition, July 1, 2012 - IEEE - Institute of Electrical and Electronics Engineers, Inc.

In the Euclidean and/or λ-geometry planes with obstacles, the shortest path problem is to find an optimal path between source and destination. There are three different approaches to solve this problem in the Euclidean plane; roadmaps, cell decomposition and...

A shortest-path-search algorithm with symmetric constraints for analog circuit routing
2005 Edition, Volume 2, January 1, 2005 - IEEE - Institute of Electrical and Electronics Engineers, Inc.

In this paper, we introduced a new algorithm, which is used for analog circuit routing, to search for the shortest path on the grid graph. It is different from previous path searching algorithms, since it concerns the symmetric constraint, one...

Advertisement