Route-Planning Algorithms for Amusement-Park Navigation

2014 ◽  
Vol 6 (2) ◽  
pp. 78-92
Author(s):  
Hayato Ohwada ◽  
Masato Okada ◽  
Katsutoshi Kanamori
Keyword(s):  
Real Time ◽  
Shortest Path ◽  
Waiting Time ◽  
Web Application ◽  
Route Planning ◽  
Traveling Salesman ◽  
Traveling Salesman Problems ◽  
Time Estimates ◽  
Planning Algorithms ◽  
Shortest Path Algorithms

This paper describes route-planning algorithms for navigation in amusement parks (e.g. Disneyland). Unlike conventional shortest-path-finding used for traveling salesman problems, the authors provide several algorithms that consider waiting time estimates in real time, exploit the reservation facilities of an attraction such as Fastpass in Disneyland, and balance a series of enjoyment types such as excitement or relaxation. These features make the new shortest-path algorithms more flexible and dynamic for supporting the cognitive aspects of enjoyment. The authors developed a navigation tool as a Web application in which users select their attractions of interest and the application suggests reasonable and enjoyable routes. An experiment was conducted to demonstrate the performance of this application, focusing on well-known attractions in Tokyo Disneyland.

scholarly journals COMPARATIVE ANALYSIS AND IMPLEMENTATION OF DIJKSTRA'S SHORTEST PATH ALGORITHM FOR EMERGENCY RESPONSE AND LOGISTIC PLANNING

2017 ◽  
Vol 36 (3) ◽  
pp. 876-888
Author(s):  
AH Eneh ◽  
UC Arinze
Keyword(s):  
Shortest Path ◽  
Spatial Data ◽  
Unified Modeling Language ◽  
Route Planning ◽  
Past Research ◽  
Planning System ◽  
Web Based ◽  
Goods And Services ◽  
Shortest Path Algorithms ◽  
Pilot Implementation

TransRoute: a web-based vehicle route planning application is proposed in this paper. This application leverages existing input-output (I/O) efficient implementations of shortest path algorithms (SPAs) to implement the proposed system that will fundamentally address the problems experienced in moving people, goods and services from one location to another. A number of SPAs are evaluated using landau notations. Main functionalities of the system will be implemented as a web-enabled geographic information system (GIS) application based on open-source technologies and object-oriented software development methodology using unified modeling language. Pilot implementation is done based on spatial data of three selected states in Nigeria, pulled from web-based mapping tools like Google Maps and Microsoft Bings respectively. In conclusion, the Dijkstra's algorithm implemented with double bucket dynamic data structure is selected for implementing the proposed route planning system, as past research efforts has proven that it is the fastest with run-time improvements from O(m + n/log C) to O(m) respectively. http://dx.doi.org/10.4314/njt.v36i3.30

Real-time endovascular guidewire position simulation using shortest path algorithms

2009 ◽  
Vol 4 (6) ◽  
pp. 597-608 ◽  
Author(s):  
Sebastian Schafer ◽  
Vikas Singh ◽  
Peter B. Noël ◽  
Alan M. Walczak ◽  
Jinhui Xu ◽  
...  
Keyword(s):  
Real Time ◽  
Shortest Path ◽  
Shortest Path Algorithms

scholarly journals PERBANDINGAN ALGORITMA SHORTEST PATH DALAM PEMROSESAN CITRA DIGITAL SEAM CARVING

2016 ◽  
Vol 11 (2) ◽  
Author(s):  
Florentinus Alvin Sebastian ◽  
R. Gunawan Santosa ◽  
Theresia Herlina R.
Keyword(s):  
Shortest Path ◽  
Web Application ◽  
Directed Acyclic Graph ◽  
Minimum Energy ◽  
Seam Carving ◽  
Image Size ◽  
Image Resizing ◽  
Web App ◽  
Shortest Path Algorithms ◽  
Better Than

Seam carving is a method of content aware image resizing. As solutions shortest path algorithms are used to find images seams. Seam is a horizontal or vertical path of an image that has minimum energy. There are two (2) shortest path algorithms that will be discussed in this paper. This paper contains the results of shortest path algorithms comparison between Dijkstra and Directed Acyclic Graph to see which one is better than another in case of efficiency. The precomputed and recomputed methods will be compared to find the more efficient method for executing the seam carving transformation. A web application has been built for this purpose. This web app is capable of transforming image size with seam carving method. The complexity of Dijkstra and Acyclic will be compared to find which one is better. The result is Dijkstra has been won, with the O(4V) with Acyclicis O(5V). The use of precomputed and recomputed is evaluated by the conditions. If the preparation is evaluated then recomputed is more efficient, but if the preparation is not evaluated then the precomputed method is the better one and has faster performance. 

