In this paper, I perform an analysis of the time to traverse different paths from a source to a destination in an urban city based on data gathered by a vehicle-to-infrastructure (V2I) intelligent transportation system (ITS) architecture. Vehicle tracking devices have been installed in 15 vehicles that frequent the University of Alaska, Anchorage on a daily basis. This data has been analyzed us...

This paper is concerned with the problem of finding a time-optimal velocity profile along the predefined path for static formations of mobile robots in order to traverse the path in shortest time and to satisfy, for each mobile robot in the formation, velocity, acceleration, tip over and wheel slip prevention constraints. Time-optimal velocity planning is achieved using so called bang-bang cont...

Shortest path algorithms optimize the costs of a journey in a network. For route planning algorithms, networks are usually modeled as graphs. Different cost functions are used, like the length of a path, or the travel time. Costs are traditionally attached to edges in the graph. For some important route planning problems costs that are associated with pairs of edges can be identified. For examp...

Computation of shortest paths on free-form surfaces is an important problem in ship design, robot motion planning, computation of medial axis transforms of trimmed surface patches, terrain navigation and NC machining. The objective of this paper is to provide an e cient and reliable method for computing the shortest path between two points on a free-form parametric surface and the shortest path...

One part of the production of modern hearing aids is the integration of a ventilation tube. This is usually done by applying a shortest path search algorithm on a non-convex ear impression. For the functionality of this so-called vent the path search algorithm has to fulfill several constraints like smoothness and space consumption of the vent. The proposed solution is based upon a modified ver...

We provide several new algorithmic results for the secluded path problem, specifically approximation and optimality results for the static algorithm of [3, 5], and an extension (h-Memory) of it based on de Bruijn graphs, when applied to bounded degree graphs and some other special graph classes which can model wireless communication and line-of-sight settings. Our primary result is that h-Memor...

In this paper, we study the online path planning for khepera II mobile robot in an unknown environment. The well known heuristic A* algorithm is implemented to make the mobile robot navigate through static obstacles and find the shortest path from an initial position to a target position by avoiding the obstacles. The proposed path finding strategy is designed in a grid-map form of an unknown e...

Transportation engineers use traac equilibrium analysis to study traac and road systems; it is also used for planning purposes. This class of applications are generally computationally-intense and requires signiicant storage because of the large networks. Parallel processing provides the memory and computational power needed to solve these problems in a reasonable amount of time. The most compu...

We present an approach for integrated decision making of vehicle agents in urban traffic systems. Planning process for a vehicle agent is separated into two stages: strategic planning for selection of the optimal route and tactical planning for passing the current street in the most optimal manner. Vehicle routing is considered as a stochastic shortest path problem with imperfect knowledge abou...