Timebase dynamic weight for Dijkstra Algorithm implementation in route planning software

2014 ◽  
Author(s):  
Lukman Rosyidi ◽  
Hening Pram Pradityo ◽  
Dedi Gunawan ◽  
Riri Fitri Sari
Keyword(s):  
Route Planning ◽  
Dijkstra Algorithm ◽  
Dynamic Weight ◽  
Planning Software ◽  
Algorithm Implementation

MISSION-ADAPTABLE ROUTE PLANNING IN UNCERTAIN AND ADVERSARIAL ENVIRONMENT

2006 ◽  
Vol 15 (05) ◽  
pp. 803-821 ◽  
Author(s):  
PING YAN ◽  
MINGYUE DING ◽  
CHANGWEN ZHENG
Keyword(s):  
Real Time ◽  
A Priori ◽  
Route Planning ◽  
Optimal Solution ◽  
Dijkstra Algorithm ◽  
Solution Quality ◽  
Model Complex ◽  
Local Methods ◽  
Domain Specific Knowledge ◽  
Planning Algorithm

In this paper, the route-planning problems of Unmanned Aerial Vehicle (UAV) in uncertain and adversarial environment are addressed, including not only single-mission route planning in known a priori environment, but also the route replanning in partially known and mission-changeable environments. A mission-adaptable hybrid route-planning algorithm based on flight roadmap is proposed, which combines existing global and local methods (Dijkstra algorithm, SAS and D*) into a two-level framework. The environment information and constraints for UAV are integrated into the procedure of building flight roadmap and searching for routes. The route-planning algorithm utilizes domain-specific knowledge and operates in real time with near-optimal solution quality, which is important to uncertain and adversarial environment. Other planners do not provide all of the functionality, namely real-time planning and replanning, near-optimal solution quality, and the ability to model complex 3D constraints.

scholarly journals The Green Paths route planning software for exposure-optimised travel

2021 ◽  
Author(s):  
Joose Helle ◽  
Age Poom ◽  
Elias S Willberg ◽  
Tuuli Toivonen
Keyword(s):  
Traffic Noise ◽  
Route Planning ◽  
Population Level ◽  
Least Cost Path ◽  
Impedance Function ◽  
Web Based ◽  
External Data ◽  
Planning Software ◽  
Alternative Routes ◽  
Python Programming

Green Paths is a prototype of route planning software for finding exposure-optimised routes for active travel. It incorporates external data on environmental exposures, including traffic noise levels, air quality, and street-level greenery into the street and paths network produced by the OpenStreetMap project. Written in the Python programming language, the software applies a novel environmental impedance function in the least cost path routing to find exposure-optimised routes. Routes for externally defined origin-destination pairs can be queried via a RESTful API. The API returns alternative routes equipped with rich exposure data. The published version of the software has been applied in population level environmental exposure assessment and in an end-user-oriented web-based route planner application designed for use in the Helsinki Metropolitan Area.

Passport: parallel land route planning software

2002 ◽  
Author(s):  
V. Delle Donne ◽  
E. Reiher ◽  
R. Wolfe ◽  
G. Vezina ◽  
V. Van Dongen
Keyword(s):  
Route Planning ◽  
Planning Software

Active route planning for active diesel particulate filter regeneration

2019 ◽  
Vol 234 (7) ◽  
pp. 1854-1868
Author(s):  
Xiangrui Zeng ◽  
Jae Hyung Lim ◽  
John W Schmotzer ◽  
Amit Mohanty
Keyword(s):  
Diesel Particulate Filter ◽  
High Speed ◽  
Route Planning ◽  
Operating Conditions ◽  
Traffic Information ◽  
Particulate Filter ◽  
Dijkstra Algorithm ◽  
Correctness Proof ◽  
Diesel Particulate ◽  
Filter Regeneration

The vehicle route choice has great impact on the vehicle operating conditions, but it has rarely been used as a way to create desired vehicle operation and benefit automotive control. This paper presents a route planning algorithm which generates a route that meets the requirement of high-speed driving time from the diesel particulate filter controller for an active diesel particulate filter regeneration. Real-time traffic information is considered when designing the route. A new routing algorithm based on the unconstrained Dijkstra algorithm is developed to approximately solve this consecutive-highway-time-constrained shortest-path problem. A correctness proof of the algorithm is given based on an augmented graph. Examples are provided to show the scenarios in which the proposed routes can facilitate the diesel particulate filter regeneration control without adding too much travel time cost.

The Bus Data Model, the Principle and Algorithm Implementation of Query System

2015 ◽  
Vol 713-715 ◽  
pp. 1959-1962
Author(s):  
Qiang Zhang ◽  
Jing Shi ◽  
Jing Jing Dong
Keyword(s):  
Evaluation Criteria ◽  
Optimal Solution ◽  
Weighted Graph ◽  
Dijkstra Algorithm ◽  
Optimum Selection ◽  
Subway System ◽  
Database Technology ◽  
Algorithm Implementation ◽  
The City ◽  
Selection Of