K-means Clustering Algorithm and Meta-heuristics for Multiple Traveling Salesman Problems

2009 ◽  
Vol 4 (2) ◽  
pp. 16-32
Author(s):  
R. Nallusamy ◽  
K. Duraiswamy ◽  
R. Dhanalaksmi ◽  
P. Parthiban
Keyword(s):  
Clustering Algorithm ◽  
Traveling Salesman ◽  
Traveling Salesman Problems

scholarly journals Real-Time Musculoskeletal Kinematics and Dynamics Analysis Using Marker- and IMU-Based Solutions in Rehabilitation

Sensors ◽  
2021 ◽  
Vol 21 (5) ◽  
pp. 1804
Author(s):  
Dimitar Stanev ◽  
Konstantinos Filip ◽  
Dimitrios Bitzas ◽  
Sokratis Zouras ◽  
Georgios Giarmatzis ◽  
...  
Keyword(s):  
Real Time ◽  
Small Error ◽  
Grand Challenge ◽  
Muscle Forces ◽  
Time Estimates ◽  
Musculoskeletal Models ◽  
Open Source Framework ◽  
Measurement Units ◽  
Technical Details ◽  
Significant Milestone

This study aims to explore the possibility of estimating a multitude of kinematic and dynamic quantities using subject-specific musculoskeletal models in real-time. The framework was designed to operate with marker-based and inertial measurement units enabling extensions far beyond dedicated motion capture laboratories. We present the technical details for calculating the kinematics, generalized forces, muscle forces, joint reaction loads, and predicting ground reaction wrenches during walking. Emphasis was given to reduce computational latency while maintaining accuracy as compared to the offline counterpart. Notably, we highlight the influence of adequate filtering and differentiation under noisy conditions and its importance for consequent dynamic calculations. Real-time estimates of the joint moments, muscle forces, and reaction loads closely resemble OpenSim’s offline analyses. Model-based estimation of ground reaction wrenches demonstrates that even a small error can negatively affect other estimated quantities. An application of the developed system is demonstrated in the context of rehabilitation and gait retraining. We expect that such a system will find numerous applications in laboratory settings and outdoor conditions with the advent of predicting or sensing environment interactions. Therefore, we hope that this open-source framework will be a significant milestone for solving this grand challenge.

scholarly journals Dynamic Shortest Paths Methods for the Time-Dependent TSP

Algorithms ◽  
2021 ◽  
Vol 14 (1) ◽  
pp. 21
Author(s):  
Christoph Hansknecht ◽  
Imke Joormann ◽  
Sebastian Stiller
Keyword(s):  
Column Generation ◽  
Traveling Salesman Problem ◽  
Shortest Path ◽  
Valid Inequalities ◽  
Shortest Paths ◽  
Traveling Salesman ◽  
Time Dependent ◽  
Full Generality ◽  
Branching Rule ◽  
The Traveling Salesman Problem

The time-dependent traveling salesman problem (TDTSP) asks for a shortest Hamiltonian tour in a directed graph where (asymmetric) arc-costs depend on the time the arc is entered. With traffic data abundantly available, methods to optimize routes with respect to time-dependent travel times are widely desired. This holds in particular for the traveling salesman problem, which is a corner stone of logistic planning. In this paper, we devise column-generation-based IP methods to solve the TDTSP in full generality, both for arc- and path-based formulations. The algorithmic key is a time-dependent shortest path problem, which arises from the pricing problem of the column generation and is of independent interest—namely, to find paths in a time-expanded graph that are acyclic in the underlying (non-expanded) graph. As this problem is computationally too costly, we price over the set of paths that contain no cycles of length k. In addition, we devise—tailored for the TDTSP—several families of valid inequalities, primal heuristics, a propagation method, and a branching rule. Combining these with the time-dependent shortest path pricing we provide—to our knowledge—the first elaborate method to solve the TDTSP in general and with fully general time-dependence. We also provide for results on complexity and approximability of the TDTSP. In computational experiments on randomly generated instances, we are able to solve the large majority of small instances (20 nodes) to optimality, while closing about two thirds of the remaining gap of the large instances (40 nodes) after one hour of computation.

Sign in / Sign up

Export Citation Format

Share Document