Results 221 to 230 of about 223,497 (264)
Some of the next articles are maybe not open access.
Alternative routes in road networks
ACM Journal of Experimental Algorithmics, 2010We study the problem of finding good alternative routes in road networks. We look for routes that are substantially different from the shortest path, have small stretch, and are locally optimal. We formally define the problem of finding alternative routes with a single via vertex, develop efficient algorithms for it, and evaluate them experimentally ...
Ittai Abraham +3 more
openaire +2 more sources
2010
The availability of large graphs that represent huge road networks has led to a vast amount of experimental research that has been custom-tailored for road networks. There are two primary reasons to investigate graph-generators that construct synthetic graphs similar to real-world road-networks: The wish to theoretically explain noticeable experimental
Bauer, R. +3 more
openaire +2 more sources
The availability of large graphs that represent huge road networks has led to a vast amount of experimental research that has been custom-tailored for road networks. There are two primary reasons to investigate graph-generators that construct synthetic graphs similar to real-world road-networks: The wish to theoretically explain noticeable experimental
Bauer, R. +3 more
openaire +2 more sources
On Representation Learning for Road Networks
ACM Transactions on Intelligent Systems and Technology, 2020Informative representation of road networks is essential to a wide variety of applications on intelligent transportation systems. In this article, we design a new learning framework, called Representation Learning for Road Networks (RLRN), which explores various intrinsic properties of road networks to learn embeddings of intersections and
Mengxiang Wang +3 more
openaire +2 more sources
Transportation Science, 1967
The networks considered in this paper consist of ring roads and equiangle spirals rotating in both directions. Journey lengths and numbers of crossings of paths are found for a circular city with uniformly and independently distributed origins and destinations of trips.
openaire +1 more source
The networks considered in this paper consist of ring roads and equiangle spirals rotating in both directions. Journey lengths and numbers of crossings of paths are found for a circular city with uniformly and independently distributed origins and destinations of trips.
openaire +1 more source
Mapping a Network of Roads for an On-road Navigating Robot
Proceedings of Conference on Advances In Robotics, 2013We present an autonomous system for outdoor terrain (road) mapping using a robot equipped with viable low cost sensors (2D laser scanner, cameras, odometry, gyroscope and commercial GPS). The research work on outdoor navigation with known maps has matured well in past few years, but navigation and exploration of roads in an unknown area is still ...
Piyoosh Mukhija, K. Madhava Krishna
openaire +1 more source
2022
Om infrastrukturen omkring Odense og Aalborg i middelalder og nyere tid.
Møller, Per Grau, Haue, Niels
openaire +1 more source
Om infrastrukturen omkring Odense og Aalborg i middelalder og nyere tid.
Møller, Per Grau, Haue, Niels
openaire +1 more source
Trajectory Regression on Road Networks
Proceedings of the AAAI Conference on Artificial Intelligence, 2011This paper addresses the task of trajectory cost prediction, a new learning task for trajectories. The goal of this task is to predict the cost for an arbitrary (possibly unknown) trajectory, based on a set of previous trajectory-cost pairs. A typical example of this task is travel-time prediction on road networks.
Tsuyoshi Idé, Masashi Sugiyama
openaire +2 more sources
OPTIMIZATION OF TRAFFIC ON ROAD NETWORKS
Mathematical Models and Methods in Applied Sciences, 2007This paper focuses on the optimization of traffic flow on a road network, modeled by a fluid-dynamic approach. Three cost functionals that measure average velocity, average traveling time, and total flux of cars, are considered. First, such functionals are optimized for two simple networks that consist of a single junction: one with two incoming and ...
CASCONE, ANNUNZIATA +3 more
openaire +3 more sources
Finding Least On-Road Travel Time on Road Network
2016Shortest path and fastest path query on time-dependent road network are widely used nowadays, but none of them can answer a least on-road travel time query, which aims to find a path between two vertices on a time-dependent road network that has the minimum on-road travel time(waiting on any vertex is allowed). In this paper, we propose a cheapest path
Lei Li 0003 +2 more
openaire +2 more sources
Faster Customization of Road Networks
2013A wide variety of algorithms can answer exact shortest-path queries in real time on continental road networks, but they typically require significant preprocessing effort. Recently, the customizable route planning (CRP) approach has reduced the time to process a new cost function to a fraction of a minute.
Daniel Delling, Renato F. Werneck
openaire +1 more source