This paper refers to a question about the optimum selection of the city bus routes, according to the different needs of passengers, there are three evaluation criteria: the minimum transfer times, the shortest riding time and the lowest riding expenditure. On the base of the three evaluation criteria we construct three models for the bus system and the bus subway system respectively, using the shortest directed route in the weighted graph, definite database technology; we also adopts the improved Dijkstra algorithm and chromatography to present the resolvent of solving the optimal solution.

scholarly journals A DIJKSTRA ALGORITHM IMPLEMENTATION IN DETERMINING SHORTEST ROUTE TO MOSQUE IN RESIDENTIAL CITRA INDAH CITY

2020 ◽  
Vol 16 (1) ◽  
pp. 65-70
Author(s):  
Siti Lestari Lestari ◽  
Ardiansyah Ardiansyah ◽  
Angelina Puput Giovani ◽  
Desy Dwijayanti
Keyword(s):  
Artificial Intelligence ◽  
Problem Solving ◽  
Shortest Path ◽  
Rapid Development ◽  
Residential Area ◽  
Daily Activities ◽  
Dijkstra Algorithm ◽  
Shortest Route ◽  
Shortest Distance ◽  
Algorithm Implementation

The application of artificial intelligence (Artificial Intelligence) for problem-solving in the field of computer science has experienced rapid development from year to year as the development of artificial intelligence itself. Problems involving searching (searching) is one example of the use of artificial intelligence that is quite popular to solve various kinds of problems. In daily activities, the use of roads is always an unavoidable activity, so determining the shortest path from one point to another becomes a problem that is often encountered. This is also felt by residents who live in a large enough housing. Sometimes to be able to reach the destination they are often confused in deciding which way to go to get the shortest distance to the destination. Citra Indah City Housing is a residential area in the Jonggol District area, Bogor Regency, developed by the Ciputra group. Within the Vignolia Hill Cluster, there is a mosque located on the northwest corner of the Vignolia Hill cluster or at the western end of the AH.17 block. A large number of blocks raise problems regarding the shortest route that can be taken by residents to get to the mosque. So, the purpose of this research is to determine the shortest path taken by citizens to get to the mosque. The method used is to apply the Djikstra algorithm which is able to produce the shortest route for residents to get to the mosque.

scholarly journals IMPLEMENTASI ALGORITMA DIJKSTRA DAN METODE HAVERSINE PADA PENENTUAN JALUR TERPENDEK PENDAKIAN GUNUNG MERAPI JALUR SELO BERBASIS ANDROID

2020 ◽  
Vol 8 (1) ◽  
Author(s):  
Paulus Harsadi ◽  
Didik Nugroho
Keyword(s):  
High Risk ◽  
Dijkstra Algorithm ◽  
Base Camp ◽  
Getting Lost ◽  
Bad Weather ◽  
Feasibility Test ◽  
Algorithm Implementation

Mount Climbing or mountaineering is one of high-risk sports having certain techniques. There are many factors emerging the lost of mountaineer, such as, getting lost or having out of the track because of bad weather and trying for a new track without well-preparations. Meanwhile, the information of mountaineering route usually can be got from brochure or map at mount base camp in general. Furthermore, some cases state that the mountaineers also must find the closest path to the peak or the closest base camp because of bad weather or condition. The lack of mountain cartographic application and the importance of the closest track become the background of the Dijkstra algorithm implementation based on Android for deciding the shortest track to Mount Merapi via Selo. The methods of this research are Dijkstra algorithm for deciding the shortest rate and Harversine method for giving the value of passed node. The use of Google map and GPS applications are used for mapping and finding the location coordinate. This data will be processed using PHP and MySql database. The results of research are this application can be used easily using smartphone and the feasibility test shows “Good” value with 77% average.

scholarly journals Anti-Congestion Route Planning Scheme Based on Dijkstra Algorithm for Automatic Valet Parking System

2019 ◽  
Vol 9 (23) ◽  
pp. 5016 ◽  
Author(s):  
Yu ◽  
Jiang ◽  
Hua
Keyword(s):  
Intelligent Transportation System ◽  
New Technology ◽  
Influence Factors ◽  
Route Planning ◽  
Parking Space ◽  
Dijkstra Algorithm ◽  
Static State ◽  
Shortest Route ◽  
Planning Scheme ◽  
Parking Lot

Based on the Dijkstra algorithm, with the parking parameters in the static state, the shortest route to each parking space of the parking lot without dynamic influence factors can be calculated. In the new technology background of the combination of the V2X environment and driverless technology, the dynamic influence factors, for example, the lanes occupancy situation caused by parking, can be considered to improve the shortest route with the new scheme in this paper. Then the final route that costs the least time to reach each parking space will be calculated. This is very important for the development of the intelligent transportation system in the parking lot environment.

Sign in / Sign up

Export Citation Format

Share Document