Related papers: How much longer do you have to drive than the crow…
Planning scholars have identified economic, safety, and social benefits of converting one-way streets to two-way. Less is known about how conversions could impact vehicular distances traveled - of growing relevance in an era of fleet…
In a graph, nodes can be characterized locally (with their degree $k$) or globally (e.g. with their average length path $\xi$ to other nodes). Here we investigate how $\xi$ depends on $k$. Our earlier algorithm of the construction of the…
This report explores the use of machine learning techniques to accurately predict travel times in city streets and highways using floating car data (location information of user vehicles on a road network). The aim of this report is…
By introducing a simple model based on two-dimensional cellular automata, we reveal the relationship between the routing strategies of individual vehicles and the global behavior of transportation networks. Specifically, we characterize the…
In transportation network analysis, various types of road network data can be used even when focusing on the same region. Since different road network datasets can make different performance in analyses, it is necessary to compare them and…
Controllability, a basic property of various networked systems, has gained profound theoretical applications in complex social, technological, biological, and brain networks. Yet, little attention has been given to the control trajectory…
Circuity, the ratio of network distances to straight-line distances, is an important measure of urban street network structure and transportation efficiency. Circuity results from a circulation network's configuration, planning, and…
Drones are becoming indispensable in many application domains. In data-driven missions, besides sensing, the drone must process the collected data at runtime to decide whether additional action must be taken on the spot, before moving to…
We develop an analytical approach which provides the dependence of the mean first-passage time (MFPT) for random walks on complex networks both on the target connectivity and on the source-target distance. Our approach puts forward two…
Most optimal routing problems focus on minimizing travel time or distance traveled. Oftentimes, a more useful objective is to maximize the probability of on-time arrival, which requires statistical distributions of travel times, rather than…
We introduce a package service model where trucks as well as drones can deliver packages. Drones can travel on trucks or fly; but while flying, drones can only carry one package at a time and have to return to a truck to charge after each…
We have carried out car-following experiments with a 25-car-platoon on an open road section to study the relation between a car's speed and its spacing under various traffic conditions, in the hope to resolve a controversy surrounding this…
We bound the time it takes for a group of birds to reach steady state in a standard flocking model. We prove that (i) within single exponential time fragmentation ceases and each bird settles on a fixed flying direction; (ii) the flocking…
We compute a number of distance-dependent universal scaling functions characterizing the distance statistics of large maps of genus one. In particular, we obtain explicitly the probability distribution for the length of the shortest…
By using the random interchanging algorithm, we investigate the relations between average distance, standard deviation of degree distribution and synchronizability of complex networks. We find that both increasing the average distance and…
Numerical models indicate that collective animal behaviour may emerge from simple local rules of interaction among the individuals. However, very little is known about the nature of such interaction, so that models and theories mostly rely…
Geographic routing with greedy relaying strategies have been widely studied as a routing scheme in sensor networks. These schemes assume that the nodes have perfect information about the location of the destination. When the distance…
In this paper, we design a greedy routing on networks of mobile agents. In the greedy routing algorithm, every time step a packet in agent $i$ is delivered to the agent $j$ whose distance from the destination is shortest among searched…
Commuting, like other types of human travel, is complex in nature, such as trip-chaining behavior involving making stops of multiple purposes between two anchors. According to the 2001 National Household Travel Survey, about one half of…
In this paper, we consider a scenario where a robot needs to establish connectivity with a remote operator or another robot, as it moves along a path. We are interested in answering the following question: what is the distance traveled by…