83,919 research outputs found
Analysing Human Mobility Patterns of Hiking Activities through Complex Network Theory
The exploitation of high volume of geolocalized data from social sport
tracking applications of outdoor activities can be useful for natural resource
planning and to understand the human mobility patterns during leisure
activities. This geolocalized data represents the selection of hike activities
according to subjective and objective factors such as personal goals, personal
abilities, trail conditions or weather conditions. In our approach, human
mobility patterns are analysed from trajectories which are generated by hikers.
We propose the generation of the trail network identifying special points in
the overlap of trajectories. Trail crossings and trailheads define our network
and shape topological features. We analyse the trail network of Balearic
Islands, as a case of study, using complex weighted network theory. The
analysis is divided into the four seasons of the year to observe the impact of
weather conditions on the network topology. The number of visited places does
not decrease despite the large difference in the number of samples of the two
seasons with larger and lower activity. It is in summer season where it is
produced the most significant variation in the frequency and localization of
activities from inland regions to coastal areas. Finally, we compare our model
with other related studies where the network possesses a different purpose. One
finding of our approach is the detection of regions with relevant importance
where landscape interventions can be applied in function of the communities.Comment: 20 pages, 9 figures, accepte
Efficient motion planning for problems lacking optimal substructure
We consider the motion-planning problem of planning a collision-free path of
a robot in the presence of risk zones. The robot is allowed to travel in these
zones but is penalized in a super-linear fashion for consecutive accumulative
time spent there. We suggest a natural cost function that balances path length
and risk-exposure time. Specifically, we consider the discrete setting where we
are given a graph, or a roadmap, and we wish to compute the minimal-cost path
under this cost function. Interestingly, paths defined using our cost function
do not have an optimal substructure. Namely, subpaths of an optimal path are
not necessarily optimal. Thus, the Bellman condition is not satisfied and
standard graph-search algorithms such as Dijkstra cannot be used. We present a
path-finding algorithm, which can be seen as a natural generalization of
Dijkstra's algorithm. Our algorithm runs in time, where~ and are the number of vertices and
edges of the graph, respectively, and is the number of intersections
between edges and the boundary of the risk zone. We present simulations on
robotic platforms demonstrating both the natural paths produced by our cost
function and the computational efficiency of our algorithm
Modeling commuting systems through a complex network analysis: a study of the Italian islands of Sardinia and Sicily
This study analyzes the inter-municipal commuting systems of the Italian islands of Sardinia and Sicily, employing weighted network analysis technique. Based on the results obtained for the Sardinian commuting network, the network analysis is used to identify similarities and dissimilarities between the two systems
Ant colony system-based applications to electrical distribution system optimization
Chapter 16, February 201
- âŠ